Related papers: On Riemann's Theorem About Conditionally Convergen…
Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a…
We give a reciprocity formula for a two-variable sum where the variables satisfy a linear congruence condition. We also prove that such sum is a measure of how well a rational is approximable from below and show that the reciprocity formula…
We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…
This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of…
Given a covering of the projective line with ramifications defined over a number field, we define a plain model of the algebraic curve realizing the Riemann existence theorem for this covering, and bound explicitly the defining equation of…
We study a generalization of the Random Energy Model to the case when the number of exponential factors varies at random. Also a relation between REM and the Erd"os-R'enyi limit theorem for maximums of partial sums is considered.
We formulate a precise conjecture that, if true, extends the converse theorem of Hecke without requiring hypotheses on twists by Dirichlet characters or an Euler product. The main idea is to linearize the Euler product, replacing it by…
The authors modify the Balazard-Saias criterion for the Riemann hypothesis by changing the cutoff of the Dirichlet series. They establish some asymptotic results related to the modified criterion.
Rewriting Induction (RI) is a principle to prove that an equation over terms is an inductive theorem of a rewrite system, i.e., that any ground instance of the equation is a theorem of the rewrite system. RI has been adapted to several…
We prove that the condition \begin{equation} \sum_{n=1}^\infty\frac{1}{nw(n)}<\infty \end{equation} is necessary for an increasing sequence of numbers $w(n)$ to be an almost everywhere unconditional convergence Weyl multiplier for the…
We consider alternative orders of summation for the conditionally convergent series defining the weight-2 Eisenstein series G2 and the Weierstrass p-function. The resulting sums differ from the standard ones by a residual term that can be…
Some examples of naturally arising multisum $q$-series which turn out to have representations as fermionic single sums are presented. The resulting identities are proved using transformation formulas from the theory of basic hypergeometric…
We give an extension of Sister Celine's method of proving hypergeometric sum identities that allows it to handle a larger variety of input summands. We then apply this to several problems. Some give new results, and some reprove already…
We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
A simple proof of a new summation formula for a terminating r+3Fr+2(1) hypergeometric series, representing an extension of Saalschutz's formula for a 3F2(1) series, is given for the case of r pairs of numeratorial and denominatorial…
We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.
We define a generalization of the winding number of a piecewise $C^1$ cycle in the complex plane which has a geometric meaning also for points which lie on the cycle. The computation of this winding number relies on the Cauchy principal…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…