A note on the theory of immanants

General properties of immanants are derived with special emphasis on practical methods of computing them. A general theorem on the structure of the immanants of a skew-symmetric matrix of odd order is proven.     

Littlewood's correspondence between Schur polynomials and immanants

Littlewood's correspondence between Schur polynomials and immanants is discussed in the context of character theory. Some of the identities for immanants that result from the correspondence are used to prove inequalities involving immanants of positive semidefinite matrices.     

Permanental dominance of the normalized single-hook immanants on the positive semi-definite matrices

As a step in the direction of the long standing conjecture that the permanent dominates all other normalized generalized matrix functions on the positive semi-definite matrices, we verify that the permanent dominates a large proportion of the normalized smgle-hook immanants. Some additional observations are made in the direction of the more precise conjecture that the single hook immanants line up.     

A2-web immanants

We describe the rank $3$ Temperley–Lieb–Martin algebras in terms of Kuperberg’s $A_2$-webs. We define consistent labelings of webs and use them to describe the coefficients of decompositions into reduced webs. We introduce web immanants, inspired by Temperley–Lieb immanants of Rhoades and Skandera. We show that web immanants are positive when evaluated on totally positive matrices and describe some further properties.     

On Quantum Immanants and the Cycle Basis of the Quantum Permutation Space

There are many combinatorial expressions for evaluating characters of the Hecke algebra of type A. However, with rare exceptions, they give simple results only for permutations that have minimal length in their conjugacy class. For other permutations, a recursive formula has to be applied. Consequently, quantum immanants are complicated objects when expressed in the standard basis of the quantum permutation space. In this paper, we introduce another natural basis of the quantum permutation space, and we prove that coefficients of quantum immanants in this basis are class functions.     

Quantum immanants and higher Capelli identities

We consider some remarkable central elements of the universal enveloping algebraU(gl(n)) which we call quantum immanants. We express them in terms of generatorsE _ij ofU(gl(n)) and as differential operators on the space of matrices These expressions are a direct generalization of the classical Capelli identities. They result in many nontrivial properties of quantum immanants. The author is supported by the International Science Foundation and the Russian Fundamental Research Foundation.     

Extensions of the Tensor Algebra and Their Applications

This article presents a natural extension of the tensor algebra. In addition to “left multiplications” by vectors, we can consider “derivations” by covectors as basic operators on this extended algebra. These two types of operators satisfy an analogue of the canonical commutation relations. This algebra and these operators have the following applications: (i) applications to invariant theory related to tensor products and (ii) applications to immanants. The latter includes a new method to study the quantum immanants in the universal enveloping algebras of the general linear Lie algebras and their Capelli type identities (the higher Capelli identities).     

A Littlewood-Richardson rule for factorial Schur functions

We give a combinatorial rule for calculating the coefficients in the expansion of a product of two factorial Schur functions. It is a special case of a more general rule which also gives the coefficients in the expansion of a skew factorial Schur function. Applications to Capelli operators and quantum immanants are also given.

     

Combinatorial formula for Macdonald polynomials and generic Macdonald polynomials

We give a direct proof of the combinatorial formula for interpolation Macdonald polynomials by introducing certain polynomials, which we call generic Macdonald polynomials, and which depend on d additional parameters and specialize to all Macdonald polynomials of degree d. The form of these generic polynomials is that of a Bethe eigenfunction and they imitate, on a more elementary level, the R-matrix construction of quantum immanants.     

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.     

Temperley-Lieb pfaffinants and Schur Q-positivity conjectures

We study pfaffian analogues of immanants, which we call pfaffinants. Our main object is the TL-pfaffinants which are analogues of Rhoades and Skandera's TL-immanants. We show that TL-pfaffinants are positive when applied to planar networks and explain how to decompose products of complementary pfaffians in terms of TL-pfaffinants. We conjecture in addition that TL-pfaffinants have positivity properties related to Schur Q-functions.     

Spherical functions and immanants

Let λ be an irreducible character of S_n corresponding to the partition (r,s) of n. Let A be a positive semidefinite Hermitian n × n matrix. Let d_λ(A) and per(A) be the immanants corresponding to λ and to the trivial character of S_n, respectively. A proof of the inequality dλ(A)≤λ(id)per(A) is given.     

Littlewood–Richardson polynomials

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are polynomials in the parameters which we call the Littlewood–Richardson polynomials. We give a combinatorial rule for their calculation by modifying an earlier result of B. Sagan and the author. The new rule provides a formula for these polynomials which is positive in the sense of W. Graham. We apply this formula for the calculation of the product of equivariant Schubert classes on Grassmannians which implies a stability property of the structure coefficients. The first manifestly positive formula for such an expansion was given by A. Knutson and T. Tao by using combinatorics of puzzles while the stability property was not apparent from that formula. We also use the Littlewood–Richardson polynomials to describe the multiplication rule in the algebra of the Casimir elements for the general linear Lie algebra in the basis of the quantum immanants constructed by A. Okounkov and G. Olshanski.     

On the dual canonical and Kazhdan-Lusztig bases and 3412-, 4231-avoiding permutations

Using Du’s characterization of the dual canonical basis of the coordinate ring O(GL(n,C)), we express all elements of this basis in terms of immanants. We then give a new factorization of permutations w avoiding the patterns 3412 and 4231, which in turn yields a factorization of the corresponding Kazhdan-Lusztig basis elements of the Hecke algebra H_n(q). Using the immanant and factorization results, we show that for every totally nonnegative immanant and its expansion with respect to the basis of Kazhdan-Lusztig immanants, the coefficient d_w must be nonnegative when w avoids the patterns 3412 and 4231.     

Some algebraic identities for the α-permanent

The permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first show a more general identity involving α-permanents: for arbitrary complex numbers α and β, we show that the α-permanent of any matrix can be expressed as a linear combination of β-permanents of related matrices. Some other identities for the α-permanent of sums and products of matrices are shown, as well as a relationship between the α-permanent and general immanants. We conclude with some discussion and a conjecture for the computational complexity of the α-permanent, and provide some numerical illustrations.     

Spherical functions and immanants

Let λ be an irreducible character of S_n corresponding to the partition (r,s) of n. Let A be a positive semidefinite Hermitian n × n matrix. Let d_λ (A) and per(A) be the immanants corresponding to λ and to the trivial character of S_n , respectively. A proof of the inequality dλ(A)≤λ(id)per(A) is given.     

On the Melvin–Morton–Rozansky conjecture

We prove a conjecture stated by Melvin and Morton (and elucidated further by Rozansky) saying that the Alexander–Conway polynomial of a knot can be read from some of the coefficients of the Jones polynomials of cables of that knot (i.e., coefficients of the “colored” Jones polynomial). We first reduce the problem to the level of weight systems using a general principle, which may be of some independent interest, and which sometimes allows to deduce equality of Vassiliev invariants from the equality of their weight systems. We then prove the conjecture combinatorially on the level of weight systems. Finally, we prove a generalization of the Melvin–Morton–Rozansky (MMR) conjecture to knot invariants coming from arbitrary semi-simple Lie algebras. As side benefits we discuss a relation between the Conway polynomial and immanants and a curious formula for the weight system of the colored Jones polynomial. Oblatum 28-VII-1994 & 5-XI-1995 & 22-XI-1995     

关于联图P_1VP_n的k-强优美性

本文研究了联图P_1VP_n的k-强优美性问题.利用K-强优美图的定义,获得了联图P_1VP_n是k-强优美图的必要条件,还得到了当n:2k-1时联图P_1VP_n是k-强优美图,亦是k-优美图,及当n≥3时联图P_1VP_n是2-强优美图,也是2-优美图的结果,推广了联图P_1VP_n是优美图的结果.     

线团-收敛图

一个图的线团图就是这个图的线图的团图。对于自然数n，一个图被称为n-线团－收敛的，如果它的n次线团图同构于一个固定的图。否则称之为发散的。本刻画了线团－收敛图与发散图，给出一个线团－收敛图的构造方法，并且，讨论了线团－收敛图的线团－收敛指数。     

紧图的两个结果及其应用

双随机矩阵有许多重要的应用, 紧图族可以看作是组合矩阵论中关于双随机矩阵的著名的Birkhoff定理的拓广,具有重要的研究价值． 确定一个图是否紧图是个困难的问题,目前已知的紧图族尚且不多.给出了两个重要结果：任意紧图与任意多个孤立点的不交并是紧图;任意紧图的每一个顶点上各增加一条悬挂边的图是紧图． 利用这两个结果,从已知紧图可构造出无穷多个紧图族．