This book explains similarities in asymptotic behavior as the result of two basic properties shared by the structures: the conditioning relation and the logarithmic condition. The discussion is conducted in the language of probability, enabling the theory to be developed under rather general and explicit conditions; for the finer conclusions, Stein's method emerges as the key ingredient.
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.
This volume is a collection of survey papers in combinatorics that have grown out of lectures given in the workshop on Probabilistic Combinatorics at the Paul Erdös Summer Research Center in Mathematics in Budapest. The papers, reflecting the many facets of modern-day combinatorics, will be appreciated by specialists and general mathematicians alike: assuming relatively little background, each paper gives a quick introduction to an active area, enabling the reader to learn about the fundamental results and appreciate some of the latest developments. An important feature of the articles, very much in the spirit of Erdös, is the abundance of open problems.
This volume grew out of two Simons Symposia on "Nonarchimedean and tropical geometry" which took place on the island of St. John in April 2013 and in Puerto Rico in February 2015. Each meeting gathered a small group of experts working near the interface between tropical geometry and nonarchimedean analytic spaces for a series of inspiring and provocative lectures on cutting edge research, interspersed with lively discussions and collaborative work in small groups. The articles collected here, which include high-level surveys as well as original research, mirror the main themes of the two Symposia. Topics covered in this volume include: Differential forms and currents, and solutions of Monge-Ampere type differential equations on Berkovich spaces and their skeletons; The homotopy types of nonarchimedean analytifications; The existence of "faithful tropicalizations" which encode the topology and geometry of analytifications; Relations between nonarchimedean analytic spaces and algebraic geometry, including logarithmic schemes, birational geometry, and the geometry of algebraic curves; Extended notions of tropical varieties which relate to Huber's theory of adic spaces analogously to the way that usual tropical varieties relate to Berkovich spaces; and Relations between nonarchimedean geometry and combinatorics, including deep and fascinating connections between matroid theory, tropical geometry, and Hodge theory.
Combinatorics and finite fields are of great importance in modern applications such as in the analysis of algorithms, in information and communication theory, and in signal processing and coding theory. This book contains survey articles on topics such as difference sets, polynomials, and pseudorandomness.
Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers.
No leading university department of mathematics or statistics, or library, can afford to be without this unique text. Leading authorities give a unique insight into a wide range of currently topical problems, from the mathematics of road networks to the genomics of cancer.
This book highlights the forefront of research on statistical distribution theory, with a focus on unconventional random quantities, and on phenomena such as random partitioning. The respective papers reflect the continuing appeal of distribution theory and the lively interest in this classic field, which owes much of its expansion since the 1960s to Professor Masaaki Sibuya, to whom this book is dedicated. The topics addressed include a test procedure for discriminating the (multivariate) Ewens distribution from the Pitman Sampling Formula, approximation to the length of the Ewens distribution by discrete distributions and the normal distribution, and the distribution of the number of levels in [s]-specified random permutations. Also included are distributions associated with orthogonal polynomials with a symmetric matrix argument and the characterization of the Jeffreys prior.
