Baxter posets (Q2318781): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijection between permutations and floorplans, and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Baxter permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for plane representations of acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Baxter permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack words, standard tableaux and Baxter permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijections for Baxter families and related objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic and combinatorial structures on pairs of twin binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward Planar Drawing of Single-Source Acyclic Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hopf algebra of diagonal rectangulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic rectangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncrossing Arc Diagrams and Canonical Join Representations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 05:19, 20 July 2024

scientific article
Language Label Description Also known as
English
Baxter posets
scientific article

    Statements

    Baxter posets (English)
    0 references
    0 references
    16 August 2019
    0 references
    Summary: We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal rectangulation, we describe the cover relations in the associated Baxter poset. Given a Baxter poset, we describe a method for obtaining the associated Baxter permutation and the associated twisted Baxter permutation.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references