Related papers: An involution on bicubic maps and \beta(0,1)-trees

Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…

We study the convolution of functions of the form \[ f_\alpha (z) := \dfrac{\left( \frac{1 + z}{1 - z} \right)^\alpha - 1}{2 \alpha}, \] which map the open unit disk of the complex plane onto polygons of 2 edges when $\alpha\in(0,1)$. We…

In this paper we investigate fixed-point numbers of endomorphisms on complex tori. Specifically, motivated by the asymptotic perspective that has turned out in recent years to be so fruitful in Algebraic Geometry, we study how the number of…

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…

We present a bijection between cyclic permutations of {1,2,...,n+1} and permutations of {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like…

We construct bijections giving three "codes" for trees. These codes follow naturally from the Matrix Tree Theorem of Tutte and have many advantages over the one produced by Prufer in 1918. One algorithm gives explicitly a bijection that is…

Inspired by the interval decomposition of persistence modules and the extended Newick format of phylogenetic networks, we show that, inside the larger category of \textit{ordered Reeb graphs}, every Reeb graph with $n$ leaves and first…

The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift $X$ and its associated hom tree-shift $\mathcal{T}_{X}$, as well as the equivalence in the sofic shift. On the…

We have been interested in graphs and realizing them as Reeb graphs of explicit real algebraic functions. The Reeb graph of a differentiable function is the quotient space of the manifold of the domain, regarded as the space consisting of…

Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…

We consider a transformation of a normalized measure space such that the image of any point is a finite set. We call such transformation $m$-transformation. In this case the orbit of any point looks like a tree. In the study of…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…

We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-circuit sets of the corresponding integral gain graphs and some…

We consider the question of existence of a unique invariant probability distribution which satisfies some evolutionary property. The problem arises from the random graph theory but to answer it we treat it as a dynamical system in the…

Using the theory of Properly Embedded Graphs developed in an earlier work we define an involutory duality on the set labeled non-crossing trees that lifts the obvious duality in the set of unlabeled non-crossing trees. The set of…

The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…

There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…