Corpus ID: 53656920

MMS-type problems for Johnson scheme

@article{IYuMogilnykh2018MMStypePF,
  title={MMS-type problems for Johnson scheme},
  author={I.Yu.Mogilnykh and K.V.Vorob'ev and A.A.Valyuzhenich},
  journal={arXiv: Combinatorics},
  year={2018}
}
In the current work we consider the minimization problems for the number of nonzero or negative values of vectors from the first and second eigenspaces of the Johnson scheme respectively. The topic is a meeting point for generalizations of the Manikam-Miklos-Singhi conjecture proven by Blinovski and the minimum support problem for the eigenspaces of the Johnson graph, asymptotically solved by authors in a recent paper. 
1 Citations

References

SHOWING 1-10 OF 19 REFERENCES
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
  • V. Blinovsky
  • Computer Science, Mathematics
  • Probl. Inf. Transm.
  • 2014
Completely Regular Designs of Strength One
Some Bounds for the Distribution Numbers of an Association Scheme
A linear bound on the Manickam-Miklós-Singhi conjecture
  • A. Pokrovskiy
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 2015
Nonnegative k-sums, fractional covers, and probability of small deviations
Minimum supports of eigenfunctions of Johnson graphs
Some Distribution Numbers of the Triangular Association Scheme
  • T. Bier
  • Computer Science, Mathematics
  • Eur. J. Comb.
  • 1988
To the theory of q-ary Steiner and other-type trades
...
1
2
...