Related papers: An Exponential Lower Bound on OBDD Refutations for…

We show that the size of the intersection of a Hermitian variety in $\PG(n,q^2)$, and any set satisfying an $r$-dimensional-subspace intersection property, is congruent to 1 modulo a power of $p$. In particular, in the case where $n=2$, if…

We prove that the residual girth of any finitely generated linear group is at most exponential. This means that the smallest finite quotient in which the $n$-ball injects has at most exponential size. If the group is also not virtually…

A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with $n=2^s$ vertices is not known when $s \ge 3$. This paper solves the first open case and finds the optimal equilateral small octagon. Its…

We study the formula complexity of Iterated Sub-Permutation Matrix Multiplication, the logspace-complete problem of computing the product of $k$ $n$-by-$n$ Boolean matrices with at most a single $1$ in each row and column. For all $d \le…

The Onsager's conjecture has two parts: conservation of energy, if the exponent is larger than $1/3$ and the possibility of dissipative Euler solutions, if the exponent is less or equal than $1/3$. The paper proves half of the conjecture,…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

In 2002, Koh and Tay conjectured that every bridgeless graph of order $n\geq 5$ and size at least ${n\choose 2}-n+5$ has an orientation of diameter two. Later, Cochran, Czabarka, Dankelmann and Sz\'{e}kely proved this conjecture and asked…

We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.

We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…

Zhao and the second author (2013) constructed a functor from o(k)-Mod to o(k + 2)-Mod. In this paper, we use the functor successively to obtain an universal first-order differential operator realization for any highest-weight representation…

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…

General bounds are presented for the diameters of orbital graphs of finite affine primitive permutation groups. For example, it is proved that the orbital diameter of a finite affine primitive permutation group with a nontrivial point…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

It's well known that in the high-level error bound for multiquadric interpolation there is a crucial constant lambda lying between 0 and 1 which connot be calculated or even approximated. The purpose of this paper is to answer this…

Let $M$ be a closed differentiable manifold of dimension at least $3$. Let $\Lambda_0 (M)$ be the minimun number of non-positive eigenvalues that the conformal Laplacian of a metric on $M$ can have. We prove that for any $k$ greater than or…

We revisit the main result of Carmosino et al \cite{CILM18} which shows that an $\Omega(n^{\omega/2+\epsilon})$ size noncommutative arithmetic circuit size lower bound (where $\omega$ is the matrix multiplication exponent) for a…

We consider the problem of finding the maximum possible size of a family of k-dimensional subcubes of the n-cube {0,1}^{n}, none of which is contained in the union of the others. (We call such a family `irredundant'). Aharoni and Holzman…

We prove tight H\"olderian error bounds for all $p$-cones. Surprisingly, the exponents differ in several ways from those that have been previously conjectured; moreover, they illuminate $p$-cones as a curious example of a class of objects…