We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the determinant that gives the number of all totally symmetric self-complementary plane partitions contained in a $(2n)\times(2n)\times(2n)$ box and that was used by Andrews (J. Combin. Theory Ser. A 66 (1994), 28-39) and Andrews and Burge (Pacific J. Math. 158 (1993), 1-14) to compute this number explicitly. The evaluation of the generalized determinant is independent of Andrews and Burge's computations, and therefore in particular constitutes a new solution to this famous enumeration problem. We also evaluate a related determinant, thus generalizing another determinant identity of Andrews and Burge (loc. cit.). By translating some of our determinant identities into constant term identities, we obtain several new constant term identities.
In this paper, we show how general determinants may be viewed as generating functions of nonintersecting lattice paths, using the Lindström-Gessel-Viennot interpretation of semistandard Young tableaux and the Jacobi-Trudi identity together with elementary observations. After some preparations, this point of view provides very simple "graphical proofs" for classical determinantal identities like the Cauchy--Binet formula, Dodgson's condensation formula, the Plücker relations and Laplace's expansion. Also, a determinantal identity generalizing Dodgson's condensation formula is presented, which m…
We give new definitions for the determinant over commutative ring $K$, noncommutative ring $\mathbf{K}$, noncommutative ring $\mathcal{K}$ with associative powers, over noncommutative nonassociative ring $\mathfrak{K}$, and study their properties.
In this paper, we evaluate determinants of some families of Toeplitz-Hessenberg matrices having tribonacci number entries. These determinant formulas may also be expressed equivalently as identities that involve sums of products of multinomial coefficients and tribonacci numbers. In particular, we establish a connection between the tribonacci and the Fibonacci and Padovan sequences via Toeplitz-Hessenberg determinants. We then obtain, by combinatorial arguments, extensions of our determinant formulas in terms of generalized tribonacci sequences satisfying an r-th order recurrence of a more gen…
We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several tableau formulas for difference operators in Types A and C, as well as other operators that appear in the "enriched", or "back-stable" Schubert polynomials. There are also tableau formulas for the enriched Schubert polynomials for vexillary and $321$-avoiding permutations.
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the inverse of the Vandermonde matrix. Then we derive a recurrence formula for sums of powers, which is similar to the well-known Newton identity. In the last section, we consider some sequences given by a homologous linear recurrence equation. A determinantal identity for the Fibonacci numbers of higher order is proved. We finish with an expression of the generalize…
We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas polynomials and certain orthogonal polynomials. These identities naturally generalize the determinant identities obtained by Alfred, Carlitz, Prodinger, Tangboonduangjit and Thanatipanonda.
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph coloring, and prove that they may be efficiently represented in terms of matrix minors. Using this viewpoint, we provide new proofs of several standard determinant formulas and a new generalization of the Jacobi determinant theorem.
Results of this paper concern $n$-determinants which we defined in the paper \cite{jan}. In the paper \cite{jabo}, $2$-determinants are considered. In this paper, we extend results from \cite{jabo} on $n$-determinants by proving that Cassini, d'Ocagne, Catalan and Vajda identities may be extended to hold for $n$-step Fibonacci numbers.
Graphical condensation is a technique used to prove combinatorial identities among numbers of perfect matchings of plane graphs. Propp and Kuo first applied this technique to prove identities for bipartite graphs. Yan, Yeh, and Zhang later applied graphical condensation to nonbipartite graphs to prove more complex identities. Here we generalize some of the identities of Yan, Yeh, and Zhang. We also describe the latest generalization of graphical condensation in which the number of perfect matchings of a plane graph is expressed as a Pfaffian or a determinant where the entries are also numbers …
We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices, namely totally stable matrices and totally upper matrices.
In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix. Also, we derive a determinantal expression of Fibonacci and Lucas numbers. We prove Binets formula for Fibonacci and Lucas numbers in a purely combinatorial way and in course of doing so, we find a determinantal identity, which we think to be new.
We present new identities for determinants of matrices $(A_{i,j})$ with entries $A_{i,j}$ equal to $a_{i,j}$ or $a_{i,0}a_{0,j}-a_{i,j}$, where the $a_{i,j}$'s are indeterminates. We show that these identities are behind trace identities for $SL(2,\Bbb C)$ matrices found earlier by Magnus in his study of trace algebras.
We obtain several determinant evaluations, related to affine root systems, which provide elliptic extensions of Weyl denominator formulas. Some of these are new, also in the polynomial special case, while others yield new proofs of the Macdonald identities for the seven infinite families of irreducible reduced affine root systems.
We present a ``method'' for bijective proofs for determinant identities, which is based on translating determinants to Schur functions by the Jacobi--Trudi identity. We illustrate this ``method'' by generalizing a bijective construction (which was first used by Goulden) to a class of Schur function identities, from which we shall obtain bijective proofs for Dodgson's condensation formula, Plücker relations and a recent identity of the second author.
We prove, by simple manipulation of commutators, two noncommutative generalizations of the Cauchy-Binet formula for the determinant of a product. As special cases we obtain elementary proofs of the Capelli identity from classical invariant theory and of Turnbull's Capelli-type identities for symmetric and antisymmetric matrices.
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
We characterize genus g canonical curves by the vanishing of combinatorial products of g+1 determinants of Brill-Noether matrices. This also implies the characterization of canonical curves in terms of (g-2)(g-3)/2 theta identities. A remarkable mechanism, based on a basis of H^0(K_C) expressed in terms of Szego kernels, reduces such identities to a simple rank condition for matrices whose entries are logarithmic derivatives of theta functions. Such a basis, together with the Fay trisecant identity, also leads to the solution of the question of expressing the determinant of Brill-Noether matri…
Michael Somos conjectured a relation between Hankel determinants whose entries $\frac 1{2n+1}\binom{3n}n$ count ternary trees and the number of certain plane partitions and alternating sign matrices. Tamm evaluated these determinants by showing that the generating function for these entries has a continued fraction that is a special case of Gauss's continued fraction for a quotient of hypergeometric series. We give a systematic application of the continued fraction method to a number of similar Hankel determinants. We also describe a simple method for transforming determinants using the genera…
We obtain a common generalization of two types of Sylvester formulas for compound determinants and its Pfaffian analogue. As applications, we give generalizations of the Giambelli identity to skew Schur functions and the Schur identity to Schur's skew $Q$-functions.
Resorting to the recursions satisfied by the polynomials which converge to the right hand sides of the Rogers-Ramanujan type identities given by Sills and a determinant method presented in a paper by Ismail-Prodinger-Stanton, we obtain many new one-parameter generalizations of the Rogers-Ramanujan type identities, such as a generalization of the analytic versions of the first and second Göllnitz-Gordon partition identities, and generalizations of the first, second, and third Rogers-Selberg identities.
The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial derivatives. In this paper we present straightforward combinatorial proofs of a variety of Cayley-type identities, both old and new. The most powerful of these proofs employ Grassmann algebra (= exterior algebra) and Grassmann-Berezin integration. Among the new identities proven here are a pair of "diagonal-parametrized" Cayley identities, a pair of "Laplacian-par…
In this paper we give Pfaffian expressions and constant term identities for the enumeration problems presented by Mills, Robbins and Rumsey (``Self-complementary totally symmetric plane partitions'' J. Combin. Theory Ser. A, 42, 277--292), concerning the totally symmetric self-complementary plane partitions (TSSCPPs). We also present some new conjectures and give Pfaffian expressions for them.
We prove a double binomial sum identity which differs from most binomial sum identities in that the summands involve the absolute value function. The identity is of interest because it can be used in proofs of lower bounds for the Hadamard maximal determinant problem. Our proof of the identity uses a two-variable variant of the method of telescoping sums.
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that the number of shifted plane partitions invariant under an involution is equal to the number of alternating sign matrices invariant under the vertical flip. We also give a determinantal formula for the general conjecture (Conjecture 6), but this determinant is still hard to evaluate. In this paper we introduce two new classes of domino plane partitions, one …
We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the unique $1$ in the top row. We prove that the expansion can be expressed as a sum over totally symmetric plane partitions and we are also able to determine the coefficients. This establishes a new connection between alternating sign matrices and a class of plane partitions, thereby complementing the fact that alternating sign matrices are equinumerous with totall…
A multilateral Bailey Lemma is proved, and multiple analogues of the Rogers--Ramanujan identities and Euler's Pentagonal Theorem are constructed as applications. The extreme cases of the Andrews--Gordon identities are also generalized using the multilateral Bailey Lemma where their final form is written in terms of determinants of theta functions.
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem, including the case of noncommutative variables and of determinant of space matrices.
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses Fuglede-Kadison determinants, while another uses effective resistance. We use the latter to prove that tree entropy respects stochastic domination. We also prove that tree entropy is non-negative in the unweighted case, a special case of which establishes Lueck's Determinant Conjecture for Cayley-graph Laplacians. We use techniques from the theory of operators affi…
We show that 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 a discussion of the computation…
An elliptic $BC_n$ generalization of the classical two parameter Bailey Lemma is proved, and a basic one parameter $BC_n$ Bailey Lemma is obtained as a limiting case. Several summation and transformation formulas associated with the root system $BC_n$ are proved as applications, including a $_6ϕ_5$ summation formula, a generalized Watson transformation and an unspecialized Rogers--Selberg identity. The last identity is specialized to give an infinite family of multilateral Rogers--Selberg identities. Standard determinant evaluations are then used to compute $B_n$ and $D_n$ generalizations of t…
We present some Pfaffian identities, which are completely different from the Plücker relations. As consequences we obtain a quadratic identity for the number of perfect matchings of plane graphs, which has a simpler form than the formula by Yan et al (Graphical condensation of plane graphs: a combinatorial approach, Theoret. Comput. Sci., to appear), and we also obtain some new determinant identities.
We prove that, for $X$, $Y$, $A$ and $B$ matrices with entries in a non-commutative ring such that $[X_{ij},Y_{k\ell}]=-A_{i\ell} B_{kj}$, satisfying suitable commutation relations (in particular, $X$ is a Manin matrix), the following identity holds: $ \mathrm{coldet} X \mathrm{coldet} Y = < 0 | \mathrm{coldet} (a A + X (I-a^{\dagger} B)^{-1} Y) |0 > $. Furthermore, if also $Y$ is a Manin matrix, $ \mathrm{coldet} X \mathrm{coldet} Y =\int \mathcal{D}(ψ, ψ^{\dagger}) \exp [ \sum_{k \geq 0} \frac{1}{k+1} (ψ^{\dagger} A ψ)^{k} (ψ^{\dagger} X B^k Y ψ) ] $. Notations: $ < 0 |$, $| 0 >$, are respec…
The Capelli identities claim $det(A)det(B) = det(AB+correction)$ for certain matrices with noncommutative entries. They have applications in representation theory and integrable systems. We propose new examples of these identities, constructed according to the following principle. For several known identities for $n$ by $n$ matrices we construct new identity for $2n$ by $2n$ matrices where each element $z$ of the original matrix is substituted by 2x2 matrix of the form $[real(z) ~imag(z); ~ -imag(z) ~ real(z)]$, i.e. we view the original identity as complex valued, while the new identity is it…
Our results revolve around a new operation on partitions, which we call overlap. We prove two overlap identities for so-called Littlewood-Schur functions. Littlewood-Schur functions are a generalization of Schur functions, whose study was introduced by Littlewood. More concretely, the Littlewood-Schur function $LS_λ(X; Y)$ indexed by the partition $λ$ is a polynomial in the variables $X \cup Y$ that is symmetric in both $X$ and $Y$ separately. The first overlap identity represents $LS _λ(X; Y)$ as a sum over subsets of $X$, while the second overlap identity essentially represents $LS_λ(X; Y)$ …
We give combinatorial proofs of $q$-Stirling identities using restricted growth words. This includes a poset theoretic proof of Carlitz's identity, a new proof of the $q$-Frobenius identity of Garsia and Remmel and of Ehrenborg's Hankel $q$-Stirling determinantal identity. We also develop a two parameter generalization to unify identities of Mercier and include a symmetric function version.
This paper studies Zeilberger's two prized constant term identities. For one of the identities, Zeilberger asked for a simple proof that may give rise to a simple proof of Andrews theorem for the number of totally symmetric self complementary plane partitions. We obtain an identity reducing a constant term in $2k$ variables to a constant term in $k$ variables. As applications, Zeilberger's constant terms are converted to single determinants. The result extends for two classes of matrices, the sum of all of whose full rank minors is converted to a single determinant. One of the prized constant …
We evaluate the Hankel determinants of various sequences related to Bernoulli and Euler numbers and special values of the corresponding polynomials. Some of these results arise as special cases of Hankel determinants of certain sums and differences of Bernoulli and Euler polynomials, while others are consequences of a method that uses the derivatives of Bernoulli and Euler polynomials. We also obtain Hankel determinants for sequences of sums and differences of powers and for generalized Bernoulli polynomials belonging to certain Dirichlet characters with small conductors. Finally, we collect a…
By studying Cameron's operator in terms of determinants, two kinds of "integer" sequences of incomplete numbers were introduced. One was the sequence of restricted numbers, including $s$-step Fibonacci sequences. Another was the sequence of associated numbers, including Lamé sequences of higher order. By the classical Trudi's formula and the inverse relation, more expressions were able to be obtained. These relations and identities can be extended to those of sequence of negative integers or rational numbers. As applications, we consider hypergeometric Bernoulli, Cauchy and Euler numbers with …
We introduce a new family $\mathcal{A}_{n,k}$ of Schur positive symmetric functions, which are defined as sums over totally symmetric plane partitions. In the first part, we show that, for $k=1$, this family is equal to a multivariate generating function involving $n+3$ variables of objects that extend alternating sign matrices (ASMs), which have recently been introduced by the authors. This establishes a new connection between ASMs and a class of plane partitions, thereby complementing the fact that ASMs are equinumerous with totally symmetric self-complementary plane partitions as well as wi…
I conjecture three identities for the determinant of adjacency matrices of graphene triangles and trapezia with Bloch (and more general) boundary conditions. For triangles, the parametric determinant is equal to the characteristic polynomial of the symmetric Pascal matrix. For trapezia it is equal to the determinant of a sub-matrix. Finally, the determinant of the tight binding matrix equals its permanent. The conjectures are supported by analytic evaluations and Mathematica, for moderate sizes. They establish connections with counting problems of partitions, lozenge tilings of hexagons, dense…
We give a new Jacobi--Trudi-type formula for characters of finite-dimensional irreducible representations in type $C_n$ using characters of the fundamental representations and non-intersecting lattice paths. We give equivalent determinant formulas for the decomposition multiplicities for tensor powers of the spin representation in type $B_n$ and the exterior representation in type $C_n$. This gives a combinatorial proof of an identity of Katz and equates such a multiplicity with the dimension of an irreducible representation in type $C_n$. By taking certain specializations, we obtain identitie…
A special case of a fundamental result of Loewner and Horn [Trans. Amer. Math. Soc. 1969] says that given an integer $n \geq 1$, if the entrywise application of a smooth function $f : (0,\infty) \to \mathbb{R}$ preserves the set of $n \times n$ positive semidefinite matrices with positive entries, then $f$ and its first $n-1$ derivatives are non-negative on $(0,\infty)$. In a recent joint work with Belton-Guillot-Putinar [J. Eur. Math. Soc., in press], we proved a stronger version, and used it to strengthen the Schoenberg-Rudin characterization of dimension-free positivity preservers [Duke Mat…
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if the constraint matrix is bimodular, that is, the determinants are bounded in absolute value by two. Determinants are also used to bound the $\ell_1$-distance between IP solutions and solutions of its linear relaxation. One of the first works to quantify the complexity of IPs with bounded determinants was that of Heller, who identified the maximum number of dif…
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for Fibonacci numbers are proved. We also show that numbers of compositions of a natural number with fixed number of ones appear as coefficients of characteristic polynomial of a Hessenberg matrix which determinant is a Fibonacci number. We derive the explicit formula for the number of such compositions, in terms of convolutions of Fibonacci numbers.
