Related papers: Introduction to Iterated Monodromy Groups
This paper discusses iterated monodromy groups for transcendental functions. We show that for every post-singularly finite entire transcendental function, the iterated monodromy action can be described by bounded activity automata of a…
We give a basic theory on monodromy evolving deformations. proposed by Chakravarty and Ablowitz in 1996. We show that Halphen's second quadratic system can be described by monodromy evolving deformations. Our result is a generalization of…
We develop a new framework for the study of complex continuous time dynamical systems based on viewing them as collections of interacting control modules. This framework is inspired by and builds upon the groupoid formalism of Golubitsky,…
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…
Polytopes are ubiquitous in different areas of mathematics. Gleason and Hubard established a factorisation theorem, stating that every abstract polytope has a unique factorisation into prime polytopes. We compute the automorphism group of a…
We introduce a class of inverse monoids, called Tarski monoids, that can be regarded as non-commutative generalizations of the unique countable, atomless Boolean algebra. These inverse monoids are related to a class of etale topological…
In 1980, Odoni initiated the study of the fixed-point proportion of iterated Galois groups of polynomials motivated by prime density problems in arithmetic dynamics. The main goal of the present paper is to completely settle the…
In a previous paper, the author and his collaborators studied the phenomenon of isotropy in the context of single-sorted equational theories, and showed that the isotropy group of the category of models of any such theory encodes a notion…
We define the class of multivariate group entropies as a novel set of information - theoretical measures, which extends significantly the family of group entropies. We propose new examples related to the "super-exponential" universality…
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads. The…
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…
Multi-robot systems of increasing size and complexity are used to solve large-scale problems, such as area exploration and search and rescue. A key decision in human-robot teaming is dividing a multi-robot system into teams to address…
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 document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…
An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…
Rauzy-type dynamics are group actions on a collection of combinatorial objects. The first and best known example concerns an action on permutations, associated to interval exchange transformations (IET) for the Poincar\'e map on compact…
In the present paper we define homogeneous algebraic systems. Particular cases of these systems are: semigroup (monoid, group) system. These algebraic systems were studied by J. Loday, A. Zhuchok, T. Pirashvili, N. Koreshkov. Quandle…
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…