The tableaux monoid: a rewriting-theoretic approach
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 yields a biautomatic structure. We then extend this presentation to a finite coherent presentation in the sense of polygraphic rewriting. These results provide canonical normal forms, yield homological and algorithmic consequences, and produce a higher-dimensional presentation that can be used to describe actions of the tableaux monoid on categories.
- quotes — The tableaux monoid: a rewriting-theoretic approach (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.10035; status: unverified)
- quotes — summary: 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 yields a biautomatic structure. We then extend this presentation to a finite coherent presentation in the sense of polygraphic rewriting. These results provide canonical normal forms, yield homological and algorithmic consequences, and produce a higher-dimensional presentation that can be used to describe actions of the tableaux monoid on categories. (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.10035; status: unverified)
- quotes — url: https://arxiv.org/abs/2610.10035 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.10035; status: unverified)
- quotes — source-subject: arxiv:2610.10035 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.10035; status: unverified)
- quotes — source-edition: sha256:b72f513f6ba2bf1ebf85025a69841e3ece49003141875276ac523609f2b2598a (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.10035; status: unverified)
- quotes — source-metadata: {"subject":"arxiv:2610.10035","id":"2610.10035","url":"https://arxiv.org/abs/2610.10035","datestamp":"2026-11-10","status":"present","title":"The tableaux monoid: a rewriting-theoretic approach","abstract":"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 yields a biautomatic structure. We then extend this presentation to a finite coherent presentation in the sense of polygraphic rewriting. These results provide canonical normal forms, yield homological and algorithmic consequences, and produce a higher-dimensional presentation that can be used to describe actions of the tableaux monoid on categories.","authors":["Nohra Hage"],"categories":["math.CO","math.CT"],"created":"2026-10-07","updated":"2026-11-10","articleLicense":"http://creativecommons.org/licenses/by-nc-sa/4.0/","version":null,"editionDigest":"sha256:b72f513f6ba2bf1ebf85025a69841e3ece49003141875276ac523609f2b2598a","sourceResponseAt":"2026-11-18T21:09:11Z","sourceDigest":"sha256:9463ef807009af84c66928c04f1b177905cda41c60c5b55e502ef901a90fca83"} (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.10035; status: unverified)
- quotes — editorial-standing: source metadata; editorial acceptance pending (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.10035; status: unverified)