Related papers: Dichotomy Results for Fixed Point Counting in Bool…
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…
In this paper, we consider a wider class of simulation functions and present some coincidence and common fixed point results in metric spaces. Results obtained in this paper extend, generalize and unify some well-known fixed and common…
For one variable rational function $\phi\in K(z)$ over a field $K$, we can define a discrete dynamical system by regarding $\phi$ as a self morphism of $\mathbb{P}_{K}^{1}$. Hatjispyros and Vivaldi defined a dynamical zeta function for this…
This paper combines the decomposition technique ($\sigma$-stability) in random functional analysis with the deterministic theory of asymptotically pointwise contractions to provide a complete self-contained derivation of a fixed point…
Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…
We investigate the dynamical system generated by the function $\lfloor\lambda x\rfloor$ defined on $\mathbb R$ and with a parameter $\lambda\in \mathbb R$. For each given $m\in \mathbb N$ we show that there exists a region of values of…
We study local biholomorphisms with finite orbits in some neighborhood of the origin since they are intimately related to holomorphic foliations with closed leaves. We describe the structure of the set of periodic points in dimension 2. As…
Following the recent advances in the study of groups of circle diffeomorphisms, we describe an efficient way of classifying the topological dynamics of locally discrete, finitely generated, virtually free subgroups of the group…
For a set F of finite tournaments, the F-free orientation problem is the problem of deciding if a given finite undirected graph can be oriented in such a way that the resulting oriented graph does not contain any member of F. Using the…
In this paper we consider dynamical systems generated by $(3,2)$-rational functions on the field of $p$-adic complex numbers. Each such function has three fixed points. We show that Siegel disks of the dynamical system may either coincide…
Fixed-time stable dynamical systems are capable of achieving exact convergence to an equilibrium point within a fixed time that is independent of the initial conditions of the system. This property makes them highly appealing for designing…
In this paper, the notion of $\mathbb{C}$-simulation function is introduced and the existence and uniqueness of common fixed points of two self-mappings satisfying contractive conditions in the setting of complex valued metric spaces via…
A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…
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…
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…
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
Usually, in order to investigate the evolution of a theory, one may find the critical points of the system and then perform perturbations around these critical points to see whether they are stable or not. This local method is very useful…
We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…
Based on the recently developed theory of random sequential compactness, we prove the random Kakutani fixed point theorem in random normed modules: if G is a random sequentially compact L0-convex subset of a random normed module, then every…