Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bmα=(α_1,...,α_p)$ of nonnegative integers such that $α_1+...+α_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of indeterminates. For $\bmα$ and ${\bmβ}$ two $p$-compositions of $n$, define $(\mathbf{x}+\bmα)^{\bmβ} = (x_1+α_1)^{β_1}... x_p+α_p)^{β_p}$. In this paper we prove an explicit formula for the determinant $\det_{\bmα,{\bmβ}\in C(n,p)}((\mathbf{x}+\bmα)^{\bmβ})$. In the case $x_1=...=x_p$ the formula gives a proof of a conjecture by C.~Krattenthaler.
We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in which the number of weak compositions with a fixed number of zeroes is expressed in terms of the number of compositions without zeroes. Then we find a relationship between weak compositions and coefficients of characteristic polynomials of appropriate matrices. Finally, we prove three explicit formulas for weak compositions of a special kind.
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results generalize previous determinant evaluations due to the first and third author [SIAM J. Matrix Anal. Appl. 23 (2001), 459--471] and ["A polynomial generalization of the power-compositions determinant," Linear Multilinear Algebra (to appear)], and they prove two conjectures of the second author ["Advanced determinant calculus: a complement," preliminary version…
We present several generalizations of Cauchy's determinant and Schur's Pfaffian by considering matrices whose entries involve some generalized Vandermonde determinants. Special cases of our formulae include previuos formulae due to S.Okada and T. Sundquist. As an application, we give a relation for the Littlewood--Richardson coefficients involving a rectangular partition.
We present a proof of determinant of special nonsymmetric Toeplitz matrices conjectured by Anđelić and Fonseca in \cite{andjelic2020some}. A proof is also demonstrated for a more general theorem. The two conjectures are therefore just two possible results, under two specific settings. Numerical examples validating the theorem are provided.
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 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 indepen…
We give a generalization and a short mechanized proof of determinant conjectured by G. Kuperberg and J. Propp. Further generalizations and applications of the method to some q-analogues may be found in http://www.math.temple.edu/~tewodros
Recently I. Mezo studied a simple but interesting generalization of the exponential polynomials. In this note I consider two q-analogues of these polynomials and compute their Hankel determinants.
In this paper we prove a homogenous generalization of the lambda determinant formula of Mills, Robbins and Rumsey. In our formula the parameters depends on two indices. Our result also extends a recent formula of Di Francesco.
In the literature there are several determinant formulas for Schur functions: the Jacobi-Trudi formula, the dual Jacobi-Trudi formula, the Giambelli formula, the Lascoux-Pragacz formula, and the Hamel-Goulden formula, where the Hamel-Goulden formula implies the others. In this paper we use an identity proved by Bazin in 1851 to derive determinant identities involving Macdonald's 9th variation of Schur functions. As an application we prove a determinant identity for factorial Schur functions conjectured by Morales, Pak, and Panova. We also obtain a generalization of the Hamel-Goulden formula, w…
The Gram determinant of type $A$ was introduced by Lickorish in his work on invariants of 3 - manifolds. We generalize the theory of the Gram determinant of type $A$ by evaluating, in the annulus, a bilinear form of non-intersecting connections in the disc. The main result provides a closed formula for this Gram determinant. We conclude the paper by discussing Chen's conjecture about the Gram determinant of type $Mb$ evaluated in the Klein bottle.
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.
In this note we introduce a determinant and then give its evaluating formula. The determinant turns out to be a generalization of the well-known ballot and Fuss-Catalan numbers, which is believed to be new. The evaluating formula is proved by showing that the determinant coincides with the number of lattice paths with (1,0), (0,1)-steps in the plane that stay below a boundary line of rational slope.
Young tableaux are ubiquitous in various branches of mathematics. There are two counting formulas for standard Young tableaux. The first involves a determinant and goes back to Frobenius and Young, and the second is the hook formula by Frame, Robinson and Thrall. We present a generalization of the determinant formula for semistandard Young tableaux of given shape and of given content. Our counting formula -- though not a determinant -- is a generalization of the determinant formula by Frobenius and Young.
We present a variation and generalization of a determinant evaluation of Wilf (math.CO/9809120). His result concerns a matrix whose entries are the coefficients of powers of a given power series; we replace the powers by repeated compositions and obtain similar results.
As an application of linear algebra for enumerative combinatorics, we introduce two new ideas, signed bigrassmannian polynomials and bigrassmannian determinant. First, a signed bigrassmannian polynomial is a variant of the statistic given by the number of bigrassmannian permutations below a permutation in Bruhat order as Reading suggested (2002) and afterward the author developed (2011). Second, bigrassmannian determinant is a $q$-analog of the determinant with respect to our statistic. It plays a key role for a determinantal expression of those polynomials. We further show that bigrassmannian…
In previous paper, the author applied the permanent-determinant method of Kasteleyn and its non-bipartite generalization, the Hafnian-Pfaffian method, to obtain a determinant or a Pfaffian that enumerates each of the ten symmetry classes of plane partitions. After a cosmetic generalization of the Kasteleyn method, we identify the matrices in the four determinantal cases (plain plane partitions, cyclically symmetric plane partitions, transpose-complement plane partitions, and the intersection of the last two types) in the representation theory of sl(2,C). The result is a unified proof of the fo…
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.
In this paper we give the absolutely new proof of a conjecture of R.F.Scott(1881) on the permanent of a Cauchy matrix $\ls \frac{1}{x_i-y_j} \rs_{1 \leqslant i,j \leqslant n},$ where $x_1, ..., x_n$ and $y_1, ..., y_n$ are the distinct roots of the polynomials $x^n-1$ and $y^n +1,$ respectively. The simple formula is given for the permanent of the Cauchy matrix $A= \ls \frac{1}{x_i-y_j} \rs_{1 \leqslant i,j \leqslant n},$ where $x_1, ..., x_n$ and $y_1, ..., y_n$ are the distinct roots of the polynomials $x^n+a$ and $y^n +b$, respectively: \begin{gather*} \per (A) =\frac{n}{(b-a)^n} \prod_{k=1…
Motivated by the Gaussian symplectic ensemble, Mehta and Wang evaluated the $n$ by $n$ determinant $\det((a+j-i)Γ(b+j+i))$ in 2000. When $a=0$, Ciucu and Krattenthaler computed the associated Pfaffian $\Pf((j-i)Γ(b+j+i))$ with an application to the two dimensional dimer system in 2011. Recently we have generalized the latter Pfaffian formula with a $q$-analogue by replacing the Gamma function by the moment sequence of the little $q$-Jacobi polynomials. On the other hand, Nishizawa has found a $q$-analogue of the Mehta--Wang formula. Our purpose is to generalize both the Mehta-Wang and Nishizaw…
We evaluate a determinant of generalized Fibonacci numbers, thus providing a common generalization of several determinant evaluation results that have previously appeared in the literature, all of them extending Cassini's identity for Fibonacci numbers.
We introduce a multi-parameter generalization of the Lambda-determinant of Robbins and Rumsey, based on the cluster algebra with coefficients attached to a T-system recurrence. We express the result as a weighted sum over alternating sign matrices.
I study Hankel determinants of a class of sequences which can be interpreted as generalizations of the Catalan numbers and the central binomial coefficients. They follow a modular pattern with a frequent appearance of zeroes, so that the theory of orthogonal polynomials is not applicable. Even so our theorems and conjectures show some similarity with the relations between Catalan numbers and Fibonacci polynomials or between central binomial coefficients and Lucas polynomials.
Starting with some determinants of binomial coefficients which are related to Fibonacci and Lucas polynomials we study similar determinants for some generalizations of these polynomials and their q-analogues.
We interpret a formula established by Lapid-M\'ınguez on real regular representations of ${\rm GL}_n$ over a local non-archimedean field as a matrix determinant. We use the Lewis Carroll determinant identity to prove new relations between real regular representations. Through quantum affine Schur-Weyl duality, these relations generalize Mukhin-Young's Extended $T$-systems, for representations of the quantum affine algebra $U_q(\widehat{\mathfrak{sl}}_k)$, which are themselves generalizations of the celebrated $T$-system relations.
