Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
From MaRDI portal
Publication:1422120
zbMath1031.05006MaRDI QIDQ1422120
Publication date: 5 February 2004
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/123225
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)
Related Items
Counting quadrant walks via Tutte's invariant method, Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes, Counting coloured planar maps, Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence, Wilf equivalences between vincular patterns in inversion sequences, The kernel method and systems of functional equations with several conditions, A new occurrence of Catalan numbers: cap permutations, Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels, Inversion sequences avoiding pairs of patterns, Five classes of pattern avoiding inversion sequences under one roof: generating trees, Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers, Generic rectangulations, Proof of Dilks' bijectivity conjecture on Baxter permutations, Baxter permuton and Liouville quantum gravity, Partially directed paths in a wedge, The number of 1s in Baxter matrices, Pattern avoidance for alternating permutations and Young tableaux, Pattern-avoiding inversion sequences and open partition diagrams, Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations, Counting signed vexillary permutations, Enumerating \(r\)c-invariant permutations with no long decreasing subsequences, Generating-tree isomorphisms for pattern-avoiding involutions, The Hopf algebra of diagonal rectangulations., Finitely labeled generating trees and restricted permutations, Refined restricted inversion sequences, Semi-Baxter and strong-Baxter permutations, Restricted inversion sequences and enhanced 3-noncrossing partitions, Algebraic and combinatorial structures on pairs of twin binary trees, Baxter permutations and plane bipolar orientations, Mixed succession rules: the commutative case, Counting permutations with no long monotone subsequence via generating trees and the kernel method, Kernel method and linear recurrence system, Decreasing subsequences in permutations and Wilf equivalence for involutions, Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents, Walks in the quarter plane: Kreweras' algebraic model, Counting colored planar maps: algebraicity results, Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions, Vincular patterns in inversion sequences, Classifying lattice walks restricted to the quarter plane, Unnamed Item, Kernel method and system of functional equations, Enumeration of bilaterally symmetric 3-noncrossing partitions, Restricted \(k\)-ary words and functional equations, Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences, On partially ordered patterns of length 4 and 5 in permutations, Bijective counting of plane bipolar orientations and Schnyder woods, Cyclic pattern containment and avoidance, New bijective links on planar maps via orientations, The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton
