English
Related papers

Related papers: Slit-slide-sew bijections for oriented planar maps

200 papers

Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalization of Schnyder woods to $d$-angulations (plane graphs with…

Combinatorics · Mathematics 2012-03-14 Olivier Bernardi , Eric Fusy

We consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists of $O(n^2)$ steps where each step is a linear morph that…

Computational Geometry · Computer Science 2014-11-25 Fidel Barrera-Cruz , Penny Haxell , Anna Lubiw

In this paper planar STIT tesselations with weighted axis-parallel cutting directions are considered. They are known also as weighted planar Mondrian tesselations in the machine learning literature, where they are used in random forest…

Probability · Mathematics 2022-04-29 Carina Betken , Tom Kaufmann , Kathrin Meier , Christoph Thäle

Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm on a particular orientation of the triangulation: the minimal…

Discrete Mathematics · Computer Science 2015-07-21 Vincent Despré , Daniel Gonçalves , Benjamin Lévêque

We define some Schnyder-type combinatorial structures on a class of planar triangulations of the pentagon which are closely related to 5-connected triangulations. The combinatorial structures have three incarnations defined in terms of…

Combinatorics · Mathematics 2023-09-01 Olivier Bernardi , Éric Fusy , Shizhe Liang

Using techniques introduced by H. Thomas and N. Williams in "Cyclic Symmetry of the Scaled Simplex," we prove that modular sweep maps are bijective. We construct the inverse of the modular sweep map by passing through an intermediary set of…

Combinatorics · Mathematics 2018-02-28 Hugh Thomas , Nathan Williams

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…

Combinatorics · Mathematics 2024-08-16 Tamás Kálmán , Lilla Tóthmérész

The active bijection forms a package of results studied by the authors in a series of papers in oriented matroids. The present paper is intended to state the main results in the particular case, and more widespread language, of graphs. We…

Combinatorics · Mathematics 2018-07-19 Emeric Gioan , Michel Las Vergnas

Rescaled spike and slab models are a new Bayesian variable selection method for linear regression models. In high dimensional orthogonal settings such models have been shown to possess optimal model selection properties. We review…

Applications · Statistics 2008-12-18 Hemant Ishwaran , Ariadni Papana

Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ of the…

Numerical Analysis · Mathematics 2013-11-19 Stanislav Harizanov

The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…

Combinatorics · Mathematics 2023-06-09 Giulio Cerbai , Anders Claesson

We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…

Combinatorics · Mathematics 2021-06-15 Olivier Bernardi

The process of self-morphing in curved surfaces found in nature, such as with the growth of flowers and leaves, has generated interest in the study of self-morphing bilayers, which has been used in many soft robots or switchers. However,…

Numerical Analysis · Mathematics 2023-09-19 Junjie Song , Yixiong Feng , Zhaoxi Hong , Bingtao Hu , Jianrong Tan , Xiuju Song

A planar stuffed map is an embedding of a graph into the 2-sphere $S^{2}$, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are…

Combinatorics · Mathematics 2026-02-12 Nathan Pagliaroli

This paper proposes a novel method of coverage path planning for the purpose of scanning an unstructured environment autonomously. The method uses the morphological skeleton of the prior 2D navigation map via SLAM to generate a sequence of…

Robotics · Computer Science 2026-02-17 Alexander James Becoy , Kseniia Khomenko , Luka Peternel , Raj Thilak Rajan

A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…

Logic in Computer Science · Computer Science 2017-01-11 Noam Zeilberger , Alain Giorgetti

The scaling limit of large simple outerplanar maps was established by Caraceni using a bijection due to Bonichon, Gavoille and Hanusse. The present paper introduces a new bijection between outerplanar maps and trees decorated with ordered…

Probability · Mathematics 2016-12-12 Benedikt Stufler

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…

Combinatorics · Mathematics 2019-08-13 Hillary S. W. Han , Christian M. Reidys

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

Combinatorics · Mathematics 2025-02-14 Yang Li , Zhicong Lin

We use some of the largest order statistics of the random projections of a reference signal to construct a binary embedding that is adapted to signals correlated with such signal. The embedding is characterized from the analytical…

Machine Learning · Computer Science 2017-01-31 Diego Valsesia , Enrico Magli