Related papers: Positive circuits and maximal number of fixed poin…
Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…
We consider the system of $N$ points on the segment of the real line with the nearest-neighbor Coulomb repulsive interaction and external force $F$. For the fixed points of such systems (fixed configurations) we study the asymptotics (in…
The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks,…
A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
Consider a three-dimensional vector field $F$ which generates a finite number of fixed points - what can we say on its unbounded dynamics? In this paper we tackle this question, and prove sufficient conditions for $F$ to have fixed points…
This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…
We present new criteria on the existence of fixed points that combine some monotonicity assumptions with the classical fixed point index theory. As an illustrative application, we use our theoretical results to prove the existence of…
In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results…
We study the discrete dynamics of standard (or left) polynomials $f(x)$ over division rings $D$. We define their fixed points to be the points $\lambda \in D$ for which $f^{\circ n}(\lambda)=\lambda$ for any $n \in \mathbb{N}$, where…
We consider a large random network, in which the performance of a node depends upon that of its neighbours and some external random influence factors. This results in random vector valued fixed-point (FP) equations in large dimensional…
A finite dynamical system is a system of multivariate functions over a finite alphabet used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which indicates which local…
We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is…
We obtain a general lower bound for the number of fixed points of a circle action on a compact almost complex manifold $M$ of dimension $2n$ with nonempty fixed point set, provided the Chern number $c_1c_{n-1}[M]$ vanishes. The proof…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…
Previous work in Boolean dynamical networks has suggested that the number of components that must be controlled to select an existing attractor is typically set by the number of attractors admitted by the dynamics, with no dependence on the…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…
The motion of a spinning football brings forth the possible existence of a whole class of finite dynamical systems where there may be non-denumerably infinite number of fixed points. They defy the very traditional meaning of the fixed point…