Publication:2315433

zbMATH Open1423.05004arXiv1511.04864MaRDI QIDQ2315433FDOQ2315433

Veronica Guerrini, Nicholas R. Beaton, Mathilde Bouvel, S. Rinaldi

Publication date: 5 August 2019

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

Abstract: We provide a new succession rule (i.e. generating tree) associated with Schr"oder numbers, that interpolates between the known succession rules for Catalan and Baxter numbers. We define Schr"oder and Baxter generalizations of parallelogram polyominoes, called slicings, which grow according to these succession rules. In passing, we also exhibit Schr"oder subclasses of Baxter classes, namely a Schr"oder subset of triples of non-intersecting lattice paths, a new Schr"oder subset of Baxter permutations, and a new Schr"oder subset of mosaic floorplans. Finally, we define two families of subclasses of Baxter slicings: the $m$-skinny slicings and the $m$-row-restricted slicings, for $minmathbbN$. Using functional equations and the kernel method, their generating functions are computed in some special cases, and we conjecture that they are algebraic for any $m$.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generating treeBaxter classesSchröder numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating functions for generating trees
• Generating trees and the Catalan and Schröder numbers
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• Bijections for Baxter families and related objects
• A generating tree approach to \(k\)-nonnesting partitions and permutations
• Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
• ECO:a methodology for the enumeration of combinatorial objects
• The number of Baxter permutations
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Baxter permutations and plane bipolar orientations
• Tableau sequences, open diagrams, and Baxter families
• Generating permutations with restricted containers
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers

Cited In (4)

• Title not available (Why is that?)
• The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels

Uses Software

• OEIS

This page was built for publication: Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences

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