相关论文: Schreier graphs of the Basilica group

A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…

We show that every countable non-abelian free group $\Gamma $ admits a spherically transitive action on a rooted tree $T$ such that the action of $\Gamma $ on the boundary of $T$ is not essentially free. This reproves a result of Bergeron…

Let $G$ be a semiabelian variety defined over an algebraically closed field $K$, endowed with a rational self-map $\Phi$. Let $\alpha\in G(K)$ and let $\Gamma\subseteq G(K)$ be a finitely generated subgroup. We show that the set…

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are…

The cogrowth series of a group with respect to a finite generating set is an important combinatorial quantity that seems very difficult to compute exactly, as evidenced by the scarcity of known examples. In this paper, we give a particular…

We consider a finitely generated group acting minimally on a compact space by homeomorphsims, and assume that the Schreier graph of at least one orbit is quasi-isometric to a line. We show that the topological full group of such an action…

Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we…

A subgroup $\Delta\leq \Gamma$ is commensurated if $|\Delta:\Delta\cap \gamma\Delta\gamma^{-1}|<\infty$ for all $\gamma\in \Gamma$. We show a finitely generated branch group is just infinite if and only if every commensurated subgroup is…

We study symbolic dynamical representations of actions of the first Grigorchuk group $G$, namely its action on the boundary of the infinite rooted binary tree, its representation in the topological full group of a minimal substitutive…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

We study finitely generated pairs of groups $H \leq G$ such that the Schreier graph of $H$ has at least two ends and is \emph{narrow}. Examples of narrow Schreier graphs include those that are quasi-isometric to finitely ended trees or have…

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…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

We propose a generalisation of the congruence subgroup problem for groups acting on rooted trees. Instead of only comparing the profinite completion to that given by level stabilizers, we also compare pro-$\mathcal{C}$ completions of the…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

A group $G$ admits an \textbf{\em $n$-partite digraphical representation} if there exists a regular $n$-partite digraph $\Gamma$ such that the automorphism group $\mathrm{Aut}(\Gamma)$ of $\Gamma$ satisfies the following properties:…

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…