Related papers: On the centralizer of generic braids
We consider the problem of inference in a causal generative model where the set of available observations differs between data instances. We show how combining samples drawn from the graphical model with an appropriate masking function…
We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.
These are Lecture Notes of a course given by the author at the French-Spanish School "Tresses in Pau", held in Pau (France) in October 2009. It is basically an introduction to distinct approaches and techniques that can be used to show…
We unify and generalize several approaches to constructing braid group representations from finite groups, using iterated twisted tensor products. Our results hint at a relationship between the braidings on the $G$-gaugings of a pointed…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
In some previous works we gave algorithms for determining generators of power integral basis in sextic fields with a quadratic subfield, under certain restrictions. The purpose of the present paper is to extend those methods to the general…
We give generators for a certain complex hyperbolic braid group. That is, we remove a hyperplane arrangement from complex hyperbolic $13$-space, take the quotient of the remaining space by a discrete group, and find generators for the…
M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace…
We give characterizations of the center, of conjugated and of commuting elements in a fundamental group of a graph of group. We deduce various results : on the one hand we give a sufficient condition for the center, the centralizers, and…
In the present paper, we construct a variant of the Burau representation of two generalizations of the classical braid group. For the Gassner representation, we propose an iterative procedure to find and generalize the extension of this…
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…
In this paper, we define generalized braid theories in alignment with the language of Fenn and Bartholomew for knot theories, and compute a generating set for the pure generalized braid theories. Using this, we prove that every oriented…
A \emph{strong coreset} for the mean queries of a set $P$ in ${\mathbb{R}}^d$ is a small weighted subset $C\subseteq P$, which provably approximates its sum of squared distances to any center (point) $x\in {\mathbb{R}}^d$. A \emph{weak…
In this article, we propose the approach to procedural optimization of a neural network, based on the combination of information theory and braid theory. The network studied in the article implemented with the intersections between the…
Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…
This paper defines a generalized column subset selection problem which is concerned with the selection of a few columns from a source matrix A that best approximate the span of a target matrix B. The paper then proposes a fast greedy…
This paper aims to develop a grafting method to address Majid's conjecture, which enables the construction of a larger target quantum group by grafting two given smaller ones. This method is significant for advancing the understanding of…
Let $\Gamma$ be a torsion free discrete group acting cocompactly on a two dimensional euclidean building $\Delta$. The centralizer of an element of $\Gamma$ is either a Bieberbach group or is described by a finite graph of finite cyclic…
We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…
We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…