← All problems

Lam–Pylyavskyy finite-type conjecture for linear Laurent phenomenon algebras

Let RR be a unique factorisation domain, and let A\mathcal{A} be a Laurent phenomenon algebra over RR. If A\mathcal{A} admits a linear seed, then A\mathcal{A} is of finite type; equivalently, its mutation pattern has only finitely many cluster variables up to the relevant normalisation.

References

Progress summary

Refreshed
Open · solution reported

An October 2026 preprint claims to prove the conjecture in full, but the claim has not been independently checked.

The conjecture, stated by Lam and Pylyavskyy in 2012, says that every Laurent phenomenon algebra with a linear seed is of finite type, extending their graph-derived construction.

Known results

  • Lam and Pylyavskyy, 2012: graph-derived linear Laurent phenomenon algebras are of finite type, with cluster variables indexed by strongly connected subsets and clusters by maximal nested families.
  • Lam and Pylyavskyy, 2012: rank-two finite-type criteria were established; these cover only a special case of the conjecture.

October 12, 2026 claimed proof

Oliver Daisey's preprint Linear Laurent phenomenon algebras are of finite type claims the full result over an arbitrary unique factorisation domain. Its proposed argument constructs an upper-algebra element divisible by every cluster variable, then uses prime factors to bound mutation classes. The preprint is unrefereed and has no independent verification in the retrieved sources.

Current status (as of October 2026): The graph-derived and some special cases are established, while the general conjecture has a claimed proof but remains open pending independent verification.

Sources

Solutions 0

No solutions have been posted yet.