Castelnuovo-Mumford regularity for $321$-avoiding Kazhdan-Lusztig varieties
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909782304096256 |
|---|---|
| author | Robichaux, Colleen |
| author_facet | Robichaux, Colleen |
| contents | We prove the Castelnuovo--Mumford regularity of 321-avoiding Kazhdan--Lusztig varieties can be computed combinatorially in terms of $K$-theoretic skew excited Young diagrams. We present an algorithm which gives a lower bound for this regularity and describe a setting in which this algorithm provides precise regularity computations. This algorithm specializes to compute the regularity of all two-sided mixed ladder determinantal varieties. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_14208 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Castelnuovo-Mumford regularity for $321$-avoiding Kazhdan-Lusztig varieties Robichaux, Colleen Combinatorics Commutative Algebra We prove the Castelnuovo--Mumford regularity of 321-avoiding Kazhdan--Lusztig varieties can be computed combinatorially in terms of $K$-theoretic skew excited Young diagrams. We present an algorithm which gives a lower bound for this regularity and describe a setting in which this algorithm provides precise regularity computations. This algorithm specializes to compute the regularity of all two-sided mixed ladder determinantal varieties. |
| title | Castelnuovo-Mumford regularity for $321$-avoiding Kazhdan-Lusztig varieties |
| topic | Combinatorics Commutative Algebra |
| url | https://arxiv.org/abs/2308.14208 |