Metraipolis › archive › dc_b484302bfa41
Uniformly Weighted Graphical Designs — arXiv:2608.27624
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27624
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T11:22:57.132Z
- SHA-256 of the archived text
b8302d9d7697e1f2522d65d8bc383ae564afb8ef0c9cb8cc420c68562c68ef6c- Stable URL of this page
https://metraipolis.com/documento/dc_b484302bfa41
How to cite
Uniformly Weighted Graphical Designs — arXiv:2608.27624 — arXiv (en), https://arxiv.org/abs/2608.27624 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b484302bfa41 (Metraipolis archive dc_b484302bfa41, sha256 b8302d9d7697e1f2522d65d8bc383ae564afb8ef0c9cb8cc420c68562c68ef6c)
BibTeX
@misc{dcb484302bfa41,
title = {Uniformly Weighted Graphical Designs — arXiv:2608.27624},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27624},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b484302bfa41; sha256 b8302d9d7697e1f2522d65d8bc383ae564afb8ef0c9cb8cc420c68562c68ef6c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27624. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A graphical design is a subset of vertices of a graph, along with a weight for each chosen vertex, that can perfectly average chosen subspaces of functions on the graph. A design is uniformly weighted if all the weights are equal, and several well-known combinatorial objects such as orthogonal arrays, combinatorial block designs and t-wise permutations are uniformly weighted graphical designs. While one might expect to see uniformly weighted designs in structured graphs, they do not always exist. In this paper we characterize the existence of uniformly weighted graphical designs, and use our result to provide several families of graphs that have, and do not have, such designs. Our results offer a polyhedral view of the structures that control the existence and cardinalities of these designs. In particular, we characterize all uniformly weighted designs of threshold graphs, and provide a geometric proof of the duality of linear codes and linear orthogonal arrays. We also provide a novel construction for graphs whose Laplacian characteristic polynomials are almost irreducible, to produce families without uniformly weighted designs. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.CO). Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM). Pagina del lavoro: https://arxiv.org/abs/2608.27624 — 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-17T11:06:51.758Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).