Related papers: Dichotomy Results for Fixed-Point Existence Proble…

We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}. For a class F of boolean functions and a…

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

An n dimensional monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamical system with the property that each of the n component functions is a monic nonzero monomial function in n variables. In…

For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of F as a spanning subgraph.While it…

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 are interested in fixed points in Boolean networks, {\em i.e.} functions $f$ from $\{0,1\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the subcubes of $\{0,1\}^n$, and we characterizes a class…

We deal with a set of solutions of the continuous multi-valued dynamical systems on $\mathbb{R}^2$ of the form $\dot x \in F(x)$ where $F(x)$ is a set-valued function and $F=\{f_1,f_2\}$. Such dynamical systems are frequently used in…

Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…

We consider the Cartesian product X of n finite intervals of integers and a map F from X to itself. As main result, we establish an upper bound on the number of fixed points for F which only depends on X and on the topology of the positive…

The field of constraint satisfaction problems (CSPs) studies homomorphism problems between relational structures where the target structure is fixed. Classifying the complexity of these problems has been a central quest of the field,…

We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions. These constraint functions need not be symmetric nor do we assume any auxiliary functions as in previous…

In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.

We establish several delay-independent criteria for the existence and stability of positive periodic solutions of n-dimensional nonautonomous functional differential equation by several fixed point theorems. Examples from positive and…

This paper investigates the global stability and the global asymptotic stability independent of the sizes of the delays of linear time-varying Caputo fractional dynamic systems of real fractional order possessing internal point delays. The…

To each Boolean function F from {0,1}^n to itself and each point x in {0,1}^n, we associate the signed directed graph G_F(x) of order n that contains a positive (resp. negative) arc from j to i if the partial derivative of f_i with respect…

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…

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 study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…

We study almost automorphic solutions of the discrete delayed neutral dynamic system% \[ x(t+1)=A(t)x(t)+\Delta Q(t,x(t-g(t)))+G(t,x(t),x(t-g(t))) \] by means of a fixed point theorem due to Krasnoselskii. Using discrete variant of…

We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…