English
Related papers

Related papers: Polynomial approximations in a generalized Nyman-B…

200 papers

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Complex Variables · Mathematics 2012-07-24 Anton Baranov , Harald Woracek

In supervised learning using kernel methods, we often encounter a large-scale finite-sum minimization over a reproducing kernel Hilbert space (RKHS). Large-scale finite-sum problems can be solved using efficient variants of Newton method,…

Machine Learning · Computer Science 2022-06-07 Ting-Jui Chang , Shahin Shahrampour

De Bruijn and Newman introduced a deformation of the Riemann zeta function $\zeta(s)$, and found a real constant $\Lambda$ which encodes the movement of the zeros of $\zeta(s)$ under the deformation. The Riemann hypothesis (RH) is…

Number Theory · Mathematics 2015-08-10 Julio Andrade , Alan Chang , Steven J. Miller

We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…

Probability · Mathematics 2022-09-23 Xiucai Ding , Thomas Trogdon

Approximation in measure is employed to solve an asymptotic Dirichlet problem on arbitrary open sets and to show that many functions, including the Riemann zeta-function, are universal in measure. Connections with the Riemann Hypothesis are…

Complex Variables · Mathematics 2021-08-11 Javier Falcó , Paul M. Gauthier

We give an estimate for sums appearing in the Nyman-Beurling criterion for the Riemann Hypothesis. These sums contain the M\"obius function and are related to the imaginary part of the Estermann zeta function. The estimate is remarkably…

Classical Analysis and ODEs · Mathematics 2018-06-14 Helmut Maier , Michael Th. Rassias

The main result of the paper is a definition of possible ways of the confirmation of the Riemann hypothesis based on the properties of the vector system of the second approximate equation of the Riemann Zeta function. The paper uses a…

General Mathematics · Mathematics 2019-10-21 Kirill Kapitonets

Gonek, Graham, and Lee have shown recently that the Riemann Hypothesis (RH) can be reformulated in terms of certain asymptotic estimates for twisted sums with von Mangoldt function $\Lambda$. Building on their ideas, for each…

Number Theory · Mathematics 2023-03-14 William D. Banks , Saloni Sinha

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

Computational Complexity · Computer Science 2009-10-21 Ilias Diakonikolas , Rocco A. Servedio

The paper presents two arithmetical versions of the Nyman-Beurling equivalence with the Riemann hypothesis, proved by classical, quasi elementary, number-theoretic methods, based on an integrated version of the classical combinatorial…

Number Theory · Mathematics 2007-05-23 Luis Baez-Duarte

First idea is to compute a quantity like the angular momentum with respect to (0, 0), of an unitary mass of coordinates (<[Xi(s)], =[Xi(s)]) while =[s] is the time, and, <[s] = constant. If we impose that the derivative along <[s], at…

General Mathematics · Mathematics 2026-03-20 Giovanni Lodone

We study multivariate integration and approximation for functions belonging to a weighted reproducing kernel Hilbert space based on half-period cosine functions in the worst-case setting. The weights in the norm of the function space depend…

Numerical Analysis · Mathematics 2015-11-23 Christian Irrgeher , Peter Kritzer , Friedrich Pillichshammer

According to two remarkable theorems of Nyman and B\'aez-Duarte, the Riemann hypothesis is equivalent to a simply-stated criterion concerning least-squares approximation. In carrying out computations related to this criterion, we have…

Number Theory · Mathematics 2020-11-06 Hugues Bellemare , Yves Langlois , Thomas Ransford

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

Complex Variables · Mathematics 2015-08-28 Gautam Bharali

We prove the Riemann Hypothesis via an analytically regulated surface integral over the critical strip of the Riemann zeta function. The key idea is that the convergence of this normalized integral is equivalent to the condition that all…

General Mathematics · Mathematics 2025-08-11 Dennis-Magnus Welz

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

For each $f:[0,\infty)\to\Com$ formally consider its co-Poisson or M\"{u}ntz transform $g(x)=\sum_{n\geq 1}f(nx)-\frac{1}{x}\int_0^\infty f(t)dt$. For certain $f$'s with both $f, g \in L_2(0,\infty)$ it is true that the Riemann hypothesis…

Number Theory · Mathematics 2007-05-23 Luis Baez-Duarte

In the present work the Riemanns hypothesis (RH) is discussed from four different perspectives. In the first case, coherent states and the Stengers approximation to Riemann-zeta function are used to show that RH avoids an indeterminacy of…

General Physics · Physics 2018-01-09 R. V. Ramos

We show in this paper that after proper scalings, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process…

Probability · Mathematics 2018-08-07 Reda Chhaibi , Joseph Najnudel , Ashkan Nikeghbali

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov