2023/08/27 by Robichaux, Colleen
#Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics
paper · doi:10.48550/arxiv.2308.14208
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.