Related papers: Subexpressions and the Bruhat order for double cos…
Given a 2-category $\twocat{K}$ admitting a calculus of bimodules, and a 2-monad T on it compatible with such calculus, we construct a 2-category $\twocat{L}$ with a 2-monad S on it such that: (1)S has the adjoint-pseudo-algebra property.…
In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…
As a generalization of weak Bruhat orders on permutations, in 1989 Manin and Schechtman introduced the notion of a higher Bruhat order on the $d$-element subsets of a set $[n]=\{1,2,\ldots,n\}$. Among other results in this field, they…
Following Babai's algorithm for the string isomorphism problem, we determine that it is possible to write expressions of short length describing certain permutation cosets, including all permutation subgroups; this is feasible both in the…
This is the second introductory paper concerning structures called rootoids and protorootoids, the definition of which is abstracted from formal properties of Coxeter groups with their root systems and weak orders. The ubiquity of…
When $G$ is a complex reductive algebraic group, MV polytopes are in bijection with the non-negative tropical points of the unipotent group of $G$. By fixing $w$ from the Weyl group, we can define MV polytopes whose highest vertex is…
We examine the periodic table of weak n-categories for the low-dimensional cases. It is widely understood that degenerate categories give rise to monoids, doubly degenerate bicategories to commutative monoids, and degenerate bicategories to…
In this note we make a universal construction of Bruhat-Tits group scheme on wonderful embeddings of adjoint groups in the absolute and relative settings and of adjoint Kac-Moody groups. These have natural classifying properties reflecting…
We present an adaptation of two recent low-rank approximation technique proposed for first-order model reduction systems to the second-order systems. The resulting reduced order models are guaranteed to keep the second order structure which…
The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…
We study the projective objects in an exact category naturally associated to a Coxeter system. We discuss an analog of the Kazhdan-Lusztig conjecture and show how it follows from a "genericity" conjecture and how the latter follows from a…
In studying the structure of derived categories of module categories of group algebras or their blocks, it is fundamental to classify support $\tau$-tilting modules. Koshio and Kozakai showed that the structure of support $\tau$-tilting…
There is a natural analogue of weak Bruhat order on the involutions in any Coxeter group. The saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms. Brion gives a general…
A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…
This paper adresses two issues in dealing with bicategories of fractions. The first is to introduce a set of conditions on a class of arrows in a bicategory which is weaker than the one given in Pronk, Etendues and stacks as bicategories of…
We introduce bimonads in a 2-category $\K$ and define biwreaths as bimonads in the 2-category $\bEM(\K)$ of bimonads, in the analogous fashion as Lack and Street defined wreaths. A biwreath is then a system containing a wreath, a cowreath…
Presentations for unbraided, braided and symmetric pseudomonoids are defined. Biequivalences characterising the semistrict bicategories generated by these presentations are proven. It is shown that these biequivalences categorify results in…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
One-parameter criterion for 2-equipped posets with respect to cerepresentations is stated and proved. The list of sincere one-parameter 2-equipped posets is given as well as a complex matrix classification of all their indecomposables…
A permutation is called smooth if the corresponding Schubert variety is smooth. Gilboa and Lapid prove that in the symmetric group, multiplying the reflections below a smooth element $w$ in Bruhat order in a compatible order yields back the…