相关论文: A Garside-theoretic approach to the reducibility p…

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…

The minimal standardizer of a curve system on a punctured disk is the minimal braid that transforms it into a system formed only by round curves. We give an algorithm to compute it in a geometrical way. Then, we generalize this problem…

Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…

Benardete, Gutierrez and Nitecki showed an important result which relates the geometrical properties of a braid, as a homeomorphism of the punctured disk, to its algebraic Garside-theoretical properties. Namely, they showed that if a braid…

In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a…

We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure.…

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 present a simple construction which associates to every Garside group a metric space, called the additional length complex, on which the group acts. These spaces share important features with curve complexes: they are…

We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…

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…

We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a…

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

An element in Artin's braid group $B_n$ is called periodic if it has a power which lies in the center of $B_n$. The conjugacy problem for periodic braids can be reduced to the following: given a divisor $1\le d<n-1$ of $n-1$ and an element…

We give an approximation algorithm for non-uniform sparsest cut with the following guarantee: For any $\epsilon,\delta \in (0,1)$, given cost and demand graphs with edge weights $C, D$ respectively, we can find a set $T\subseteq V$ with…

We introduce the notion of a braid group parametrized by a ring, which is defined by generators and relations and based on the geometric idea of painted braids. We show that the parametrized braid group is isomorphic to the semi-direct…

We consider the universal family $E_n^d$ of superelliptic curves: each curve $\Sigma_n^d$ in the family is a $d$-fold covering of the unit disk, totally ramified over a set $P$ of $n$ distinct points; $\Sigma_n^d\hookrightarrow E_n^d\to…

We restate the semistable reduction theorem from geometric invariant theory in the context of spaces of morphisms on $\mathbb{P}^{n}$. For every complete curve $C$ downstairs, we get a $\mathbb{P}^{n}$-bundle on an abstract curve $D$…

In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The first problem is to approximate cuts in balanced directed…

Let M be a compact, connected surface, possibly with a finite set of points removed from its interior. Let d,n be positive integers, and let N be a d-fold covering space of M. We show that the covering map induces an embedding of the n-th…