Related papers: Minimal configurations and sandpile measures

In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that…

For every $n\in\mathbb N$ we construct a finite graph $G$ such that every orientation $\vec G$ of $G$ contains an isometric copy of any oriented tree on $n$ vertices, and evaluate the smallest possible cardinality of $G$. On the other hand,…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Let $\mu$ be a positive measure on the real line with locally finite support $\Lambda$ and integer masses such that its Fourier transform in the sense of distributions is a purely point measure. An explicit form is found for an entire…

There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…

We discuss the problem of deciding when a metrisable topological group $G$ has a canonically defined local Lipschitz geometry. This naturally leads to the concept of minimal metrics on $G$, that we characterise intrinsically in terms of a…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

We construct forests that span $\mathbb{Z}^d$, $d\geq2$, that are stationary and directed, and whose trees are infinite, but for which the subtrees attached to each vertex are as short as possible. For $d\geq3$, two independent copies of…

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

In the abelian sandpile model, recurrent chip configurations are of interest as they are a natural choice of coset representatives under the quotient of the reduced Laplacian. We investigate graphs whose recurrent identities with respect to…

Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…

A base for a finite permutation group $G \le \mathrm{Sym}(\Omega)$ is a subset of $\Omega$ with trivial pointwise stabiliser in $G$, and the base size of $G$ is the smallest size of a base for $G$. Motivated by the interest in groups of…

We study universality of geometric gauge sectors in the string landscape in the context of F-theory compactifications. A finite time construction algorithm is presented for $\frac43 \times 2.96 \times 10^{755}$ F-theory geometries that are…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We show that a one-ended, locally finite, measurable graph on a standard probability space admits a measurable one-ended spanning subtree if and only if it is measure-hyperfinite. This answers a question posed by Bowen, Poulin, and Zomback…

Let $G$ be a permutation group on a set $\Omega$. A base for $G$ is a subset of $\Omega$ whose pointwise stabiliser is trivial, and the base size of $G$ is the minimal cardinality of a base. If $G$ has base size $2$, then the corresponding…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

The competition between local and global driving forces is significant in a wide variety of naturally occurring branched networks. We have investigated the impact of a global minimization criterion versus a local one on the structure of…

In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…

The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…