[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
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 …

[HTML][HTML] A note on the Manickam–Miklós–Singhi conjecture for vector spaces

F Ihringer - European Journal of Combinatorics, 2016 - Elsevier
Let V be an n-dimensional vector space over a finite field with q elements. Define a real-
valued weight function on the 1-dimensional subspaces of V such that the sum of all weights …

[HTML][HTML] A note on the Manickam–Miklós–Singhi conjecture

A Chowdhury - European Journal of Combinatorics, 2014 - Elsevier
For k∈ Z+, let f (k) be the minimum integer N such that for all n≥ N, every set of n real
numbers with nonnegative sum has at least (n− 1 k− 1) k-element subsets whose sum is …

The Erdös-Ko-Rado theorem for vector spaces

P Frankl, RM Wilson - Journal of Combinatorial Theory, Series A, 1986 - Elsevier
Let V be an n-dimensional vector space over GF (q) and for integers k⩾ t> 0 let mq (n, k, t)
denote the maximum possible number of subspaces in a t-intersecting family F of k …

An inequality in binary vector spaces

AE Brouwer - Discrete Mathematics, 1986 - Elsevier
AN INEQUALITY IN BINARY VECTOR SPACES Page 1 Discrete Mathematics 59 (1986) 315-317
North-Holland 315 NOTE AN INEQUALITY IN BINARY VECTOR SPACES AE BROUWER …

Partition theorems for subspaces of vector spaces

ML Cates, N Hindman - Journal of Combinatorial Theory, Series A, 1975 - Elsevier
The principal result of this paper provides a nearly complete answer to the following
question. For which cardinal numbers t, m, n, q and r is it true that whenever the t …

Subspaces, subsets, and partitions

DE Knuth - Journal of Combinatorial Theory, Series A, 1971 - Elsevier
To each k-dimensional subspace of an n-dimensional vector space ove GF (q) we assign a
number p and a partition of p into at most k parts not exceeding n− k, in such a way that …

Intersection theorems for vector spaces

P Frankl, RL Graham - European Journal of Combinatorics, 1985 - Elsevier
We prove that if b is an arbitrary positive integer, ℱ={F 1,..., F m} is a collection of k-
dimensional subspaces of an n-dimensional vector space over a finite field K, and there …

[HTML][HTML] An improved bound for the Manickam–Miklós–Singhi conjecture

M Tyomkyn - European Journal of Combinatorics, 2012 - Elsevier
We show that for n> k2 (4elogk) k, every set {x1,⋯, xn} of n real numbers with∑ i= 1nxi≥ 0
has at least (n− 1k− 1) k-element subsets of a non-negative sum. This is a substantial …

[HTML][HTML] A linear bound on the Manickam–Miklós–Singhi conjecture

A Pokrovskiy - Journal of Combinatorial Theory, Series A, 2015 - Elsevier
Suppose that we have a set S of n real numbers which have nonnegative sum. How few
subsets of S of order k can have nonnegative sum? Manickam, Miklós, and Singhi …