Algorithmic Probability and Combinatorics
Edited by Manuel E. Lladser, CU assistant professor of applied mathematics; Robert S. Maier, University of Arizona, Tucson; Marni Mishna, Simon Fraser University, Canada; and Andrew Rechnitzer, University of British Columbia, Canada
American Mathematical Society
This volume contains the proceedings of the American Mathematical Society’s Special Sessions on Algorithmic Probability and Combinatorics held at DePaul University on Oct. 5-6, 2007, and at the University of British Columbia on Oct. 4-5, 2008.
This volume collects cutting-edge research and expository on algorithmic probability and combinatorics. It includes contributions by well-established experts and younger researchers who use generating functions, algebraic and probabilistic methods as well as asymptotic analysis on a daily basis.
Walks in the quarter-plane and random walks (quantum, rotor and self-avoiding), permutation tableaux and random permutations are considered. In addition, articles in the volume present a variety of saddle-point and geometric methods for the asymptotic analysis of the coefficients of single- and multi-variable generating functions associated with combinatorial objects and discrete random structures.
The volume should appeal to pure and applied mathematicians, as well as mathematical physicists; in particular, anyone interested in computational aspects of probability, combinatorics and enumeration. Furthermore, the expository or partly expository papers included in this volume should serve as an entry point to this literature not only to experts in other areas, but also to graduate students.
American Mathematical Society
This volume contains the proceedings of the American Mathematical Society’s Special Sessions on Algorithmic Probability and Combinatorics held at DePaul University on Oct. 5-6, 2007, and at the University of British Columbia on Oct. 4-5, 2008.
This volume collects cutting-edge research and expository on algorithmic probability and combinatorics. It includes contributions by well-established experts and younger researchers who use generating functions, algebraic and probabilistic methods as well as asymptotic analysis on a daily basis.
Walks in the quarter-plane and random walks (quantum, rotor and self-avoiding), permutation tableaux and random permutations are considered. In addition, articles in the volume present a variety of saddle-point and geometric methods for the asymptotic analysis of the coefficients of single- and multi-variable generating functions associated with combinatorial objects and discrete random structures.
The volume should appeal to pure and applied mathematicians, as well as mathematical physicists; in particular, anyone interested in computational aspects of probability, combinatorics and enumeration. Furthermore, the expository or partly expository papers included in this volume should serve as an entry point to this literature not only to experts in other areas, but also to graduate students.