Related papers: Counting an infinite number of points: a testing g…
Deng (arXiv:math/9812082) gave an asymptotic formula for the number of rational points on a weighted projective space over a number field with respect to a certain height function. We prove a generalization of Deng's result involving a…
We show how a rescaling of fractional operators with bounded kernels may help circumvent their documented deficiencies, for example, the inconsistency at zero or the lack of inverse integral operator. On the other hand, we build a novel…
Integer counting processes increment of an integer value at transitions between states of an underlying Markov process. The generator of a counting process, which depends on a parameter conjugate to the increments, defines a complex…
In this article we study the inverse problem of determining a semilinear term appearing in an elliptic equation from boundary measurements. Our main objective is to develop flexible and general theoretical results that can be used for…
In 1999, Neil Calkin and Herbert Wilf wrote "Recounting the rationals" which gave an explicit bijection between the positive integers and the positive rationals. We find several different (some new) ways to construct this enumeration and…
The subject matter of this work is integral points on conics described by the general equation, ax^2+bxy+cy^2+dx+ey+f=0 (1) where the six coefficients are integers satisfying the conditions, b^2-4ac=k^2, with a and c being nonzero and k a…
A new numerical method for an inverse problem for an elliptic equation with unknown potential is proposed. In this problem the point source is running along a straight line and the source-dependent Dirichlet boundary condition is measured…
We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…
We use a method, first developed for the Riemann zeta-function by Masser in ["Rational values of the Riemann zeta function", Journ. Num. Th. 131 (2011), 2037-2046], to prove a new zero estimate for polynomials in z and 1/Gamma(z). This…
This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…
A possible connection between quantum computing and Zeta functions of finite field equations is described. Inspired by the 'spectral approach' to the Riemann conjecture, the assumption is that the zeroes of such Zeta functions correspond to…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…
We construct convergent and divergent lattices in negative curvature and give a precise asymptotic description of the behavior of their counting function.
A new definition for the Dirichlet beta function for positive integer arguments is discovered and presented for the first time. This redefinition of the Dirichlet beta function, based on the polygamma function for some special values,…
An elementary method of computing the values at negative integers of the Riemann zeta function is presented. The principal ingredient is a new q-analogue of the Riemann zeta function. We show that for any argument other than 1 the classical…
Let $k$ be a positive integer and let $X_k$ be the cubic hypersurface defined by the equation $x^3-(y_1^2+\cdots+y_{4k}^2)z=0$. In this paper, we give an asymptotic formula for the counting function of semi-integral points on $X_k$. We also…
We propose a procedure to reconstruct characteristic features of an unknown stochastic system from the long-time full counting statistics of some of the system's transitions that are monitored by a detector. The full counting statistics is…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
We study the coupling constant renormalization of gauge theories with an infinite multiplet of fermions, using the zeta function method to make sense of the infinite sums over fermions. If the gauge group K is the maximal compact subgroup…