Papers
Topics
Authors
Recent
Search
2000 character limit reached

A weak Lehmer code for type F4F_4

Published 25 Sep 2025 in math.CO | (2509.20981v1)

Abstract: We show that, despite the Poincar\'e polynomial of F4F_4 is a product of qq-analogues, the Bruhat order of F4F_4 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 F4F_4 do not exist. Nevertheless, by introducing weak Lehmer codes, we construct explicitly multicomplexes and Lehmer complexes for any lower Bruhat interval in type F4F_4.

Authors (2)

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.