Related papers: The Zeta ($\zeta$) Notation for Complex Asymptotes
Asymptotic notations are heavily used while analysing runtimes of algorithms. Present paper argues that some of these usages are non trivial, therefore incurring errors in communication of ideas. After careful reconsidera- tion of the…
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…
The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \log^2 d)$ and space complexity of $O(d \log d)$ or $O(d)$. Following work…
Multiple zeta values are real numbers defined by an infinite series generalizing values of the Riemann zeta function at positive integers. Finite truncations of this series are called multiple harmonic sums and are known to have interesting…
The problem of defining and studying complexity of a time series has interested people for years. In the context of dynamical systems, Grassberger has suggested that a slow approach of the entropy to its extensive asymptotic limit is a sign…
We prove asymptotic formulas for the complex coefficients of $(\zeta q;q)_\infty^{-1}$, where $\zeta$ is a root of unity, and apply our results to determine secondary terms in the asymptotics for $p(a,b,n)$, the number of integer partitions…
We present several formulae for the large $t$ asymptotics of the Riemann zeta function $\zeta(s)$, $s=\sigma+i t$, $0\leq \sigma \leq 1$, $t>0$, which are valid to all orders. A particular case of these results coincides with the classical…
Timed automata (TAs) are an efficient formalism to model and verify systems with hard timing constraints, and concurrency. While TAs assume exact timing constants with infinite precision, parametric TAs (PTAs) leverage this limitation and…
The algebra of big zeta values we introduce in this paper is an intermediate object between multiple zeta values and periods of the multiple zeta motive. It consists of number series generalizing multiple zeta values, the simplest examples,…
Timed automata are a widely used formalism for specifying the discrete-state/continuous-time behavior of time-critical reactive systems. For the fundamental verification problem of comparing two timed automata, it has been shown that timed…
In this article, we investigate the behaviour of values of zeta sums $\sum_{n\le x}n^{it}$ when $t$ is large. We show some asymptotic behaviour and Omega results of zeta sums, which are analogous to previous results of large character sums…
In this article we use the idea of algorithmic complexity (AC) to study various cosmological scenarios, and as a means of quantizing the gravitational interaction. We look at 5D and 7D cosmological models where the Universe begins as a…
This paper presents compact notations for concentration inequalities and convenient results to streamline probabilistic analysis. The new expressions describe the typical sizes and tails of random variables, allowing for simple operations…
We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…
We revisit a representation for the Riemann zeta function $\zeta(s)$ expressed in terms of normalised incomplete gamma functions given by the author and S. Cang in Methods Appl. Anal. {\bf 4} (1997) 449--470. Use of the uniform asymptotics…
The field of computational complexity is concerned both with the intrinsic hardness of computational problems and with the efficiency of algorithms to solve them. Given such a problem, normally one designs an algorithm to solve it and sets…
Assuming the Riemann Hypothesis we study negative moments of the Riemann zeta-function and obtain asymptotic formulas in certain ranges of the shift in $\zeta(s)$. For example, integrating $|\zeta(1/2+\alpha+it)|^{-2k}$ with respect to $t$…
Entropy has been a common index to quantify the complexity of time series in a variety of fields. Here, we introduce increment entropy to measure the complexity of time series in which each increment is mapped into a word of two letters,…
Given a member A of the class of non-deterministic timed automata with silent transitions (eNTA), we effectively compute its timestamp: the set of all pairs (time value, action) of all observable timed traces of A, a generalization of the…
Building on the mapping relations between analytic functions and periodic functions using the abstract operators $\cos(h\partial_x)$ and $\sin(h\partial_x)$, and by defining the Zeta and related functions including the Hurwitz Zeta function…