English
Related papers

Related papers: A finitary version of Gromov's polynomial growth t…

200 papers

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

Group Theory · Mathematics 2018-01-30 Lei Wang , Yin Liu

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

Group Theory · Mathematics 2007-05-23 A. Lubotzky , N. Nikolov

An $n$-vertex graph $G$ is a $C$-expander if $|N(X)|\geq C|X|$ for every $X\subseteq V(G)$ with $|X|< n/2C$ and there is an edge between every two disjoint sets of at least $n/2C$ vertices. We show that there is some constant $C>0$ for…

Let G denote a closed, connected, self adjoint, noncompact subgroup of GL(n,R), and let d_{R} denote the canonical right invariant Riemannian metric on G. For v in R^{n} let G_{v} = {g in G : g(v) = v}. We obtain algebraically defined upper…

Differential Geometry · Mathematics 2010-12-15 Patrick Eberlein

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

Quantum Physics · Physics 2025-11-26 Ziyuan Dong , Xiang Fan , Tengxun Zhong , Daowen Qiu

A group $G$ is said to have restricted centralizers if for every $x\in G$ the centralizer $C_G(x)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. Here we…

Group Theory · Mathematics 2026-04-24 Cristina Acciarri , Pavel Shumyatsky

Let G be a finite group and S a subset of G\{0}. We call S an additive basis of G if every element of G can be expressed as a sum over a nonempty subset in some order. Let cr(G) be the smallest integer t such that every subset of G\{0} of…

Number Theory · Mathematics 2012-12-05 Qinghong Wang , Yongke Qu

We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…

Group Theory · Mathematics 2007-05-23 Victor Guba

This note shows there are infinitely many finite groups G, such that every connected Cayley graph on G has a hamiltonian cycle, and G is not solvable. Specifically, for every prime p that is congruent to 1, modulo 30, we show there is a…

Combinatorics · Mathematics 2015-07-20 Dave Witte Morris

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

Group Theory · Mathematics 2024-04-17 Max Forester , Anthony Martino

We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w…

Group Theory · Mathematics 2013-01-18 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

We determine all maximal subgroups of the direct product $\sc G^n$ of $\sc n$ copies of a group~$\sc G$. If $\sc G$ is finite, we show that the number of maximal subgroups of~$\sc G^n$ is a quadratic function of~$\sc n$ if $\sc G$ is…

Group Theory · Mathematics 2008-02-03 Jacques Thévenaz

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…

Geometric Topology · Mathematics 2011-01-04 Louis Funar , Daniele Ettore Otera

A result of D. Segal states that every complex irreducible representation of a finitely generated nilpotent group $G$ is monomial if and only if $G$ is abelian-by-finite. A conjecture of A. N. Parshin, recently proved affirmatively by I.V.…

Representation Theory · Mathematics 2016-12-04 E. K. Narayanan , Pooja Singla

We prove the following: For any $\rho\in\left(0,1\right)$, if a finite group $G$ has an automorphism with a cycle of length at least $\rho\cdot|G|$, then the index of the solvable radical $\operatorname{Rad}(G)$ in $G$ is bounded from above…

Group Theory · Mathematics 2015-06-15 Alexander Bors

If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…

Group Theory · Mathematics 2024-02-13 Doron Shafrir

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

Group Theory · Mathematics 2021-08-31 Andrea Lucchini , Daniele Nemmi

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

Group Theory · Mathematics 2019-06-18 Stefanos Aivazidis , Thomas W. Müller

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

Logic · Mathematics 2011-05-17 Ehud Hrushovski

The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…

Representation Theory · Mathematics 2018-11-30 Valdemar V. Tsanov
‹ Prev 1 8 9 10 Next ›