Related papers: Some results on maps that factor through a tree

The Rooted Maximum Leaf Outbranching problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its parameterized version asks if there exists such a tree with at…

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

Given a finite set of points $C \subseteq \mathbb{R}^d$, we say that an ordering of $C$ is protrusive if every point lies outside the convex hull of the points preceding it. We give an example of a set $C$ of $5$ points in the Euclidean…

We deduce a necessary condition for Auslander-Reiten components of the bounded derived category of a finite dimensional algebra to have Euclidean tree class by classifying certain types of irreducible maps in the category of complexes. This…

We consider the iteration of quasiregular maps of transcendental type from $\mathbb{R}^d$ to $\mathbb{R}^d$. We give a bound on the rate at which the iterates of such a map can escape to infinity in a periodic component of the quasi-Fatou…

For a map $T \colon [0,1] \to [0,1]$ with an invariant measure $\mu$, we study, for a $\mu$-typical $x$, the set of points $y$ such that the inequality $|T^n x - y| < r_n$ is satisfied for infinitely many $n$. We give a formula for the…

We study affine maps between CAT(0) spaces with geometric actions, and show that they essentially split as products of dilations and linear maps (on the Euclidean factor). This extends known results from the Riemannian case. Furthermore, we…

Tree embedding has been a fundamental method in algorithm design with wide applications. We focus on the efficiency of building tree embedding in various computational settings under high-dimensional Euclidean $\mathbb{R}^d$. We devise a…

We prove that the Loop O(1) model, a well-known graphical expansion of the Ising model, is a factor of i.i.d. on unimodular random rooted graphs under various conditions, including in the presence of a non-negative external field. As an…

A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision…

We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…

A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in…

A relation between values of a unitarily invariant norm of Hermitian operator before and after action of completely positive map is studied. If the norm is jointly defined on both the input and output Hilbert spaces, one defines a shrinking…

We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

Given an one-dimensional Lorenz-like expanding map we prove that the condition\linebreak $P_{top}(\phi,\partial \mathcal{P},\ell)<P_{top}(\phi,\ell)$ (see, subsection 2.4 for definition), introduced by Buzzi and Sarig in [1] is satisfied…

Let $G$ be a bipartite graph with bipartition $(X,Y)$, let $k$ be a positive integer, and let $f:V(G)\rightarrow Z_k$ be a mapping with $\sum_{v\in X}f(v) \stackrel{k}{\equiv}\sum_{v\in Y}f(v)$. In this paper, we show that if $G$ is…

We describe all quasiconformal maps on the higher (real and complex) model Filiform groups equipped with the Carnot metric, including non-smooth ones. These maps have very special forms. In particular, they are all biLipschitz and preserve…

Most research into similarity search in metric spaces relies upon the triangle inequality property. This property allows the space to be arranged according to relative distances to avoid searching some subspaces. We show that many common…

We consider certain parametrised families of piecewise expanding maps on the interval, and estimate and sometimes calculate the Hausdorff dimension of the set of parameters for which the orbit of a fixed point has a certain shrinking target…