Related papers: Upper bound for the counting function of interior …

An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$. The \emph{weight} of a threshold gate is the sum of its…

Finite automata on infinite words ($\omega$-automata) proved to be a powerful weapon for modeling and reasoning infinite behaviors of reactive systems. Complementation of $\omega$-automata is crucial in many of these applications. But the…

In this paper, we prove two new Weyl-type upper estimates for the eigenvalues of the Dirichlet Laplacian. As a consequence, we obtain the following {\em lower} bounds for its counting function. For $\la\ge \la_1$, one has N(\la) >…

Let {\Omega} be a bounded domain in R^n with C^{1,1} boundary and let u_{\lambda} be a Neumann Laplace eigenfunction in {\Omega} with eigenvalue {\lambda}. We show that the (n - 1)-dimensional Hausdorff measure of the zero set of…

For various compactly supported perturbations of the Laplacian in odd dimensions $n$, we prove a sharp upper bound of the resonance counting function $N(r)$ of the type $N(r) \le A_n r^n(1+o(1))$ with an explicit constant $A_n$. In a few…

Let $E\subset \mathbb{R}^{n+1}$, $n\ge 2$, be a closed, Ahlfors-David regular set of dimension $n$ satisfying the "Riesz Transform bound" $$\sup_{\varepsilon>0}\int_E\left|\int_{\{y\in E:|x-y|>\varepsilon\}}\frac{x-y}{|x-y|^{n+1}} f(y)…

We show a tight lower bound of $\Omega(N \log\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input…

In this paper, we use methods of exponential sums to derive a formula for estimating effective upper bounds of $|\zeta'(1/2+it)|$. Different effective upper bounds can be obtained by choosing different parameters.

Let $y\ne 0$ and $C>0$. Under the Riemann Hypothesis, there is a number $T_*>0$ $($depending on $y$ and $C)$ such that for every $T\ge T_*$, both \[ \zeta(\tfrac12+i\gamma)=0 \quad\text{and}\quad\zeta(\tfrac12+i(\gamma+y))\ne 0 \] hold for…

It is shown that the maximum of $|\zeta(1/2+it)|$ on the interval $T^{1/2}\le t \le T$ is at least $\exp\left((1/\sqrt{2}+o(1)) \sqrt{\log T \log\log\log T/\log\log T}\right)$. Our proof uses Soundararajan's resonance method and a certain…

In this paper we consider the identification (ID) via multiple access channels (MACs). In the general MAC the ID capacity region includes the ordinary transmission (TR) capacity region. In this paper we discuss the converse coding theorem.…

Two-sided estimates for higher order eigenvalues are presented for a class of non-local Schr\"odinger operators by using the jump rate and the growth of the potential. For instance, let $L$ be the generator of a L\'evy process with L\'evy…

We explore the expressive power of Transformers by establishing precise approximation error upper and lower bounds for H\"{o}lder class. Specifically, a new approximation upper bound is derived for the standard Transformer architecture…

In this paper, given a topological space $X$, an interval $I\subseteq {\bf R}$ and five continuous functions $\varphi, \psi, \omega :X\to {\bf R}$, $\alpha, \beta:I\to {\bf R}$, we are interested in the infimum of the function $\Phi:X\to…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

The main objective of this presentation is to point out that the Upper bound on the cutoff in lattice Electroweak theory is still unknown. The consideration of the continuum theory is based on the perturbation expansion around trivial…

For a class $\mathcal{C}$ of binary linear codes, we write $\theta_{\mathcal{C}}\colon (0,1) \to [0,\frac{1}{2}]$ for the maximum-likelihood decoding threshold function of $\mathcal{C}$, the function whose value at $R \in (0,1)$ is the…

We use spectral embeddings to give upper bounds on the spectral function of the Laplace--Beltrami operator on homogeneous spaces in terms of the volume growth of balls. In the case of compact manifolds, our bounds extend the 1980 lower…

As techniques for fault-tolerant quantum computation keep improving, it is natural to ask: what is the fundamental lower bound on redundancy? In this paper, we obtain a lower bound on the redundancy required for $\epsilon$-accurate…

In order to formally understand the power of neural computing, we first need to crack the frontier of threshold circuits with two and three layers, a regime that has been surprisingly intractable to analyze. We prove the first super-linear…