[HTML][HTML] The Manickam–Miklós–Singhi conjectures for sets and vector spaces

A Chowdhury, G Sarkis, S Shahriari - Journal of Combinatorial Theory …, 2014 - Elsevier
Journal of Combinatorial Theory, Series A, 2014Elsevier
More than twenty-five years ago, Manickam, Miklós, and Singhi conjectured that for positive
integers n, k with n≥ 4 k, every set of n real numbers with nonnegative sum has at least (n−
1 k− 1) k-element subsets whose sum is also nonnegative. We verify this conjecture when
n≥ 8 k 2, which simultaneously improves and simplifies a bound of Alon, Huang, and
Sudakov and also a bound of Pokrovskiy when k< 10 45. Moreover, our arguments resolve
the vector space analogue of this conjecture. Let V be an n-dimensional vector space over a …
More than twenty-five years ago, Manickam, Miklós, and Singhi conjectured that for positive integers n, k with n≥ 4 k, every set of n real numbers with nonnegative sum has at least (n− 1 k− 1) k-element subsets whose sum is also nonnegative. We verify this conjecture when n≥ 8 k 2, which simultaneously improves and simplifies a bound of Alon, Huang, and Sudakov and also a bound of Pokrovskiy when k< 10 45. Moreover, our arguments resolve the vector space analogue of this conjecture. Let V be an n-dimensional vector space over a finite field. Assign a real-valued weight to each 1-dimensional subspace in V so that the sum of all weights is zero. Define the weight of a subspace S⊂ V to be the sum of the weights of all the 1-dimensional subspaces it contains. We prove that if n≥ 3 k, then the number of k-dimensional subspaces in V with nonnegative weight is at least the number of k-dimensional subspaces in V that contain a fixed 1-dimensional subspace. This result verifies a conjecture of Manickam and Singhi from 1988.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果