Search arXiv⌕ Search

arXiv · 1905.03730

New necessary conditions for (negative) Latin square type partial difference sets in abelian groups

Abstract

Partial difference sets (for short, PDSs) with parameters ($n^2$, $r(n-ε)$, $εn+r^2-3εr$, $r^2-εr$) are called Latin square type (respectively negative Latin square type) PDSs if $ε=1$ (respectively $ε=-1$). In this paper, we will give restrictions on the parameter $r$ of a (negative) Latin square type partial difference set in an abelian group of non-prime power order. As far as we know no previous general restrictions on $r$ were known. Our restrictions are particularly useful when $a$ is much larger than $b$. As an application, we show that if there exists an abelian negative Latin square type PDS with parameter set $(9p^{4s}, r(3p^{2s}+1),-3p^{2s}+r^2+3r,r^2+r)$, $1 \le r \le \frac{3p^{2s}-1}{2}$, $p\equiv 1 \pmod 4$ a prime number and $s$ is an odd positive integer, then there are at most three possible values for $r$. For two of these three $r$ values, J. Polhill gave constructions in 2009.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zeying Wang. 2019-05-09. New necessary conditions for (negative) Latin square type partial difference sets in abelian groups. https://arxiv.org/abs/1905.03730

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗