English
Related papers

Related papers: A Note on Flips in Diagonal Rectangulations

200 papers

We study the reconfiguration of odd matchings of combinatorial graphs. Odd matchings are matchings that cover all but one vertex of a graph. A reconfiguration step, or flip, is an operation that matches the isolated vertex and,…

Computational Complexity · Computer Science 2026-02-11 Joseph Dorfer

We study, theoretically and experimentally, a 1-parameter family of transformations and their limiting vector field on the space of plane polygons. These transformations are discrete analogs of completely integrable transformation on closed…

Dynamical Systems · Mathematics 2024-02-27 Maxim Arnold , Lael Costa , Serge Tabachnikov

Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in $\mathbb{R}^2$. We study a generalization in space: touching graphs of axis-aligned rectangles in $\mathbb{R}^3$, and prove that planar…

Combinatorics · Mathematics 2023-09-18 Stefan Felsner , Kolja Knauer , Torsten Ueckerdt

A concept of a rectangular diagram of a foliation in the three-sphere is introduced. It is shown that any co-orientable finite depth foliation in the complement of a link admits a presentation by a rectangular diagram compatible with the…

Geometric Topology · Mathematics 2025-08-12 Mikhail Chernavskikh , Ivan Dynnikov

We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…

Geometric Topology · Mathematics 2019-04-01 Riccardo Benedetti

A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…

Combinatorics · Mathematics 2023-12-29 Sergi Elizalde , Alejandro B. Galván

Given a polygon $P$ in the plane, a {\em pop} operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be…

Computational Geometry · Computer Science 2009-11-24 Adrian Dumitrescu , Evan Hilscher

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Combinatorics · Mathematics 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

Drinfeld orbifold algebras are a type of deformation of skew group algebras generalizing graded Hecke algebras of interest in representation theory, algebraic combinatorics, and noncommutative geometry. In this article, we classify all…

Rings and Algebras · Mathematics 2016-11-03 Briana Foster-Greenwood , Cathy Kriloff

The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…

Combinatorics · Mathematics 2022-03-31 François Bergeron , Mikhail Mazin

Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present…

Combinatorics · Mathematics 2023-06-22 Andrei Asinowski , Cyril Banderier , Benjamin Hackl

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

Combinatorics · Mathematics 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two…

Combinatorics · Mathematics 2012-09-17 Marie Albenque , Eric Fusy , Dominique Poulalhon

Derivations play a fundamental role in the definition of vertex (operator) algebras, sometimes regarded as a generalization of differential commutative algebras. This paper studies the role played by the integral counterpart of the…

Quantum Algebra · Mathematics 2023-07-20 Chengming Bai , Li Guo , Jianqi Liu , Xiaoyan Wang

In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…

Combinatorics · Mathematics 2024-01-05 Serena An , Holden Mui

In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Thomas Hackl , David Orden , Alexander Pilz , Maria Saumell , Birgit Vogtenhuber

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

Combinatorics · Mathematics 2025-07-10 Jinjin Liang , Yixi Liao , Wenchuan Hu , Erxiao Wang

This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…

Combinatorics · Mathematics 2019-10-29 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno

We study when an arrangement of axis-aligned rectangles can be transformed into an arrangement of axis-aligned squares in $\mathbb{R}^2$ while preserving its structure. We found a counterexample to the conjecture of J. Klawitter, M.…

Computational Geometry · Computer Science 2016-11-24 Matěj Konečný , Stanislav Kučera , Michal Opler , Jakub Sosnovec , Štěpán Šimsa , Martin Töpfer

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

Computational Geometry · Computer Science 2019-12-11 Vincent Despré , Jean-Marc Schlenker , Monique Teillaud