Related papers: A Dynamical System-based Key Equation for Decoding…
Boolean networks are special types of finite state time-discrete dynamical systems. A Boolean network can be described by a function from an n-dimensional vector space over the field of two elements to itself. A fundamental problem in…
There exists a well established differential topological theory of singularities of ordinary differential equations. It has mainly studied scalar equations of low order. We propose an extension of the key concepts to arbitrary systems of…
We study non-recurrence sets for weakly mixing dynamical systems by using linear dynamical systems. These are systems consisting of a bounded linear operator acting on a separable complex Banach space X, which becomes a probability space…
We introduce DDE-Solver, a Maple package designed for solving Discrete Differential Equations (DDEs). These equations are functional equations relating algebraically a formal power series F(t, u) with polynomial coefficients in a…
The task of modelling and forecasting a dynamical system is one of the oldest problems, and it remains challenging. Broadly, this task has two subtasks - extracting the full dynamical information from a partial observation; and then…
We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the…
If $F:H\to H$ is a map in a Hilbert space $H$, $F\in C^2_{loc}$, and there exists $y$, such that $F(y)=0$, $F'(y)\not= 0$, then equation $F(u)=0$ can be solved by a DSM (dynamical systems method). This method yields also a convergent…
In this paper we propose a new identification scheme for Hammerstein systems, which are dynamic systems consisting of a static nonlinearity and a linear time-invariant dynamic system in cascade. We assume that the nonlinear function can be…
Let $F(u)=h$ be an operator equation in a Banach space $X$, $\|F'(u)-F'(v)\|\leq \omega(\|u-v\|)$, where $\omega\in C([0,\infty))$, $\omega(0)=0$, $\omega(r)>0$ if $r>0$, $\omega(r)$ is strictly growing on $[0,\infty)$. Denote…
The Bures metric and the associated Bures-Hall measure is arguably the best choice for studying the spectrum of the quantum mechanical density matrix with no apriori knowledge of the system. We investigate the probability of a gap in the…
We investigate the linear complexities of the periodic 0-1 infinite sequences in which the periods are the sequence of the parities of the spacings between quadratic residues modulo a prime p, and the sequence of the parities of the…
The nonlinear dynamics of a system with periodic structure can be analyzed using a square matrix. We show that because the special property of the square matrix constructed for nonlinear dynamics, we can reduce the dimension of the matrix…
Let $ ([0,1]^d,T,\mu) $ be a measure-preserving dynamical system so that the correlations decay exponentially for H\"older continuous functions. Suppose that $ \mu $ is absolutely continuous with a density function $ h\in L^q(\mathcal L^d)…
In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known…
This chapter explores dynamical structural equation models (DSEMs) and their nonlinear generalizations into sheaves of dynamical systems. It demonstrates these two disciplines on part of the food web in the Bering Sea. The translation from…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
In this paper we present a new dynamical systems algorithm for clustering in hyperspectral images. The main idea of the algorithm is that data points are \`pushed\' in the direction of increasing density and groups of pixels that end up in…
In the applications of Boolean networks to modeling biological systems, an important computational problem is the detection of the fixed points of these networks. This is an NP-complete problem in general. There have been various attempts…
The Dynamic-Mode Decomposition (DMD) is a well established data-driven method of finding temporally evolving linear-mode decompositions of nonlinear time series. Traditionally, this method presumes that all relevant dimensions are sampled…
For sequential stochastic control problems with standard Borel measurement and control action spaces, we introduce a general (universally applicable) dynamic programming formulation, establish its well-posedness, and provide new existence…