Related papers: On the Tape-Number Problem for Deterministic Time …
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…
A diffusive ratio-dependent Holling-Tanner system subject to Neumann boundary conditions is considered. The existence of multiple bifurcations, including Turing-Hopf bifurcation, Turing-Truing bifurcation, Hopf-double-Turing bifurcation and…
The Turing-Hopf type spatiotemporal patterns in a diffusive Holling-Tanner model with discrete time delay is considered. A global Turing bifurcation theorem for $\tau=0$ and a local Turing bifurcation theorem for $\tau>0$ are given by the…
The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…
Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,$p_j{\in}\{1,2\}$|$C_{\max}$, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs…
The dynamical systems invariant under gauge transformations with higher order time derivatives of the gauge parameter are considered from the Hamiltonian point of view. We investigate the consequences of the basic requirements that the…
We consider the two categories of termination problems of quantum programs with nondeterminism: 1) Is an input of a program terminating with probability one under all schedulers? If not, how can a scheduler be synthesized to evidence the…
For a graph $H$, the $H$-free Edge Deletion problem asks whether there exist at most $k$ edges whose deletion from the input graph $G$ results in a graph without any induced copy of $H$. We prove that $H$-free Edge Deletion is NP-complete…
Under the assumption $P=\Sigma_2^p$, we prove a new variant of the Union Theorem of McCreight and Meyer for the class $\Sigma_2^p$. This yields a union function $F$ which is computable in time $F(n)^c$ for some constant $c$ and satisfies…
When a Hamiltonian system is subject to constraints which depend explicitly on time, difficulties can arise in attempting to reduce the system to its physical phase space. Specifically, it is non-trivial to restrict the system in such a way…
Graded modalities have been proposed in recent work on programming languages as a general framework for refining type systems with intensional properties. In particular, continuous endomaps of the discrete time scale, or time warps, can be…
We answer in the affirmative two conjectures made by Klein and Williams. First, in a range of dimensions, the equivariant Reidemeister trace defines a complete obstruction to removing $n$-periodic points from a self-map $f$. Second, this…
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…
Generative models trained on finite data face a fundamental tension: their score-matching or next-token objective converges to the empirical training distribution rather than the population distribution we seek to learn. Using rule-valid…
For a fixed marked surface $S$, we show that the problem of deciding whether or not a mapping class is reducible lies in $\textbf{NP}$. As usual this immediately gives an exponential time algorithm to decide whether or not a mapping class…
We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, ${\sf x}$ can access ${\sf y}$ if an electromagnetic or (slower than light) mechanical signal could be sent from…
We investigate the rupture of invariant tubes in a class of nonautonomous dynamical systems arising from time-dependent Ermakov-type equations. Starting from an exactly tube-integrable reference system, we analyze a time-dependent invariant…
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…
We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…