Related papers: Blocks of monodromy groups in Complex Dynamics

We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields…

We introduce a class of polynomial maps that we call polynomial roots of powerseries, and show that automorphisms with this property generate the automorphism group in any dimension. In particular we determine generically which polynomial…

We associate a group $IMG(f)$ to every covering $f$ of a topological space $M$ by its open subset. It is the quotient of the fundamental group $\pi_1(M)$ by the intersection of the kernels of its monodromy action for the iterates $f^n$.…

We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

We describe finite groups whose principal block contains only characters of prime power degree.

An important problem in the theory of finite dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems over the field with two elements. For systems that can…

We obtain general upper bounds of the sizes and the numbers of Jordan blocks for the eigenvalues $\lambda \not= 1$ in the monodromies at infinity of polynomial maps.

We compute all dynamical degrees of monomial maps by interpreting them as mixed volumes of polytopes. By exploiting further the isomorphism between the polytope algebra of P. McMullen and the universal cohomology of complete toric…

The monodromy conjecture is a mysterious open problem in singularity theory. Its original version relates arithmetic and topological/geometric properties of a multivariate polynomial $f$ over the integers, more precisely, poles of the…

Let $G$ be a digraph and $r(G)$ be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digraph is available. In this article, we study the rank of a…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…

Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets facing each other on two vertical lines. Instead of minimizing…

We consider spaces of plane curves in the setting of algebraic geometry and of singularity theory. On one hand there are the complete linear systems, on the other we consider unfolding spaces of bivariate polynomials of Brieskorn-Pham type.…

Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…

Let \theta:\pi_1(R) \to \PSL(2,\C) be a homomorphism of the fundamental group of an oriented, closed surface R of genus exceeding one. We will establish the following theorem. Theorem. Necessary and sufficient for \theta to be the monodromy…

We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…

We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…