A Matrix model for plane partitions

We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary boundary conditions. Using the known solution of matrix models, this method allows to find the large size asymptotic expansion of plane partitions, to ALL orders. It also allows to describe several universal regimes.Comment: Latex, 41 figures. Misprints and corrections. Changing the term TASEP to self avoiding particle porces

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)

The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..

Stirling Numbers Interpolation using Permutations with Forbidden Subsequences

. We present a family of number sequences which interpolates between the sequences Bn , of Bell numbers, and n!. It is defined in terms of permutations with forbidden patterns or subsequences. The introduction, as a parameter, of the number m of right--to--left minima yields an interpolation between Stirling numbers of the second kind S(n; m) and of the first kind (signless) c(n; m). Moreover, q-counting the restricted permutations by special inversions gives an interpolation between variants of the usual q-analogues of these numbers. R'esum'e. Nous pr'esentons une famille de suites de nombres qui interpole entre la suite Bn des nombres de Bell et la suite n!. Cette famille est d'efinie en termes de permutations `a motifs interdits. L'introduction comme param`etre du nombre d"el'ements saillants minimums de gauche `a droite donne une interpolation plus fine entre les nombres de Stirling de deuxi`eme esp`ece S(n; m) et de premi`ere esp`ece (sans signe) c(n; m). De plus, un q-comptage d..

PYTHIA 6.3 Physics and Manual

The PYTHIA program can be used to generate high-energy-physics `events', i.e. sets of outgoing particles produced in the interactions between two incoming particles. The objective is to provide as accurate as possible a representation of event properties in a wide range of reactions, with emphasis on those where strong interactions play a role, directly or indirectly, and therefore multihadronic final states are produced. The physics is then not understood well enough to give an exact description; instead the program has to be based on a combination of analytical results and various QCD-based models. This physics input is summarized here, for areas such as hard subprocesses, initial- and final-state parton showers, beam remnants and underlying events, fragmentation and decays, and much more. Furthermore, extensive information is provided on all program elements: subroutines and functions, switches and parameters, and particle and process data. This should allow the user to tailor the generation task to the topics of interest.Comment: 8 + 454 page

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 28 regular papers presented in this volume were carefully reviewed and selected from 88 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Algorithms Seminar, 2001-2002

These seminar notes constitute the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorics, symbolic computation, asymptotic analysis, number theory, as well as the analysis of algorithms, data structures, and network protocols