AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (578.7 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Some elementary properties of Laurent phenomenon algebras

Qiuning DuFang Li( )
Department of Mathematics, Zhejiang University (Yuquan Campus), Hangzhou, Zhejiang 310027, China
Show Author Information

Abstract

Let Σ be a Laurent phenomenon (LP) seed of rank n, A(Σ), U(Σ), and L(Σ) be its corresponding Laurent phenomenon algebra, upper bound and lower bound respectively. We prove that each seed of A(Σ) is uniquely defined by its cluster and any two seeds of A(Σ) with n1 common cluster variables are connected with each other by one step of mutation. The method in this paper also works for (totally sign-skew-symmetric) cluster algebras. Moreover, we show that U(Σ) is invariant under seed mutations when each exchange polynomials coincides with its exchange Laurent polynomials of Σ. Besides, we obtain the standard monomial bases of L(Σ). We also prove that U(Σ) coincides with L(Σ) under certain conditions.

References

【1】
【1】
 
 
Electronic Research Archive
Pages 3019-3041

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Du Q, Li F. Some elementary properties of Laurent phenomenon algebras. Electronic Research Archive, 2022, 30(8): 3019-3041. https://doi.org/10.3934/era.2022153

1

Views

0

Downloads

0

Crossref

2

Web of Science

2

Scopus

Received: 23 November 2021
Revised: 20 April 2022
Accepted: 24 April 2022
Published: 15 August 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)