The number of Baxter permutations

DOI10.1016/0097-3165(78)90068-7zbMath0398.05003OpenAlexW2165766451MaRDI QIDQ1254315

V. E. jun. Hoggatt, Ronald L. Graham, Mark A. R. Kleiman, Fan R. K. Chung

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90068-7

zbMATH Keywords

Number of Baxter Permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

From object grammars to ECO systems, Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes, On some combinatorial sequences associated to invariant theory, Generating trees and the Catalan and Schröder numbers, Subregularity in infinitely labeled generating trees of restricted permutations, On the enumeration of tanglegrams and tangled chains, Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence, Shuffle of parenthesis systems and Baxter permutations, Cambrian Hopf algebras, Catalan intervals and uniquely sorted permutations, New production matrices for geometric graphs, Stack words, standard tableaux and Baxter permutations, Generating trees and forbidden subsequences, Parametric Catalan numbers and Catalan triangles, Baxter permutations rise again, Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry, Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels, The skew Brownian permuton: A new universality class for random constrained permutations, Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers, Construction and composition of rooted trees via descent functions, Generic rectangulations, Recurrence relations, succession rules and the positivity problem, Differentiably finite power series, Proof of Dilks' bijectivity conjecture on Baxter permutations, Inequalities associated with the Baxter numbers, Baxter permuton and Liouville quantum gravity, The number of 1s in Baxter matrices, The combinatorics of a tree-like functional equation for connected chord diagrams, Bijections for Baxter families and related objects, Jumping succession rules and their generating functions, Pattern-avoiding inversion sequences and open partition diagrams, Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations, Unnamed Item, Algebraic methods for permutations with prescribed patterns, Unnamed Item, Matrix characterizations of Riordan arrays, Automatic discovery of structural rules of permutation classes, The Hopf algebra of diagonal rectangulations., On Ward's differential calculus, Riordan matrices and Sheffer polynomials, Finitely labeled generating trees and restricted permutations, A Good Question Won’t Go Away: An Example of Mathematical Research, Refined restricted inversion sequences, Convex polytopes and enumeration, Coxeter-bicatalan combinatorics, Sequence characterizations of double Riordan arrays and their compressions, Proper generating trees and their internal path length, Baxter permutations and plane bipolar orientations, Mixed succession rules: the commutative case, The tennis ball problem, Waiting patterns for a printer, On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia, Baxter permutations, Some linear recurrences and their combinatorial interpretation by means of regular languages, Lattice congruences, fans and Hopf algebras., Production matrices, A bijection between permutations and floorplans, and its applications, On the number of rectangulations of a planar point set, Enumerations of permutations by circular descent sets, Approximating algebraic functions by means of rational ones, A general exhaustive generation algorithm for Gray structures, Enumeration Schemes for Restricted Permutations, Restricted 123-avoiding Baxter permutations and the Padovan numbers, Recurrence Relations, Succession Rules, and the Positivity Problem, ECO:a methodology for the enumeration of combinatorial objects, Tableau sequences, open diagrams, and Baxter families, Unnamed Item, Unnamed Item, Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's, Refined Wilf-equivalences by Comtet statistics, Combinatorics of Fulton's essential set, Combinatorial statistics on alternating permutations, Enumeration of bilaterally symmetric 3-noncrossing partitions, Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences, Finding regular insertion encodings for permutation classes, Meeting covered elements in \(\nu\)-Tamari lattices, Baxter posets, Explicit enumeration of 321, hexagon-avoiding permutations, Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations, Cyclic pattern containment and avoidance, On directed-convex polyominoes in a rectangle, On the equivalence problem for succession rules, A combinatorial proof of J. West's conjecture, Directed animals, forests and permutations, Forbidden subsequences and Chebyshev polynomials, Noncrossing Arc Diagrams and Canonical Join Representations, A linear operator approach to succession rules, An algebraic characterization of the set of succession rules, Stack-sorting for Words

Cites Work