Related papers: Garside and quadratic normalisation: a survey
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…
We present a formal analysis, in Isabelle/HOL, of optimisation algorithms for matroids, which are useful generalisations of combinatorial structures that occur in optimisation, and greedoids, which are a generalisation of matroids. Although…
We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…
In this paper we consider the task of estimating the non-zero pattern of the sparse inverse covariance matrix of a zero-mean Gaussian random vector from a set of iid samples. Note that this is also equivalent to recovering the underlying…
We provide explicit and unified formulae for the normalized 3-cocycles on arbitrary finite abelian groups. As an application, we compute all the braided monoidal structures on linear Gr-categories.
The notion of geometric k-normality for curves is introduced in complete generality and is investigated in the case of nodal and cuspidal curves living on several types of surfaces. We discuss and suggest some applications of this notion to…
We obtain a parametric normal form for any non-degenerate perturbation of the generalized saddle-node case of Bogdanov--Takens singularity. Explicit formulas are derived and greatly simplified for an efficient implementation in any computer…
We introduce a new class of generalised quadratic forms over totally real number fields, which is rich enough to capture the arithmetic of arbitrary systems of quadrics over the rational numbers. We explore this connection through a version…
We hypothesize that due to the greedy nature of learning in multi-modal deep neural networks, these models tend to rely on just one modality while under-fitting the other modalities. Such behavior is counter-intuitive and hurts the models'…
We study mechanisms that use greedy allocation rules and pay-your-bid pricing to allocate resources subject to a matroid constraint. We show that all such mechanisms obtain a constant fraction of the optimal welfare at any equilibrium of…
We give a short constructive proof for the existence and uniqueness of the rational normal form of a quadratic matrix.
We define geodesic normal forms for the general series of complex reflection groups G(e,e,n). This requires the elaboration of a combinatorial technique in order to explicitly determine minimal word representatives of the elements of…
We construct a class of Garside groupoid structures on the pure braid groups, one for each function (called labelling) from the punctures to the integers greater than 1. The object set of the groupoid is the set of ball decompositions of…
Generalised geometry studies structures on a d-dimensional manifold with a metric and 2-form gauge field on which there is a natural action of the group SO(d,d). This is generalised to d-dimensional manifolds with a metric and 3-form gauge…
In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…
We show that the characteristic series for the greedy normal form of a Coxeter group is always a rational series, and prove a reciprocity formula for this series when the group is right-angled and the nerve is Eulerian. As corollaries we…
In this paper, a Groebner-Shirshov basis for the Chinese monoid is obtained and an algorithm for the normal form of the Chinese monoid is given.
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…
This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of…
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…