arXiv (All)
open access
Characterizing pyramidal Hadamard designs with the largest number of fixed points
A symmetric $(v,k,λ)$-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-λ)$. In particular, for a Hadamard design wit
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Removable matchings in $2$-connected graphs#974996
- Conjugator Lengths and Isoperimetric functions#818918
- Conjugator Lengths and Isoperimetric functions#808926
- Self-complementary completions on six vertices#1033999
- The Bipartite Swapping Trick on Graph Homomorphisms#409017
Record · ID 971522
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive