Search arXivSearch

arXiv · 2605.19596

Cyclotomic skew partial difference sets and partial difference families

Abstract

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: this produces examples of Latin square type. In this paper we show that these examples are not an isolated phenomenon; we present new constructions for families of skew PDSs using cyclotomy in finite fields. We provide the first constructions for skew PDSs of Paley type, and new constructions for Latin square type (with different parameters to those from bent partitions). Moreover, we show how skew PDSs relate to disjoint and external partial difference families (DPDFs/EPDFs), and provide new cyclotomic constructions of both standard and relative DPDFs and EPDFs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sophie Huczynska, Tekgül Kalaycı. 2026-05-19. Cyclotomic skew partial difference sets and partial difference families. https://arxiv.org/abs/2605.19596

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO