Related papers: An algebraic and graph theoretical framework to st…
Boolean networks are special types of finite state time-discrete dynamical systems. A Boolean network can be described by a function from an n-dimensional vector space over the field of two elements to itself. A fundamental problem in…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the…
We study point modules of monomial algebras associated with symbolic dynamical systems, parametrized by proalgebraic varieties which 'linearize' the underlying dynamical systems. Faithful point modules correspond to transitive sub-systems,…
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The…
This article surveys the burgeoning area at the intersection of dynamical systems theory and algorithms for NP-hard problems. Traditionally, computational complexity and the analysis of non-deterministic polynomial-time (NP)-hard problems…
The aim of this paper is threefold. Firstly, we develop the author's previous work on the dynamical relationship between determinantal point processes and CAR algebras. Secondly, we present a novel application of the theory of stochastic…
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 consider linear dynamical systems with a structure of a multigraph. The vertices are associated to linear spaces and the edges correspond to linear maps between those spaces. We analyse the asymptotic growth of trajectories (associated…
We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…
The self-consistent field theory is a popular and highly successful theoretical framework for studying equilibrium (co)polymer systems at the mesoscopic level. Dynamic density functionals allow one to use this framework for studying…
This paper is concerned with the study of the stability of dynamical systems evolving on time scales. We first {formalize the notion of matrix measures on time scales, prove some of their key properties and make use of this notion to study…
In this paper we study the dynamics of rational maps induced by endomorphisms of ordinary elliptic curves defined over finite fields.
Stochastic dynamical systems often contain nonlinearities which make it hard to compute probability density functions or statistical moments of these systems. For the moment computations, nonlinearities in the dynamics lead to unclosed…
With the tracking condition, the stability of quintessence solutions are examined. It is found that there is only one physically relevant fixed point for the system generically. Two specific examples of quintessence potentials are worked…
The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…
We show that if a field k contains sufficiently many elements(for instance, if k is infinite), and K is an algebraically closed field containing k, then every linear algebraic k-group over K is k-isomorphic to Aut(A\otimes_kK), where A is a…
Let $D_n$ be the dihedral group with $2n$ elements, and suppose $n$ is greater than one. We call ring system a finite $D_n$-symmetric set of points in $\mathbb{R}^2$. Ring systems have been used as models for planets surrounded by rings,…
This paper studies the relations among system parameters, uniqueness, and stability of equilibria, for kinetic systems given in the form of polynomial ODEs. Such models are commonly used to describe the dynamics of nonnegative systems, with…
Differential equations are a ubiquitous tool to study dynamics, ranging from physical systems to complex systems, where a large number of agents interact through a graph with non-trivial topological features. Data-driven approximations of…