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

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

Based on examples from superstring/D-brane theory since the work of Douglas and Moore on resolution of singularities of a superstring target-space $Y$ via a D-brane probe, the richness and the complexity of the stack of punctual D0-branes…

In this paper we introduce a class of `parabolic' subgroups for the generalized braid group associated to an arbitrary irreducible complex reflection group, which maps onto the collection of parabolic subgroups of the reflection group.…

For a fixed marked surface $S$, we show that the problem of deciding whether or not a mapping class is reducible lies in $\textbf{NP}$. As usual this immediately gives an exponential time algorithm to decide whether or not a mapping class…

Given an undirected graph $G = (V, E)$ and a weight function $w:E \to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V \setminus U$ is adjacent…

Let $C \s \pr^2$ be an irreducible plane curve whose dual $C^* \s \pr^{2*}$ is an immersed curve which is neither a conic nor a nodal cubic. The main result states that the Poincar\'e group $\pi_1(\pr^2 \se C)$ contains a free group with…

Classical optimisation theory guarantees monotonic objective decrease for gradient descent (GD) when employed in a small step size, or ``stable", regime. In contrast, gradient descent on neural networks is frequently performed in a large…

Let $C$ be a smooth plane curve of degree $d$ defined over an algebraically closed field $k$. A base point free complete very special linear system $g^r_n$ on $C$ is trivial if there exists an integer $m\ge 0$ and an effective divisor $E$…

The minimum cut problem in an undirected and weighted graph $G$ is to find the minimum total weight of a set of edges whose removal disconnects $G$. We completely characterize the quantum query and time complexity of the minimum cut problem…

Normalized-Cut (N-Cut) is a famous model of spectral clustering. The traditional N-Cut solvers are two-stage: 1) calculating the continuous spectral embedding of normalized Laplacian matrix; 2) discretization via $K$-means or spectral…

The seminal work of Bencz\'ur and Karger demonstrated cut sparsifiers of near-linear size. Subsequent extensions have yielded sparsifiers for hypergraph cuts and more recently linear codes over Abelian groups. A decade ago, Kogan and…

Homology of braid groups and Artin groups can be related to the study of spaces of curves. We completely calculate the integral homology of the family of smooth curves of genus $g$ with one boundary component, that are double coverings of…

Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory…

For every finite Coxeter group $\Gamma$, each positive braids in the corresponding braid group admits a unique decomposition as a finite sequence of elements of $\Gamma$, the so-called Garside-normal form.The study of the associated…

The traditional method for computation in either the surface code or in the Raussendorf model is the creation of holes or "defects" within the encoded lattice of qubits that are manipulated via topological braiding to enact logic gates.…

In his PhD thesis, Abrams proved that, for a natural number n and a graph G with at least n vertices, the n-strand configuration space of G deformation retracts to a compact subspace, the discretized n-strand configuration space, provided G…

By a classical result of Gomory and Hu (1961), in every edge-weighted graph $G=(V,E,w)$, the minimum $st$-cut values, when ranging over all $s,t\in V$, take at most $|V|-1$ distinct values. That is, these $\binom{|V|}{2}$ instances exhibit…

We prove that an Artin-Tits group of type $\tilde C$ is the group of fractions of a Garside monoid, analogous to the known dual monoids associated with Artin-Tits groups of spherical type and obtained by the "generated group" method. This…

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

Distributed network optimization algorithms, such as minimum spanning tree, minimum cut, and shortest path, are an active research area in distributed computing. This paper presents a fast distributed algorithm for such problems in the…