Related papers: Correspondences in computational and dynamical com…

Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence

In the theory and practice of inverse problems for partial differential equations (PDEs) much attention is paid to the problem of the identification of coefficients from some additional information. This work deals with the problem of…

Constraints imposed directly on accelerations of the system leading to the relation of constants of motion with appropriate local projectors occurring in the derived equations are considered. In this way a generalization of the Noether's…

We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and…

Polymers with active segments constitute prospective future materials and are used as a model for some biological systems such as chromatin. The directions of the active forces are typically introduced with temporal or spatial correlations…

We discuss the problem of non abelian constrained systems and the origin of appearance of non abelian algebras. We show that it is possible, in principle, to change a non abelian system to an abelian one, at least locally. Our method is…

The paper analyzes dynamic epistemic logic from a topological perspective. The main contribution consists of a framework in which dynamic epistemic logic satisfies the requirements for being a topological dynamical system thus interfacing…

This paper examines two related problems that are central to developing an autonomous decision-making agent, such as a robot. Both problems require generating structured representafions from a database of unstructured declarative knowledge…

I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.

We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…

Temporal logics are an obvious high-level descriptive companion formalism to dynamical systems which model behavior as deterministic evolution of state over time. A wide variety of distinct temporal logics applicable to dynamical systems…

Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…

Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…

Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

We define natural topologies on the Colombeau algebras which are compatible with the algebraic structure. These topologies reduces do Scarpalezos sharp topologies when restricted. with this we take a positive step towards topological…

With distributed computing and mobile applications, synchronizing diverging replicas of data structures is a more and more common problem. We use algebraic methods to reason about filesystem operations, and introduce a simplified definition…

This article presents a new approach to the real-time solution of inverse problems on embedded systems. The class of problems addressed corresponds to ordinary differential equations (ODEs) with generalized linear constraints, whereby the…

It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…

Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…