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

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…

We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…

In a graph $G=(V,E)$ with no isolated vertex, a dominating set $D \subseteq V$, is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$, such that distance between $u$ and $v$ is at most two in…

We investigate indeterminate points in discrete integrable system. They appear in singularity confinement phenomenon naturally. We develop a method to analyse indeterminate points of dynamical maps and using this method we clarify behaviour…

This paper is devoted to a nonlinear singular Riemann-Liouville type fractional differential equation, the local existence of whose continuous solutions under the weakest condition remained as an open problem until now. The singularity of…

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

In the modeling of biological systems by Boolean networks a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structural properties of the interaction graph like those proposed…

For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. Motivated by…

The goal of this work is to identify steady-state solutions to dynamical systems defined on large, random families of networks. We do so by passing to a continuum limit where the adjacency matrix is replaced by a non-local operator with…

Propositional dynamic logic (PDL) is an important modal logic used to specify and reason about the behavior of software. A challenging problem in the context of PDL is solving fixed-point equations, i.e., formulae of the form $x \equiv…

In this paper, we study the existence of fixed points for mappings defined on complete (compact) metric space (X, d) satisfying a general contractive (contraction) inequality depended on another function. These conditions are analogous to…

A transcendental entire function f is called geometrically finite if the intersection of the set of singular values with the Fatou set is compact and the intersection of the postsingular set with the Julia set is finite. (In particular,…

We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\operatorname{Holant}\left(f\mid =_3 \right)$, where $f$ is any integer-valued ternary…

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…

This note presents a method to study center families of periodic orbits of complex holomorphic differential equations near singularities, based on some iteration properties of fixed point indices. As an application of this method, we will…

If K is a discrete group and Z is a K-spectrum, then the homotopy fixed point spectrum Z^{hK} is Map_*(EK_+, Z)^K, the fixed points of a familiar expression. Similarly, if G is a profinite group and X is a discrete G-spectrum, then X^{hG}…

This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the second computes the group $[\Sigma X,Y]^*$ of pointed…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…

This paper is devoted to prove the existence of one or multiple solutions of a wide range of nonlinear differential boundary value problems. To this end, we obtain some new fixed point theorems for a class of integral operators. We follow…