Related papers: Noncrossing partitions for periodic braids

A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$-element subsets such that the vertices in each set are at distance at most $2$. The semipaired domination…

Let $\Gamma=(V,E)$ be a simple connected graph. A vertex $a$ is said to recognize (resolve) two different elements $b_{1}$ and $b_{2}$ from $V(\Gamma)\cup E(\Gamma)$ if $d(a, b_{1})\neq d(a, b_{2}\}$. A subset of distinct ordered vertices…

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…

We study the dynamic structure factor for density and spin within the crossover from BCS superfluidity of atomic fermions to the Bose-Einstein condensation of molecules. Both structure factors are experimentally accessible via Bragg…

Recently, Lusztig constructed for each reductive group a partition by unions of sheets of conjugacy classes, which is indexed by a subset of the set of conjugacy classes in the associated Weyl group. Sevostyanov subsequently used certain…

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…

The binomial random bipartite graph $G(n,n,p)$ is the random graph formed by taking two partition classes of size $n$ and including each edge between them independently with probability $p$. It is known that this model exhibits a similar…

We study fermion pairing in a population-imbalanced mixture of $^{6}$Li atomic gas loaded in a three-dimensional lattice at very low temperatures. Using the number equation for each population, the gap equation and the equation for the…

The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…

In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural…

If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…

In this paper, we give a Groebner-Shirshov basis of the braid group $B_{n+1}$ in the Artin--Garside generators. As results, we obtain a new algorithm for getting the Garside normal form, and a new proof that the braid semigroup $B^+{n+1}$…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

Motivated by the work in [15], this paper deals with the theory of the braids from chromatic configuration spaces. This kind of braids possess the property that some strings of each braid may intersect together and can also be untangled, so…

We introduce, for a symmetric fusion category $\mathcal{A}$ with Drinfeld centre $\mathcal{Z}(\mathcal{A})$, the notion of $\mathcal{Z}(\mathcal{A})$-crossed braided tensor category. These are categories that are enriched over…

The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set $\{1,2,\dots, n\}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting…

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…

Let $H$ be a Hopf algebra in braided category $\cal C$. Crossed modules over $H$ are objects with both module and comodule structures satisfying some comatibility condition. Category ${\cal C}^H_H$ of crossed modules is braided and is…

If g is a quasitriangular Lie bialgebra, one can asks what is the geometrical meaning of its r-matrix. A first answer was given in a paper by Weinstein and Xu, using purely geometrical means: roughly, one has that the formal Poisson group…

We argue that the collinear factorization of the fragmentation functions in high energy nuclear collisions breaks down at transverse momenta $p_T \lesssim Q_s/g$ due to high parton densities in the colliding hadrons and/or nuclei. We find…