中文
相关论文

相关论文: On the properties of the exchange graph of a clust…

200 篇论文

Fomin-Zelevinsky conjectured that in any cluster algebra, the cluster monomials are linearly independent and that the exchange graph and cluster complex are independent of the choice of coefficients. We confirm these conjectures for all…

An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum…

量子代数 · 数学 2020-02-26 Hyun Kyu Kim , Masahito Yamazaki

For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…

表示论 · 数学 2020-09-09 Wen Chang , Bin Zhu

The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…

表示论 · 数学 2023-08-04 Thomas Brüstle , Dong Yang

We study cluster algebras that are associated to unpunctured surfaces with coefficients arising from boundary arcs. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of…

表示论 · 数学 2008-02-27 Ralf Schiffler , Hugh Thomas

We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials…

环与代数 · 数学 2007-05-23 Sergey Fomin , Andrei Zelevinsky

The claim in the title is proved.

环与代数 · 数学 2024-02-15 Changjian Fu , Shengfei Geng , Pin Liu

This article tries to generalize former works of Derksen, Weyman and Zelevinsky about skew-symmetric cluster algebras to the skew-symmetrizable case. We introduce the notion of group species with potentials and their decorated…

表示论 · 数学 2010-06-01 Laurent Demonet

Let $\Delta$ be an oriented valued graph equipped with a group of admissible automorphisms satisfying a certain stability condition. We prove that the (coefficient-free) cluster algebra $\mathcal A(\Delta/G)$ associated to the valued…

表示论 · 数学 2009-01-30 G. Dupont

We continue our investigation on denominator conjecture of Fomin and Zelevinsky for cluster algebras via geometric models initialed in \cite{FG22}. In this paper, we confirm the denominator conjecture for cluster algebras of finite type.…

表示论 · 数学 2024-11-19 Changjian Fu , Shengfei Geng

We show that for cluster algebras associated with finite quivers without oriented cycles (with no coefficients), a seed is determined by its cluster, as conjectured by Fomin and Zelevinsky.We also obtain an interpretation of the monomial in…

表示论 · 数学 2020-12-21 Aslak Bakke Buan , Bethany Marsh , Idun Reiten , Gordana Todorov

Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…

交换代数 · 数学 2015-07-15 Elisângela Silva Dias , Diane Castonguay

The denominator conjecture, proposed by Fomin and Zelevinsky, says that for a cluster algebra, the cluster monomials are uniquely determined by their denominator vectors with respect to an initial cluster. In this paper, for a cluster…

表示论 · 数学 2024-07-17 Changjian Fu , Shengfei Geng

In this paper, we prove Conjecture 4.8 of "Cluster algebras IV" by S. Fomin and A. Zelevinsky, stating that the mutation classes of rectangular matrices associated with cluster algebras of finite type are precisely those classes which are…

组合数学 · 数学 2011-06-30 Ahmet Seven

Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…

组合数学 · 数学 2024-02-26 Pierre-Philippe Dechant , Yang-Hui He , Elli Heyes , Edward Hirst

A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…

The non--commuting graph $\Gamma(G)$ of a non--abelian group $G$ is defined as follows. The vertex set $V(\Gamma(G))$ of $\Gamma(G)$ is $G\setminus Z(G)$ where $Z(G)$ denotes the center of $G$ and two vertices $x$ and $y$ are adjacent if…

For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…

几何拓扑 · 数学 2018-09-05 Sergey Fomin , Dylan Thurston

We conjecture a new lower bound on the algebraic connectivity of a graph that involves the number of vertices of high eccentricity in a graph. We prove that this lower bound implies a strengthening of the Laplacian Spread Conjecture. We…

组合数学 · 数学 2022-01-13 Wayne Barrett , Emily Evans , H. Tracy Hall , Mark Kempton

In this paper, we prove some combinatorial results on generalized cluster algebras. To be more precisely, we prove that (i) the seeds of a generalized cluster algebra $\mathcal A(\mathcal S)$ whose clusters contain particular cluster…

环与代数 · 数学 2019-10-09 Peigen Cao , Fang Li
‹ 上一页 1 2 3 10 下一页 ›