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

We report the finding of the new upper bound on the lowest positive integer $x$ for which the Mertens conjecture \begin{equation*} \left| \sum_{1 \leq n \leq x} \mu(n) \right| < \sqrt{x} \end{equation*} fails to hold: $x < \exp(1.017 \times…

We derive a lower bound for the top possibly-non-zero Betti number of the Milnor fiber of an analytic function in terms of the zero-dimensional L\^e number and the internal monodromy of the vanishing cycles restricted to the complex link of…

In this paper we establish the following estimate \[ w\left(\left\{ x\in\mathbb{R}^{n}\,:\,\left|[b,T]f(x)\right| > \lambda\right\} \right)\leq…

The interior transmission eigenvalue problem (ITP) plays a central role in inverse scattering theory and in the spectral analysis of inhomogeneous media. Despite its smooth dependence on the refractive index at the PDE level, the…

We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq…

We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of…

Let $\mathrm{TC}_r(X)$ denote the $r$-th topological complexity of a space $X$. In many cases, the generating function $\sum_{r\ge 1}\mathrm{TC}_{r+1}(X)x^r$ is a rational function $\frac{P(x)}{(1-x)^2}$ where $P(x)$ is a polynomial with…

In networked control, a fundamental problem is to determine the smallest capacity of a communication channel between a dynamical system and a controller above which a prescribed control objective can be achieved. Often, a preliminary task…

Our aim in this article is to obtain the limit of counting function for the Dirichlet eigenvalues involving the m-order logarithmic Laplacian in a bounded Lipschitz domain and to derive also the lower bound.

Assuming the Riemann Hypothesis, we obtain an upper bound for the 2k-th moment of the derivative of the Riemann zeta-function averaged over the non-trivial zeros of $\zeta(s)$ for every positive integer k. Our bounds are nearly as sharp as…

In 2007, assuming the Riemann Hypothesis (RH), Soundararajan \cite{Moment} proved that $\int_{0}^T |\zeta(1/2 + it)|^{2k} dt \ll_{k, \epsilon} T(\log T)^{k^2 + \epsilon}$ for every $k$ positive real number and every $\epsilon > 0.$ In this…

We consider the scalar second order ODE u + |u | $\alpha$ u + |u| $\beta$ u = 0, where $\alpha$, $\beta$ are two positive numbers and the non-linear semi-group S(t) generated on IR 2 by the system in (u, u). We prove that S(t)IR 2 is…

Let $(R, m)$ be a $d$-dimensional Cohen-Macaulay local ring. In this note we prove, in a very elementary way, an upper bound of the first normalized Hilbert coefficient of a $m$-primary ideal $I\subset R$ that improves all known upper…

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…

In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we prove the highest lower bound to date for any explicit problem,…

In this paper, we give a new upper bound for the number $N_{\mathcal{R}}$ which is defined to be the smallest positive integer such that a certain inequality due to Ramanujan involving the prime counting function $\pi(x)$ holds for every $x…

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…

We provide an upper bound as a random variable for the functions of estimators in high dimensions. This upper bound may help establish the rate of convergence of functions in high dimensions. The upper bound random variable may converge…

In this paper, we investigate computational power of threshold circuits and other theoretical models of neural networks in terms of the following four complexity measures: size (the number of gates), depth, weight and energy. Here the…

Here we present the thermal neutron counter from the ELI Gamma Above Neutron Threshold setup at the Extreme Light Infrastructure - Nuclear Physics. We describe the mechanical design of the setup, the properties of the ${}^{3}$He gas…