中文
相关论文

相关论文: Expanders, rank and graphs of groups

200 篇论文

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

群论 · 数学 2026-04-02 Sabine Chu , George Domat , Christine Gao , Ananya Prasanna , Alex Wright

Let S be a fixed symmetric finite subset of SL_d(O_K) that generates a Zariski dense subgroup of SL_d(O_K) when we consider it as an algebraic group over Q by restriction of scalars. We prove that the Cayley graphs of SL_d(O_K/I) with…

群论 · 数学 2012-05-15 Péter P. Varjú

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^(1+epsilon) where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

群论 · 数学 2010-01-27 László Pyber , Endre Szabó

An auxiliary free construction $*_{i=1}^{r}(K_i, L_i, t_i)_M$ based on HNN-extensions and on generalized free product of groups with amalgamated subgroups is suggested, and some of its basic properties are displayed. The proposed…

群论 · 数学 2025-06-23 Vahagn H. Mikaelian

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

群论 · 数学 2024-03-27 D. Osin

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

群论 · 数学 2016-05-09 Volker Diekert , Alexei G. Myasnikov , Armin Weiß

Suppose that $G$ is a group, $H$ and $K$ are proper isomorphic central subgroups of $G$, and $\mathfrak{G}$ is an HNN-extension of $G$ with the associated subgroups $H$ and $K$. We prove necessary and sufficient conditions for…

群论 · 数学 2021-06-30 E. V. Sokolov

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

群论 · 数学 2007-05-23 Miklos Abert , Laszlo Babai

It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.

组合数学 · 数学 2024-02-12 Pierre de la Harpe

Let $S$ be a subset of a amenable group $G$ such that $e\in S$ and $S^{-1}=S$. The main result of the paper states that if the Cayley graph of $G$ with respect to $S$ has a certain combinatorial property, then every positive definite…

泛函分析 · 数学 2019-08-15 M. Bakonyi , D. Timotin

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

群论 · 数学 2026-05-14 Joseph Paul MacManus

In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…

群论 · 数学 2019-12-06 Maurice Chiodo , Robert Crumplin , Oscar Donlan , Paweł Piwek

In the present paper, we study Neumaier Cayley graphs. First, we give a criterion for a Cayley graph to be a Neumaier graph with a spread given by the cosets of a subgroup. Further, we construct a new infinite family of Neumaier Cayley…

组合数学 · 数学 2026-02-24 Rhys J. Evans , Sergey Goryainov , Grigory Ryabov , Da Zhao

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes…

K理论与同调 · 数学 2010-12-21 Rufus Willett , Guoliang Yu

Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…

组合数学 · 数学 2023-09-19 Jason Bell , Haggai Liu , Marni Mishna

In this paper, we characterize the finite groups $G$ of even order with the property that for any involution $x$ and element $y$ of $G$, $\langle x, y \rangle$ is isomorphic to one of the following groups: $\mathbb{Z}_2,$ $\mathbb{Z}_2^2$,…

群论 · 数学 2021-04-02 Yan-Quan Feng , István Kovács

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

度量几何 · 数学 2024-10-29 Or Kalifa

In the first, mostly expository, part of this paper, a graded Lie algebra is associated to every group G given with an N-series of subgroups. The asymptotics of the Poincare series of this algebra give estimates on the growth of the group…

群论 · 数学 2009-11-27 Laurent Bartholdi , Rostislav I. Grigorchuk

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…

组合数学 · 数学 2012-11-13 Endre Csoka , Gabor Lippner

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

群论 · 数学 2016-05-23 Susan Hermiller , Conchita Martínez-Pérez