Quantized Number Theory, Fractal Strings and the Riemann Hypothesis

10.1142/10728 ◽  
2021 ◽  
Author(s):  
Hafedh Herichi ◽  
Michel L Lapidus
Keyword(s):  
Number Theory ◽  
Riemann Hypothesis ◽  
Fractal Strings

scholarly journals The Complexity of Mathematics

2020 ◽  
Author(s):  
Frank Vega
Keyword(s):  
Number Theory ◽  
Complexity Theory ◽  
Riemann Hypothesis ◽  
Open Problems ◽  
Mathematical Proofs ◽  
Pure Mathematics ◽  
The Riemann Zeta Function ◽  
Riemann Zeta ◽  
Goldbach’S Conjecture ◽  
Goldbach's Conjecture

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We prove the Riemann hypothesis using the Complexity Theory. Number theory is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We show the Goldbach's conjecture is true using the Complexity Theory as well. An important complexity class is 1NSPACE(S(n)) for some S(n). These mathematical proofs are based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

A Proof to the Riemann Hypothesis

2020 ◽  
Author(s):  
Sourangshu Ghosh
Keyword(s):  
Number Theory ◽  
Zeta Function ◽  
Riemann Zeta Function ◽  
Riemann Hypothesis ◽  
Prime Numbers ◽  
Complex Numbers ◽  
The Riemann Zeta Function ◽  
Riemann Zeta

In this paper, we shall try to prove the Riemann Hypothesis which is a conjecture that the Riemann zeta function hasits zeros only at the negative even integers and complex numbers with real part ½. This conjecture is very importantand of considerable interest in number theory because it tells us about the distribution of prime numbers along thereal line. This problem is one of the clay mathematics institute’s millennium problems and also comprises the 8ththe problem of Hilbert’s famous list of 23 unsolved problems. There have been many unsuccessful attempts in provingthe hypothesis. In this paper, we shall give proof to the Riemann Hypothesis.

The Complexity of Mathematics

2020 ◽  
Author(s):  
Frank Vega
Keyword(s):  
Number Theory ◽  
Complexity Theory ◽  
Riemann Hypothesis ◽  
Open Problems ◽  
Mathematical Proofs ◽  
Pure Mathematics ◽  
The Riemann Zeta Function ◽  
Riemann Zeta ◽  
Goldbach’S Conjecture ◽  
Goldbach's Conjecture

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We prove the Riemann hypothesis using the Complexity Theory. Number theory is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We show the Goldbach's conjecture is true using the Complexity Theory as well. An important complexity class is 1NSPACE(S(n)) for some S(n). These mathematical proofs are based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

A note on Li’s coefficients for Hecke L-functions

2017 ◽  
Vol 13 (07) ◽  
pp. 1747-1753
Author(s):  
Sami Omar ◽  
Raouf Ouni
Keyword(s):  
Number Theory ◽  
Riemann Hypothesis ◽  
General Class ◽  
Numerical Experiments ◽  
Selberg Class ◽  
Numerical Computations ◽  
Math Phys

Recently, the Li criterion for the Riemann hypothesis has been extended for a general class of [Formula: see text]-functions, so-called the Selberg class [S. Omar and K. Mazhouda, Le critère de Li et l’hypothèse de Riemann pour la classe de Selberg, J. Number Theory 125(1) (2007) 50–58; Corrigendum et addendum à “Le critère de Li et l’hypothèse de Riemann pour la classe de Selberg” [J. Number Theory 125(1) (2007) 50–58], J. Number Theory 130(4) (2010) 1109–1114]. Further numerical computations have been done to verify the positivity of some Li coefficients for the Dirichlet [Formula: see text]-functions and the Hecke [Formula: see text]-functions [S. Omar, R. Ouni and K. Mazhouda, On the zeros of Dirichlet [Formula: see text]-functions, LMS J. Comput. Math. 14 (2011) 140–154; On the Li coefficients for the Hecke [Formula: see text]-functions, Math. Phys. Anal. Geom. 17(1–2) (2014) 67–81]. Based on the latter numerical experiments, it was conjectured that those coefficients are increasing in [Formula: see text]. In this note, we show actually that the Riemann hypothesis holds if and only if the Li coefficients for the Hecke [Formula: see text]-functions are increasing in [Formula: see text].

Short intervals containing numbers without large prime factors

1991 ◽  
Vol 109 (1) ◽  
pp. 1-5 ◽  
Author(s):  
Glyn Harman
Keyword(s):  
Number Theory ◽  
Lower Bound ◽  
Riemann Hypothesis ◽  
Short Intervals ◽  
Prime Factors ◽  
Image Position

We denote, as usual, the number of integers not exceeding x having no prime factors greater than y by Ψ(x, y). We also writeThe function Ψ(x, y) is of great interest in number theory and has been studied by many researchers (see [3], [5] and [6] for example). The function Ψ(x, z, y) has also received some attention (see [2], [4–6]). In this paper we shall try to obtain a positive lower bound for Ψ(x, z, y) with y as small as possible when z is about x½ in magnitude. We note that the approach in [5] and [6] allows y to be much smaller than is permissible here, but requires x/z to be smaller than any power of x in [6] (unless some conjecture like the Riemann Hypothesis is assumed), or needs in [5]. The following result was obtained by Balog[1].

On the Number of Solutions of Some General Types of Equations in a Finite Field

1952 ◽  
Vol 4 ◽  
pp. 343-351 ◽  
Author(s):  
Olin B. Faircloth
Keyword(s):  
Number Theory ◽  
Finite Field ◽  
Riemann Hypothesis ◽  
Quadratic Forms ◽  
Function Fields ◽  
Commutative Rings ◽  
Number Of Solutions ◽  
Fermat's Last Theorem ◽  
Conditional Equation ◽  
And Algebra

The conditional equation f(x1, … , xs) = 0, where f is a polynomial in the x´s with coefficients in a finite field F(pn), is connected with many well-known developments in number theory and algebra, such as: Waring's problem, the arithmetical theory of quadratic forms, the Riemann hypothesis for function fields, Fermat's Last Theorem, cyclotomy, and the theory of congruences in commutative rings.

scholarly journals On the bounded generation of arithmetic SL2

2019 ◽  
Vol 116 (38) ◽  
pp. 18880-18882 ◽  
Author(s):  
Bruce W. Jordan ◽  
Yevgeny Zaytman
Keyword(s):  
Number Theory ◽  
Number Field ◽  
Riemann Hypothesis ◽  
Additional Hypothesis ◽  
Generalized Riemann Hypothesis ◽  
Group Of Units ◽  
Finite Set ◽  
Bounded Generation

Let K be a number field and S be a finite set of primes of K containing the archimedean valuations. Let 𝒪 be the ring of S-integers in K. Morgan, Rapinchuck, and Sury [A. V. Morgan et al., Algebra Number Theory 12, 1949–1974 (2018)] have proved that if the group of units 𝒪× is infinite, then every matrix in SL2(𝒪) is a product of at most 9 elementary matrices. We prove that under the additional hypothesis that K has at least 1 real embedding or S contains a finite place we can get a product of at most 8 elementary matrices. If we assume a suitable generalized Riemann hypothesis, then every matrix in SL2(𝒪) is the product of at most 5 elementary matrices if K has at least 1 real embedding, the product of at most 6 elementary matrices if S contains a finite place, and the product of at most 7 elementary matrices in general.

scholarly journals Toward the Unification of Physics and Number Theory

2019 ◽  
Vol 03 (01) ◽  
pp. 1950003 ◽  
Author(s):  
Klee Irwin
Keyword(s):  
Number Theory ◽  
Riemann Hypothesis ◽  
Deep Understanding ◽  
Prime Number Theorem ◽  
Geometric Form ◽  
Code Theory ◽  
Information Theoretic ◽  
Primality Test ◽  
Error Factor ◽  
Geometric Analogue

This paper introduces the notion of simplex-integers and shows how, in contrast to digital numbers, they are the most powerful numerical symbols that implicitly express the information of an integer and its set theoretic substructure. A geometric analogue to the primality test is introduced: when [Formula: see text] is prime, it divides [Formula: see text] for all [Formula: see text]. The geometric form provokes a novel hypothesis about the distribution of prime-simplexes that, if solved, may lead to a proof of the Riemann hypothesis. Specifically, if a geometric algorithm predicting the number of prime simplexes within any bound [Formula: see text]-simplex or associated [Formula: see text] lattice is discovered, a deep understanding of the error factor of the prime number theorem would be realized — the error factor corresponding to the distribution of the non-trivial zeta zeros, which might be the mysterious link between physics and the Riemann hypothesis [D. Schumayer and D. A. W. Hutchinson, Colloquium: Physics of the Riemann hypothesis, Rev. Mod. Phys. 83 (2011) 307]. It suggests how quantum gravity and particle physicists might benefit from a simplex-integer-based quasicrystal code formalism. An argument is put forth that the unifying idea between number theory and physics is code theory, where reality is information theoretic and 3-simplex integers form physically realistic aperiodic dynamic patterns from which space, time and particles emerge from the evolution of the code syntax.

Sign in / Sign up

Export Citation Format

Share Document