The first distribution invariant of the Johnson-scheme
It is shown that the invariant of the title equals \(\binom{n-1}{d-1}\), for the Johnson scheme \(J(n,d)\), for n sufficiently large. This amounts to the following. If \(a_ 1,...,a_ n\in {\mathbb{R}}\) satisfy \(\sum^{n}_{i=1}a_ i=0\) and \(\sum_{i\in T}a_ i\neq 0\) for every d-subset T of \(\{1,2,...,n\}\), then there exist at least \(N=\binom{n- 1}{d-1}\) d-subsets giving positive sums. This holds for \(2d<n\) and n sufficiently large, in particular for \(n\geq 6\) if \(d=2\), for \(n\geq 93\) if \(d=3\), for \(n\geq f(d)\) if \(d>3\), with explicitly given f(d). However, \(N=\binom{2d-1}{d-1}\) for \(n=2d+1\).
- First distribution invariants and EKR theorems
- Some distribution numbers of the triangular association scheme
- A local characterization of the Johnson scheme
- On a problem concerning the weight functions
- On a conjecture of Manickam and Singhi
- A method to count the positive 3-subsets in a set of real numbers with non-negative sum
- A remark on the problem of nonnegative k-subset sums
- Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
- A linear programming approach to the Manickam-Miklós-Singhi conjecture
- New results related to a conjecture of Manickam and Singhi
- A note on the Manickam-Miklós-Singhi conjecture
- The Completeness and Uniqueness of Johnson's System in Skewness–Kurtosis Space
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- A minimum problem for finite sets of real numbers with nonnegative sum
- The Manickam-Miklós-Singhi conjectures for sets and vector spaces
- Minimum supports of eigenfunctions of graphs: a survey
- An improved bound for the Manickam-Miklós-Singhi conjecture
- A note on the Manickam-Miklós-Singhi conjecture for vector spaces
This page was built for publication: The first distribution invariant of the Johnson-scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757446)
