相关论文: The geometry of profinite graphs revisited
We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…
We introduce the co-surface graph $\mathcal{CS}$ of a finitely generated free group $\mathbb{F}$ and use it to study the geometry of hyperbolic group extensions of $\mathbb{F}$. Among other things, we show that the Gromov boundary of the…
If $G$ is a group of permutations of a set $\Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_\alpha$ acting on $\Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive…
Let $\Gamma$ be a group and $(\Gamma_n)_{n=1} ^{\infty}$ be a descending sequence of finite-index normal subgroups. We establish explicit upper bounds on the diameters of the directed Cayley graphs of the $\Gamma/\Gamma_n$ , under some…
In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…
We study gauge theory with finite group $G$ on a graph $X$ using noncommutative differential geometry and Hopf algebra methods with $G$-valued holonomies replaced by gauge fields valued in a `finite group Lie algebra' subset of the group…
Let G be a semi-simple algebraic group over a finitely generated field K of characteristic zero, and let \Gamma < G(K) be a finitely generated Zariski-dense subgroup. In this note we prove that the set of K-generic elements of \Gamma (whose…
We investigate interactions between Ramsey theory, topological dynamics, and model theory. We introduce various Ramsey-like properties for first order theories and characterize them in terms of the appropriate dynamical properties of the…
A connected graph is called \emph{geodetic} if there is a unique shortest path between each pair of vertices. We introduce a systematic method for constructing new presentations of free products that give rise to previously unknown geodetic…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
Relations and interactions between the theorems of Ash, Herwig--Lascar and Ribes--Zalesskii are discussed and it is shown that these three theorems are equivalent in the sense that each of them can be derived from each other one. Some…
We prove that in both the free and the wired uniform spanning forest (FUSF and WUSF) of any unimodular random rooted network (in particular, of any Cayley graph), it is impossible to distinguish the connected components of the forest from…
We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…
A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…
We prove the rather counterintuitive result that there exist finite transitive graphs H and integers k such that the Free Uniform Spanning Forest in the direct product of the k-regular tree and H has infinitely many trees almost surely.…
For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign),…
We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…
Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $\eta$-closed if the average degree of the subgraph induced by $A$ is at least $\eta d$. This says that if we choose a random vertex $x\in A$ and a random…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…