Related papers: Singmaster's conjecture in the interior of Pascal'…

Constraint Satisfaction Problems are ubiquitous in fields ranging from the physics of solids to artificial intelligence. In many cases, such systems undergo a transition when the ratio of constraints to variables reaches some value…

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

Consider real or complex polynomial Riccati differential equations $a(x) \dot y=b_0(x)+b_1(x)y+b_2(x)y^2$ with all the involved functions being polynomials of degree at most $\eta$. We prove that the maximum number of polynomial solutions…

A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…

Nivat's conjecture is a long-standing open combinatorial problem. It concerns two-dimensional configurations, that is, maps $\mathbb Z^2 \rightarrow \mathcal A$ where $\mathcal A$ is a finite set of symbols. Such configurations are often…

The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system…

We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…

Ballantine--Beck--Feigon--Maurischat introduced the subsum polynomial \[ \operatorname{sp}(\lambda,x):=\prod_i (1+x^{\lambda_i}) \] attached to an integer partition $\lambda$, and studied rational functions obtained by summing reciprocals…

Let $\Omega\subset\mathbb{R}^n$ be a bounded Lipschitz domain. For any $\epsilon\in (0,1)$ we show that for any Dirichlet eigenvalue $\lambda_k(\Omega)>\Lambda(\epsilon,\Omega)$, it holds \begin{align*} k&\le…

In 1954, G. Polya conjectured that the counting function $N(\Omega,\Lambda)$ of the eigenvalues of the Laplace operator of the Dirichlet (resp. Neumann) boundary value problem in a bounded set $\Omega\subset R^d$ is lesser (resp. greater)…

The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…

We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…

More than twenty-five years ago, Manickam, Miklos, 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 sum is…

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…

All of the six Painlev\'e equations except the first have families of rational solutions, which are frequently important in applications. The third Painlev\'e equation in generic form depends on two parameters $m$ and $n$, and it has…

We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is x in S?" can be answered by making at most t probes into the…

Iizuka's conjecture predicts that, given $m \in \mathbb{N}$ and a prime $p$, there exists infinitely many integers $n$ such that the class numbers of \textit{all} of the following quadratic number fields, \[ \mathbb{Q}(\sqrt{n}),\…

The fibonomial triangle has been shown by Chen and Sagan to have a fractal nature mod 2 and 3. Both these primes have the property that the Fibonacci entry point of $p$ is $p+1$. We study the fibonomial triangle mod 5, showing with a…