相关论文: Negative Latin square type partial difference sets…

There exist few examples of negative Latin square type partial difference sets (NLST PDSs) in nonabelian groups. We present a list of 176 inequivalent NLST PDSs in 48 nonisomorphic, nonabelian groups of order 64. These NLST PDSs form 8…

Partial difference sets (for short, PDSs) with parameters ($n^2$, $r(n-\epsilon)$, $\epsilon n+r^2-3\epsilon r$, $r^2-\epsilon r$) are called Latin square type (respectively negative Latin square type) PDSs if $\epsilon=1$ (respectively…

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…

Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square type graphs and whose underlying set is a…

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}$,…

We construct two families of strongly regular Cayley graphs, or equivalently, partial difference sets, based on elementary abelian groups. The parameters of these two families are generalizations of the Denniston and the dual Denniston…

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$…

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…

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:…

Partial difference sets with parameters $(v,k,\lambda,\mu)=(v, (v-1)/2, (v-5)/4, (v-1)/4)$ are called Paley type partial difference sets. In this note we prove that if there exists a Paley type partial difference set in an abelian group $G$…

In this paper, we consider regular automorphism groups of graphs in the RT$2$ family and the Davis-Xiang family and amorphic abelian Cayley schemes from these graphs. We derive general results on the existence of non-abelian regular…

We generalize the construction of affine polar graphs in two different ways to obtain new partial difference sets and amorphic association schemes. The first generalization uses a combination of quadratic forms and uniform cyclotomy. In the…

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…

Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [J.A Davis, Partial difference sets in p-groups, Arch.Math.63 (1994) 103-110; K.H Leung, S.L. Ma, Partial difference sets with Paley…

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}$,…

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…

In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $\Omega$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form…

A partial difference set $S$ in a finite group $G$ satisfying $1 \notin S$ and $S = S^{-1}$ corresponds to an undirected strongly regular Cayley graph ${\rm Cay}(G,S)$. While the case when $G$ is abelian has been thoroughly studied, there…

A quantum Latin square is an $n \times n$ array of unit vectors where each row and column forms an orthonormal basis of a fixed complex vector space. We introduce the notion of $(G,G')$-invariant quantum Latin squares for finite groups $G$…

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…