Minimum supports of eigenfunctions of Johnson graphs

DOI10.1016/J.DISC.2018.04.018MaRDI QIDQ1637129zbMATH OpenOpenAlexFDO

Authors Konstantin Vorob'ev, Alexandr Valyuzhenich, Ivan Yu. Mogilnykh

Publication date 7 June 2018

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.03987

zbMATH Keywords

eigenspaceJohnson schemesupport of a function

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: We study the weights of eigenvectors of the Johnson graphs $J(n,w)$. For any $iin1,ldots,w$ and sufficiently large $n,ngeqn(i,w)$ we show that an eigenvector of $J(n,w)$ with the eigenvalue $lambd{a}_i=(n-w-i)(w-i)-i$ has at least $2^i{(}_{w-i}^{n-2i})$ nonzeros and obtain a characterization of eigenvectors that attain the bound.

Recommendations

• MMS-type problems for Johnson scheme
• Minimum supports of functions on the Hamming graphs with spectral constraints
• Minimum supports of eigenfunctions in bilinear forms graphs
• On the minimum supports of some eigenfunctions in the Doob graphs
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters

Cites work

• Combinatorial \(S_ n\)-modules as codes
• Combinatorial designs and algebras
• Completely regular designs
• scientific article; zbMATH DE number 4198073 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Induced perfect colorings
• Minimal null designs of subspace lattices over finite fields
• Minimum supports of eigenfunctions of Hamming graphs
• On one transformation of Steiner quadruple systems S( , 4, 3)
• On the number of inequivalent steiner triple systems
• On the structure of (v,k,t) trades
• On the support size of null designs of finite ranked posets
• Perfect Single Error-Correcting Codes in the Johnson Scheme
• To the theory of \(q\)-ary Steiner and other-type trades

Cited in

(15)

• Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
• On the minimum supports of some eigenfunctions in the Doob graphs
• Minimum supports of functions on the Hamming graphs with spectral constraints
• The EKR-module property of pseudo-Paley graphs of square order
• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• On reconstruction of eigenfunctions of Johnson graphs
• MMS-type problems for Johnson scheme
• Minimum supports of eigenfunctions in bilinear forms graphs
• Embedding of eigenfunctions of the Johnson graph into eigenfunctions of the Hamming graph
• Minimum supports of eigenfunctions of graphs: a survey
• Optimal functions with spectral constraints in hypercubes
• Inclusion matrices for rainbow subsets
• \(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs
• On reduction for eigenfunctions of graphs
• Equitable 2-partitions of the Johnson graphs J(n,3)

This page was built for publication: Minimum supports of eigenfunctions of Johnson graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637129)