Chain algebras of finite distributive lattices

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Gasanova, Oleksandra, Nicklasson, Lisa
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929272593055744
author Gasanova, Oleksandra
Nicklasson, Lisa
author_facet Gasanova, Oleksandra
Nicklasson, Lisa
contents We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its Krull dimension in terms of the combinatorics of the underlying lattice. When the lattice is planar, we show that the corresponding chain algebra is generated by a sortable set of monomials and is isomorphic to a Hibi ring of another finite distributive lattice. As a consequence it has a defining toric ideal with a quadratic Gröbner basis, and its $h$-vector counts ascents in certain standard Young tableaux. If instead the lattice has dimension $n>2$, we show that the defining ideal has minimal generators of degree at least $n$.
format Preprint
id arxiv_https___arxiv_org_abs_2304_04810
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Chain algebras of finite distributive lattices
Gasanova, Oleksandra
Nicklasson, Lisa
Commutative Algebra
Combinatorics
13F65, 13H10, 06A11
We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its Krull dimension in terms of the combinatorics of the underlying lattice. When the lattice is planar, we show that the corresponding chain algebra is generated by a sortable set of monomials and is isomorphic to a Hibi ring of another finite distributive lattice. As a consequence it has a defining toric ideal with a quadratic Gröbner basis, and its $h$-vector counts ascents in certain standard Young tableaux. If instead the lattice has dimension $n>2$, we show that the defining ideal has minimal generators of degree at least $n$.
title Chain algebras of finite distributive lattices
topic Commutative Algebra
Combinatorics
13F65, 13H10, 06A11
url https://arxiv.org/abs/2304.04810