Immanant positivity for Catalan-Stieltjes matrices

We give some sufficient conditions for the nonnegativity of immanants of square submatrices of Catalan-Stieltjes matrices and their corresponding Hankel matrices. To obtain these sufficient conditions, we construct new planar networks with a recursive nature for Catalan-Stieltjes matrices. As applications, we provide a unified way to produce inequalities for many combinatorial polynomials, such as the Eulerian polynomials, Schröder polynomials, and Narayana polynomials.     

On structure of cluster algebras of geometric type I: In view of sub-seeds and seed homomorphisms

Our motivation is to build a systematic method in order to investigate the structure of cluster algebras of geometric type. The method is given through the notion of mixing-type sub-seeds, the theory of seed homomorphisms and the view-point of gluing of seeds. As an application, for (rooted) cluster algebras, we completely classify rooted cluster subalgebras and characterize rooted cluster quotient algebras in detail. Also, we build the relationship between the categorification of a rooted cluster algebra and that of its rooted cluster subalgebras. Note that cluster algebras of geometric type studied here are of the sign-skew-symmetric case.     

On structure of cluster algebras of geometric type Ⅰ:In view of sub-seeds and seed homomorphisms

Our motivation is to build a systematic method in order to investigate the structure of cluster algebras of geometric type. The method is given through the notion of mixing-type sub-seeds, the theory of seed homomorphisms and the view-point of gluing of seeds. As an application, for(rooted) cluster algebras, we completely classify rooted cluster subalgebras and characterize rooted cluster quotient algebras in detail. Also,we build the relationship between the categorification of a rooted cluster algebra and that of its rooted cluster subalgebras. Note that cluster algebras of geometric type studied here are of the sign-skew-symmetric case.     

A class of Lie algebras arising from intersection matrices

We find a class of Lie algebras, which are defined from the symmetrizable generalized intersection matrices. However, such algebras are different from generalized intersection matrix algebras and intersection matrix algebras. Moreover, such Lie algebras generated by semi-positive definite matrices can be classified by the modified Dynkin diagrams.     

Cartan determinants for gentle algebras

The determinant of the Cartan matrix of a finite dimensional algebra is an invariant of the derived category and can be very helpful for derived equivalence classifications. In this paper we determine the determinants of the Cartan matrices for all gentle algebras. This is a class of algebras of tame representation type which occurs naturally in various places in representation theory. The definition of these algebras is of a purely combinatorial nature, and so are our formulae for the Cartan determinants.Received: 29 October 2004     

Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices

Since exact determination of haplotype blocks is usually not possible, it is desirable to develop a haplotyping method which can account for recombinations. A natural candidate for such a method is haplotyping via phylogenetic networks or their simplified version: galled-tree networks. In earlier work we characterized the existence of the galled-tree networks. Building on this, we reduce the problem of haplotype inferring via galled-tree networks to a hypergraph covering problem for genotype matrices satisfying a combinatorial condition. Our experiments on actual data show that this condition is almost always satisfied when the percentage of minor alleles for each SNP reaches at least 30%.     

Loop-erased walks and total positivity

We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights with nonnegative coefficients. A combinatorial explanation of this phenomenon involves loop-erased walks. Applications include total positivity of hitting matrices of Brownian motion in planar domains.

     

Crystal bases of modified quantized enveloping algebras and a double RSK correspondence

We give a new combinatorial realization of the crystal base of the modified quantized enveloping algebras of type A+∞ or A_∞. It is obtained by describing the decomposition of the tensor product of a highest weight crystal and a lowest weight crystal into extremal weight crystals, and taking its limit using a tableaux model of extremal weight crystals. This realization induces in a purely combinatorial way a bicrystal structure of the crystal base of the modified quantized enveloping algebras and hence its Peter-Weyl type decomposition generalizing the classical RSK correspondence.     

Representations of Frobenius-type triangular matrix algebras

The aim of this paper is mainly to build a new representation-theoretic realization of finite root systems through the so-called Frobenius-type triangular matrix algebras by the method of reflection functors over any field. Finally, we give an analog of APR-tilting module for this class of algebras. The major conclusions contains the known results as special cases, e.g., that for path algebras over an algebraically closed field and for path algebras with relations from symmetrizable cartan matrices. Meanwhile, it means the corresponding results for some other important classes of algebras, that is, the path algebras of quivers over Frobenius algebras and the generalized path algebras endowed by Frobenius algebras at vertices.     

On Spin Models,Triply Regular Association Schemes,and Duality

Motivated by the construction of invariants of links in 3-space, we study spin models on graphs for which all edge weights (considered as matrices) belong to the Bose-Mesner algebra of some association scheme. We show that for series-parallel graphs the computation of the partition function can be performed by using series-parallel reductions of the graph appropriately coupled with operations in the Bose-Mesner algebra. Then we extend this approach to all plane graphs by introducing star-triangle transformations and restricting our attention to a special class of Bose-Mesner algebras which we call exactly triply regular. We also introduce the following two properties for Bose-Mesner algebras. The planar duality property (defined in the self-dual case) expresses the partition function for any plane graph in terms of the partition function for its dual graph, and the planar reversibility property asserts that the partition function for any plane graph is equal to the partition function for the oppositely oriented graph. Both properties hold for any Bose-Mesner algebra if one considers only series-parallel graphs instead of arbitrary plane graphs. We relate these notions to spin models for link invariants, and among other results we show that the Abelian group Bose-Mesner algebras have the planar duality property and that for self-dual Bose-Mesner algebras, planar duality implies planar reversibility. We also prove that for exactly triply regular Bose-Mesner algebras, to check one of the above properties it is sufficient to check it on the complete graph on four vertices. A number of applications, examples and open problems are discussed.     

非负定阵元素的扰动和正定完备化

在保持非负定性不变的前提下,本文对矩阵每一元素容许多大的扰动作了进一步的研究, 将本文的结论和C．R．Johnson提出的部分正定阵的正定完备化进行比较,容易发现对已知的正定矩阵求扰动,本文的结论比用C．R.Johnson的正定完备化计算扰动形式上更简单,同时也给出了不同于C．R．Johnson的部分正定阵的正定完备化表示的另外一个公式,推出了这些正定完备化矩阵应具有的若干性质．     

Regularizing properties of a class of matrices including the optimal and the superoptimal preconditioners

In this work, given a positive definite matrix A, we introduce a class of matrices related to A, which is obtained by suitably combining projections of its powers onto algebras of matrices simultaneously diagonalized by a unitary transform. After a detailed theoretical study of some spectral properties of the matrices of this class, which suggests their use as regularizing preconditioners, we prove that such matrices can be cheaply computed when the matrix A has a Toeplitz structure. We provide numerical evidence of the advantages coming from the employment of the proposed preconditioners when used in regularizing procedures.     

～A0型箭图的一个表示的自同态代数的Cartan矩阵

为了探讨代数的Cartan矩阵的某些性质与代数分类的关系,通过研究完全域k上的A0型仿射箭图的一个有限维表示的自同态代数的结构与Jordan标准型的关系,并利用Jorelan标准型的组合信息得到了该自同态代数的Cartan矩阵,验证了Cartan矩阵猜想在此情形下不成立.最后提出了一个有关仿射箭图性质的猜想.     

Minimal condition number for positive definite Hankel matrices using semidefinite programming

We present a semidefinite programming approach for computing optimally conditioned positive definite Hankel matrices of order n. Unlike previous approaches, our method is guaranteed to find an optimally conditioned positive definite Hankel matrix within any desired tolerance. Since the condition number of such matrices grows exponentially with n, this is a very good test problem for checking the numerical accuracy of semidefinite programming solvers. Our tests show that semidefinite programming solvers using fixed double precision arithmetic are not able to solve problems with n>30. Moreover, the accuracy of the results for 24?n?30 is questionable. In order to accurately compute minimal condition number positive definite Hankel matrices of higher order, we use a Mathematica 6.0 implementation of the SDPHA solver that performs the numerical calculations in arbitrary precision arithmetic. By using this code, we have validated the results obtained by standard codes for n?24, and we have found optimally conditioned positive definite Hankel matrices up to n=100.     

A Riemannian submersion-based approach to the Wasserstein barycenter of positive definite matrices

In this paper, we introduce a novel geometrization on the space of positive definite matrices, derived from the Riemannian submersion from the general linear group to the space of positive definite matrices, resulting in easier computation of its geometric structure. The related metric is found to be the same as a particular Wasserstein metric. Based on this metric, the Wasserstein barycenter problem is studied. To solve this problem, some schemes of the numerical computation based on gradient descent algorithms are proposed and compared. As an application, we test the k-means clustering of positive definite matrices with different choices of matrix mean.     

Completely Positive Definite Maps Over Topological^＊—algebras

ＣｏｍｐｌｅｔｅｌｙＰｏｓｉｔｉｖｅＤｅｆｉｎｉｔｅＭａｐｓＯｖｅｒＴｏｐｏｌｏｇｉｃａｌ－ａｌｇｅｂｒａｓＸｕＴｉａｎｚｈｏｕ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＢｅｉｊｉｎｇＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｆｏｇｙ，...     

Produkte positiver elemente in formal-reellen Jordan-Algebren

A generalization of the Rayleigh quotient defined for real symmetric matrices to the elements of a formally real Jordan algebra is used here to give a generalization to formally real Jordan algebras of the theorem that for any real symmetric matrix C with tr C > 0 there are positive definite real symmetric matrices A and B with C = AB + BA.     

M-矩阵与广义正定矩阵的关系

将文[1,4]中定义广义正定矩阵的概念再作推广,并讨论各种不同定义下的广义正定矩阵间的包含关系,给出M-矩阵等价的四种新定义.     

On the numerical radius of matrices and its application to iterative solution methods

Uses of the numerical radius in the analysis of basic iterative solution methods, of the SOR method for quasi-Hermitian positive definite matrices (not being consistently ordered) and of maximal eigenvalues of symmetric positive definite matrices using incomplete block-matrix factorizations are presented.     

On the numerical radius of matrices and its application to iterative solution methods

Uses of the numerical radius in the analysis of basic iterative solution methods, of the SOR method for quasi-Hermitian positive definite matrices (not being consistently ordered) and of maximal eigenvalues of symmetric positive definite matrices using incomplete block-matrix factorizations are presented.