English
Related papers

Related papers: On the Intersection Numbers of Finite Groups

200 papers

Let $G$ be a multiple HNN-extension of an infinite cyclic group. We will calculate the intersection $(N_{p}){_\omega}(G)$ of the normal subgroups of finite $p$-index in $G$ thus generalizing the result of Moldavanskii for Baumslag-Solitar…

Group Theory · Mathematics 2025-12-03 V. Metaftsis , D. Tsipa

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Group Theory · Mathematics 2016-04-29 P. Devi , R. Rajkumar

Intersection growth concerns the asymptotic behavior of the index of the intersection of all subgroups of a group that have index at most n. In this note we show that the intersection growth of some groups may not be a nicely behaved…

Group Theory · Mathematics 2013-10-01 Martin Kassabov , Francesco Matucci

The distinguishing number of $G \leqslant \sym(\Omega)$ is the smallest size of a partition of $\Omega$ such that only the identity of $G$ fixes all the parts of the partition. Extending earlier results of Cameron, Neumann, Saxl and Seress…

Group Theory · Mathematics 2019-04-05 Alice Devillers , Scott Harper , Luke Morgan

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…

Group Theory · Mathematics 2019-09-13 Alexander A. Buturlakin , Andrey V. Vasil'ev

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

Combinatorics · Mathematics 2013-05-01 Haiyan Zhang , Guoqing Wang

In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a…

Group Theory · Mathematics 2016-05-06 Mariagrazia Bianchi , Marcel Herzog

An irredundant cover of a finite group $G$ is a collection of proper subgroups whose union is $G$ and which contains no smaller subcover. We classify finite groups which possess exactly two irredundant covers, thereby initiating an answer…

Group Theory · Mathematics 2022-06-22 Jonathan Cohen , Kyle Rosengartner

Some new results on metric ultraproducts of finite simple groups are presented. Suppose that G is such a group, defined in terms of a non-principal ultrafilter {\omega} on N and a sequence {(G_i)_{i \in N}} of finite simple groups, and that…

Group Theory · Mathematics 2014-02-04 Andreas Thom , John S. Wilson

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

Combinatorics · Mathematics 2025-06-25 Siddharth Malviy , Vipul Kakkar

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Combinatorics · Mathematics 2007-05-23 Robert Guralnick , David Perkinson

Two elements $g$ and $h$ of a permutation group $G$ acting on a set $V$ are said to be intersecting if $g(v) = h(v)$ for some $v \in V$. More generally, a subset ${\cal F}$ of $G$ is an intersecting set if every pair of elements of ${\cal…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Group Theory · Mathematics 2025-02-11 Costantino Delizia , Michele Gaeta , Mark L. Lewis , Carmine Monetta

A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of…

Logic · Mathematics 2016-09-06 Saharon Shelah , Simon Thomas

The intersection growth of a group $G$ is the asymptotic behavior of the index of the intersection of all subgroups of $G$ with index at most $n$, and measures the Hausdorff dimension of $G$ in profinite metrics. We study intersection…

Group Theory · Mathematics 2013-12-06 Ian Biringer , Khalid Bou-Rabee , Martin Kassabov , Francesco Matucci

Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called {\it non-trivial cross-intersecting} if $F\cap G\neq \emptyset$ for all $F\in \mathcal{F}, G\in \mathcal{G}$ and $\cap \{F\colon F\in…

Combinatorics · Mathematics 2026-05-12 Peter Frankl , Jian Wang

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

Group Theory · Mathematics 2026-01-23 Siddhartha Sarkar

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…

Combinatorics · Mathematics 2022-03-29 Ivan Martino , Rahul Singh

We introduce the \emph{intersection orbital graph} $\Gamma(G_1, G_2; \Omega)$ associated with two permutation groups $G_1, G_2 \leq \mathrm{Sym}(\Omega)$ on a finite set $\Omega$.

Combinatorics · Mathematics 2026-05-28 Shahram Mehry

In this paper, we describe the structure of maximal non-trivial uniform $t$-intersecting families with large size for finite sets. In the special case when $t=1$, our result gives rise to Kostochka and Mubayi's result in 2017.

Combinatorics · Mathematics 2020-11-17 Mengyu Cao , Benjian Lv , Kaishun Wang
‹ Prev 1 4 5 6 7 8 10 Next ›