Maximal-monomial conjecture for -polynomials
Maximal-monomial conjecture for -polynomials
An -polynomial is the polynomial in the initial coefficient variables obtained from a cluster variable by specializing the initial cluster variables to . Maximal-monomial conjecture for -polynomials. Each -polynomial has a unique monomial of maximal degree; this monomial has coefficient and is divisible by all other monomials in the -polynomial. The source relates this claim to the constant-term conjecture and records finite Cartan type as a case where it holds; no general resolution is stated.
Sources & referencesView supporting material
Primary source
Nathan Reading and David E Speyer, “Combinatorial frameworks for cluster algebras”, arXiv:1111.2652 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.