Search results for "Automorphisms"
showing 4 items of 24 documents
Embedding mapping class groups of orientable surfaces with one boundary component
2012
We denote by $S_{g,b,p}$ an orientable surface of genus $g$ with $b$ boundary components and $p$ punctures. We construct homomorphisms from the mapping class groups of $S_{g,1,p}$ to the mapping class groups of $S_{g',1,(b-1)}$, where $b\geq 1$. These homomorphisms are constructed from branched or unbranched covers of $S_{g,1,0}$ with some properties. Our main result is that these homomorphisms are injective. For unbranched covers, this construction was introduced by McCarthy and Ivanov~\cite{IM}. They proved that the homomorphisms are injective. A particular cases of our embeddings is a theorem of Birman and Hilden that embeds the braid group on $p$ strands into the mapping class group of …
Embeddings of Danielewski hypersurfaces
2008
In this thesis, we study a class of hypersurfaces in $\mathbb{C}^3$, called \emph{Danielewski hypersurfaces}. This means hypersurfaces $X_{Q,n}$ defined by an equation of the form $x^ny=Q(x,z)$ with $n\in\mathbb{N}_{\geq1}$ and $\deg_z(Q(x,z))\geq2$. We give their complete classification, up to isomorphism, and up to equivalence via an automorphism of $\mathbb{C}^3$. In order to do that, we introduce the notion of standard form and show that every Danielewski hypersurface is isomorphic (by an algorithmic procedure) to a Danielewski hypersurface in standard form. This terminology is relevant since every isomorphism between two standard forms can be extended to an automorphism of the ambiant …
The Abelian Kernel of an Inverse Semigroup
2020
The problem of computing the abelian kernel of a finite semigroup was first solved by Delgado describing an algorithm that decides whether a given element of a finite semigroup S belongs to the abelian kernel. Steinberg extended the result for any variety of abelian groups with decidable membership. In this paper, we used a completely different approach to complete these results by giving an exact description of the abelian kernel of an inverse semigroup. An abelian group that gives this abelian kernel was also constructed.
Counting Berg partitions via Sturmian words and substitution tilings
2013
We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, [12]. This approach together with the formula of Seebold [10], for the number of substitutions preserving a given Sturmian sequence, shows that all of the combinatorial substitutions can be realized geometrically as Berg partitions. We treat Sturmian tilings as intersection tilings of bi-partitions. Using the symmetries of bi-partitions we obtain geometrically the palindromic properties of Sturmian sequences (Theorem 3) established combinatorially by de Luca and Migno…