Related papers: An involution on bicubic maps and \beta(0,1)-trees
A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of fixed genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the…
We describe a general method of arithmetic coding of geodesics on the modular surface based on a two parameter family of continued fraction transformations studied previously by the authors. The finite rectangular structure of the…
We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
In this paper we investigate fixed-point numbers and entropies of endomorphisms on abelian varieties. It was shown quite recently that the number of fixed-points of an iterated endomorphism on a simple complex torus is either periodic or…
A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same distance to the root. We study sequences of $B$-trees that…
We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…
Numerical Campedelli surfaces are minimal surfaces of general type with p_g=0 (and so q=0) and K^2=2. Although they have been studied by several authors, their complete classification is not known. In this paper we classify numerical…
A QRT map is the composition of two involutions on a biquadratic curve: one switching the $x$-coordinates of two intersection points with a given horizontal line, and the other switching the $y$-coordinates of two intersections with a…
The diameter distribution of a given species of deciduous trees in mature, temperate zone forests is well approximated by a Gamma distribution. Here we give new experimental evidence for this conjecture by analyzing deciduous tree size data…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…
We consider the space of embeddings of finitely many circles that bound disks in non-positively curved surfaces. We index the connected components of this space with finite rooted trees and show that the connected components are classifying…
A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…
We construct the entropic measure $\mathbb{P}^\beta$ on compact manifolds of any dimension. It is defined as the push forward of the Dirichlet process (another random probability measure, well-known to exist on spaces of any dimension)…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…
Interesting properties of the partitions of a finite field $\mathbb F_q$ induced by the combination of involutions and trace maps are studied. The special features of involutions of the form $\frac{u}{z}$, $u$ being a fixed element of…
We discuss an autoencoder model in which the encoding and decoding functions are implemented by decision trees. We use the soft decision tree where internal nodes realize soft multivariate splits given by a gating function and the overall…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…
We define a ring whose elements are rational functions, whose addition is polynomial multiplication, and whose multiplication is a convolution operation. It is then show that this ring's endomorphisms exhibit a strong classification.…