A Note on Flips in Diagonal Rectangulations
نویسندگان
چکیده
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 t3142, 2413u. 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. E-mail addresses: [email protected], {Vera.Sacristan, Rodrigo.Silveira}@upc.edu. 1 ar X iv :1 71 2. 07 91 9v 1 [ m at h. C O ] 2 1 D ec 2 01 7
منابع مشابه
Binary search trees and rectangulations
We revisit the classical problem of searching in a binary search tree (BST) using rotations, and present novel connections of this problem to a number of geometric and combinatorial structures. In particular, we show that the execution trace of a BST that serves a sequence of queries is in close correspondence with the flip-sequence between two rectangulations. (Rectangulations are well-studied...
متن کاملSigned Diagonal Flips
We introduce the notion of signed diagonal flips on signed surface tri-angulations. We then formulate the conjecture that any two triangulations (without interior vertices) of a given polygon may be transformed into each other by a signable sequence of diagonal flips. Finally, we explain how this conjecture implies the four color theorem.
متن کاملDiagonal Flips in Hamiltonian Triangulations on the Sphere
In this paper, we shall prove that any two Hamiltonian triangulations on the sphere with n 5 vertices can be transformed into each other by at most 4n 20 diagonal flips, preserving the existence of Hamilton cycles. Moreover, using this result, we shall prove that at most 6n 30 diagonal flips are needed for any two triangulations on the sphere with n vertices to transform into each other.
متن کاملDiagonal Flips in Labelled Planar Triangulations
A classical result of Wagner states that any two (unlabelled) planar triangulations with the same number of vertices can be transformed into each other by a finite sequence of diagonal flips. Recently Komuro gives a linear bound on the maximum number of diagonal flips needed for such a transformation. In this paper we show that any two labelled triangulations can be transformed into each other ...
متن کاملOn signed diagonal flip sequences
Eliahou [1] and Kryuchkov conjectured a proposition that Gravier and Payan [4] proved to be equivalent to the Four Color Theorem. It states that any triangulation of a polygon can be transformed into another triangulation of the same polygon by a sequence of signed diagonal flips. It is well known that any pair of polygonal triangulations are connected by a sequence of (non-signed) diagonal fli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.07919 شماره
صفحات -
تاریخ انتشار 2017