Metraipolis › archive › dc_e5d351ff2d10

Extremal character spectra of finite projective systems — arXiv:2610.42006

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.42006
License (as archived)
CC0-1.0
Archived
2026-11-02T05:00:44.702Z
SHA-256 of the archived text
e2e20609e0e5aff6a6e033fdac97ee3b1489c3d7f9c643c4667ae9166d957e21
Stable URL of this page
https://metraipolis.com/documento/dc_e5d351ff2d10

How to cite

Extremal character spectra of finite projective systems — arXiv:2610.42006 — arXiv (en), https://arxiv.org/abs/2610.42006 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e5d351ff2d10 (Metraipolis archive dc_e5d351ff2d10, sha256 e2e20609e0e5aff6a6e033fdac97ee3b1489c3d7f9c643c4667ae9166d957e21)
BibTeX
@misc{dce5d351ff2d10,
  title = {Extremal character spectra of finite projective systems — arXiv:2610.42006},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.42006},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e5d351ff2d10; sha256 e2e20609e0e5aff6a6e033fdac97ee3b1489c3d7f9c643c4667ae9166d957e21},
  year = {2026}
}

Archived text

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

Let $\mathcal M$ be a finite spanning multiset of points in ${\rm PG}(k-1,q)$, and let ${\rm Char}_{\mathcal M}$ be its character function. For $1\le r\le k$, we study the maximum number of distinct values attained by ${\rm Char}_{\mathcal M}$ on the codimension-$r$ flats under a total-multiplicity budget. The spectrum is subject to two natural upper bounds, whose extremal cases lead respectively to $r$-maximum character spectrum ($r$-MCS) and $r$-full character spectrum ($r$-FCS) systems. We establish the existence of $r$-FCS systems in a broad parameter range, and solve the size-constrained extremal problem completely when $r=k-1$, including the minimum-cost multiplicity profiles. For $1\le r<k$, put $M_r=\qbinom{k}{r}$ and $B_r=\qbinom{k-1}{r}$. The minimum size $\nu_r(k,q)$ of an $r$-MCS system satisfies \[\left\lceil\frac{\binom{M_r}{2}}{B_r}\right\rceil\le \nu_r(k,q)\le \binom{M_r-1}{2}+\frac{q^k-q^{k-r}}{q-1}.\] The upper bound is at most $\binom{M_r}{2}$, strictly less when $r\le k-2$, and exact when $r=k-1$. Its proof applies positive additive labelings to the complement of one flat, whose trace is empty while all remaining traces are distinct. For $r=1$, we improve the known upper bounds on the minimum length of such systems. We also develop global moment identities and local flat-incidence bounds that impose strong structural constraints on large character spectra. Under the projective-system correspondence, complementary character spectra are the support-weight spectra of $r$-dimensional subcodes.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.42006 — 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-11-02T04:47:57.705Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).