Related papers: On Vandermonde determinants via $n$-determinants

In this paper we prove some combinatorial identities which can be considered as generalizations and variations of remarkable Chu-Vandermonde identity. These identities are proved by using an elementary combinatorial-probabilistic approach…

We give general lower bounds on the maximal determinant of n by n {+1,-1}-matrices, both with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier results of de Launey and Levin (2010) and, for certain…

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…

By using Schur transformed sequences and Dyukarev-Stieltjes parameters we obtain a new representation of the resolvent matrix corresponding to the truncated matricial Stieltjes moment problem. Explicit relations between orthogonal matrix…

We obtain general identities for the product of two Schur functions in the case where one of the functions is indexed by a rectangular partition, and give their t-analogs using vertex operators. We study subspaces forming a filtration for…

We show that the action of classical operators associated to the Macdonald polynomials on the basis of Schur functions, S_{\lambda}[X(t-1)/(q-1)], can be reduced to addition in \lambda-rings. This provides explicit formulas for the…

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…

Some generalized multi-sum Chu-Vandermonde identities are presented and proved, generalizing some known multi-sum Chu-Vandermonde identities from literature and adding some quadratic and cubic examples of these identities. Some other…

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

Given two polynomials f(x) and g(x), we extend the formula expressing the remainder in terms of the roots of these two polynomials to the case where f(x) is a Laurent polynomial. This allows us to give new expressions of a Schur function,…

From the irreducible decompositions' point of view, the structure of the cyclic $GL_n$-module generated by the $\alpha$-determinant degenerates when $\alpha=\pm \frac1k (1\leq k\leq n-1)$. In this paper, we show that $-\frac1k$-determinant…

We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key…

We present a different proof of the characterization of non--degenerate recurrence sequences, which are also divisibility sequences, given by Van der Poorten, Bezevin, and Petho in their paper "A Full Characterisation of Divisibility…

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…

We derive an identity that relates a class of multiple integrals involving Vandermonde polynomials to divided differences. Alternatively the identity can be viewed as an integral formula for divided differences. As part of the derivation we…

In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…

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…

Let $\nu_d : \mathbb{P}^n \longrightarrow \mathbb{P}^N$ be the Veronese mapping of degree $d$ where $N = {n+d \choose n} -1$. By an elementary approach it is shown that $\nu_d$ is an isomorphism of $\mathbb{P}^n$ onto the projective variety…

We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…