Metraipolis › archive › dc_26476e07bc42

A Family of Gauss Type Hadamard Difference Sets — arXiv:2609.07088

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.07088
License (as archived)
CC0-1.0
Archived
2026-10-16T14:48:42.447Z
SHA-256 of the archived text
7b33ed0b8a41e352b5d63541b4db978e833c88b5b26bae90430a4c5473f2dadd
Stable URL of this page
https://metraipolis.com/documento/dc_26476e07bc42

How to cite

A Family of Gauss Type Hadamard Difference Sets — arXiv:2609.07088 — arXiv (en), https://arxiv.org/abs/2609.07088 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_26476e07bc42 (Metraipolis archive dc_26476e07bc42, sha256 7b33ed0b8a41e352b5d63541b4db978e833c88b5b26bae90430a4c5473f2dadd)
BibTeX
@misc{dc26476e07bc42,
  title = {A Family of Gauss Type Hadamard Difference Sets — arXiv:2609.07088},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.07088},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_26476e07bc42; sha256 7b33ed0b8a41e352b5d63541b4db978e833c88b5b26bae90430a4c5473f2dadd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07088. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A Hadamard difference set (HDS) $D$ of order $u^2$ in an abelian group $G$ satisfies $|\chi(D)|=u$ for every nontrivial character $\chi$ of $G$. We call such a character value naive if it is divisible by $u$, i.e., if it is equal to $u$ times a root of unity. All previously known abelian HDSs only have naive character values. We show that for $d\ge 1$ and $u=3d$, a group $Z_3^2\times H$, with $H$ an abelian group of order $2^{2d+2}$, contains a HDS of order $u^2$ with non-naive character values if and only if $8\le\exp H\le 2^{d+2}$. All difference sets obtained are new. The proof rests on a specific HDS in $Z_3^2\times Z_8\times Z_2$, a covering extended building set on $Z_3^2\times Z_8\times Z_4$, and a variation of the Davis-Jedwab recursive construction.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.07088 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.809Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).