Related papers: Realizing trees of configurations in thin sets

We introduce a new spin-fermion mapping, for arbitrary spin $S$ generating the SU(2) group algebra, that constitutes a natural generalization of the Jordan-Wigner transformation for $S=1/2$. The mapping, valid for regular lattices in any…

This paper establishes connections between the group-Fourier transform and the geometry of measures in the Heisenberg group. Firstly, it is shown that if the Fourier transform of a compactly supported, finite, Radon measure is square…

In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…

We establish a structure theorem for rational maps $f:\overline{\mathbb{C}}\to\overline{\mathbb{C}}$: the pullback metric $f^{*}{\rm d}s_{0}^{2}$ of the standard metric ${\rm d}s_{0}^{2}$ admits a canonical decomposition into finitely many…

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

In this paper we prove that the existence of absolutely continuous spectrum of the Kirchhoff Laplacian on a radial metric tree graph together with a finite complexity of the geometry of the tree implies that the tree is in fact eventually…

Let $G$ be a discrete countable infinite group. We show that each topological $(C,F)$-action $T$ of $G$ on a locally compact non-compact Cantor set is a free minimal amenable action admitting a unique up to scaling non-zero invariant Radon…

We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…

In a recent paper, Chan, \L aba, and Pramanik investigated geometric configurations inside thin subsets of the Euclidean set possessing measures with Fourier decay properties. In this paper we ask which configurations can be found inside…

The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…

The famous Erd\H{o}s-S\'os conjecture states that every graph of average degree more than $t-1$ must contain every tree on $t+1$ vertices. In this paper, we study a spectral version of this conjecture. For $n>k$, let $S_{n,k}$ be the join…

We give conditions for $k$-point configuration sets of thin sets to have nonempty interior, applicable to a wide variety of configurations. This is a continuation of our earlier work \cite{GIT19} on 2-point configurations, extending a…

The Radial Spanning Tree (RST) in dimension $d\geq2$ is a random geometric graph constructed on a homogeneous Poisson point process $\mathcal N$ in $\mathbb R^d$ augmented by the origin, with edges connecting each $x\in\mathcal N$ to the…

We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…

Thin spanning trees lie at the intersection of graph theory, approximation algorithms, and combinatorial optimization. They are central to the long-standing \emph{thin tree conjecture}, which asks whether every $k$-edge-connected graph…

We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…

We give an explicit algorithm to reduce the ramification order of any exponential factor of an irregular connection on $\mathbb P^1$, using the same types of basic operations as in the Katz-Deligne-Arinkin algorithm for rigid irregular…

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

We provide a new characterisation of Duquesne and Le Gall's $\alpha$-stable tree, $\alpha\in(1,2]$, as the solution of a recursive distribution equation (RDE) of the form $\mathcal{T}\overset{d}{=}g(\xi,\mathcal{T}_i, i\geq0)$, where $g$ is…

Let $M_n(\mathbb{F})$ denote the algebra of $n \times n$ matrices over an algebraically closed field $\mathbb{F}$ of characteristic different from $2$. For $n \ge 2$, we classify all maps $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$…