Related papers: The Zeta ($\zeta$) Notation for Complex Asymptotes
This is a paper in the intersection of time series analysis and complexity theory that presents new results on permutation complexity in general and permutation entropy in particular. In this context, permutation complexity refers to the…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
Real vector fields $\dot{z} = f(z)$ in $\mathbb{R}^N$ extend to $\mathbb{C}^N$, for complex entire $f$. One known consequence are exponentially small upper bounds \begin{equation*} \label{*} C_\eta \exp(-\eta/\varepsilon) \tag{*}…
We investigate the data complexity of answering queries mediated by metric temporal logic ontologies under the event-based semantics assuming that data instances are finite timed words timestamped with binary fractions. We identify classes…
Reachability and other path-based measures on temporal graphs can be used to understand spread of infection, information, and people in modelled systems. Due to delays and errors in reporting, temporal graphs derived from data are unlikely…
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. To reason about data words, linear temporal logic is extended by the freeze…
Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…
We explore the distribution of class numbers $h(d)$ of indefinite binary quadratic forms, for discriminants $d$ such that the corresponding fundamental unit $\varepsilon_d$ is lower than $d^{1/2+\alpha}$, where $0<\alpha<1/2$. To do so we…
A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…
Two identities extracted from the literature are coupled to obtain an integral equation for Riemann's $\xi(s)$ function, and thus $\zeta(s)$ indirectly. The equation has a number of simple properties from which useful derivations flow, the…
Periodograms are used as a key significance assessment and visualisation tool to display the significant periodicities in unevenly sampled time series. We introduce a framework of periodograms, called "Agatha", to disentangle periodic…
We give bounds on the error in the asymptotic approximation of the log-Gamma function $\ln\Gamma(z)$ for complex $z$ in the right half-plane. These improve on earlier bounds by Behnke and Sommer (1962), Spira (1971), and Hare (1997). We…
We examine the size of $E_{2}(T)$, the error term in the asymptotic formula for $\int_{0}^{T} |\zeta(1/2 + it)|^{4}\, dt$ where $\zeta(s)$ is the Riemann zeta-function. We make improvements in the powers of $\log T$ in the known bounds for…
We prove that the (suitably rescaled) moments of certain discrete measures on the unit interval, which are related to the numerical evaluation of zeta series with missing digits in radix $b$, are asymptotically $1$-periodic in the base $b$…
Timed languages contain sequences of discrete events ("letters'') separated by real-valued delays, they can be recognized by timed automata, and represent behaviors of various real-time systems. The notion of bandwidth of a timed language…
Partially ordered models of time occur naturally in applications where agents or processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport. In this paper we consider the problem of…
Most work on computational complexity is concerned with time. However this course will try to show that program-size complexity, which measures algorithmic information, is of much greater philosophical significance. I'll discuss how one can…
The applicability of Large Language Models (LLMs) in temporal reasoning tasks over data that is not present during training is still a field that remains to be explored. In this paper we work on this topic, focusing on structured and…
We provide explicit ranges for $\sigma$ for which the asymptotic formula \begin{equation*} \int_0^T|\zeta(1/2+it)|^4|\zeta(\sigma+it)|^{2j}dt \;\sim\; T\sum_{k=0}^4a_{k,j}(\sigma)\log^k T \quad(j\in\mathbb N) \end{equation*} holds as…
We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…