Related papers: Encoding toroidal triangulations
Landry, Minsky and Taylor [LMT] introduced two polynomial invariants of veering triangulations -- the taut polynomial and the veering polynomial. We give algorithms to compute these invariants. In their definition [LMT] use only the upper…
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…
A bijection $\Phi$ is presented between plane bipolar orientations with prescribed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with prescribed extremities. This yields a combinatorial proof of the…
We set the foundation for a series of works aimed at proving strong relations between uniform random planar maps and Liouville quantum gravity (LQG). Our method relies on a bijective encoding of site-percolated planar triangulations by…
We describe a technique to reorganize topologies of Steiner trees by exchanging neighbors of adjacent Steiner points. We explain how to use the systematic way of building trees, and therefore topologies, to find the correct topology after…
In the Escherization problem, given a closed figure in a plane, the objective is to find a closed figure that is as close as possible to the input figure and tiles the plane. Koizumi and Sugihara's formulation reduces this problem to an…
Moir\'e patterns of twisted and scaled bilayers have recently emerged as a fertile source of quasiperiodic order in two-dimensional materials. Inspired by these systems, we introduce the \emph{near-coincidence method} for generating…
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…
This paper introduces a method to extract a hierarchical tree representation from 3D unorganized polygonal data. The proposed approach first extracts a graph representation of the surface, which serves as the foundation for structural…
Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point…
Fractional cascading is one of the influential techniques in data structures, as it provides a general framework for solving the important iterative search problem. In the problem, the input is a graph $G$ with constant degree and a set of…
We study electromagnetic field propagation through an ideal, passive, triangular three-waveguide coupler using a symmetry based approach to take advantage of the underlying $SU(3)$ symmetry. The planar version of this platform has proven…
We develop a new bijective framework for the enumeration of bipartite planar maps with control on the degree distribution of black and white vertices. Our approach builds on the blossoming-tree paradigm, introducing a family of orientations…
In deep neural networks, better results can often be obtained by increasing the complexity of previously developed basic models. However, it is unclear whether there is a way to boost performance by decreasing the complexity of such models.…
We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all surfaces, that is orientable and non-orientable as well. This…
We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…
We consider the problem of learning low-rank tensors from partial observations with structural constraints, and propose a novel factorization of such tensors, which leads to a simpler optimization problem. The resulting problem is an…
In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…
Selfridge, along with Sutherland and Marr provided some of the earliest proposals for how to program computers to recognize shapes. Their emphasis on filtering for contour features, especially the orientation of boundary segments, was…
We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is…