Related papers: The Zeta ($\zeta$) Notation for Complex Asymptotes
Interrupt Timed Automata (ITA) is an expressive timed model, introduced to take into account interruptions, according to levels. Due to this feature, this formalism is incomparable with Timed Automata. However several decidability results…
Reasoning about time is essential for understanding the nuances of events described in natural language. Previous research on this topic has been limited in scope, characterized by a lack of standardized benchmarks that would allow for…
Recently, a natural variant of the Art Gallery problem, known as the \emph{Contiguous Art Gallery problem} was proposed. Given a simple polygon $P$, the goal is to partition its boundary $\partial P$ into the smallest number of contiguous…
We in this paper show that omega regular languages are not closed under infinite union and intersection. As an attempt, we propose to add step variables and quantifiers to temporal logics to enhance the expressiveness of the underlying…
Taking $t$ at random, uniformly from $[0,T]$, we consider the $k$th moment, with respect to $t$, of the random variable corresponding to the $2\beta$th moment of $\zeta(1/2+ix)$ over the interval $x\in(t, t+1]$, where $\zeta(s)$ is the…
We intimate deeper connections between the Riemann zeta and gamma functions than often reported and further derive a new formula for expressing the value of $\zeta(2n+1)$ in terms of zeta at other fractional points. This paper also…
We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version…
Human annotation of natural language facilitates standardized evaluation of natural language processing systems and supports automated feature extraction. This document consists of instructions for annotating the temporal information in…
A positive integer $n$ is called a $\theta$-congruent number if there is a triangle with sides $a,b$ and $c$ for which the angle between $a$ and $b$ is equal to $\theta$ and its area is $n\sqrt{r^2 - s^2}$, where $0 < \theta < \pi$, $\cos…
In this paper we study a generalized class of Maxwell-Boltzmann equations which in addition to the usual collision term contains a linear deformation term described by a matrix A. This class of equations arises, for instance, from the…
Active learning of timed languages is concerned with the inference of timed automata from observed timed words. The agent can query for the membership of words in the target language, or propose a candidate model and verify its equivalence…
A temporal network is a mathematical way of precisely representing a time varying relationship among a group of agents. In this paper, we introduce the notion of $(\Delta, \gamma)$-Cliques of a temporal network, where every pair of vertices…
The correlations arising from sequential measurements on a single quantum system form a polytope. This is defined by the arrow-of-time (AoT) constraints, meaning that future choices of measurement settings cannot influence past outcomes. We…
A new complexity measure named as Lattice Complexity is presented for finite symbolic sequences. This measure is based on the symbolic dynamics of one-dimensional iterative maps and Lempel-Ziv Complexity. To make Lattice Complexity…
Toda proved in 1989 that the (discrete) polynomial time hierarchy, $\mathbf{PH}$, is contained in the class $\mathbf{P}^{#\mathbf{P}}$, namely the class of languages that can be decided by a Turing machine in polynomial time given access to…
In this work, we study the relative hardness of fundamental problems with state-of-the-art word RAM algorithms that take $O(n\sqrt{\log n})$ time for instances described in $\Theta(n)$ machine words ($\Theta(n\log n)$ bits). This complexity…
In this paper we extend a result on the asymptotics of moments of certain cotangent sums associated to the Estermann and Riemann zeta functions established in a previous paper for integer exponents to arbitrary positive real exponents.
Large clinical datasets derived from insurance claims and electronic health record (EHR) systems are valuable sources for precision medicine research. These datasets can be used to develop models for personalized prediction of risk or…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
Reachability analysis for hybrid systems is an active area of development and has resulted in many promising prototype tools. Most of these tools allow users to express hybrid system as automata with a set of ordinary differential equations…