Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 16 tok/s
GPT-5 High 18 tok/s Pro
GPT-4o 104 tok/s
GPT OSS 120B 459 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Combinatorial results on (1,2,1,2)-avoiding $GL(p,\mathbb{C}) \times GL(q,\mathbb{C})$-orbit closures on $GL(p+q, \mathbb{C})/B$ (1403.0363v1)

Published 3 Mar 2014 in math.CO, math.AG, and math.RT

Abstract: Using recent results of the second author which explicitly identify the "$(1,2,1,2)$-avoiding" $GL(p,\mathbb{C}) \times GL(q,\mathbb{C})$-orbit closures on the flag manifold $GL(p+q,\mathbb{C})/B$ as certain Richardson varieties, we give combinatorial criteria for determining smoothness, lci-ness, and Gorensteinness of such orbit closures. (In the case of smoothness, this gives a new proof of a theorem of W.M. McGovern.) Going a step further, we also describe a straightforward way to compute the singular locus, the non-lci locus, and the non-Gorenstein locus of any such orbit closure. We then describe a manifestly positive combinatorial formula for the Kazhdan-Lusztig-Vogan polynomial $P_{\tau,\gamma}(q)$ in the case where $\gamma$ corresponds to the trivial local system on a $(1,2,1,2)$-avoiding orbit closure $Q$ and $\tau$ corresponds to the trivial local system on any orbit $Q'$ contained in $\overline{Q}$. This combines the aforementioned result of the second author, results of A. Knutson, the first author, and A. Yong, and a formula of Lascoux and Sch\"{u}tzenberger which computes the ordinary (type $A$) Kazhdan-Lusztig polynomial $P_{x,w}(q)$ whenever $w \in S_n$ is cograssmannian.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.