Related papers: Necessary conditions for binomial collisions

We obtain several estimates for bilinear form with exponential sums with binomials $mx^k + nx^\ell$. In particular we show the existence of nontrivial cancellations between such sums when the coefficients $m$ and $n$ vary over rather sparse…

We investigate the following surprisingly widespread phenomenon which we call The Rule of Three: in order for a particular kind of commutation relation to hold for subsequences of elements of a ring labeled by any subset of indices, it is…

In this article we provide a combinatorial sufficient (and conjecturally, necessary) condition (called $\alpha$-symmetry) for the mating of two postcritically finite polynomials in $\mathcal{S}_1$ to be obstructed. To do this, we study the…

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

We prove a quantitative stability result for the Brunn-Minkowski inequality: if $|A|=|B|=1$, $t \in [\tau,1-\tau]$ with $\tau>0$, and $|tA+(1-t)B|^{1/n}\leq 1+\delta$ for some small $\delta$, then, up to a translation, both $A$ and $B$ are…

In this paper we give new requirements that a tree of $\delta$-hyperbolic spaces has to satisfy in order to be $\delta$-hyperbolic itself. As an application, we give a simple proof that limit groups are relatively hyperbolic.

We give a sufficient condition for the local limit theorem. To construct it, we employ infinite times of convolutions of probability density functions.

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…

We present explicit examples to show that the `compatibility criterion' is capable of providing a {\em necessary} and {\em sufficient} condition for any regular configuration to be compatible with the state of hydrostatic equilibrium. This…

Given integers $k$ and $m$ with $k \geq 2$ and $m \geq 2$, let $P$ be an empty simplex of dimension $(2k-1)$ whose $\delta$-polynomial is of the form $1+(m-1)t^k$. In the present paper, the necessary and sufficient condition for the $k$-th…

We give necessary and sufficient conditions for differentiating under the integral sign an integral that depends on a parameter. The conditions require the equality of two iterated integrals and depend on being able to integrate every…

We establish necessary and sufficient condition for existence of solutions for a class of semilinear Dirichlet problems with the linear part at resonance at eigenvalues of multiplicity two. The result is applied to give a condition for…

This paper provides a necessary and sufficient condition for guaranteeing exponential stability of the linear difference equation $x(t)=Ax(t-a)+Bx(t-b)$ where $a>0,b>0$ are constants and $A,B$ are $n\times n$ square matrices, in terms of a…

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

Gronwall-Bellman type inequalities entail the following implication: if a sufficiently integrable function satisfies a certain homogeneous linear integral inequality, then it is nonpositive. We present a minimal (necessary and sufficient)…

In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…

We give a new unified proof that any simple graph on $n$ vertices with maximum degree at most $\Delta$ has no more than $a\binom{\Delta+1}{t}+\binom{b}{t}$ cliques of size $t \ (t \ge 3)$, where $n = a(\Delta+1)+b \ (0 \le b \le \Delta)$.

Second order linear non-autonomous differential equations with negative stiffness are considered. Using Chetaev-like (Lyapunov-like) functions, necessary (sufficient) conditions are found for the solutions to be bounded for all initial…