Related papers: Graph components and dynamics over finite fields
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
We provide in this paper an upper bound for the number of rational points on a curve defined over a one variable function field over a finite field. The bound only depends on the curve and the field, but not on the Jacobian variety of the…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system…
We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.
We find the limiting proportion of periodic points in towers of finite fields for polynomial maps associated to algebraic groups, namely pure power maps z^d and Chebyshev polynomials.
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
The critical point degree of a periodic graph operator is the number of critical points of its complex Bloch variety. Determining it is a step towards the spectral edges conjecture and more generally understanding Bloch varieties. Previous…
The theory of polynomial-like maps is of fundamental importance in holomorphic dynamics. We study dynamical properties of a larger class of maps. Our main result is that, under some natural conditions, a map of this class has a completely…
We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…
Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…
Every generic linear functional $f$ on a convex polytope $P$ induces an orientation on the graph of $P$. From the resulting directed graph one can define a notion of $f$-arborescence and $f$-monotone path on $P$, as well as a natural graph…
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, $\tau$. Paths are sequences of adjacent edges whose appearing times are either strictly increasing or non-strictly increasingly…
Piecewise smooth systems are intensively studied today in many application areas, such as economics, finance, engineering, biology, and ecology. In this work, we consider a class of one-dimensional piecewise linear discontinuous maps with a…
A connected component of an affine algebraic group is called periodic if all its elements have finite order. We give a characterization of periodic components in terms of automorphisms with finite number of fixed points. It is also…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We investigate from a statistical perspective the arithmetic properties of the dynamics of polynomials of fixed degree and defined over the field of rational numbers. To start with, ordering their affine conjugacy classes by height, we show…
Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(\Phi(x,y))$ as edges. We study the following problem:…