中文
相关论文

相关论文: On palindromic width of certain extensions and quo…

200 篇论文

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…

In this paper, we initiate the study of palindromic automorphisms of groups that are free in some variety. More specifically, we define palindromic automorphisms of free nilpotent groups and show that the set of such automorphisms is a…

In this paper, we present an explicit structure for the Baer invariant of a free nilpotent group (the $n$-th nilpotent product of the infinite cyclic group, $\textbf{Z}\st{n}* \textbf{Z}\st{n}*... \st{n}*\textbf{Z}$) with respect to the…

群论 · 数学 2011-03-29 Mohsen Parvizi , Behrooz Mashayekhy

We show that the verbal width is infinite for acylindrically hyperbolic groups, which include hyperbolic groups, mapping class groups and Out(Fn).

群论 · 数学 2019-02-13 Mladen Bestvina , Ken Bromberg , Koji Fujiwara

Let $n,d \in \mathbb N$ and $w \in \mathbb F_n$ be non-trivial. We prove that the relatively free group of rank $d$ in the variety defined by the group law $w$ has a largest anabelian finite quotient and estimate its size. Here, a finite…

群论 · 数学 2025-09-12 Andreas Thom

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

群论 · 数学 2021-06-28 Luca Sabatini

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

数论 · 数学 2007-05-23 Igor Rivin

We prove that finitely generated free metabelian groups $\Psi_n$ are profinitely rigid in the absolute sense: they are distinguished by their finite quotients among all finitely generated residually finite groups. The proof is based on a…

群论 · 数学 2025-07-04 Julian Wykowski

Given a commutative unital ring $R$, we show that the finiteness length of a group $G$ is bounded above by the finiteness length of the Borel subgroup of rank one $\mathbf{B}_2^\circ(R)=\left( \begin{smallmatrix} * & * \\ 0 & *…

群论 · 数学 2023-12-20 Yuri Santos Rego

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

群论 · 数学 2011-04-13 Khalid Bou-Rabee

We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…

群论 · 数学 2020-10-01 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

群论 · 数学 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

组合数学 · 数学 2019-03-21 Christian Elsholtz , Péter Pál Pach

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…

群论 · 数学 2008-09-10 Norbert Peyerimhoff , Alina Vdovina

We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n)…

群论 · 数学 2013-07-09 Danny Calegari , Alden Walker

For a finite group G, we study the higher commuting probabilities, namely the probabilities that r randomly chosen elements of G commute pairwise, together with the corresponding numbers of simultaneous conjugacy classes of commuting…

群论 · 数学 2026-05-05 Vadim E. Levit , Robert Shwartz

It is known that the bounded Geodesic Length Problem in free metabelian groups is NP-complete (in particular, the Geodesic Problem is NP-hard). We construct a 2-approximation polynomial time deterministic algorithm for the Geodesic Problem.…

群论 · 数学 2011-09-28 O. Kharlampovich , A. Mohajeri Moghaddam

Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we…

群论 · 数学 2022-11-17 Azizollah Azad , Nasim Karimi

We investigate Friedl-L\"uck's universal $L^2$-torsion for descending HNN extensions of finitely generated free groups, and so in particular for $F_n$-by-$\mathbb{Z}$ groups. This invariant induces a semi-norm on the first cohomology of the…

群论 · 数学 2019-02-26 Florian Funke , Dawid Kielak

We prove the existence of a limiting distribution for the appropriately rescaled diameters of random undirected Cayley graphs of finite nilpotent groups of bounded rank and nilpotency class, thus extending a result of Shapira and Zuck which…

组合数学 · 数学 2020-02-27 Daniel El-Baz , Carlo Pagano