Related papers: Necessary conditions for binomial collisions

Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.

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…

Given a bilinear form on $\mathbb C^n$, represented by a matrix $A\in\mathbb C^{n\times n}$, the problem of finding the largest dimension of a subspace of $\mathbb C^n$ such that the restriction of $A$ to this subspace is a non-degenerate…

Two families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$ are called cross-$t$-intersecting if $|A\cap B|\geq t$ for all $A\in\mathcal A$, $B\in\mathcal B$. Let $n$, $k$ and $\ell$ be positive integers such…

We present a necessary and sufficient condition for a cubic polynomial to be positive for all positive reals. We identify the set where the cubic polynomial is nonnegative but not all positive for all positive reals, and explicitly give the…

We present a necessary and sufficient condition for the separability of multipartite quantum states, this criterion also tells us how to write a multipartite separable state as a convex sum of separable pure states. To work out this…

We derive a family of correctness conditions for complex Langevin simulations. In particular, we show that if in a given theory the expectation values of all observables within a particular space satisfy the theory's Schwinger-Dyson…

The present paper is devoted to provide conditions for the Levi--Malcev theorem to hold or not to hold (i.e. for two Levi subalgebras to be or not conjugate by an inner automorphism) in the context of finite-dimensional Leibniz algebras…

Multinomial logistic regression models allow one to predict the risk of a categorical outcome with more than 2 categories. When developing such a model, researchers should ensure the number of participants (n) is appropriate relative to the…

Necessary and sufficient conditions are given for the existence of extended Schmidt decompositions, with more than two subspaces.

We consider binomial Thue equations of type $x^n-my^n=\pm 1$ in $x,y\in Z$. Optimizing the method of Peth\H o we perform an extensive calculation by a high performance computer to determine all solutions with $\max(|x|,|y|)<10^{500}$ of…

Let $X$ be a random variable distributed according to the binomial distribution with parameters $n$ and $p$. It is shown that $P(X>EX)\ge1/4$ if $1>p\ge c/n$, where $c:=\ln(4/3)$, the best possible constant factor.

Consider the probability that a binomial random variable Bi$(n,m/n)$ with integer expectation $m$ is at most its expectation. Chv\'atal conjectured that for any given $n$, this probability is smallest when $m$ is the integer closest to…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Necessary and sufficient observable conditions for the nonnegativity of all partial transpositions of multi-mode quantum states are derived. The result is a hierarchy of inequalities for minors in terms of moments of the given state.…

We study the norms of the Bloch vectors for arbitrary $n$-partite quantum states. A tight upper bound of the norms is derived for $n$-partite systems with different individual dimensions. These upper bounds are used to deal with the…

We calculate the minimum magnitude an electric dipole must have for a 1D system, interacting through the dipole, to support bound states.

A necessary and sufficient condition for an element of an algebra (in the sense of Universal Algebra) to be in the dominion of a subalgebra is given, in terms of transferable sets. This criterion is then used to formulate a more wieldy…

A practical number is a positive integer $n$ such that all positive integers less than $n$ can be written as a sum of distinct divisors of $n$. Leonetti and Sanna proved that, as $x \to +\infty$, the central binomial coefficient…

Let $h$ and $l$ be integers such that $0\le h\le 2$, $0\le l\le 4$. We obtain asymptotic formulas for the numbers of solutions of the equations $n-3m=h$, $n-5m=l$ in positive integers $m$ and $n$ of a special kind, $m\le X$.