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!
Model Theoretic Methods in Finite Combinatorics
 
Edited by: Martin Grohe Humboldt-Universität zu Berlin, Berlin, Germany
Johann A. Makowsky Technion-Israel Institute of Technology, Haifa, Israel
Model Theoretic Methods in Finite Combinatorics
eBook ISBN:  978-0-8218-8237-5
Product Code:  CONM/558.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Model Theoretic Methods in Finite Combinatorics
Click above image for expanded view
Model Theoretic Methods in Finite Combinatorics
Edited by: Martin Grohe Humboldt-Universität zu Berlin, Berlin, Germany
Johann A. Makowsky Technion-Israel Institute of Technology, Haifa, Israel
eBook ISBN:  978-0-8218-8237-5
Product Code:  CONM/558.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 5582011; 519 pp
    MSC: Primary 03; 05; 68;

    This volume contains the proceedings of the AMS-ASL Special Session on Model Theoretic Methods in Finite Combinatorics, held January 5–8, 2009, in Washington, DC.

    Over the last 20 years, various new connections between model theory and finite combinatorics emerged. The best known of these are in the area of 0-1 laws, but in recent years other very promising interactions between model theory and combinatorics have been developed in areas such as extremal combinatorics and graph limits, graph polynomials, homomorphism functions and related counting functions, and discrete algorithms, touching the boundaries of computer science and statistical physics.

    This volume highlights some of the main results, techniques, and research directions of the area. Topics covered in this volume include recent developments on 0-1 laws and their variations, counting functions defined by homomorphisms and graph polynomials and their relation to logic, recurrences and spectra, the logical complexity of graphs, algorithmic meta theorems based on logic, universal and homogeneous structures, and logical aspects of Ramsey theory.

    Readership

    Graduate students and research mathematicians interested in logic, combinatorics, and theoretical computer science.

  • Table of Contents
     
     
    • Articles
    • Eldar Fischer, Tomer Kotek and Johann A. Makowsky — Application of logic to combinatorial sequences and their recurrence relations
    • Jason P. Bell, Stanley N. Burris and Karen Yeats — Spectra and systems of equations
    • Jason P. Bell and Stanley N. Burris — Compton’s method for proving logical limit laws
    • Oleg Pikhurko and Oleg Verbitsky — Logical complexity of graphs: A survey
    • Martin Grohe and Stephan Kreutzer — Methods for algorithmic meta theorems
    • Tomer Kotek, Johann A. Makowsky and Boris Zilber — On counting generalized colorings
    • Martin Grohe and Marc Thurley — Counting homomorphisms and partition functions
    • Jan Hubička and Jarošlav Nešetřil — Some examples of universal and generic partial orders
    • Gregory Cherlin — Two problems on homogeneous structures, revisited
    • Assaf Hasson, Menachem Kojman and Alf Onshuus — On symmetric indivisbility of countable structures
    • Andreas Blass — Partitions and permutation groups
    • Dietrich Kuske — (Un)countable and (non)effective versions of Ramsey’s theorem
    • Manuel Bodirsky and Michael Pinsker — Reducts of Ramsey structures
  • 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: 5582011; 519 pp
MSC: Primary 03; 05; 68;

This volume contains the proceedings of the AMS-ASL Special Session on Model Theoretic Methods in Finite Combinatorics, held January 5–8, 2009, in Washington, DC.

Over the last 20 years, various new connections between model theory and finite combinatorics emerged. The best known of these are in the area of 0-1 laws, but in recent years other very promising interactions between model theory and combinatorics have been developed in areas such as extremal combinatorics and graph limits, graph polynomials, homomorphism functions and related counting functions, and discrete algorithms, touching the boundaries of computer science and statistical physics.

This volume highlights some of the main results, techniques, and research directions of the area. Topics covered in this volume include recent developments on 0-1 laws and their variations, counting functions defined by homomorphisms and graph polynomials and their relation to logic, recurrences and spectra, the logical complexity of graphs, algorithmic meta theorems based on logic, universal and homogeneous structures, and logical aspects of Ramsey theory.

Readership

Graduate students and research mathematicians interested in logic, combinatorics, and theoretical computer science.

  • Articles
  • Eldar Fischer, Tomer Kotek and Johann A. Makowsky — Application of logic to combinatorial sequences and their recurrence relations
  • Jason P. Bell, Stanley N. Burris and Karen Yeats — Spectra and systems of equations
  • Jason P. Bell and Stanley N. Burris — Compton’s method for proving logical limit laws
  • Oleg Pikhurko and Oleg Verbitsky — Logical complexity of graphs: A survey
  • Martin Grohe and Stephan Kreutzer — Methods for algorithmic meta theorems
  • Tomer Kotek, Johann A. Makowsky and Boris Zilber — On counting generalized colorings
  • Martin Grohe and Marc Thurley — Counting homomorphisms and partition functions
  • Jan Hubička and Jarošlav Nešetřil — Some examples of universal and generic partial orders
  • Gregory Cherlin — Two problems on homogeneous structures, revisited
  • Assaf Hasson, Menachem Kojman and Alf Onshuus — On symmetric indivisbility of countable structures
  • Andreas Blass — Partitions and permutation groups
  • Dietrich Kuske — (Un)countable and (non)effective versions of Ramsey’s theorem
  • Manuel Bodirsky and Michael Pinsker — Reducts of Ramsey structures
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.