English

Minimum supports of eigenfunctions of Johnson graphs

Combinatorics 2017-06-14 v1

Abstract

We study the weights of eigenvectors of the Johnson graphs J(n,w)J(n,w). For any i{1,,w}i \in \{1,\ldots,w\} and sufficiently large n,nn(i,w)n, n\geq n(i,w) we show that an eigenvector of J(n,w)J(n,w) with the eigenvalue λi=(nwi)(wi)i\lambda_i=(n-w-i)(w-i)-i has at least 2i(win2i)2^i(^{n-2i}_{w-i}) nonzeros and obtain a characterization of eigenvectors that attain the bound.

Cite

@article{arxiv.1706.03987,
  title  = {Minimum supports of eigenfunctions of Johnson graphs},
  author = {Konstantin Vorob'ev and Ivan Mogilnykh and Alexandr Valyuzhenich},
  journal= {arXiv preprint arXiv:1706.03987},
  year   = {2017}
}
R2 v1 2026-06-22T20:17:17.431Z