Related papers: A Garside-theoretic approach to the reducibility p…

A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\ell_{1}$ to a point on a horizontal line $\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed…

This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…

We review the $N$-Body Problem in arbitrary dimension $d$ at the kinematical level, with modelling Background Independence in mind. In particular, we give a structural analysis of its reduced configuration spaces, decomposing this subject…

We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a…

For a general surface $M$ and an arbitrary braid $\alpha$ from the surface braid group $B_{n-1}(M)$ we study the system of equations $d_1\beta=\cdots=d_{n}\beta=\alpha, $ where operation $d_i$ is deleting of $i$-th strand. We obtain that if…

If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…

Let $G$ be a Garside group with Garside element $\Delta$, and let $\Delta^m$ be the minimal positive central power of $\Delta$. An element $g\in G$ is said to be 'periodic' if some power of it is a power of $\Delta$. In this paper, we study…

We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…

Let $G = (V,w)$ be a weighted undirected graph with $m$ edges. The cut dimension of $G$ is the dimension of the span of the characteristic vectors of the minimum cuts of $G$, viewed as vectors in $\{0,1\}^m$. For every $n \ge 2$ we show…

Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the \emph{rectangular braid diagram (RBD)} method is proposed to compute the braid monodromy of a completely reducible $n$-gonal curve,…

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

A generalization of the topological fundamental group is developed in order to exhibit a topologically complete braid group containing Artin's braid group on infinitely many strands with respect to the following notion of convergence: A…

Let $E/\mathbb{Q}$ be an elliptic curve. The reduced minimal model of $E$ is a global minimal model $y^{2}+a_{1}xy+a_{3}y=x^{3}+a_{2}x^{2}+a_{4}x+a_{6}$ which satisfies the additional conditions that $a_{1},a_{3}\in \{0,1\}$ and…

The reduced Burau representation $V_n$ of the braid group $B_n$ is obtained from the action of $B_n$ on the homology of an infinite cyclic cover of the disc with $n$ punctures. The group homology $H_*(B_n;V_n)$ of braid groups with…

Given a group $G$ and an integer $n \geq 0$, let $\mathcal{F}_n$ denote the family of all virtually abelian subgroups of $G$ of rank at most $n$. In this article, we show that for each $n \geq 1$, the minimal dimension of a model for the…

In this paper, we explicitly classify the minimal discriminants of all elliptic curves $E/\mathbb{Q}$ with a non-trivial torsion subgroup. This is done by considering various parameterized families of elliptic curves with the property that…

Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…

We prove several new tight distributed lower bounds for classic symmetry breaking graph problems. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a $\Delta$-coloring on…

We consider the classical Minimum Balanced Cut problem: given a graph $G$, compute a partition of its vertices into two subsets of roughly equal volume, while minimizing the number of edges connecting the subsets. We present the first {\em…