English
Related papers

Related papers: Counting packings of generic subsets in finite gro…

200 papers

Let $G$ be a finite group and $S< G$. A cover for a group $G$ is a collection of subgroups of $G$ whose union is $G$. We use the term $n$-cover for a cover with $n$ members. A cover $\Pi =\{H_1, H_2, \dots, H_n\}$ is said to be a strict…

Group Theory · Mathematics 2018-04-19 L. J. Taghvasani , M. Zarrin

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…

Group Theory · Mathematics 2007-05-23 Miklos Abert , Pal Hegedus

For positive integers $n\geq k\geq t$, a collection $ \mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\mathcal{B}$. In this paper, we give some upper and…

Combinatorics · Mathematics 2019-05-28 Ramin Javadi , Ehsan Poorhadi , Farshad Fallah

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

Group Theory · Mathematics 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

Let $G$ be a finite group. The aim of this paper is to study the number of solutions $S\subseteq G$ of the equation $\mho^{\{n\}}(S)=L$, where $L$ is a non-empty subset of $G$, $n$ is a positive integer and $\mho^{\{n\}}(S)=\{ s^n \ | \…

Group Theory · Mathematics 2026-03-31 Mihai-Silviu Lazorec

Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…

Group Theory · Mathematics 2021-12-02 Victor Fadinger , Qinghai Zhong

Let $G$ be a finite group and let $A_1,\ldots,A_k$ be a collection of subsets of $G$ such that $G=A_1\ldots A_k$ is the product of all the $A_i$'s with $|G|=|A_1|\ldots|A_k|$. We write $G=A_1\cdot\ldots\cdot A_k$ and call this a $k$-fold…

Group Theory · Mathematics 2022-11-04 Mikhail Kabenyuk

A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $\sigma(G)$. Determining $\sigma(G)$ is an open…

Group Theory · Mathematics 2014-09-09 Luise-Charlotte Kappe , Daniela Nikolova-Popova , Eric Swartz

If $G_1,...,G_n$ are limit groups and $S\subset G_1\times...\times G_n$ is of type $\FP_n(\mathbb Q)$ then $S$ contains a subgroup of finite index that is itself a direct product of at most $n$ limit groups. This settles a question of Sela.

Group Theory · Mathematics 2007-11-07 Martin R Bridson , James Howie , Charles F Miller , Hamish Short

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

Group Theory · Mathematics 2020-12-09 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

Group Theory · Mathematics 2015-12-01 A. L. Agore , G. Militaru

In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we…

Group Theory · Mathematics 2024-08-20 Abdallah Shihadeh

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

Combinatorics · Mathematics 2019-11-22 Carmelo Cisto , Manuel Delgado , Pedro A. García-Sánchez

We consider factorizations $G=XY$ where $G$ is a general group, $X$ and $Y$ are normal subsets of $G$ and any $g\in G$ has a unique representation $g=xy$ with $x\in X$ and $y\in Y$. This definition coincides with the customary and…

Group Theory · Mathematics 2018-10-11 Dan Levy , Attila Maróti

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

Group Theory · Mathematics 2025-07-30 Martino Garonzi , Christe Montijo , Alexandre Zalesski

Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets…

Group Theory · Mathematics 2011-07-27 Ayman Badawi

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all whose subgroups are normal are presented.

Combinatorics · Mathematics 2007-05-23 Boris Horvat , Gašper Jaklič , Tomaž Pisanski

If $G$ is a finite group and $x\in G$ then the set of all elements of $G$ having the same order as $x$ is called {\em an order subset of $G$ determined by $x$} (see [2]). We say that $G$ is a {\em group with perfect order subsets} or…

Group Theory · Mathematics 2019-02-22 Nguyen Trong Tuan , Bui Xuan Hai

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan.…

Combinatorics · Mathematics 2015-09-08 Michiel Kosters

Let $P$ be a probability on a finite group $G$, ${P^{(n)}}$ $n$-fold convolution of $P$ on $G$. Under mild condition, ${P^{(n)}}$ at $n \to \infty $ converges to the uniform probability on the group $G$. If $A = \left\{ {g \in G,\;P\left( g…

Group Theory · Mathematics 2024-02-05 Oleksandr Vyshnevetskiy