activity
20142026
most citedFinite convergent presentation of plactic monoid for type C

7 citations · 13 across the 7 of their papers we have counts for

collaborators

10 papers

math.CO2026

The tableaux monoid: a rewriting-theoretic approach

Nohra Hage

We study the tableaux monoid from the perspective of rewriting theory. We first construct a finite quadratic convergent presentation based on column generators and prove that it yi…

math.CO2026

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…

math.CO2022

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…

math.CO2021

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…

math.CO2021★ 2 cited

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…

math.CO2020

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…

math.CO2019★ 4 cited

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…

math.CO2016

Knuth's Coherent Presentations of Plactic Monoids of Type A

Nohra Hage, Philippe Malbos

We construct finite coherent presentations of plactic monoids of type A. Such coherent presentations express a system of generators and relations for the monoid extended in a coher…

math.RT2015

Finite convergent presentations of plactic monoids for semisimple lie algebras

Nohra Hage

We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation…

math.RT2014★ 7 cited

Finite convergent presentation of plactic monoid for type C

Nohra Hage

We give an explicit presentation for the plactic monoid for type C using admissible column generators. Thanks to the combinatorial properties of symplectic tableaux, we prove that…