English
Related papers

Related papers: The Zeta ($\zeta$) Notation for Complex Asymptotes

200 papers

Although cosmological solutions to Einstein's equations are known to be generically singular, little is known about the nature of singularities in typical spacetimes. It is shown here how the operator splitting used in a particular…

General Relativity and Quantum Cosmology · Physics 2009-10-22 B. K. Berger , V. Moncrief

Starting from the classical integral representation of the $\zeta(s)$ function introduced by Riemann in 1859, this paper reexamines its analytic symmetry structure. By performing a geometric decomposition of the integral representation, we…

Number Theory · Mathematics 2026-01-05 Nainrong Feng

Temporal graphs represent graph evolution over time, and have been receiving considerable research attention. Work on expressing temporal graph patterns or discovering temporal motifs typically assumes relatively simple temporal…

Databases · Computer Science 2022-05-31 Amir Pouya Aghasadeghi , Jan Van den Bussche , Julia Stoyanovich

We present two types of meta-algorithm that can greatly improve the accuracy of existing algorithms for integrating the equations of motion of dynamical systems. The first meta-algorithm takes an integrator that is time-symmetric only for…

Astrophysics · Physics 2007-05-23 Piet Hut , Yoko Funato , Eiichiro Kokubo , Junichiro Makino , Steve McMillan

Automata over infinite words, also known as omega-automata, play a key role in the verification and synthesis of reactive systems. The spectrum of omega-automata is defined by two characteristics: the acceptance condition (e.g. B\"uchi or…

Formal Languages and Automata Theory · Computer Science 2021-01-01 Rayna Dimitrova , Bernd Finkbeiner , Hazem Torfah

Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications. However, unlike for…

Formal Languages and Automata Theory · Computer Science 2024-08-07 S Akshay , Paul Gastin , R Govind , B Srivathsan

Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…

Formal Languages and Automata Theory · Computer Science 2026-01-30 Markel Zubia , Herman Geuvers

We prove an asymptotic for the sum of $\zeta^{(n)} (\rho)X^{\rho}$ where $\zeta^{(n)} (s)$ denotes the $n$th derivative of the Riemann zeta function, $X$ is a positive real and $\rho$ denotes a non-trivial zero of the Riemann zeta function.…

Number Theory · Mathematics 2021-11-05 Andrew Pearce-Crump

A representation for the Riemann zeta function valid for arbitrary complex $s=\sigma+it$ is $\zeta(s)=\sum_{n=0}^\infty A(n,s)$, where \[A(n,s)=\frac{2^{-n-1}}{1-2^{1-s}} \sum_{k=0}^n \left(\!\begin{array}{c}n\\k\end{array}\!\right)…

Classical Analysis and ODEs · Mathematics 2021-06-04 R B Paris

Topological data analysis (TDA) is a fast-growing field that utilizes advanced tools from topology to analyze large-scale data. A central problem in topological data analysis is estimating the so-called Betti numbers of the underlying…

Quantum Physics · Physics 2024-04-23 Nhat A. Nghiem

We show that the genus problem for alternating knots with $n$ crossings has linear time complexity and is in Logspace$(n)$. Almost all alternating knots of given genus possess additional combinatorial structure, we call them standard. We…

Geometric Topology · Mathematics 2018-03-29 Olga Kharlampovich , Alina Vdovina

The theory of asymptotic complexity provides an approach to characterizing the behavior of programs in terms of bounds on the number of computational steps executed or use of computational resources. We describe work using ACL2 to prove…

Computational Complexity · Computer Science 2022-05-25 William D. Young

We give an informal introduction to the most basic techniques used to evaluate moments on the critical line of the Riemann zeta-function and to find asymptotics for sums of arithmetic functions.

Number Theory · Mathematics 2007-05-23 David W. Farmer

Acquisition and analysis of time-tagged events is a ubiquitous tool in scientific and industrial applications. With increasing time resolution, number of input channels, and acquired events, the amount of data can be overwhelming for…

Instrumentation and Detectors · Physics 2021-08-31 Zuzeng Lin , Lucas Schweickert , Samuel Gyger , Klaus D. Jöns , Val Zwiller

A practical method to compute the Riemann zeta function is presented. The method can compute $\zeta(1/2+it)$ at any $\lfloor T^{1/4} \rfloor$ points in $[T,T+T^{1/4}]$ using an average time of $T^{1/4+o(1)}$ per point. This is the same…

Number Theory · Mathematics 2018-08-31 G. A. Hiary

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and let $E(T)$ denote the error term in the asymptotic formula for the mean square of $|\zeta(1/2+it)|$. If $E^*(t) := E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x)…

Number Theory · Mathematics 2013-05-10 Aleksandar Ivić

There is a remarkable interest in the study of Out-of-time ordered correlators (OTOCs) that goes from many body theory and high energy physics to quantum chaos. In this latter case there is a special focus on the comparison with the…

Quantum Physics · Physics 2019-10-30 Pablo D. Bergamasco , Gabriel G. Carlo , Alejandro M. F. Rivas

Most numerical methods for time integration use real time steps. Complex time steps provide an additional degree of freedom, as we can select the magnitude of the step in both the real and imaginary directions. By time stepping along…

Numerical Analysis · Mathematics 2022-12-06 Jithin D. George , Samuel Y. Jung , Niall M. Mangan

Software is now ubiquitous and involved in complex interactions with the human users and the physical world in so-called cyber-physical systems where the management of time is a major issue. Separation of concerns is a key asset in the…

Logic in Computer Science · Computer Science 2018-10-24 Mathieu Montin , Marc Pantel

Timed automata (TAs) are a widely used formalism to specify systems having temporal requirements. However, exactly specifying the system may be difficult, as the user may not know the exact clock constraints triggering state transitions. In…

Logic in Computer Science · Computer Science 2019-07-05 Étienne André , Paolo Arcaini , Angelo Gargantini , Marco Radavelli