Related papers: On depth-3 circuits and covering number: an explic…
While Kronecker coefficients $g(\lambda,\mu,\nu)$ with bounded rows are polynomial-time computable via lattice-point methods, no explicit closed-form formulas have been obtained for genuinely three-row cases in the 87 years since…
We show the existence of a set $S\subset\mathbb{Z}^2$ avoiding collinear triples satisfying $|S\cap [n]^2|=\Omega(n/\sqrt{\log n})$ for sufficiently large $n$. This improves on the best-known lower bound on Erde's extensible…
In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…
We consider correlation functions in symmetric product orbifold CFTs on the sphere, focusing on the case where all operators are single-cycle twists, and the covering surface is also a sphere. We directly construct the general class of…
Integrable structure has played a very important role in the study of various non-perturbative aspects of planar ABJM theories. In this paper we showed that this remarkable structure survive after orbifold operation with discrete group…
Random constraint satisfaction problems (CSPs) are known to exhibit threshold phenomena: given a uniformly random instance of a CSP with $n$ variables and $m$ clauses, there is a value of $m = \Omega(n)$ beyond which the CSP will be…
In 1985, Razborov discovered a proof that the monotone circuit complexity of the clique problem is super-polynomial. Alon and Boppana improved the result into exponential lower bound exp(\Omega(n / \log n)^{1/3})) of a monotone circuit C to…
The 3SUM problem asks if an input $n$-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three…
We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the…
By combining some ideas of Lubinsky with some soft analysis, we prove that universality and clock behavior of zeros for OPRL in the a.c. spectral region is implied by convergence of $\frac{1}{n} K_n(x,x)$ for the diagonal CD kernel and…
We construct the Generalized Monodromy matrix $\mathcal{\hat{M}}(\omega)$ of two dimensional string effective action by introducing the T-duality group properties.The integrability conditions with general solutions depending on spectral…
We investigate the existence of Boolean degree $d$ functions on the Grassmann graph of $k$-spaces in the vector space $\mathbb{F}_q^n$. For $d=1$ several non-existence and classification results are known, and no non-trivial examples are…
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
We prove two new upper bounds for depth-2 linear circuits computing the $N$th disjointness matrix $D^{\otimes N}$. First, we obtain a circuit of size $O\big(2^{1.24485N}\big)$ over $\{0,1\}$. Second, we obtain a circuit of degree…
The question of complete integrability of evolution equations associated to $n\times n$ first order isospectral operators is investigated using the inverse scattering method. It is shown that for $n>2$, e.g. for the three-wave interaction,…
Let $U_{k,N}$ denote the Boolean function which takes as input $k$ strings of $N$ bits each, representing $k$ numbers $a^{(1)},\dots,a^{(k)}$ in $\{0,1,\dots,2^{N}-1\}$, and outputs 1 if and only if $a^{(1)} + \cdots + a^{(k)} \geq 2^N.$…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…
In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As immediate corollary we obtain the first deterministic…
The focus of this paper is to show the absence of critical points for the solutions to the Helmholtz equation in a bounded domain $\Omega\subset\mathbb{R}^{3}$, given by \[ \left\{ \begin{array}{l} -\rm{div}(a\,\nabla u_{\omega}^{g})-\omega…