Related papers: Blocks of monodromy groups in Complex Dynamics

We define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…

A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…

We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…

We study the behavior of blocks in flat families of finite-dimensional algebras. In a general setting we construct a finite directed graph encoding a stratification of the base scheme according to the block structures of the fibers. This…

In the group of polynomial automorphisms of the plane, the conjugacy class of an element is closed if and only if the element is diagonalisable. In this article, we show that this does not hold for the group of special automorphisms, giving…

We prove two results that shed new light on the monotone complexity of the spanning tree polynomial, a classic polynomial in algebraic complexity and beyond. First, we show that the spanning tree polynomials having $n$ variables and defined…

We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…

Monodromy groups, i.e. the groups of isometries of the intersection lattice L_X:=H_2/torsion generated by the monodromy action of all deformation families of a given surface, have been computed in math.AG/0006231 for any minimal elliptic…

The profinite iterated monodromy group (pfIMG) is a self-similar group associated to dynamical systems. We show that its proper open self-similar subgroups correspond to highly rigid semiconjugacies, which we partly classify in general. For…

Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural…

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

In this paper we investigate gradings on tame blocks of group algebras whose defect group is dihedral. We classify gradings on an arbitrary dihedral block up to graded Morita equivalence. We do this by computing the group of outer…

For any polynomial f with complex coefficients we find a remarkable subset of poles of the motivic zeta function. It is combinatorially determined by any log resolution and it admits an intrinsic interpretation in terms of contact loci of…

The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. This parameter of a graph has recently gained much more attention from the research community after the work of Bar-Yossef et al. (2006). In…

The set ${\cal P}^{m\times n}_{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min \{m, n\}-1$, we show that ${\cal…

The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…

This paper studies signed graphs with possible outer-edges. We introduce and investigate the chain group, the boundary operator, the co-boundary operator, the flow group, the tension group, the homology group, the cohomology group, with…