Related papers: On subgroups with narrow Schreier graphs

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…

In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…

If $G$ is a group acting on a tree $X$, and ${\mathcal S}$ is a $G$-equivariant sheaf of vector spaces on $X$, then its compactly-supported cohomology is a representation of $G$. Under a finiteness hypothesis, we prove that if $H_c^0(X,…

We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph.

Every self-similar group acts on the space $X^\omega$ of infinite words over some alphabet $X$. We study the Schreier graphs $\Gamma_w$ for $w\in X^\omega$ of the action of self-similar groups generated by bounded automata on the space…

A multigraph $G$ is near-bipartite if $V(G)$ can be partitioned as $I,F$ such that $I$ is an independent set and $F$ induces a forest. We prove that a multigraph $G$ is near-bipartite when $3|W|-2|E(G[W])|\ge -1$ for every $W\subseteq…

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

In this paper, the notion of proper proximality (introduced in [BIP18]) is studied and classified in various families of groups. We show that if a group acts non-elementarily by isometries on a tree such that for any two edges, the…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…

If $G$ is a group, a virtual retract of $G$ is a subgroup which is a retract of a finite index subgroup. Most of the paper focuses on two group properties: property (LR), that all finitely generated subgroups are virtual retracts, and…

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

For each of the notions of hypergraph quasirandomness that have been studied, we identify a large class of hypergraphs F so that every quasirandom hypergraph H admits a perfect F-packing. An informal statement of a special case of our…

We show that if H is a non-elementary hyperbolic commensurated subgroup of infinite index in a hyperbolic group G, then H is virtually a free product of hyperbolic surface groups and free groups. We prove that whenever a one-ended…

We study subgroups $H_U$ of the R. Thompson group $F$ which are stabilizers of finite sets $U$ of numbers in the interval $(0,1)$. We describe the algebraic structure of $H_U$ and prove that the stabilizer $H_U$ is finitely generated if and…

Let $H$ be an infinite-dimensional complex Hilbert space and let ${\mathcal G}_{\infty}(H)$ be the set of all closed subspaces of $H$ whose dimension and codimension both are infinite. We investigate (not necessarily surjective)…

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be…

Let $G$ be a finite group and $H$ a core-free subgroup of $G$. We will show that if there exists a solvable, generating transversal of $H$ in $G$, then $G$ is a solvable group. Further, if $S$ is a generating transversal of $H$ in $G$ and…