Related papers: Combinatorial transfer: a new method for construct…
A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of a group $G$ such that $|G| = v$, $|D| = k$, and every nonidentity element $x$ of $G$ can be written in either $\lambda$ or $\mu$ different ways as a product $gh^{-1}$,…
For a finite group $G$, the notion of a $G$-transfer system provides homotopy theorists with a combinatorial way to study equivariant objects. In this paper, we focus on the properties of transfer systems for non-abelian groups. We…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields, finite geometry, and number theory. Of particular interest…
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…
A transfer is a group homomorphism from a finite group to an abelian quotient group of a subgroup of the group. In this paper, we explain some of the properties of transfers by using noncommutative determinants. These properties enable us…
We give two new constructions of almost difference sets. The first is a generic construction of $(q^{2}(q+1),q(q^{2}-1),q(q^{2}-q-1),q^{2}-1)$ almost difference sets in certain groups of order $q^{2}(q+1)$ ($q$ is an odd prime power) having…
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…
A difference matrix over a group is a discrete structure that is intimately related to many other combinatorial designs, including mutually orthogonal Latin squares, orthogonal arrays, and transversal designs. Interest in constructing…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of size $k$ of a group $G$ of order $v$ such that every nonidentity element $g$ of $G$ can be expressed in either $\lambda$ or $\mu$ different ways as a product $xy^{-1}$,…
We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…
In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…
In this paper we construct exponentionally many non-isomorphic skew Hadamard difference sets over an elementary abelian group of order $q^3$.
Denniston \cite{D1969} constructed partial difference sets (PDS) with parameters $(2^{3m}, (2^{m+r}-2^m+2^r)(2^m-1), 2^m-2^r+(2^{m+r}-2^m+2^r)(2^r-2), (2^{m+r}-2^m+2^r)(2^r-1))$ in elementary abelian groups of order $2^{3m}$ for all $m\geq…
Let $p$ be an odd prime and $S$ a nonabelian finite $p$-group. In [9, 10], they proposed the following conjecture: if $\mathcal{F}$ be a transitive fusion system over a finite $p$-group $S$, then $S$ is either extraspecial of order $p^{3}$…
Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…
Difference sets have been studied for more than 80 years. Techniques from algebraic number theory, group theory, finite geometry, and digital communications engineering have been used to establish constructive and nonexistence results. We…
Full set of autonomous completely solvable differential systems of equations in total differentials is built by basis of infinitesimal operators, universal invariant, and structure constants of admited multiparametric Lie group (abelian and…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…