相关论文: A User's Guide to the Mapping Class Group: Once Pu…

Given an oriented surface of positive genus with finitely many punctures, we classify the finite orbits of the mapping class group action on the moduli space of semisimple complex special linear two dimensional representations of the…

The quadratic programming over one inequality quadratic constraint (QP1QC) is a very special case of quadratically constrained quadratic programming (QCQP) and attracted much attention since early 1990's. It is now understood that, under…

The mapping class group of an orientable surface, which records its symmetries up to isotopy, plays a central role in low-dimensional topology. This chapter explores the foundational problem of determining minimal generating sets for these…

Let $\Sigma$ be a complete finite-area orientable hyperbolic surface with one cusp, and let $\mathcal{R}$ be the space of complete geodesic rays in $\Sigma$ emanating from the puncture. Then there is a natural action of the mapping class…

We show that the {\it full} mapping class group of any orientable closed surface with punctures admits a cocompact classifying space for proper actions of dimension equal to its virtual cohomological dimension. This was proved for closed…

A word equation with one variable in a free group is given as $U = V$, where both $U$ and $V$ are words over the alphabet of generators of the free group and $X, X^{-1}$, for a fixed variable $X$. An element of the free group is a solution…

In this paper, we give presentations of the mapping class groups of marked surfaces stabilizing boundaries for any genus. Note that in the existing works, the mapping class groups of marked surfaces were the isotopy classes of…

Let $\Gamma_g$ denote the orientation-preserving Mapping Class Group of the genus $g\geq 1$ closed orientable surface. In this paper we show that for fixed $g$, every finite group occurs as a quotient of a finite index subgroup of…

An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…

Autonomous robots operating in real-world environments encounter a variety of objects that can be both rigid and articulated in nature. Having knowledge of these specific object properties not only helps in designing appropriate…

Under the natural action of the pure mapping class group of a surface of genus at least three, we show that any global fixed point in the low-dimensional deformation space of the surface group corresponds to the trivial representation. A…

The present paper are the notes of a mini-course addressed mainly to non-experts. It purpose it to provide a first approach to the theory of mapping class groups of non-orientable surfaces.

This paper proposes a fast and accurate surface normal estimation method which can be directly used on depth maps (organized point clouds). The surface normal estimation process is formulated as a closed-form expression. In order to reduce…

For a fixed marked surface $S$, we show that the problem of deciding whether or not a mapping class is reducible lies in $\textbf{NP}$. As usual this immediately gives an exponential time algorithm to decide whether or not a mapping class…

A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of $O(\log n)$ bits, where $n$ is the size of the input. We assume that a simple $n$-gon is given by the ordered sequence of its…

Let G be a graph cellularly embedded in a surface S. Given two closed walks c and d in G, we take advantage of the RAM model to describe linear time algorithms to decide if c and d are homotopic in S, either freely or with fixed basepoint.…

There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…

We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…