Related papers: A User's Guide to the Mapping Class Group: Once Pu…
We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product of surface groups. This allows us to detect a non-trivial obstruction bounding from below the effective topological complexity of an…
Let $\Sigma_{g,p}$ be a closed oriented surface of genus $g\geq 1$ with $p$ punctures. Let $\rm Mod(\Sigma_{\textit{g,p}})$ be the mapping class group of $\Sigma_{g,p}$. Wajnryb proved in [Wa] that for $p=0, 1$ $\rm…
It is proved that the mapping class group of any closed surface with finitely many marked points is quasiisometric to a CAT(0) cube complex. We provide two distinct proofs, one tailored to mapping class groups, and one applying to a larger…
In this paper, we provide details on the proofs of the quantum polynomial time algorithm of Biasse and Song (SODA 16) for computing the $S$-unit group of a number field. This algorithm directly implies polynomial time methods to calculate…
In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…
We study the action of the mapping class group M(F) on the complex of curves of a non-orientable surface F. We obtain, by using a result of K. S. Brown, a presentation for M(F) defined in terms of the mapping class groups of the…
A version of Dehn's algorithm for simple diagrams on a once punctured surface representing simple diagrams on a closed surface is presented
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…
Computing the unit group and solving the principal ideal problem for a number field are two of the main tasks in computational algebraic number theory. This paper proposes efficient quantum algorithms for these two problems when the number…
We produce a sequence of finite dimensional representations of the fundamental group $\pi_1(S)$ of a closed surface where all simple closed curves act with finite order, but where each non--simple closed curve eventually acts with infinite…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
The mapping class group of a genus $g$ surface $\Sigma_{g,1}$ with one boundary component is known to have a simple yet infinite presentation with generators given by elementary moves called Whitehead moves on so-called marked bordered…
We analyze the number of ends of the mapping class group of a stable avenue surface. We prove that the mapping class group is one-ended whenever the stable avenue surface has at least one end of discrete type. Our method is to show that the…
The Chinese language poses challenges for natural language processing based on the unit of a word even for formal uses of the Chinese language, social media only makes word segmentation in Chinese even more difficult. In this document we…
Braid groups and mapping class groups have many features in common. Similarly to the notion of inverse braid monoid inverse mapping class monoid is defined. It concerns surfaces with punctures, but among given $n$ punctures several can be…
In this paper, we present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. -…
A high-order quadrature algorithm is presented for computing integrals over curved surfaces and volumes whose geometry is implicitly defined by the level sets of (one or more) multivariate polynomials. The algorithm recasts the implicitly…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
Vector-based word representations help countless Natural Language Processing (NLP) tasks capture the language's semantic and syntactic regularities. In this paper, we present the characteristics of existing word embedding approaches and…
The ability to estimate joint parameters is essential for various applications in robotics and computer vision. In this paper, we propose CAPT: category-level articulation estimation from a point cloud using Transformer. CAPT uses an…