Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Algorithmic Probability and Combinatorics
 
Edited by: Manuel E. Lladser University of Colorado, Boulder, CO
Robert S. Maier University of Arizona, Tucson, AZ
Marni Mishna Simon Fraser University, Burnaby, BC, Canada
Andrew Rechnitzer University of British Columbia, Vancouver, BC, Canada
Algorithmic Probability and Combinatorics
Softcover ISBN:  978-0-8218-4783-1
Product Code:  CONM/520
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-8199-6
Product Code:  CONM/520.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-4783-1
eBook: ISBN:  978-0-8218-8199-6
Product Code:  CONM/520.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
Algorithmic Probability and Combinatorics
Click above image for expanded view
Algorithmic Probability and Combinatorics
Edited by: Manuel E. Lladser University of Colorado, Boulder, CO
Robert S. Maier University of Arizona, Tucson, AZ
Marni Mishna Simon Fraser University, Burnaby, BC, Canada
Andrew Rechnitzer University of British Columbia, Vancouver, BC, Canada
Softcover ISBN:  978-0-8218-4783-1
Product Code:  CONM/520
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-8199-6
Product Code:  CONM/520.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-4783-1
eBook ISBN:  978-0-8218-8199-6
Product Code:  CONM/520.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 5202010; 240 pp
    MSC: Primary 05; 60; 41; 82

    This volume contains the proceedings of the AMS Special Sessions on Algorithmic Probability and Combinatorics held at DePaul University on October 5–6, 2007 and at the University of British Columbia on October 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.

    Readership

    Graduate students and research mathematicians interested in computational aspects of probability, combinatorics, and enumeration.

  • Table of Contents
     
     
    • Articles
    • Mireille Bousquet-Mélou and Marni Mishna — Walks with small steps in the quarter plane [ MR 2681853 ]
    • Andrew Bressler, Torin Greenwood, Robin Pemantle and Marko Petkovšek — Quantum random walk on the integer lattice: examples and phenomena [ MR 2681854 ]
    • Timothy DeVries — A case study in bivariate singularity analysis [ MR 2681855 ]
    • Paweł Hitczenko and Svante Janson — Asymptotic normality of statistics on permutation tableaux [ MR 2681856 ]
    • Alexander E. Holroyd and James Propp — Rotor walks and Markov chains [ MR 2681857 ]
    • E. J. Janse van Rensburg — Approximate enumeration of self-avoiding walks [ MR 2681858 ]
    • Iwan Jensen — Fuchsian differential equations from modular arithmetic [ MR 2681859 ]
    • Neal Madras and Hailong Liu — Random pattern-avoiding permutations [ MR 2681860 ]
    • Robin Pemantle — Analytic combinatorics in $d$ variables: an overview [ MR 2681861 ]
    • Robin Pemantle and Mark C. Wilson — Asymptotic expansions of oscillatory integrals with complex phase [ MR 2681862 ]
  • Additional Material
     
     
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 5202010; 240 pp
MSC: Primary 05; 60; 41; 82

This volume contains the proceedings of the AMS Special Sessions on Algorithmic Probability and Combinatorics held at DePaul University on October 5–6, 2007 and at the University of British Columbia on October 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.

Readership

Graduate students and research mathematicians interested in computational aspects of probability, combinatorics, and enumeration.

  • Articles
  • Mireille Bousquet-Mélou and Marni Mishna — Walks with small steps in the quarter plane [ MR 2681853 ]
  • Andrew Bressler, Torin Greenwood, Robin Pemantle and Marko Petkovšek — Quantum random walk on the integer lattice: examples and phenomena [ MR 2681854 ]
  • Timothy DeVries — A case study in bivariate singularity analysis [ MR 2681855 ]
  • Paweł Hitczenko and Svante Janson — Asymptotic normality of statistics on permutation tableaux [ MR 2681856 ]
  • Alexander E. Holroyd and James Propp — Rotor walks and Markov chains [ MR 2681857 ]
  • E. J. Janse van Rensburg — Approximate enumeration of self-avoiding walks [ MR 2681858 ]
  • Iwan Jensen — Fuchsian differential equations from modular arithmetic [ MR 2681859 ]
  • Neal Madras and Hailong Liu — Random pattern-avoiding permutations [ MR 2681860 ]
  • Robin Pemantle — Analytic combinatorics in $d$ variables: an overview [ MR 2681861 ]
  • Robin Pemantle and Mark C. Wilson — Asymptotic expansions of oscillatory integrals with complex phase [ MR 2681862 ]
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.