Combinatorial Exploration: an Algorithmic Framework for Enumeration

AMERICAN MATHEMATICAL SOCIETYISBN: 9781470480004

Price:
Sale price$181.00
Stock:
Temporarily out of stock. Order now & we'll deliver when available

By Michael H. Albert, Christian Bean, Anders Claesson, Emile Nadeau, Jay Pantone
Imprint:
AMERICAN MATHEMATICAL SOCIETY
Release Date:
Format:
PAPERBACK
Dimensions:
254 x 178 mm
Weight:

Pages:
109

Request Academic Copy

Button Actions

Please copy the ISBN for submitting review copy form

Description

Michael H. Albert, University of Otago, Dunedin, New Zealand. Christian Bean, Keele University, England, United Kingdom. Anders Claesson, University of Iceland, Reykjavik, Iceland. Emile Nadeau, Reykjavik, Iceland. Jay Pantone, Marquette University, Milwaukee, Wisconsin. Henning Ulfarsson, Reykjavik University, Iceland

Chapters; 1. Introduction; 2. Permutation Patterns; 3. Combinatorial Exploration; 4. Productive Proof Trees and Combinatorial Specifications; 5. Transfer Tools; 6. Applying Combinatorial Exploration to Permutation Patterns; 7. Applying Combinatorial Exploration to Alternating Sign Matrices; 8. Applying Combinatorial Exploration to Polyominoes; 9. Applying Combinatorial Exploration to Pattern-Avoiding Set Partitions; 10. Further Algorithmic Considerations; 11. Final Notes

You may also like

Recently viewed