AbstractWe study and develop a very new object introduced by V.I. Arnold: a monad is a triple consisting of a finite set, a map from that finite set to itself and the monad graph which is the directed graph whose vertices are the elements of the finite set and whose arrows lead each vertex to its image (by the map). We consider the case in which the finite set entering in the monad definition is a finite group G and the map f:G→G is the Frobenius mapfk:x↦xk, for some k∈Z. We study the Frobenius dynamical system defined by the iteration of the monad fk, and also study the combinatorics and topology (i.e., the discrete invariants) of the monad graph. Our study provides useful information about several structures on the group associated to the...
We prove that every combinatorial dynamical system in the sense of Forman, defined on a family of si...
AbstractThe paper contains results about hamiltonian circuits and paths in Cayley graphs of finite g...
A dynamical system consists of a set V and a map f : V → V. The primary goal is to characterize poin...
AbstractWe study and develop a very new object introduced by V.I. Arnold: a monad is a triple consis...
A monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamic...
This paper surveys some recent and classical investigations of geometric progressions of residues th...
A sequential dynamical system is a quadruple consisting of a (directed) graph , each of whose vertic...
A dynamical system consists of a set V and a map f : V → V . The primary goal is to characterize poi...
In this thesis, the dynamical system is used as a function on afinite group, to show how states chan...
Dynamical systems are mathematical structures whose aim is to describe the evolution of an arbitrary...
AbstractIn this paper we survey some surprising connections between group theory, the theory of auto...
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states th...
We consider a class of algebraic dynamical systems introduced by Kitchens and Schmidt. Under a weak ...
AbstractLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard ...
In this note we give a simple proof of a special case of the Pólya enumeration theorem, and also a n...
We prove that every combinatorial dynamical system in the sense of Forman, defined on a family of si...
AbstractThe paper contains results about hamiltonian circuits and paths in Cayley graphs of finite g...
A dynamical system consists of a set V and a map f : V → V. The primary goal is to characterize poin...
AbstractWe study and develop a very new object introduced by V.I. Arnold: a monad is a triple consis...
A monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamic...
This paper surveys some recent and classical investigations of geometric progressions of residues th...
A sequential dynamical system is a quadruple consisting of a (directed) graph , each of whose vertic...
A dynamical system consists of a set V and a map f : V → V . The primary goal is to characterize poi...
In this thesis, the dynamical system is used as a function on afinite group, to show how states chan...
Dynamical systems are mathematical structures whose aim is to describe the evolution of an arbitrary...
AbstractIn this paper we survey some surprising connections between group theory, the theory of auto...
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states th...
We consider a class of algebraic dynamical systems introduced by Kitchens and Schmidt. Under a weak ...
AbstractLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard ...
In this note we give a simple proof of a special case of the Pólya enumeration theorem, and also a n...
We prove that every combinatorial dynamical system in the sense of Forman, defined on a family of si...
AbstractThe paper contains results about hamiltonian circuits and paths in Cayley graphs of finite g...
A dynamical system consists of a set V and a map f : V → V. The primary goal is to characterize poin...