相关论文: Still another approach to the braid ordering

We identify natural symmetries of each rigid higher braided category. Specifically, we construct a functorial action by the continuous group $\Omega \mathsf{O}(n)$ on each $\mathcal{E}_{n-1}$-monoidal $(g,d)$-category $\mathcal{R}$ in which…

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta\_{ij}$,…

We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…

We study the problem of generating, ranking and unranking of unlabeled ordered trees whose nodes have maximum degree of $\Delta$. This class of trees represents a generalization of chemical trees. A chemical tree is an unlabeled tree in…

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

The mixed braid groups are the subgroups of Artin braid groups whose elements preserve a given partition of the base points. We prove that the centralizer of any braid can be expressed in terms of semidirect and direct products of mixed…

Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $\|n\| \ge 3\log_3 n$ for all $n$. Define the defect of…

Using totally symmetric sets, Chudnovsky, Kordek, Li, and Partin gave a superexponential lower bound on the cardinality of non-abelian finite quotients of the braid group. In this paper, we develop new techniques using multiple totally…

For a composition $\lambda$ of $n$ we consider the Kazhdan-Lusztig cell in the symmetric group $S_n$ containing the longest element of the standard parabolic subgroup of $S_n$ associated to $\lambda$. In this paper we extend some of the…

We study and give examples of braided groupoids, and, a fortiori, non-degenerate solutions of the quiver-theoretical braid equation.

A linear Gr-category is a category of finite-dimensional vector spaces graded by a finite group together with natural tensor product. We classify the braided monoidal structures of a class of linear Gr-categories via explicit computations…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…

There are natural actions of the braid groups on the products of the braid groups, called the Hurwitz action. We first study the roots of centralizers in the braid groups. By using the structure of the roots, we provide a criterion for the…

Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an…

We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…

We introduce a new invariant describing the structure of sets of lengths in atomic monoids and domains. For an atomic monoid $H$, let $\Delta_{\rho} (H)$ be the set of all positive integers $d$ which occur as differences of arbitrarily long…

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…

Some curious structural similarities between a recent braid- and Hurwitz algebraic description of the unbroken internal symmetries for a single generations of Standard Model fermions were recently identified. The non-trivial braid groups…