Hessenberg variety

In geometry, Hessenberg varieties, first studied by Filippo De Mari, Claudio Procesi, and Mark A. Shayman, are subvarieties of the full flag variety that are defined in terms of a Hessenberg function h and a linear transformation X. The study of Hessenberg varieties was first motivated by questions in numerical analysis in relation to algorithms for computing eigenvalues and eigenspaces of the linear operator X. Later work by T. A. Springer, Dale Peterson, Bertram Kostant, among others, found connections with combinatorics, representation theory and cohomology. == Definitions == A Hessenberg function is a map h : { 1 , 2 , … , n } → { 1 , 2 , … , n } {\displaystyle h:\{1,2,\ldots ,n\}\rightarrow \{1,2,\ldots ,n\}} such that h ( i + 1 ) ≥ max ( i , h ( i ) ) {\displaystyle h(i+1)\geq {\text{max }}(i,h(i))} for each i.

Source: Wikipedia — Hessenberg variety (CC BY-SA 4.0)

Hessenberg variety

In geometry, Hessenberg varieties, first studied by Filippo De Mari, Claudio Procesi, and Mark A. Shayman, are subvarieties of the full flag variety that are defined in terms of a Hessenberg function h and a linear transformation X. The study of Hessenberg varieties was first motivated by questions in numerical analysis in relation to algorithms for computing eigenvalues and eigenspaces of the linear operator X. Later work by T. A. Springer, Dale Peterson, Bertram Kostant, among others, found connections with combinatorics, representation theory and cohomology. == Definitions == A Hessenberg function is a map h : { 1 , 2 , … , n } → { 1 , 2 , … , n } {\displaystyle h:\{1,2,\ldots ,n\}\rightarrow \{1,2,\ldots ,n\}} such that h ( i + 1 ) ≥ max ( i , h ( i ) ) {\displaystyle h(i+1)\geq {\text{max }}(i,h(i))} for each i.

This neuron ends here.

Source: Wikipedia "Hessenberg variety" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy