English
Related papers

Related papers: An upper bound for the logarithmic capacity of two…

200 papers

We study the binomial channel and the structure of its capacity-achieving input and output distributions. It is known that the capacity-achieving input distribution is discrete and supported on finitely many points. The best previously…

Information Theory · Computer Science 2026-05-13 Mohammadamin Baniasadi , Luca Barletta , Alex Dytso

Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…

Optimization and Control · Mathematics 2014-06-17 Gene A. Bunin , Grégory François , Dominique Bonvin

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…

Algebraic Geometry · Mathematics 2023-08-30 David Massey

In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration…

Number Theory · Mathematics 2017-09-05 Christian Axler

Over the last 50 years a large number of effective exponential bounds on the first Chebyshev function $\vartheta(x)$ have been obtained. Specifically we shall be interested in effective exponential bounds of the form \[ |\vartheta(x)-x| < a…

Number Theory · Mathematics 2025-04-29 Matt Visser

We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…

Number Theory · Mathematics 2023-05-18 Andrew Fiori , Habiba Kadiri , Joshua Swidinsky

In recent work, Fyodorov and Keating conjectured the maximum size of $|\zeta(1/2+it)|$ in a typical interval of length O(1) on the critical line. They did this by modelling the zeta function by the characteristic polynomial of a random…

Number Theory · Mathematics 2013-04-03 Adam J. Harper

We consider Dirichlet $L$-functions $L(s, \chi)$ where $\chi$ is a non-principal quadratic character to the modulus $q$. We make explicit a result due to Pintz and Stephens by showing that $|L(1, \chi)|\leq \frac{1}{2}\log q$ for all $q\geq…

Number Theory · Mathematics 2023-03-27 D. R. Johnston , O. Ramare , T. S. Trudgian

For any dynamical system, we show that higher variation-norms for the sequence of ergodic bilinear averages of two functions satisfy a large range of bilinear Lp estimates. It follows that, with probability one, the number of fluctuations…

Classical Analysis and ODEs · Mathematics 2015-04-29 Yen Do , Richard Oberlin , Eyvindur A. Palsson

Since the logarithm function is the solution of Poisson's equation in two dimensions, it appears as the Coulomb interaction in two dimensions, the interaction between Abrikosov flux lines in a type II superconductor, or between line defects…

Mesoscale and Nanoscale Physics · Physics 2020-05-28 B. Berche , S. Fumeron , F. Moraes

Starting with an infinite set of non linear Equations for the Li-Keiper coefficients, we first specify a lower bound emerging from the infinite set and give a characterization of it. Then, we propose a possible new upper and lower bound for…

General Mathematics · Mathematics 2020-12-16 Merlini Danilo , Sala Massimo , Sala Nicoletta

We obtain a uniform $L^{\infty}(\Omega)$ a priori bound, for any positive weak solutions to elliptic problem with a nonlinearity $f$ slightly subcritical, slightly superlinear, and regularly varying. To achieve our result, we first obtain a…

Analysis of PDEs · Mathematics 2025-06-10 Mabel Cuesta , Rosa Pardo

We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…

Metric Geometry · Mathematics 2023-10-10 Naser T. Sardari , Masoud Zargar

For the real number $\alpha>1$, we use a technique due to Nehari and Netanyahu and an application of certain integral iteration of Caratheodory functions to find the best-possible upper bounds on the coefficients of functions of the class…

Complex Variables · Mathematics 2009-11-04 K. O. Babalola

This is the first part of a series of two papers where we study perturbations of divergence form second order elliptic operators $-\mathop{\operatorname{div}} A \nabla$ by first and zero order terms, whose coefficients lie in critical…

Analysis of PDEs · Mathematics 2023-02-02 Simon Bortz , Steve Hofmann , José Luis Luna Garcia , Svitlana Mayboroda , Bruno Poggi

We improve existing lower bounds of the hyperbolic dimension for meromophic functions that have a logarithmic tract {\Omega} which is a H\"older domain. These bounds are given in terms of the fractal behavior, measured with integral means,…

Dynamical Systems · Mathematics 2017-09-08 Volker Mayer

In this paper, we give sharp bounds of the difference of the moduli of the second and the first logarithmic coefficient for the functions on the class $\mathcal U$, for the $\alpha$-convex functions, and for the class $\mathcal{G}(\alpha)$…

Complex Variables · Mathematics 2024-04-03 Milutin Obradović , Nikola Tuneski

Let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$ and let $q \ge 1$. We upper bound the $\ell_q$ norm of $T_{\epsilon} f$ by the average $\ell_q$…

Information Theory · Computer Science 2019-11-13 Alex Samorodnitsky

We consider ergodic Jacobi operators and obtain estimates on the Lebesgue measure and the distance between maximum and minimum points of the spectrum in terms of the Lyapunov exponent. Our proofs are based on results from logarithmic…

Spectral Theory · Mathematics 2024-07-09 Burak Hatinoğlu

Determining the capacity $\alpha_c$ of the Binary Perceptron is a long-standing problem. Krauth and Mezard (1989) conjectured an explicit value of $\alpha_c$, approximately equal to .833, and a rigorous lower bound matching this prediction…

Probability · Mathematics 2024-01-30 Dylan J. Altschuler , Konstantin Tikhomirov