English
Related papers

Related papers: Geometric embeddings of braid groups do not merge …

200 papers

We prove that embeddings of compact groups are equalizers, and a number of results on pushouts (and more generally, amalgamated free products) in the category of compact groups. Call a family of compact-group embeddings $H\le G_i$…

Group Theory · Mathematics 2023-02-03 Alexandru Chirvasitu

Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…

Combinatorics · Mathematics 2013-11-18 Iain Moffatt

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…

Combinatorics · Mathematics 2016-02-29 Aistis Atminas , Viktor Zamaraev

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

Combinatorics · Mathematics 2012-12-27 Tyler Friesen , Vassily Manturov

Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…

Computational Geometry · Computer Science 2009-08-28 Alireza Bagheri , Mohammadreza Razzazi

In this paper, we investigate some applications of commutator subgroups to homotopy groups and geometric groups. In particular, we show that the intersection subgroups of some canonical subgroups in certain link groups modulo their…

Algebraic Topology · Mathematics 2010-02-03 J. Y. Li , J. Wu

We look at algebraic embeddings of the Cremona group in $n$ variables $Cr_n(C)$ to the group of birational transformations $Bir(M)$ of an algebraic variety $M$. First we study geometrical properties of an example of an embedding of…

Algebraic Geometry · Mathematics 2016-03-11 Christian Urech

The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie in the boundary of the disk. Using this definition, the…

Group Theory · Mathematics 2021-01-06 Michael Dougherty , Jon McCammond , Stefan Witzel

Let $M$ be a regular matroid. The Jacobian group ${\rm Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$. This group generalizes the definition of the Jacobian group (also known as the…

Combinatorics · Mathematics 2019-12-11 Spencer Backman , Matthew Baker , Chi Ho Yuen

In~\cite{Ma} Manturov studied groups $G_{n}^{k}$ for fixed integers $n$ and $k$ such that $k<n$. In particular, $G_{n}^{2}$ is isomorphic to the group of free braids of $n$-stands. In~\cite{KiMa} Manturov and the author studied an invariant…

Geometric Topology · Mathematics 2016-05-03 S. Kim

Classic grammars and regular expressions can be used for a variety of purposes, including parsing, intent detection, and matching. However, the comparisons are performed at a structural level, with constituent elements (words or characters)…

Computation and Language · Computer Science 2018-08-16 David Wingate , William Myers , Nancy Fulda , Tyler Etchart

This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…

Differential Geometry · Mathematics 2012-11-21 Tobias H. Colding , William P. Minicozzi

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

Computational Geometry · Computer Science 2017-03-07 Abu Reyan Ahmed , Felice De Luca , Sabin Devkota , Alon Efrat , Md Iqbal Hossain , Stephen Kobourov , Jixian Li , Sammi Abida Salma , Eric Welch

A geometric intersection graph is constructed over a set of geometric objects, where each vertex represents a distinct object and an edge connects two vertices if and only if the corresponding objects intersect. We examine the problem of…

Computational Geometry · Computer Science 2025-12-23 J. Mark Keil , Debajyoti Mondal

Let $\Gamma_{g,1}^m$ be the mapping class group of the orientable surface $\Sigma_{g,1}^m$ of genus $g$ with one parametrised boundary curve and $m$ permutable punctures; when $m=0$ we omit it from the notation. Let…

Algebraic Topology · Mathematics 2021-04-07 Andrea Bianchi

We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…

Dynamical Systems · Mathematics 2017-01-31 Antti Käenmäki

We show that for each d>0 the d-dimensional Hamming graph H(d,q) has an orientably regular surface embedding if and only if q is a prime power p^e. If q>2 there are up to isomorphism \phi(q-1)/e such maps, all constructed as Cayley maps for…

Combinatorics · Mathematics 2010-06-04 Gareth A. Jones

Let $n \geq 3$. In this paper, we study the problem of whether a given finite group $G$ embeds in a quotient of the form $B_n/\Gamma_k(P_n)$, where $B_n$ is the $n$-string Artin braid group, $k \in \{2, 3\}$, and $\{\Gamma_l(P_n)\}_{l\in…

Geometric Topology · Mathematics 2018-11-02 Daciberg Lima Gonçalves , John Guaschi , Oscar Ocampo

A combinatorial model of molecular conformational space that was previously developped (J. Gabarro-Arpa, Comp. Biol. and Chem. 27, (2003) 153-159), had the drawback that structures could not be properly embedded beacause it lacked explicit…

Chemical Physics · Physics 2016-11-17 Jacques Gabarro-Arpa

Let $G=(V, E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal C}$ be an arrangement of disks with a bijection between the disks…

Computational Geometry · Computer Science 2018-11-05 Tamara Mchedlidze , Marcel Radermacher , Ignaz Rutter , Nina Zimbel
‹ Prev 1 4 5 6 7 8 10 Next ›