Related papers: Graph components and dynamics over finite fields
In this manuscript we systematically review known results of local dynamics of discrete local holomorphic dynamics near fixed points in one and several complex variables as well as the consequences in global dynamics.
The description of invariants of surfaces with respect to the motion groups is reduced to the description of invariants of parameterized surfaces with respect to the motion groups. Existence of a commuting system of invariant partial…
This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…
To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two…
Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…
We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
Coordination sequences of periodic and quasiperiodic graphs are analysed. These count the number of points that can be reached from a given point of the graph by a number of steps along its bonds, thus generalising the familiar coordination…
We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…
In this paper, we study the relation between two dynamical systems (V,f) and (V,g) with f. g = g . f. As an application, we show that an endomorphism (respectively a polynomial map with Zariski dense, of bounded Pre(f) has only finitely…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
Periodic orbits and cycles, respectively, play a significant role in discrete- and continuous-time dynamical systems (i.e. maps and flows). To succinctly describe their shifts when the system is applied perturbation, the notions of…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…