Locally convex words and permutations

zbMath1335.05004arXiv1410.7818MaRDI QIDQ281597

Jonathan Dewitt, Christopher Coscia

Publication date: 11 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.7818

zbMATH Keywords

permutationswordsgenerating functionsasymptoticstransfer matricesinteger partitionspermutation patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On convex permutations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Patterns in permutations and words.
• Combinatorial aspects of continued fractions
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Finite automata and pattern avoidance in words
• Restricted permutations and Chebyshev polynomials
• Finitely labeled generating trees and restricted permutations
• On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
• The Editor's Corner: n Coins in a Fountain

This page was built for publication: Locally convex words and permutations