English
Related papers

Related papers: Intersection-saturated groups without free subgrou…

200 papers

Using graph-theoretic techniques for f.g. subgroups of $F^{\mathbb{Z}[t]}$ we provide a criterion for a f.g. subgroup of a f.g. fully residually free group to be of finite index. Moreover, we show that this criterion can be checked…

Group Theory · Mathematics 2021-07-14 Andrey Nikolaev , Denis Serbin

Given graphs $H_1, \dots, H_t$, a graph $G$ is $(H_1, \dots, H_t)$-Ramsey-minimal if every $t$-coloring of the edges of $G$ contains a monochromatic $H_i$ in color $i$ for some $i\in\{1, \dots, t\}$, but any proper subgraph of $G $ does not…

Combinatorics · Mathematics 2018-08-14 Martin Rolek , Zi-Xia Song

We say that a group $G$ of local (maybe formal) biholomorphisms satisfies the uniform intersection property if the intersection multiplicity $(\phi (V), W)$ takes only finitely many values as a function of $G$ for any choice of analytic…

Dynamical Systems · Mathematics 2022-03-25 Javier Ribón

In this paper, we give a complete, two-way characterization, of when a noncommutative crossed product $A \rtimes_\lambda G$ is simple, in the case of $G$ being an FC-hypercentral group. This is a large class of amenable groups that contains…

Operator Algebras · Mathematics 2026-01-14 Shirly Geffen , Dan Ursu

A graph is "$H$-free" if it has no induced subgraph isomorphic to $H$. A conjecture of Conlon, Fox and Sudakov states that for every graph $H$, there exists $s>0$ such that in every $H$-free graph with $n>1$ vertices, either some vertex has…

Combinatorics · Mathematics 2020-12-08 Maria Chudnovsky , Jacob Fox , Alex Scott , Paul Seymour , Sophie Spirkl

The congruence subgroup problem for a finitely generated group $\Gamma$ and $G\leq Aut(\Gamma)$ asks whether the map $\hat{G}\to Aut(\hat{\Gamma})$ is injective, or more generally, what is its kernel $C\left(G,\Gamma\right)$? Here $\hat{X}$…

Group Theory · Mathematics 2020-05-08 David El-Chai Ben-Ezra , Alexander Lubotzky

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

Group Theory · Mathematics 2007-05-23 Inna Bumagin , Olga Kharlampovich , Alexei Miasnikov

Developing an idea of M. Gromov, we study the intersection formula for random subsets with density. The \textit{density} of a subset $A$ in a finite set $E$ is defined by $dens A := \log_{|E|}(|A|)$. The aim of this article is to give a…

Group Theory · Mathematics 2025-08-26 Tsung-Hsuan Tsai

Let $p$ be a prime number. A saturated fusion system $\mathcal{F}$ on a finite $p$-group $S$ is said to be supersolvable if there is a series $1 = S_0 \le S_1 \le \dots \le S_m = S$ of subgroups of $S$ such that $S_i$ is strongly…

Group Theory · Mathematics 2023-05-17 Fawaz Aseeri , Julian Kaspczyk

We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

Group Theory · Mathematics 2015-09-21 J. O. Button

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

Group Theory · Mathematics 2023-05-02 E. V. Sokolov

Let $H$ be a subgroup of a group $G$. We say that $H$ satisfies the power condition with respect to $G$, or $H$ is a power subgroup of $G$, if there exists a non-negative integer $m$ such that $H=G^{m}=<g^{m} | g \in G >$. In this note, the…

Group Theory · Mathematics 2007-05-23 Wei Zhou , Wujie Shi , Zeyong Duan

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

Group Theory · Mathematics 2023-01-26 Sean Eberhard , Pavel Shumyatsky

We provide new examples of groups without rational cross-sections (also called regular normal forms), using connections with bounded generation and rational orders on groups. Specifically, our examples are extensions of infinite torsion…

Group Theory · Mathematics 2024-06-10 Corentin Bodart

For a finite non cyclic group $G$, let $\gamma(G)$ be the smallest integer $k$ such that $G$ contains $k$ proper subgroups $H_1,\dots,H_k$ with the property that every element of $G$ is contained in $H_i^g$ for some $i \in \{1,\dots,k\}$…

Group Theory · Mathematics 2013-10-08 Andrea Lucchini , Martino Garonzi

For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…

Group Theory · Mathematics 2016-07-14 Ilya Gorshkov

This paper considers two important questions in the well-studied theory of graphs that are $F$-saturated. A graph $G$ is called $F$-saturated if $G$ does not contain a subgraph isomorphic to $F$, but the addition of any edge creates a copy…

Combinatorics · Mathematics 2020-07-17 Debsoumya Chakraborti , Po-Shen Loh

A subgroup $A$ of a finite group $G$ is said to be a $CAP$-subgroup of $G$, if for any chief factor $H/K$ of $G$, either $A H= AK$ or $A\cap H = A \cap K$. Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion…

Group Theory · Mathematics 2024-12-09 Shengmin Zhang , Zhencai Shen

For a graph $F$, we say that another graph $G$ is $F$-saturated, if $G$ is $F$-free and adding any edge to $G$ would create a copy of $F$. We study for a given graph $F$ and integer $n$ whether there exists a regular $n$-vertex…

Combinatorics · Mathematics 2020-12-22 Dániel Gerbner , Balázs Patkós , Zsolt Tuza , Máté Vizer

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

Group Theory · Mathematics 2013-01-21 Mathieu Carette