Minimum supports of functions on the Hamming graphs with spectral constraints
Alexandr Valyuzhenich, Konstantin Vorob'ev

TL;DR
This paper determines the minimum support size of functions on Hamming graphs with spectral constraints, providing characterizations for various parameter regimes and extending understanding of eigenfunctions with minimal nonzero entries.
Contribution
It introduces new bounds and characterizations for the minimum support of functions in specific eigenspaces of Hamming graphs, generalizing previous results.
Findings
Minimum support sizes are established for functions in certain eigenspaces.
Characterizations of functions with minimal support are provided for various parameter cases.
Results extend spectral support bounds to broader classes of Hamming graph functions.
Abstract
We study functions defined on the vertices of the Hamming graphs . The adjacency matrix of has distinct eigenvalues with corresponding eigenspaces for . In this work, we consider the problem of finding the minimum possible support (the number of nonzeros) of functions belonging to a direct sum for . For the case and we find the minimum cardinality of the support of such functions and obtain a characterization of functions with the minimum cardinality of the support. In the case and we also find the minimum cardinality of the support of functions, and obtain a characterization of functions with the minimum cardinality of the support for , and . In particular, we characterize…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · Coding theory and cryptography
