相关论文: The classification of polynomial basins of infinit…
We study the dynamics of cubic polynomials restricted to their basins of infinity, and we enumerate topological conjugacy classes with given combinatorics.
We study the projection $\pi: M_d \to B_d$ which sends an affine conjugacy class of polynomial $f: \mathbb{C}\to\mathbb{C}$ to the holomorphic conjugacy class of the restriction of $f$ to its basin of infinity. When $B_d$ is equipped with a…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
Let $\mathbb{C}_v$ be a characteristic zero algebraically closed field which is complete with respect to a non-Archimedean absolute value. We provide a necessary and sufficient condition for two tame polynomials in $\mathbb{C}_v[z]$ of…
We study the dynamics near infinity of polynomial mappings $f$ in $\mathbb{C}^2$. We assume that $f$ has indeterminacy points and is non constant on the line at infinity $L_\infty$. If $L_\infty$ is $f$-attracting, we decompose the Green…
We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
The set of points that escape to infinity under iteration of a cosine map, that is, of the form $C_{a,b} \colon z \mapsto ae^z+be^{-z}$ for $a,b\in \mathbb{C}^\ast$, consists of a collection of injective curves, called dynamic rays. If a…
We describe the class of polynomial functions which are barycentrically associative over an infinite commutative integral domain.
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…