The permutation classes Av(1234, 2341) and Av(1243, 2314)

MaRDI QIDQ2800760zbMATH OpenFDO

Authors David Bevan

Publication date 18 April 2016

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.0570, http://ajc.maths.uq.edu.au//pdf/64/ajc_v64_p003.pdf

zbMATH Keywords

Hasse graphs of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: We investigate the structure of the two permutation classes defined by the sets of forbidden patterns {1234,2341} and {1243,2314}. By considering how the Hasse graphs of permutations in these classes can be built from a sequence of rooted source graphs, we determine their algebraic generating functions. Our approach is similar to that of "adding a slice", used previously to enumerate various classes of polyominoes and other combinatorial structures. To solve the relevant functional equations, we make extensive use of the kernel method.

Recommendations

• The permutation class Av(4213,2143)
• The enumeration of three pattern classes using monotone grid classes
• The enumeration of permutations avoiding 3124 and 4312
• Generating trees for permutations avoiding generalized patterns
• Permutation classes of polynomial growth

Cited in

(3)

• Using large random permutations to partition permutation classes
• Blockers of pattern avoiding permutation matrices
• Combinatorial exploration: an algorithmic framework for enumeration

This page was built for publication: The permutation classes \(\mathrm{Av}(1234, 2341)\) and \(\mathrm{Av}(1243, 2314)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800760)