A note on flips in diagonal rectangulations

MaRDI QIDQ4560267zbMATH OpenFDO

Authors Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira

Publication date 10 December 2018

Full work available at URL https://arxiv.org/abs/1712.07919, https://dmtcs.episciences.org/4943/pdf

zbMATH Keywords

flip graphspattern-avoiding permutationsrectangulations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal with local changes involving a single edge of a rectangulation, referred to as flips, edge rotations, or edge pivoting. Such operations induce a graph on equivalence classes of rectangulations, related to so-called flip graphs on triangulations and other families of geometric partitions. In this note, we consider a family of flip operations on the equivalence classes of diagonal rectangulations, and their interpretation as transpositions in the associated Baxter permutations, avoiding the vincular patterns { 3{14}2, 2{41}3 }. This complements results from Law and Reading (JCTA, 2012) and provides a complete characterization of flip operations on diagonal rectangulations, in both geometric and combinatorial terms.

Recommendations

• Generic rectangulations
• Baxter posets
• On the number of rectangulations of a planar point set

Cited in

(17)

• Combinatorial generation via permutation languages. II. Lattice congruences
• A NOTE ON FLIP SYSTEMS
• Generic rectangulations
• A note on Delaunay diagonal flips
• scientific article; zbMATH DE number 7640030 (Why is no real title available?)
• scientific article; zbMATH DE number 7641239 (Why is no real title available?)
• Combinatorial generation via permutation languages. I: Fundamentals
• Flip distances between graph orientations
• Combinatorial generation via permutation languages. III: Rectangulations
• Rectangulotopes
• Patterns in rectangulations. I: -like patterns, inversion sequence classes I(010, 101, 120, 201) and I(011, 201), and rushed Dyck paths
• Shortest paths on polymatroids and hypergraphic polytopes
• Combinatorics of rectangulations: old and new bijections
• Efficient generation of rectangulations via permutation languages
• Combinatorial generation via permutation languages. VII: Supersolvable hyperplane arrangements
• Generation and enumeration of floorplans determined by \textit{HV}-matrices
• From geometry to generating functions: rectangulations and permutations

This page was built for publication: A note on flips in diagonal rectangulations

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