Related papers: Context-Free Groups and Their Structure Trees
We consider the inference of the structure of an undirected graphical model in an exact Bayesian framework. More specifically we aim at achieving the inference with close-form posteriors, avoiding any sampling step. This task would be…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…
We give a simple proof of the finite presentation of Sela's limit groups by using free actions on R^n-trees. We first prove that Sela's limit groups do have a free action on an R^n-tree. We then prove that a finitely generated group having…
In previous work arXiv:2407.13556, we proposed an extended phase space structure at null infinity accommodating large gauge symmetries for sub$^n$-leading soft theorems in Yang-Mills, via dressing fields arising in the Stueckelberg…
We generalise the result of Tent and Ziegler to homogeneous structures that have a stationary independence relation without the symmetry axiom. We apply our result to prove simplicity of the automorphism group of some asymmetric examples…
Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including…
We give necessary and sufficient conditions under which a quasi-action of any group on an arbitrary metric space can be reduced to a cobounded isometric action on some bounded valence tree, following a result of Mosher, Sageev and Whyte.…
A generalized Baumslag-Solitar (GBS) group is a finitely generated group acting on a tree with infinite cyclic edge and vertex stabilizers. We show how to determine effectively the rank (minimal cardinality of a generating set) of a GBS…
We prove that a hereditary graph class $\mathcal{G}$ defined by finitely many excluded induced subgraphs has bounded tree-$\alpha$ if and only if it is "$(\mathrm{tw},\omega)$-bounded" (that is, for all $t\in \mathbb N$, the class of all…
In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…
Un des r\'esultats fondamentaux de la th\'eorie de Bass-Serre est le th\'eor\`eme suivant : un groupe est amalgam\'e si et seulement si il agit sur un arbre avec comme domaine fondamental un segment. Dans cet article nous donnons un…
In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…
This paper presents new graph-theoretic conditions for structural target controllability of directed networks. After reviewing existing conditions and highlighting some gaps in the literature, we introduce a new class of network systems,…
A topological group $G$ is said to have a local $\omega^\omega$-base if the neighbourhood system at identity admits a monotone cofinal map from the directed set $\omega^\omega$. In particular, every metrizable group is such, but the class…