Linear Laurent phenomenon algebras are of finite type
Oliver Daisey
Source abstract
Laurent phenomenon algebras generalise cluster algebras by allowing irreducible exchange polynomials in place of binomials. Lam and Pylyavskyy proved finite type for those arising from graphs and conjectured that the same holds for every Laurent phenomenon algebra admitting a linear seed. We prove this conjecture over an arbitrary unique factorisation domain. Our proof constructs a nonzero element of the upper algebra divisible by every cluster variable. Comparing noninitial cluster variables with the prime factors of this element in the initial Laurent ring bounds the number of cluster variable classes and yields a finite normalised mutation pattern.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.