Related papers: On the Tape-Number Problem for Deterministic Time …
Let $G$ be a finite group of Lie type defined in characteristic $p$, and let $k$ be an algebraically closed field of characteristic $r>0$. We will assume that $r \neq p$ (so, we are in the non-defining characteristic case). Let $V$ be a…
The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy. Several natural parameterized problems have,…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…
If the vertices composing a network interact at distinct time points, the temporal ordering of these interactions and the network's graph structure are sufficient to convey the routes by which information can flow in the network. Two…
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…
This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…
If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…
The Lie claw digraph controls Background Independence and thus the Problem of Time and indeed the Fundamental Nature of Physical Law. This has been established in the realms of Flat and Differential Geometry with varying amounts of extra…
The paper studies thin times which are random times whose graph is contained in a countable union of the graphs of stopping times with respect to a reference filtration $\mathbb F$. We show that a generic random time can be decomposed into…
Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed…
We deal here with the issue of determinism versus randomness in time series. One wishes to identify their relative importance in a given time series. To this end we extend i) the use of ordinal patterns-based probability distribution…
We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…
Time does not obviously appear amongst the coordinates on the constrained phase space of general relativity in the Hamiltonian formulation. Recent work in finite-dimensional models claims that topological obstructions generically make the…
Single-tape nondeterministic Turing machines that are allowed to replace the symbol in each tape cell only when it is scanned for the first time are also known as 1-limited automata. These devices characterize, exactly as finite automata,…
We prove explicitly that to every discrete, semibounded Hamiltonian with constant degeneracy and with finite sum of the squares of the reciprocal of its eigenvalues and whose eigenvectors span the entire Hilbert space there exists a…
We study the problems of counting copies and induced copies of a small pattern graph $H$ in a large host graph $G$. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns $H$. In…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.