AbstractWe study the problem of covering or packing a finite group with subgroups of a specified order and obtain bounds on the size of such covers and packings. Our main results provide characterizations of the elementary abelian groups by the existence of large packings or small covers, respectively. Hence large packings and small covers can be thought of as geometric objects: they correspond to large partial t-spreads and small t-covers of a suitable projective space PG(d,p) for some prime p. We shall also exhibit some series of examples which show that our bounds are reasonable
Using algebraic and graph theoretical methods we provide an algorithm to determine the integer latti...
AbstractLet G be a group covered by its left cosets a1G1,⋯ , akGkexactly m times. It is known that [...
Given a finite non-cyclic group $G$, a "cover" of $G$ is a family $\mathcal{H}$ of proper subgroups ...
A group partition is a group cover in which the elements have trivial pairwise intersection. Here we...
A group cover is a collection of subgroups whose union is the group. A group partition is a group co...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractLet p be a prime, q = pa, and G = Z2nq. We consider partial spreads in G, i.e. collections o...
AbstractWe survey the state of research to determine the maximum size of a nonspanning subset of a f...
A connection between maximal sets of pairwise non-commuting elements and coverings of a finite group...
Let G be a finite Abelian group written additively which is the n-fold direct sum of ...
AbstractA partial t-spread in a projective space P is a set of mutually skew t-dimensional subspaces...
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite...
A finite cover $\mathcal{C}$ of a group $G$ is a finite collection of proper subgroups of $G$ such t...
We survey the state of research to determine the maximum size of a nonspanning subset of a finite ab...
A set of proper subgroups is a covering for a group if their union is the whole group. Determining t...
Using algebraic and graph theoretical methods we provide an algorithm to determine the integer latti...
AbstractLet G be a group covered by its left cosets a1G1,⋯ , akGkexactly m times. It is known that [...
Given a finite non-cyclic group $G$, a "cover" of $G$ is a family $\mathcal{H}$ of proper subgroups ...
A group partition is a group cover in which the elements have trivial pairwise intersection. Here we...
A group cover is a collection of subgroups whose union is the group. A group partition is a group co...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractLet p be a prime, q = pa, and G = Z2nq. We consider partial spreads in G, i.e. collections o...
AbstractWe survey the state of research to determine the maximum size of a nonspanning subset of a f...
A connection between maximal sets of pairwise non-commuting elements and coverings of a finite group...
Let G be a finite Abelian group written additively which is the n-fold direct sum of ...
AbstractA partial t-spread in a projective space P is a set of mutually skew t-dimensional subspaces...
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite...
A finite cover $\mathcal{C}$ of a group $G$ is a finite collection of proper subgroups of $G$ such t...
We survey the state of research to determine the maximum size of a nonspanning subset of a finite ab...
A set of proper subgroups is a covering for a group if their union is the whole group. Determining t...
Using algebraic and graph theoretical methods we provide an algorithm to determine the integer latti...
AbstractLet G be a group covered by its left cosets a1G1,⋯ , akGkexactly m times. It is known that [...
Given a finite non-cyclic group $G$, a "cover" of $G$ is a family $\mathcal{H}$ of proper subgroups ...