English
Related papers

Related papers: Instability of nondiscrete free subgroups in Lie g…

200 papers

We investigate properties of closed approximate subgroups of locally compact groups, with a particular interest for approximate lattices i.e. those approximate subgroups that are discrete and have finite co-volume. We prove an approximate…

Group Theory · Mathematics 2025-01-29 Simon Machado

Under suitable conditions on a family $(I(t))_{t\ge 0}$ of Lipschitz mappings on a complete metric space, we show that up to a subsequence the strong limit $S(t):=\lim_{n\to\infty}(I(t 2^{-n}))^{2^n}$ exists for all dyadic time points $t$,…

Analysis of PDEs · Mathematics 2021-12-02 Jonas Blessing , Michael Kupper

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

Group Theory · Mathematics 2023-03-14 A. Ballester-Bolinches , R. Esteban-Romero , P. Jiménez-Seral

We establish various results on the structure of approximate subgroups in linear groups such as SL_n(k) that were previously announced by the authors. For example, generalising a result of Helfgott (who handled the cases n = 2 and 3), we…

Group Theory · Mathematics 2010-05-12 Emmanuel Breuillard , Ben Green , Terence Tao

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

Group Theory · Mathematics 2014-09-02 E. I. Khukhro , P. Shumyatsky

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

Group Theory · Mathematics 2017-11-15 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

We find asymptotic lower bounds for the numbers of both Beauville and non-Beauville $2$-generator finite $p$-groups of a fixed order, which turn out to coincide with the best known asymptotic lower bound for the total number of…

Group Theory · Mathematics 2019-09-11 Gustavo A. Fernández-Alcober , Şükran Gül , Matteo Vannacci

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

A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a…

Group Theory · Mathematics 2008-12-15 Brent Everitt

Lie algebras provide a useful framework for theoretical analysis in quantum machine learning, particularly in hybrid quantum-classical learning. From the viewpoint of function approximation, expectation values of parameterized quantum…

Quantum Physics · Physics 2026-02-19 Hiroshi Ohno

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…

Group Theory · Mathematics 2011-08-02 Robert Gray , Nik Ruskuc

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

Group Theory · Mathematics 2019-12-19 Richard Aoun

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

Group Theory · Mathematics 2013-03-21 Frédérique Bassino , Armando Martino , Cyril Nicaud , Enric Ventura , Pascal Weil

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

Group Theory · Mathematics 2018-10-02 Jonas Deré , Mark Pengitore

For a finite group $G$ we investigate the difference between the maximum size MaxDim$(G)$ of an "independent" family of maximal subgroups of $G$ and maximum size $m(G)$ of an irredundant sequence of generators of $G$. We prove that…

Group Theory · Mathematics 2015-02-25 Eloisa Detomi , Andrea Lucchini

We study quasi-isometric representations of finitely generated non-abelian free groups into some higher rank semi-simple Lie groups which are not Anosov, nor approximated by Anosov. We show in some cases that these can be perturbed to be…

Group Theory · Mathematics 2024-11-07 León Carvajales , Pablo Lessa , Rafael Potrie

Let (G_i | i in I) be a family of groups, let F be a free group, and let G = F *(*I G_i), the free product of F and all the G_i. Let FF denote the set of all finitely generated subgroups H of G which have the property that, for each g in G…

Group Theory · Mathematics 2008-05-14 Warren Dicks , S. V. Ivanov

We continue the investigation of notions of approximate amenability that were introduced in work of the second and third authors. It is shown that every boundedly approximately contractible Banach algebra has a bounded approximate identity.…

Functional Analysis · Mathematics 2009-03-26 Y. Choi , F. Ghahramani , Y. Zhang

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

Group Theory · Mathematics 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

We examine the minimum entropy coupling problem, where one must find the minimum entropy variable that has a given set of distributions $S = \{p_1, \dots, p_m \}$ as its marginals. Although this problem is NP-Hard, previous works have…

Information Theory · Computer Science 2022-03-11 Spencer Compton