Related papers: Slit-slide-sew bijections for oriented planar maps
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
In the wood industry, logs are commonly quality screened by discrete X-ray scans on a moving conveyor belt from a few source positions. Typically, the measurements are obtained in a single two-dimensional (2D) plane (a "slice") by a…
Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly…
We construct a family of birational maps acting on two dimensional projective varieties, for which the growth of the degrees of the iterates is cubic. It is known that this growth can be bounded, linear, quadratic or exponential for such…
We study bounded weighted shifts on directed trees. We show that the set of multiplication operators associated with an injective weighted shift on a rooted directed tree coincides with the WOT/SOT closure of the set of polynomials of the…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…
We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…
This paper introduces the concept of a bi-scale metric for use in the cooperative phase of the self-organizing map (SOM) algorithm. Use of a bi-scale metric allows segmentation of the map into a number of regions, corresponding to…
We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…
We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus…
The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
Self-organizing neural networks are used for brick finding in OPERA experiment. Self-organizing neural networks and wavelet analysis used for recognition and extraction of car numbers from images.
Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…
We study Schreier dynamical systems associated with a vast family of groups that hosts many known examples of groups of intermediate growth. We are interested in the orbital graphs for the actions of these groups on $d-$regular rooted trees…
This note addresses the quantitative aspect of the bilipschitz extension problem. The main result states that any bilipschitz embedding of $\mathbb R$ into $\mathbb R^2$ can be extended to a bilipschitz self-map of $\mathbb R^2$ with a…
The pivot algorithm is the most efficient known method for sampling polymer configurations for self-avoiding walks and related models. Here we introduce two recent improvements to an efficient binary tree implementation of the pivot…
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
While feature association to a global map has significant benefits, to keep the computations from growing exponentially, most lidar-based odometry and mapping methods opt to associate features with local maps at one voxel scale. Taking…
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…