2000 character limit reached
A weak Lehmer code for type
Published 25 Sep 2025 in math.CO | (2509.20981v1)
Abstract: We show that, despite the Poincar\'e polynomial of is a product of -analogues, the Bruhat order of does not admit a product of chains as subposet. This answers negatively, in this type, a question by Billey, Fan and Losonczy. In other words, we show that Lehmer codes for type do not exist. Nevertheless, by introducing weak Lehmer codes, we construct explicitly multicomplexes and Lehmer complexes for any lower Bruhat interval in type .
Paper Prompts
Sign up for free to create and run prompts on this paper.