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

The number of lattice points in $d$-dimensional hyperbolic or elliptic shells $\{m : a<Q[m]<b\}$, which are restricted to rescaled and growing domains $r\;\Omega$, is approximated by the volume. An effective error bound of order…

Let $\omega=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $\omega \in (0,1)$; let $R_n (\omega)$ (resp. $R_{n, \, k} (\omega)$, $R_{n, \, k+} (\omega)$) be the number of distinct partial…

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least…

We prove the existence of two thresholds regarding the compilability of random 2-CNF formulas to OBDDs. The formulas are drawn from $\mathcal{F}_2(n,\delta n)$, the uniform distribution over all 2-CNFs with $\delta n$ clauses and $n$…

We show that the value of the $n$-fold repeated GHZ game is at most $2^{-\Omega(n)}$, improving upon the polynomial bound established by Holmgren and Raz. Our result is established via a reduction to approximate subgroup type questions from…

Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the…

It is shown that the orthogonal polynomials, corresponding to the oscillatory weight $e^{\im\omega x}$, exists if $\omega$ is a transcendental number and $\tan\omega/\omega\in\Q$. Also, it is proved that such orthogonal polynomials exist…

We establish the existence of many holomorphic Hecke eigenforms $f$ of large weight $k$ for the full modular group, for which the least positive integer $n_f$ such that $\lambda_f(n_f)<0$ satisfies $n_f \ge (\log k)^{1-o(1)}.$ This is…

Exploiting an iterative formula already introduced in a previous manuscript to count the number $O_d$ of finite $O$-sequences of multiplicity $d$, we obtain some new information about $O_d$. Letting $A_d$ be the number of the finite…

In this paper, we prove the Generalized P\'{o}lya conjecture for the Dirichlet eigenvalues. In other words, we show that $\lambda_k(\alpha) \ge \frac{(2\pi)^{\alpha} k^{\alpha/n}}{\big(\omega_n \cdot {vol}(\Omega)\big)^{\alpha/n}}, \quad\,…

Ozawa and Shioya proposed the limit formula for observable diameters of pyramids under weak convergence. However, we find a constructive counterexample to an inequality used in their proof. In this paper, we correct the inequality and…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

It has been conjectured for some time that, for any integer n\ge 2, any real number \epsilon >0 and any transcendental real number \xi, there would exist infinitely many algebraic integers \alpha of degree at most n with the property that…

In this article, we give an asymptotic bound for the exponential sum of the M\"obius function $\sum_{n \le x} \mu(n) e(\alpha n)$ for a fixed irrational number $\alpha\in\mathbb{R}$. This exponential sum was originally studied by Davenport…

Higher order MDS codes are an interesting generalization of MDS codes recently introduced by Brakensiek, Gopi and Makam (IEEE Trans. Inf. Theory 2022). In later works, they were shown to be intimately connected to optimally list-decodable…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

We propose a conjecture, similar to Skolem's conjecture, on a Hasse-type principle for exponential diophantine equations. We prove that in a sense the principle is valid for "almost all" equations. Based upon this we propose a general…

We exhibit a monotone function computable by a monotone circuit of quasipolynomial size such that any monotone circuit of polynomial depth requires exponential size. This is the first size-depth tradeoff result for monotone circuits in the…