Related papers: A New Quadratic Bound for the Manickam-Mikl\'os-Si…

More than twenty-five years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for positive integers $n,k$ with $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose…

We show that for $n>k(4e\log k)^k$ every set $\{x_1,..., x_n\}$ of $n$ real numbers with $\sum_{i=0}^{n}x_i \geq 0$ has at least $\binom{n-1}{k-1}$ $k$-element subsets of a non-negative sum. This is a substantial improvement on the best…

Suppose that we have a set of numbers x_1, ..., x_n which have nonnegative sum. How many subsets of k numbers from {x_1, ..., x_n} must have nonnegative sum? Manickam, Miklos, and Singhi conjectured that for n at least 4k the answer is (n-1…

More than twenty years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for any integers $n, k$ satisfying $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum…

In 1998 Manickam and Singhi conjectured that for every positive integer $d$ and every $n \ge 4d$, every set of $n$ real numbers whose sum is nonnegative contains at least $\binom {n-1}{d-1}$ subsets of size $d$ whose sums are nonnegative.…

The Manickam-Miklos-Singhi Conjecture states that when n is at least 4k, every multiset of n real numbers with nonnegative total sum has at least (n-1 choose k-1) k-subsets with nonnegative sum. We develop a branch-and-cut strategy using a…

Let $V$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$. Define a real-valued weight function on the $1$-dimensional vector spaces of $V$ such that the sum of all weights is zero. Let the weight of a subspace $S$ be…

An r-unform n-vertex hypergraph H is said to have the Manickam-Mikl\'os-Singhi (MMS) property if for every assignment of weights to its vertices with nonnegative sum, the number of edges whose total weight is nonnegative is at least the…

The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Zamarashkin in \cite{GTZ1997}. For arbitrary real $n \times k$ matrix with orthonormal columns a sufficiently "good" $k \times k$ submatrix exists. "Good" in the sense…

For any posotive integer $m$, let $[m]:=\{1,\ldots,m\}$. Let $n,k,t$ be positive integers. Aharoni and Howard conjectured that if, for $i\in [t]$, $\mathcal{F}_i\subset[n]^k:= \{(a_1,\ldots,a_k): a_j\in [n] \mbox{ for } j\in [k]\}$ and…

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture $A_k (n) \geq B_k (n)$ holds for large enough positive integers n, where A_k(n) (resp. B_k(n)) is…

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

Let $f^{(r)}(n;s,k)$ be the maximum number of edges of an $r$-uniform hypergraph on~$n$ vertices not containing a subgraph with $k$~edges and at most $s$~vertices. In 1973, Brown, Erd\H{o}s and S\'os conjectured that the limit $$\lim_{n\to…

Let $n$ be a positive even integer, and let $a_1,...,a_n$ and $w_1, ..., w_n$ be integers satisfying $\sum_{k=1}^n a_k\equiv\sum_{k=1}^n w_k =0 (mod n)$. A conjecture of Bialostocki states that there is a permutation $\sigma$ on {1,...,n}…

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

Zaremba's conjecture (1971) states that every positive integer number d can be represented as a denominator of a finite continued fraction b/d = [d1,d2,...,dk], with all partial quotients d1,d2,...,dk being bounded by an absolute constant…