Cluster algebras of finite type and positive symmetrizable matrices
Michael Barot, Christof Geiss, Andrei Zelevinsky
备注：
20 pages. In version 3, some new material is added in the end of section 2, discussing the classification and characterizations of positive quasi-Cartan matrices. In final version 4, Proposition 2.9 is corrected and its proof expanded. To appear in J. London Math. Soc. In version 5 only typos in the arXiv data fixed
发表信息：
J. London Math. Soc. (2) 73 (2006), no. 3, 545--564
The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two classifications is different: roughly speaking, Kac-Moody algebras are associated with (symmetrizable) Cartan matrices, while cluster algebras correspond to skew-symmetrizable matrices. We study an interplay between the two classes of matrices, in particular, establishing a new criterion for deciding whether a given skew-symmetrizable matrix gives rise to a cluster algebra of finite type.
Inspired by Fock-Goncharov's amalgamation procedure \cite{Fock-Goncharov-2006}, Shen-Weng introduced string diagrams in \cite{Shen-Weng-2021}, which are very useful to describe many interesting skew-symmetrizable matrices closely related with Lie theory. In this paper, we prove that the skew-symmetrizable matrices from string diagrams are in the smallest class $\mathcal P^\prime$ of skew-symmetrizable matrices containing the $1\times 1$ zero matrix and closed under mutations and source-sink extensions. This result applies to the exchange matrices of cluster algebras from double Bruhat cells, u…
The study of positive-definite matrices has focused on Hermitian matrices, that is, square matrices with complex (or real) entries that are equal to their own conjugate transposes. In the classical setting, positive-definite matrices enjoy a multitude of equivalent definitions and properties. In this paper, we investigate when a square, symmetric matrix with entries coming from a finite field can be called "positive-definite" and discuss which of the classical equivalences and implications carry over.
Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of nonnegative matrices up to similarity. Also we find all realizable dimensions of algebras generated by two nonnegative semi-commuting matrices. The last result provides the solution to the problem posed by M. Kandić, K. Šivic (2017).
We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite (HPSD) matrices. By analyzing a constructive randomized rounding algorithm, we obtain an improved multiplicative approximation factor to the permanent of HPSD matrices, as well as computationally efficient certificates for this approximation. We also propose an analog of van der Waerden's conjecture for HPSD matrices, where the polynomial optimization problem i…
