Related papers: Counting an infinite number of points: a testing g…
Conical zeta values associated with rational convex polyhedral cones generalise multiple zeta values. We renormalise conical zeta values at poles by means of a generalisation of Connes and Kreimer's Algebraic Birkhoff Factorisation. This…
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…
Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…
Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…
We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…
Of what use are the zeros of the Riemann zeta function? We can use sums involving zeta zeros to count the primes up to $x$. Perron's formula leads to sums over zeta zeros that can count the squarefree integers up to $x$, or tally Euler's…
We use visible point vector identities to examine polylogarithms in the neighbourhood of the Riemann zeta function zeroes. New formulas limiting to the trivial zeroes and to the critical line on the zeta function are given. Similar results…
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…
We study an asymptotic formula for counting integral points over an equation defined by a non-degenerated indefinite integral ternary quadratic form $f$ representing a non-zero integer $a$ such that $-a\cdot det(f)$ is square over a number…
In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…
We study the mathematical structure underlying the concept of locality which lies at the heart of classical and quantum field theory, and develop a machinery used to preserve locality during the renormalisation procedure. Viewing…
Zeros and poles of $k$-tuple zeta functions, that are defined here implicitly, enable localization onto prime-power $k$-tuples in pair-wise coprime $k$-lattices $\mathfrak{N}_k$. As such, the set of all $\mathfrak{N}_k$ along with their…
We equip the space of lattice cones with a coproduct which makes it a connected cograded colagebra. The exponential sum and exponential integral on lattice cones can be viewed as linear maps on this space with values in the space of…
We propose a regularization technique and apply it to the Euler product of zeta functions, mainly of the Riemann zeta function, to make unknown some clear. In this paper that is the first part of the trilogy, we try to demonstrate the…
Infinite lattice summation scheme based on the idea of renormalization is generalized to enable evaluation of infinite lattice sums with Bloch phase factors which can occur when treating long-range interactions in infinite periodic systems.…
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.
By some hypergeometric summation theorems, the authors establish a series of new infinite summation formulas involving generalized harmonic numbers related to Riemann-Zeta function, with three different patterns.
We examine the counting function for rational points on conics, and show how the point where the asymptotic behaviour begins depends on the size of the smallest zero.