Related papers: Number Theories
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…
In this chapter a general mathematical framework for probabilistic theories of operationally understood circuits is laid out. Circuits are comprised of operations and wires. An operation is one use of an apparatus and a wire is a…
In this paper we aim to generalize results obtained in the framework of fractional calculus by the way of reformulating them in terms of operator theory. In its own turn, the achieved generalization allows us to spread the obtained…
We give an exposition of some connections between Fourier optimization problems and problems in number theory. In particular, we present some recent conditional bounds under the generalized Riemann hypothesis, achieved via a Fourier…
We define a very general notion of regularity for functions taking values in an alternative real $*$-algebra. Over Clifford numbers, this notion subsumes the well-established notions of monogenic function and slice-monogenic function. Over…
We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…
By considering generalized logarithm and exponential functions used in nonextensive statistics, the four usual algebraic operators : addition, subtraction, product and division, are generalized. The properties of the generalized operators…
Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…
The essential parts of the operad algebra are concisely presented, which should be useful when confronting with the operadic physics. It is also clarified how the Gerstenhaber algebras can be associated with the linear pre-operads (comp…
Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory…
We give an informal introduction to the most basic techniques used to evaluate moments on the critical line of the Riemann zeta-function and to find asymptotics for sums of arithmetic functions.
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
We give an informal survey of the historical development of computations related to prime number distribution and zeros of the Riemann zeta function.
We study the $M$-functions, which describe the limit theorem for the value-distributions of the secondary main terms in the asymptotic formulas for the summatory functions of the Goldbach counting function. One of the new aspects is a…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
We consider the Dirichlet series associated to the number of representations of an integer as the sum of primes. Assuming the Riemann hypothesis on the distribution of the zeros of the Riemann zeta function we obtain the domain of…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…
Let $\alpha$ and $\beta$ be two nonnegative integers such that $\beta < \alpha$. For an arbitrary sequence $\{a_n\}_{n\geqslant 1}$ of complex numbers, we consider the generalized Lambert series in order to investigate linear combinations…