Math-3841 · mathematics · Algebraic geometry

Math-3841

Finite Generation of Birational-Sequence Monoids

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

For a monoid $M$ with operation $\circ$ and identity $e$, a subset $F\subseteq M$ generates $M$ if every element of $M$ is a finite product of elements of $F$, allowing the empty product $e$. Thus $M$ is finitely generated if \[ \exists F\subseteq M\quad |F|<\infty,\qquad M=\left\{f_1\circ\cdots\circ f_k : k\in{\mathbb{Z}}_{\geq 0},\ f_1,\ldots,f_k\in F\right\}. \] Here $\circ$ is neutral notation for the monoid operation, not an additional assertion about the construction.

The supplied question is the following: for every birational sequence $S$ and every total order $\prec$ that is proper in the intended PBW/Newton--Okounkov construction, is the associated monoid $\Gamma(S,\prec)$ finitely generated? Equivalently, does every such pair $(S,\prec)$ admit a finite subset $F\subseteq\Gamma(S,\prec)$ generating that monoid?

Unresolved scope. The supplied record does not define a birational sequence, the condition that an order is proper, or the construction of $\Gamma$. It also does not specify the ambient algebraic group or Lie algebra, the representation-theoretic hypotheses, or the domains over which these data vary. Consequently, the universal quantifiers above retain the source's intended scope; the record alone does not determine a fully self-contained mathematical formulation.

Short English statement

The question asks whether every monoid obtained from a birational sequence and a proper total order in the intended PBW/Newton--Okounkov construction has a finite generating set. The construction and its admissibility conditions are unspecified in the supplied record and require source clarification.

Sources

  • Local UnsolvedMath registry, supplied record with permanent ID $30003072$, title Finite Generation of Birational-Sequence Monoids, source problem code catalogue entry, in the Oberwolfach Reports Open Problems collection.
  • Supplied primary provenance: Mini-Workshop: PBW Structures in Representation Theory (2016), Oberwolfach Reports, pp. 615--651, DOI 10.4171/owr/2016/13. https://doi.org/10.4171/owr/2016/13. This is also the supplied literature reference labelled "OWR report 13/2016." The record gives proposed year 2016 and names no individual proposer.
  • Supplied literature reference labelled "Fang--Fourier--Littelmann": https://arxiv.org/abs/1510.02295.
  • Supplied literature reference labelled "Feigin survey": https://doi.org/10.4171/ICM2022/81.
  • Literature assessment dated exactly 2026-08-21: the supplied curation labels the problem open, reports finite generation for important reduced-decomposition and classical PBW cases, and states that the report conjectures finite generation for every birational sequence and that no general proof was found. This is supplied dated curation derived from the OWR material, not an independently verified literature assessment; its time-sensitive status and cited claims require independent verification.

Catalogue entry

Statement licence: CC-BY-SA-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.