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

Positive permutation braids on n strings, which are defined to be positive n-braids where each pair of strings crosses at most once, form the elementary but non-trivial building blocks in many studies of conjugacy in the braid groups. We…

In this paper, we study the embedding problem of homogeneous quandles. We give a necessary and sufficient condition under which a quandle homomorphism from the homogeneous quandle associated with a quandle triplet $(G,H,\sigma)$ into a…

If a class of finitely generated groups Curly(G) is closed under isometric amalgamations along free subgroups, then every G in Curly(G) can be quasi-isometrically embedded in a group Hat(G) in Curly(G) that has no proper subgroups of finite…

We introduce the notion of coupled embeddability, defined for maps on products of topological spaces. We use known results for nonsingular biskew and bilinear maps to generate simple examples and nonexamples of coupled embeddings. We study…

The braid groups B_n can be defined as the mapping class group of the n-punctured disc. The Lawrence-Krammer representation of the braid group B_n is the induced action on a certain twisted second homology of the space of unordered pairs of…

Let $M$ be the disk or a compact, connected surface without boundary different from the sphere $S^2$ and the real projective plane $\mathbb{R}P^2$, and let $N$ be a compact, connected surface (possibly with boundary). It is known that the…

An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…

Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

We show that branched coverings of surfaces of large enough genus arise as characteristic maps of braided surfaces that is, lift to embeddings in the product of the surface with $\mathbb R^2$. This result is nontrivial already for…

Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…

Let $S_{g,1,p}$ be an orientable surface of genus $g$ with one boundary component and $p$ punctures. Let $\mathcal{M}_{g,1,p}$ be the mapping-class group of $S_{g,1,p}$ relative to the boundary. We construct homomorphisms…

This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

$*$-structures on quantum and braided spaces of the type defined via an R-matrix are studied. These include $q$-Minkowski and $q$-Euclidean spaces as additive braided groups. The duality between the $*$-braided groups of vectors and…

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…

A map between connected $2$-manifolds has a geometric kernel if it sends a non-contractible simple loop to a null-homotopic loop. While every non-$\pi_1$-injective map between compact surfaces admits a geometric kernel, this generally fails…

Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…