Permutation patterns : St. Andrews 2007 / edited by Steve Linton, Nik Ruškuc, Vincent Vatter.

By: (5th : International Conference on Permutation Patterns (5th : 2007 : St. Andrews University)
Contributor(s): Linton, S. (Steve) | Ruškuc, Nik | Vatter, Vincent
Material type: TextTextSeries: London Mathematical Society lecture note series: 376.Publisher: Cambridge, UK ; New York : Cambridge University Press, 2010Description: 1 online resource (345 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9780511901829; 0511901828; 1107207479; 9781107207479; 1282733702; 9781282733701; 9786612733703; 6612733705; 0511901038; 9780511901034; 0511798679; 9780511798672; 0511797273; 9780511797279; 0511902492; 9780511902499; 0511900244; 9780511900242Subject(s): Combinatorial analysis -- Congresses | Probabilities -- Congresses | MATHEMATICS -- Algebra -- Intermediate | Combinatorial analysis | ProbabilitiesGenre/Form: Electronic books. | Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Permutation patterns.DDC classification: 512 LOC classification: QA164 | .I582 2007ebOnline resources: Click here to access online
Contents:
Cover; Series-title; Title; Copyright; Contents; Preface; Some general results in combinatorial enumeration; A survey of simple permutations; Permuting machines and permutation patterns; On three different notions of monotone subsequences; A survey on partially ordered patterns; Generalized permutation patterns -- a short survey; An introduction to structural methods in permutation patterns; Combinatorial properties of permutation tableaux; Enumeration schemes for words avoiding permutations; The lexicographic first occurrence of a I-II-III-pattern
Enumeration of partitions by rises, levels and descentsRestricted patience sorting and barred pattern avoidance; Permutations with k-regular descent patterns; Packing rates of measures and a conjecture for the packing density of 2413; On the permutational power of token passing networks; Problems and conjectures presented at the problem session
Summary: The study of permutation patterns is a thriving area of combinatorics that relates to many other areas of mathematics, including graph theory, enumerative combinatorics, model theory, the theory of automata and languages, and bioinformatics. Arising from the Fifth International Conference on Permutation Patterns, held in St Andrews in June 2007, this volume contains a mixture of survey and research articles by leading experts, and includes the two invited speakers, Martin Klazar and Mike Atkinson. Together, the collected articles cover all the significant strands of current research: structural methods and simple patterns, generalisations of patterns, various enumerative aspects, machines and networks, packing, and more. Specialists in this area and other researchers in combinatorics and related fields will find much of interest in this book. In addition, the volume provides plenty of material accessible to advanced undergraduates and is a suitable reference for projects and dissertations.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

"Fifth International Conference on Permutation Patterns, held in St Andrews in June 2007"--Page 4 of cover.

"Conference was held 11-15 June 2007 at the University of St. Andrews"--Preface.

Includes bibliographical references.

Print version record.

The study of permutation patterns is a thriving area of combinatorics that relates to many other areas of mathematics, including graph theory, enumerative combinatorics, model theory, the theory of automata and languages, and bioinformatics. Arising from the Fifth International Conference on Permutation Patterns, held in St Andrews in June 2007, this volume contains a mixture of survey and research articles by leading experts, and includes the two invited speakers, Martin Klazar and Mike Atkinson. Together, the collected articles cover all the significant strands of current research: structural methods and simple patterns, generalisations of patterns, various enumerative aspects, machines and networks, packing, and more. Specialists in this area and other researchers in combinatorics and related fields will find much of interest in this book. In addition, the volume provides plenty of material accessible to advanced undergraduates and is a suitable reference for projects and dissertations.

Cover; Series-title; Title; Copyright; Contents; Preface; Some general results in combinatorial enumeration; A survey of simple permutations; Permuting machines and permutation patterns; On three different notions of monotone subsequences; A survey on partially ordered patterns; Generalized permutation patterns -- a short survey; An introduction to structural methods in permutation patterns; Combinatorial properties of permutation tableaux; Enumeration schemes for words avoiding permutations; The lexicographic first occurrence of a I-II-III-pattern

Enumeration of partitions by rises, levels and descentsRestricted patience sorting and barred pattern avoidance; Permutations with k-regular descent patterns; Packing rates of measures and a conjecture for the packing density of 2413; On the permutational power of token passing networks; Problems and conjectures presented at the problem session

English.

There are no comments for this item.

to post a comment.

Powered by Koha