Patterns in Permutations and Words

Patterns in Permutations and Words PDF Author: Sergey Kitaev
Publisher: Springer Science & Business Media
ISBN: 3642173330
Category : Computers
Languages : en
Pages : 511

Get Book Here

Book Description
There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan—Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, including sorting stacks and sortable permutations. The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology. The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

Permutation Patterns

Permutation Patterns PDF Author: Steve Linton
Publisher: Cambridge University Press
ISBN: 1139488848
Category : Mathematics
Languages : en
Pages : 353

Get Book Here

Book Description
A mixture of survey and research articles by leading experts that will be of interest to specialists in permutation patterns and other researchers in combinatorics and related fields. In addition, the volume provides plenty of material accessible to advanced undergraduates and is a suitable reference for projects and dissertations.

Algebraic Combinatorics on Words

Algebraic Combinatorics on Words PDF Author: M. Lothaire
Publisher: Cambridge University Press
ISBN: 9780521812207
Category : Mathematics
Languages : en
Pages : 536

Get Book Here

Book Description
Comprehensive 2002 introduction to combinatorics on words for mathematicians and theoretical computer scientists.

Avoiding and Enforcing Repetitive Structures in Words

Avoiding and Enforcing Repetitive Structures in Words PDF Author: Mike Müller
Publisher: BoD – Books on Demand
ISBN: 3734741971
Category : Computers
Languages : en
Pages : 174

Get Book Here

Book Description
Avoiding and enforcing repetitions in words are central topics in the area of combinatorics on words, with first results going back to the beginning of the 20th century. The results presented in this thesis extend and enrich the existing theory concerning the presence and absence of repetitive structures in words. In the first part the question whether such structures necessarily appear in infinite words over a finite alphabet is investigated. In particular, avoidability questions of patterns whose repetitive structure is disguised by the application of a permutation are studied. The second part deals with equations on words that enforce a certain repetitive structure involving involutions in their solution set. A generalisation of the classical equations u^l = v^mw^n that were studied by Lyndon and Schützenberger is analysed. The last part considers the influence of the shuffle operation on square-free words and related avoidability questions.

Analytic Combinatorics

Analytic Combinatorics PDF Author: Philippe Flajolet
Publisher: Cambridge University Press
ISBN: 1139477161
Category : Mathematics
Languages : en
Pages : 825

Get Book Here

Book Description
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

Combinatorics of Compositions and Words

Combinatorics of Compositions and Words PDF Author: Silvia Heubach
Publisher: CRC Press
ISBN: 1420072684
Category : Computers
Languages : en
Pages : 505

Get Book Here

Book Description
A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words. It

Developments in Language Theory

Developments in Language Theory PDF Author: Igor Potapov
Publisher: Springer
ISBN: 3319215000
Category : Computers
Languages : en
Pages : 459

Get Book Here

Book Description
This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing.

Combinatorics of Permutations

Combinatorics of Permutations PDF Author: Miklos Bona
Publisher: CRC Press
ISBN: 1439850526
Category : Computers
Languages : en
Pages : 478

Get Book Here

Book Description
A Unified Account of Permutations in Modern CombinatoricsA 2006 CHOICE Outstanding Academic Title, the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, Second Edition continues to clearly show the usefuln

Applied Combinatorics on Words

Applied Combinatorics on Words PDF Author: M. Lothaire
Publisher: Cambridge University Press
ISBN: 9780521848022
Category : Computers
Languages : en
Pages : 646

Get Book Here

Book Description
Publisher Description

Discrete Mathematics

Discrete Mathematics PDF Author: Oscar Levin
Publisher: Createspace Independent Publishing Platform
ISBN: 9781534970748
Category :
Languages : en
Pages : 342

Get Book Here

Book Description
This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. There are also Investigate! activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course. It is written to be used in a course for future math teachers. It is open source, with low cost print editions and free electronic editions.