Related papers: Dichotomy Results for Fixed-Point Existence Proble…
Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…
A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We…
Dynamical systems involving non-local derivative operators are of great importance in Mathematical analysis and applications. This article deals with the dynamics of fractional order systems involving Caputo derivatives. We take a review of…
Invariant manifolds provide the geometric structures for describing and understanding dynamics of nonlinear systems. The theory of invariant manifolds for both finite and infinite dimensional autonomous deterministic systems, and for…
A technique is introduced which allows to generate -- starting from any solvable discrete-time dynamical system involving N time-dependent variables -- new, generally nonlinear, generations of discrete-time dynamical systems, also involving…
In this note, we deal with the fixed points of an endofunctor $F: \mathcal{C} \longrightarrow \mathcal{C}$. Three classes of fixed points are introduced, and the case when $F$ is an endomorphism of a category with pretopology is…
We construct a family of globally defined dynamical systems for a nonlinear programming problem, such that: (a) the equilibrium points are the unknown (and sought) critical points of the problem, (b) for every initial condition, the…
We study Diophantine equations of type f(x)=g(y), where both f and g have at least two distinct critical points and equal critical values at at most two distinct critical points. Some classical families of polynomials (f_n)_n are such that…
We prove that if a geodesically complete $\mathrm{CAT}(0)$ space $X$ admits a proper cocompact isometric action of a group, then the Izeki-Nayatani invariant of $X$ is less than $1$. Let $G$ be a finite connected graph, $\mu_1 (G)$ be the…
The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P = NP by introducing a universal, graph-based…
We study some stronger forms of sensitivity, namely, F-sensitivity and weakly F-sensitivity for non-autonomous discrete dynamical systems. We obtain a condition under which these two forms of sensitivity are equivalent. We also justify the…
In this letter we are concerned with the possibility to approach the existence of solutions to a class of discontinuous dynamical systems of fractional order. In this purpose, the underlying initial value problem is transformed into a…
We apply the Fixed Point Theorem for the actions of finite groups on Bruhat-Tits buildings and their products to establish two results concerning the groups of points of reductive algebraic groups over polynomial rings in one variable,…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…
We prove that for every discrete-time linear switching system in two complex variables and with finitely many switching states, either the system is Lyapunov stable or there exists a trajectory which escapes to infinity with at least linear…
Suppose that $G=(V, E)$ be a locally finite and connected graph with symmetric weight and uniformly positive measure, where $V$ denotes the vertex set and $E$ denotes the edge set. We are concered with the following problem $$…
Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem #CSP. A problem from #CSP is characterised by a constraint language, which is a fixed, finite set of relations over a finite domain D. An instance of the…
We introduce the concepts of perpetual points and periodic perpetual loci in discrete--time systems (maps). The occurrence and analysis of these points/loci are shown and basic examples are considered. We discuss the potential usage and…
We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…
We continue the work of [10], studying properties of digital images determined by fixed point invariants. We introduce pointed versions of invariants that were introduced in [10]. We introduce freezing sets and cold sets to show how the…