Related papers: Trees, unsplittability, property (FA) and the like…
An $\mathbb R$-tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying $\mathbb R$-trees be characterised by the fact that…
Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…
We survey recent developments concerning two properties of classes of finite structures: the Ramsey property and the extension property for partial automorphisms (EPPA).
Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F)…
Starting from the existence of many supercompact cardinals, we construct a model of ZFC in which the tree property holds at a countable segment of successor of singular cardinals.
We study extremal properties of finite ultrametric spaces $X$ and related properties of representing trees $T_X$. The notion of weak similarity for such spaces is introduced and related morphisms of labeled rooted trees are found. It is…
We study isomorphism invariant point processes of $\mathbb{R}^d$ whose groups of symmetries are almost surely trivial. We define a 1-ended, locally finite tree factor on the points of the process, that is, a mapping of the point…
The Poisson boundary of a finite direct product of affine automorphism groups of homogeneous trees is considered. The Poisson boundary is shown to be a product of ends of trees with a hitting measure for spread-out, aperiodic measures of…
We characterize permutational wreath products with Property (FA). For instance, the standard wreath product A wr B of two nontrivial countable groups A,B, has Property (FA) if and only if B has Property (FA) and A is a finitely generated…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…
In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…
Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism group of Y has an infinite orbit. We prove that there is no automorphism-invariant measure on the set of spanning trees in the direct…
For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…
Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested…
We consider the problem of testing properties of graphs underlying high-dimensional graphical models. We adopt the model of covariance queries introduced by Lugosi, Truszkowski, Velona, and Zwiernik (2021). We study the case when the…
We show that in algebraically locally finite countable homogeneous structures with a free stationary independence relation the small index property implies the strong small index property. We use this and the main result of [15] to deduce…
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…
It is proved that the consistency strength of having definable tree property for successors of all regular cardinals is the consistency strength of having proper class many small large cardinals which are defined very similar to…
Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…