2000 character limit reached
Root systems, affine subspaces, and projections
Published 2 Sep 2021 in math.CO and math.RT | (2109.00944v1)
Abstract: We tackle several problems related to a finite irreducible crystallographic root system $\Phi$ in the real vector space $\mathbb E$. In particular, we study the combinatorial structure of the subsets of $\Phi$ cut by affine subspaces of $\mathbb E$ and their projections. As byproducts, we obtain easy algebraic combinatorial proofs of refinements of Oshima's Lemma and of a result by Kostant, a partial result towards the resolution of a problem by Hopkins and Postnikov, and new enumerative results on root systems.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.