Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
From MaRDI portal
Publication:4561264
DOI10.1137/17M1126734zbMath1401.05022arXiv1702.04529OpenAlexW2963539886WikidataQ128824522 ScholiaQ128824522MaRDI QIDQ4561264
Andrew Rechnitzer, Mathilde Bouvel, Simone Rinaldi, Veronica Guerrini
Publication date: 5 December 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.04529
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)
Related Items (23)
Counting quadrant walks via Tutte's invariant method ⋮ Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes ⋮ Consecutive patterns in inversion sequences II: avoiding patterns of relations ⋮ Wilf equivalences between vincular patterns in inversion sequences ⋮ 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 ⋮ Inversion sequences avoiding pairs of patterns ⋮ Restricted inversion sequences and Schröder paths ⋮ 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 ⋮ Inversion sequences avoiding a triple of patterns of 3 letters ⋮ On the enumeration of plane bipolar posets and transversal structures ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Baxter permuton and Liouville quantum gravity ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Few Sequence Pairs Suffice: Representing All Rectangle Placements ⋮ A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Unnamed Item ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-D-finite excursions in the quarter plane
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
- Lattice congruences, fans and Hopf algebras.
- New Wilf-equivalence results for vincular patterns
- On partitions avoiding 3-crossings
- The number of Baxter permutations
- Generating functions for generating trees
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- On the nature of the generating series of walks in the quarter plane
- Generating permutations with restricted containers
- Generating trees and the Catalan and Schröder numbers
- An asymptotic formula for binomial sums
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
- Some Wilf-equivalences for vincular patterns
- Enumeration schemes for permutations avoiding barred patterns
- Forest-like permutations
- Partially directed paths in a wedge
- Bijections for Baxter families and related objects
- Enumerating permutations avoiding three Babson-Steingrímsson patterns
- Walks with small steps in the quarter plane
- The on-line encyclopedia of integer sequences
- Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
- ECO:a methodology for the enumeration of combinatorial objects
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius
- Baxter permutations and plane bipolar orientations
This page was built for publication: Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
