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

In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

The normal covering number $\gamma(G)$ of a finite group $G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for $\gamma(S_n)$ and $\gamma(A_n)$ depending on the arithmetic structure of…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

A primary covering of a finite group $G$ is a family of proper subgroups of $G$ whose union contains the set of elements of $G$ having order a prime power. We denote with $\sigma_0(G)$ the smallest size of a primary covering of $G$, and…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

Let $G$ be a finite group. A proper subgroup $H$ of $G$ is said to be large if the order of $H$ satisfies the bound $|H|^3 \ge |G|$. In this note we determine all the large maximal subgroups of finite simple groups, and we establish an…

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

In this paper we study the minimal number of translates of an arbitrary subset $S$ of a group $G$ needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups,…

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…