Related papers: Some results on maps that factor through a tree
Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…
We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…
We formalize the notion of limit of an inverse system of metric spaces with $1$-Lipschitz projections having unbounded fibers. The purpose is to use sub-Riemannian groups for metrizing the space of signatures of rectifiable paths in…
A quasiconformal tree is a metric tree that is doubling and of bounded turning. We prove that every quasiconformal tree is quasisymmetrically equivalent to a geodesic tree with Hausdorff dimension arbitrarily close to 1.
Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…
Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is ${\sf NP}$-complete, even for diameter two…
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…
We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…
A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…
Inspired by a recent work of Crovisier and Pujals on mildly dissipative diffeomorphisms of the plane, we show that H\'enon-like and Lozi-like maps on their strange attractors are conjugate to natural extensions (a.k.a. shift homeomorphisms…
We introduce a higher dimensional quasiregular map analogous to the trigonometric functions and we use the dynamics of this map to define, for d>1, a partition of d-dimensional Euclidean space into curves tending to infinity such that two…
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…
Lipschitz and horizontal maps from an $n$-dimensional space into the $(2n+1)$-dimensional Heisenberg group $\H^n$ are abundant, while maps from higher-dimensional spaces are much more restricted. DeJarnette-Haj{\l}asz-Lukyanenko-Tyson…
We study the infimal value of the Hausdorff dimension of spaces that are H\"older equivalent to a given metric space; we call this bi-H\"older-invariant "H\"older dimension". This definition and some of our methods are analogous to those…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
For a given graph, the unlabeled subgraphs $G-v$ are called the cards of $G$ and the deck of $G$ is the multiset $\{G-v: v \in V(G)\}$. Wendy Myrvold [Ars Combinatoria, 1989] showed that a non-connected graph and a connected graph both on…
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
We construct factors of type $\tn$ for $n\in\NN, n\geq 2$ from group actions on homogeneous trees and their boundaries. Our result is a discrete analogue of a result of R.J Spatzier, where the hyperfinite factor of type $\tone$ is…
The necessary and sufficient conditions under which a given family $\mathcal{F}$ of subsets of finite set $X$ coincides with the family $\mathbf{B}_X$ of all balls generated by some ultrametric $d$ on $X$ are found. It is shown that the…