Related papers: Effective de la Valle Poussin style bounds on the …
In this paper we investigate a class of $2$-Hessian equations and establish a minimum principle for a $P$-function in the sense of L.E. Payne (see R. Sperb \cite{Sp81}). The analysis is based on a sharp matrix inequality providing an…
Meher et al. [Proc. Amer. Math. Soc. 147 (2019)] have recently established that $L-$functions attached to certain cusp forms of half-integral weight have infinitely many zeros on the critical line. Kim [J. Numb. Th. 253 (2023)] obtained…
Explicit bounds on the tails of the zeta function $\zeta$ are needed for applications, notably for integrals involving $\zeta$ on vertical lines or other paths going to infinity. Here we bound weighted $L^2$ norms of tails of $\zeta$. Two…
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…
Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…
We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…
For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…
Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…
Answering affirmatively a 2007 problem of Chen, the first author proved that there is a unique representation basis $A$ of $\mathbb{Z}$ and a constant $c>0$ such that $$ A(-x,x)\ge c\sqrt{x} $$ for infinitely many positive integers $x$,…
We study Stochastic Convex Optimization in the Differential Privacy model (DP-SCO). Unlike previous studies, here we assume the population risk function satisfies the Tsybakov Noise Condition (TNC) with some parameter $\theta>1$, where the…
Let $g$ be a fixed Hecke cusp form for $\mathrm{SL}(2,\mathbb{Z})$ and $\chi$ be a primitive Dirichlet character of conductor $M$. The best known subconvex bound for $L(1/2,g\otimes \chi)$ is of Burgess strength. The bound was proved by a…
We obtain a new proof of Bobkov's lower bound on the first positive eigenvalue of the (negative) Neumann Laplacian (or equivalently, the Cheeger constant) on a bounded convex domain $K$ in Euclidean space. Our proof avoids employing the…
On a convex set, we prove that the Poincar\'e-Sobolev constant for functions vanishing at the boundary can be bounded from above by the ratio between the perimeter and a suitable power of the $N-$dimensional measure. This generalizes an old…
Let $\mathsf{TH}_k$ denote the $k$-out-of-$n$ threshold function: given $n$ input Boolean variables, the output is $1$ if and only if at least $k$ of the inputs are $1$. We consider the problem of computing the $\mathsf{TH}_k$ function…
We consider the functional given by the product of the first Dirichlet eigenvalue and the torsional rigidity of planar domains normalized by the area. This scale invariant functional was studied by P\'olya and Szeg\H{o} in 1951 who showed…
Many special functions are solutions of first order linear systems $y_n'(x)=a_n(x)y_n(x)+d_n(x)y_{n-1}(x)$, $y_{n-1}'(x)=b_n(x)y_{n-1}(x)+e_{n}(x)y_n(x)$. We obtain bounds for the ratios $y_n(x)/y_{n-1}(x)$ and the logarithmic derivatives…
We present a simple transformation of any linear program or semidefinite program into an equivalent convex optimization problem whose only constraints are linear equations. The objective function is defined on the whole space, making…
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
Let $\zeta_K(s)$ denote the Dedekind zeta-function associated to a number field $K$. In this paper, we give an effective upper bound for the height of first non-trivial zero other than $1/2$ of $\zeta_K(s)$ under the generalized Riemann…
The problem of finding upper bounds for L-functions at the edge of the critical strip has a long and interesting history. Here, the situation for classical L-functions such as Dirichlet L-functions is relatively well understood. The reason…