Related papers: Packings of partial difference sets

This paper considers the arbitrary-proportional finite-set-partitioning problem which involves partitioning a finite set into multiple subsets with respect to arbitrary nonnegative proportions. This is the core art of many fundamental…

We construct sequencings for many groups that are a semi-direct product of an odd-order abelian group and a cyclic group of odd prime order. It follows from these constructions that there is a group-based complete Latin square of order $n$…

A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…

We study notions such as finite presentability and coherence, for partially ordered abelian groups and vector spaces. Typical results are the following: (i) A partially ordered abelian group G is finitely presented if and only…

For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior…

Davis and Jedwab (1997) established a great construction theory unifying many previously known constructions of difference sets, relative difference sets and divisible difference sets. They introduced the concept of building blocks, which…

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

We introduce the bounded packing property for a subgroup of a countable discrete group G. This property gives a finite upper bound on the number of left cosets of the subgroup that are pairwise close in G. We establish basic properties of…

We have recently showed that it is possible to deal with collections of indistinguishable elementary particles (in the context of quantum mechanics) in a set-theoretical framework by using hidden variables, in a sense. In the present paper…

The Apollonian packings (APs) are fractals that result from a space-filling procedure with spheres. We discuss the finite size effects for finite intervals $s\in[s_\mathrm{min},s_\mathrm{max}]$ between the largest and the smallest sizes of…

Skew partial difference sets (skew PDSs) are recently-introduced combinatorial objects closely related to partial difference sets (PDSs). To date, only one construction approach for non-trivial skew PDSs is known, using bent partitions:…

A partial transversal $T$ of a Latin square $L$ is a set of entries of $L$ in which each row, column and symbol is represented at most once. A partial transversal is maximal if it is not contained in a larger partial transversal. Any…

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

We establish several finiteness properties of groups defined by algebraic difference equations. One of our main results is that a subgroup of the general linear group defined by possibly infinitely many algebraic difference equations in the…

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

A packing of disks in the plane is a set of disks with disjoint interiors. This paper is a survey of some open questions about such packings. It is organized into five themes: compacity, conjugacy, density, uniformity and computability.