Metraipolis › archive › dc_50ce6f4d96eb
Characterizing pyramidal Hadamard designs with the largest number of fixed points — arXiv:2609.04858
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.04858
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T23:20:58.831Z
- SHA-256 of the archived text
e16b7b9efc26ead92b0c8a0259ee4d3fbda512eb30945d8792964c9a831a689a- Stable URL of this page
https://metraipolis.com/documento/dc_50ce6f4d96eb
How to cite
Characterizing pyramidal Hadamard designs with the largest number of fixed points — arXiv:2609.04858 — arXiv (en), https://arxiv.org/abs/2609.04858 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_50ce6f4d96eb (Metraipolis archive dc_50ce6f4d96eb, sha256 e16b7b9efc26ead92b0c8a0259ee4d3fbda512eb30945d8792964c9a831a689a)
BibTeX
@misc{dc50ce6f4d96eb,
title = {Characterizing pyramidal Hadamard designs with the largest number of fixed points — arXiv:2609.04858},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.04858},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_50ce6f4d96eb; sha256 e16b7b9efc26ead92b0c8a0259ee4d3fbda512eb30945d8792964c9a831a689a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04858. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A symmetric $(v,k,\lambda)$-design is said to be $f$-pyramidal, with $f<v-1$, under the action of a group $G$ if $G$ acts as an automorphism group fixing $f$ points and acting sharply transitively on the remaining ones. We show that, necessarily, $f\leq v -2(k-\lambda)$. In particular, for a Hadamard design with parameters $(v,k,\lambda)=(4m-1, 2m-1, m-1)$, for some $m\in\mathbb{N}$, it follows that $f\leq 2m-1$. Recently, working on the complement design, the family $P$ of Hadamard $(4m-1,2m-1,m-1)$-designs admitting an abelian $(2m-1)$-pyramidal automorphism group $G$ has been completely determined in the case $m=2^{k}>1$. In this paper, we generalize that result by showing that $P$ coincides with the family of Hadamard $(4m-1,2m-1,m-1)$-designs admitting a $(2m-1)$-pyramidal automorphism group, without assuming either that the group is abelian or that $m$ is a power of $2$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.04858 — 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-16T23:03:13.249Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).