Related papers: Blocks of monodromy groups in Complex Dynamics
The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…
In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…
We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…
The monodromy group is an invariant for parameterized systems of polynomial equations that encodes structure of the solutions over the parameter space. Since the structure of real solutions over real parameter spaces are of interest in many…
We consider the monodromy at infinity and the monodromies around the bifurcation points of polynomial functions $f : \CC^n \longrightarrow \CC$ which are not tame and might have non-isolated singularities. Our description of their Jordan…
For a composition $f=f_1\circ\cdots \circ f_r$ of polynomials $f_i\in \mathbb Q[x]$ of degrees $d_i\geq 5$ with alternating or symmetric monodromy group, we show that the monodromy group of $f$ contains the iterated wreath product…
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…
The trigonometric moment problem arises from the study of one-parameter families of centers in polynomial vector fields. It asks for the classification of the trigonometric polynomials $Q$ which are orthogonal to all powers of a…
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,…
For a tree $G$, we study the changing behaviors in the homology groups $H_i(B_nG)$ as $n$ varies, where $B_nG := \pi_1($UConf$_n(G))$. We prove that the ranks of these homologies can be described by a single polynomial for all $n$, and…
The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…
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…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
Distinctive power of the alliance polynomial has been studied in previous works, for instance, it has been proved that the empty, path, cycle, complete, complete without one edge and star graphs are characterized by its alliance polynomial.…
There are several natural families of groups acting on rooted trees for which every member is known to be amenable. It is, however, unclear what the elementary amenable members of these families look like. Towards clarifying this situation,…
The Basilica group is a well-known 2-generated weakly branch, but not branch, group acting on the binary rooted tree. Recently a more general form of the Basilica group has been investigated by Petschick and Rajeev, which is an…
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…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…
We continue the study of graph classes in which the treewidth can only be large due to the presence of a large clique, and, more specifically, of graph classes with bounded tree-independence number. In [Dallard, Milani\v{c}, and…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…