Finkelberg–Fourier–Littelmann finite-generation conjecture for essential monomials

From papers

Let SS be a birational sequence and let >> be a monomial ordering. The construction associates to a dominant weight λ\lambda a monoid Γ(S,>,λ)\Gamma(S,>,\lambda) of essential monomials, and the global monoid is

Γ(S,>):=λΓ(S,>,λ).\Gamma(S,>):= \sum_{\lambda} \Gamma(S,>,\lambda).

Finkelberg–Fourier–Littelmann conjecture. For every birational sequence SS and monomial ordering >>, the monoid Γ(S,>,λ)\Gamma(S,>,\lambda) is finitely generated.

The conjecture concerns the existence of finite generating sets for the monoids parametrizing monomial bases. It is stated as the main conjecture of the paper; the supplied text gives no evidence that it has been resolved.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Xin Fang, Ghislain Fourier, Lars Göttgens and Ben Wilop, “Computing monomial bases in Lie theory using OSCAR”, arXiv:2403.15018 (2024).

Solutions 0

No solutions have been posted yet.