2 citations · 2 across the 4 of their papers we have counts for
8 papers
Coherent presentations for stylic monoids via row rewriting
Nohra Hage
We study stylic monoids from the viewpoint of higher-dimensional rewriting. A coherent presentation records not only the defining relations of a monoid, but also the relations amon…
A super Robinson-Schensted-Knuth correspondence with symmetry and the super Littlewood-Richardson rule
Nohra Hage
The Robinson-Schensted-Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays of non-negative integers and pairs of same-shape semistandard tableaux. Thi…
A super Littlewood--Richardson type rule
Nohra Hage
We introduce a super version of the Littlewood--Richardson rule for super Schur functions over signed alphabets. We give in particular combinatorial interpretations of the super Li…
Super jeu de taquin and combinatorics of super tableaux of type A
Nohra Hage
This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the an…
String of columns rewriting and confluence of the jeu de taquin
Nohra Hage, Philippe Malbos
Schützenberger's jeu de taquin is an algorithm on the structure of tableaux, which transforms a skew tableau into a Young one by local transformation rules on the columns of the ta…
Chinese syzygies by insertions
Nohra Hage, Philippe Malbos
We construct a finite convergent semi-quadratic presentation for the Chinese monoid by adding column generators and using combinatorial properties of insertion algorithms on Chines…