Papers
Topics
Authors
Recent
Search
2000 character limit reached

Twisted quadratic foldings of root systems and liftings of Schubert classes

Published 26 May 2021 in math.GR | (2105.12601v1)

Abstract: Given a finite crystallographic root system $\Phi$ whose Dynkin diagram has a non-trivial automorphism, it yields a new root system $\Phi_{\tau}$ by a so-called classical folding. On the other hand, Lusztig's folding (1983) folds the root system of type $E_8$ to $H_4$ starting from an automorphism of the root lattice of type $E_8.$ The notion of a twisted quadratic folding of a root system was introduced by Lanini-Zainoulline (2018) to describe both the classical foldings and Lusztig's folding on the same footing. The structure algebra $\mathcal{Z}(\mathcal{G})$ of the moment graph $\mathcal{G}$ associated with a finite root system and its reflection group $W$ is an algebra over a certain polynomial ring $\mathcal{S},$ whose underlying module is free with a distinguished basis ${\sigma{(w)} \mid w \in W}$ called combinatorial Schubert classes. By Lanini-Zainoulline (2018), a twisted quadratic folding $\Phi \rightsquigarrow \Phi_{\tau}$ induces an embedding of the respective Coxeter groups $\varepsilon: W_{\tau} \hookrightarrow W$ and a ring homomorphism $\varepsilon*: \mathcal{Z}(\mathcal{G}) \rightarrow \mathcal{Z}(\mathcal{G}{\tau})$ between the corresponding structure algebras. This paper studies the $\varepsilon*$-preimage of Schubert classes and provides a combinatorial criterion for a Schubert class $\sigma{(u)}{\tau}$ of $\mathcal{Z}(\mathcal{G}{\tau})$ to admit a Schubert class $\sigma{(w)}$ of $\mathcal{Z}(\mathcal{G})$ such that the relation $\varepsilon*(\sigma{(w)}) = c \cdot \sigma{(u)}{\tau}$ holds for some nonzero scalar $c.$

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Authors (1)

Collections

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