Related papers: On the centralizer of generic braids
We determine a set of generators for the Brunnian braids on a general surface $M$ for $M\not=S^2$ or $\RP^2$. For the case $M=S^2$ or $\RP^2$, a set of generators for the Brunnian braids on $M$ is given by our generating set together with…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
We prove that in the Cayley graph of any braid group modulo its center $B_n/Z(B_n)$, equipped with Garside's generating set, the axes of all pseudo-Anosov braids are strongly contracting. More generally, we consider a Garside group $G$ of…
We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we…
A Garside monoid is a cancellative monoid with a finite lattice generating set; a Garside group is the group of fractions of a Garside monoid. The family of Garside groups contains the Artin-Tits groups of spherical type. We generalise the…
We give a method to produce representations of the braid group $B_n$ of $n-1$ generators ($n\leq \infty$). Moreover, we give sufficient conditions over a non unitary representation for being of this type. This method produces examples of…
We present a new procedure to determine the growth function of a homogeneous Garside monoid, with respect to the finite generating set formed by the atoms. In particular, we present a formula for the growth function of each Artin--Tits…
Aggregating signals from a collection of noisy sources is a fundamental problem in many domains including crowd-sourcing, multi-agent planning, sensor networks, signal processing, voting, ensemble learning, and federated learning. The core…
A generalization of the term "generalized Clifford algebras" (as appears in papers on advances in applied Clifford algebras) is introduced. This algebra is studied by means of structure theory of central simple algebras. A graph theoretical…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…
A motif is a frequently occurring subgraph of a given directed or undirected graph $G$. Motifs capture higher order organizational structure of $G$ beyond edge relationships, and, therefore, have found wide applications such as in graph…
We produce braided commutative algebras in braided monoidal categories by generalizing Davydov's full center construction of commutative algebras in centers of monoidal categories. Namely, we build braided commutative algebras in relative…
In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garside's greedy normal forms and quadratic convergent rewriting systems, in particular those…
Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this paper, we study this problem in the Centralized Local model, where the goal is to decide whether an edge is part of the spanning subgraph by…
In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained and constrained optimization that have been proposed in the…
How far can the elementary description of centralizers of parabolic subalgebras of Hecke algebras of finite real reflection groups be generalized to the complex reflection group case? In this paper we begin to answer this question by…
We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…
Statistical modeling often involves identifying an optimal estimate to some underlying probability distribution known to satisfy some given constraints. I show here that choosing as estimate the centroid, or center of mass, of the set…
Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building recommender systems, and many more fields. While there are…