---
title: Bivariate Vandermonde Determinants
url: https://www.emergentmind.com/topics/bivariate-vandermonde-determinants
type: topic
---

# Bivariate Vandermonde Determinants

Searching arXiv for the specified paper and closely related work on bivariate and multivariable Vandermonde determinants.
arXiv search query: "bivariate Vandermonde determinants diagonal coinvariant ring Dyck paths Jiang"
Bivariate Vandermonde determinants are determinant constructions in which the classical univariate Vandermonde matrix is replaced by a matrix built from bivariate monomials, bivariate polynomial families, or products of linear forms evaluated at pairs of variables or points. In the recent literature, the term encompasses several non-equivalent but structurally related objects: determinants of the form $\Delta_X(x,y)=\det[x_i^{\alpha_j}y_i^{\beta_j}]$, grid-Vandermonde matrices with rows $(1,x_i,\dots,x_i^{a-1})\otimes(1,y_i,\dots,y_i^{b-1})$, evaluation matrices $[p(a_r,b_s)]$ for homogeneous $p(x,y)$, and projective Veronese-block determinants attached to linear forms. These constructions share the characteristic feature that antisymmetry, collision loci, and factorization phenomena are controlled by one-variable Vandermonde factors, but they arise in different mathematical settings, including diagonal coinvariants, interpolation on tensor-product grids, symmetric-function expansions, and projective intersection theory [2508.12521].

## 1. Definitions and principal matrix models

One standard definition fixes $n$ and a sequence of $n$ pairs of nonnegative integers
$$
X=((\alpha_1,\beta_1),(\alpha_2,\beta_2),\dots,(\alpha_n,\beta_n)),
$$
and sets
$$
\Delta_X(x,y)=\det\bigl[x_i^{\alpha_j}y_i^{\beta_j}\bigr]_{1\le i,j\le n}.
$$
Equivalently, if $X$ is viewed as an $n\times 2$ matrix of exponents, then $\Delta_X$ is the determinant of the $n\times n$ matrix whose $(i,j)$-entry is $x_i^{\alpha_j}y_i^{\beta_j}$ [2508.12521]. This is the form used in the study of alternating diagonal coinvariants.

A second model arises from tensor-product grids. If $X=\{x_1,\dots,x_m\}$, $Y=\{y_1,\dots,y_n\}$, and $P(x)\in\mathbb R^{m\times n}[x]$, $Q(y)\in\mathbb R^{m\times n}[y]$, then the Hadamard product $P\odot Q$ defines bivariate polynomials $p_{i,j}(x,y)=P_{i,j}(x)Q_{i,j}(y)$, and the associated Vandermonde matrix on $A:=X\times Y$ has determinant
$$
(X\times Y,P\odot Q)=\det\bigl[P_{i,j}(x_r)Q_{i,j}(y_s)\bigr]_{(r,s),(i,j)}.
$$
This is the framework in which variables separate on almost-square tensor-product grids [1311.6455].

A third formulation starts from a homogeneous polynomial
$$
p(x,y)=\sum_{i=0}^k \alpha_i x^{k-i}y^i
$$
and vectors $a=(a_1,\dots,a_n)$, $b=(b_1,\dots,b_n)\in\mathbb C^n$. The evaluation matrix
$$
A_{a,b}(p):=[p(a_r,b_s)]_{1\le r,s\le n}
$$
admits the factorization
$$
A_{a,b}(p)=V_a^{(k)}D_\alpha (W_b^{(k)})^T,
$$
where $V_a^{(k)}=[a_r^{k-j}]$, $W_b^{(k)}=[b_s^j]$, and $D_\alpha=\operatorname{diag}(\alpha_0,\dots,\alpha_k)$ [2601.17626].

A fourth model is the grid-Vandermonde matrix
$$
V_{(a,b)}(x,y)=\bigl\{x_i^r y_i^s \mid 0\le r\le a-1,\ 0\le s\le b-1\bigr\}_{1\le i\le ab},
$$
whose $i$th row is
$$
(1,x_i,\dots,x_i^{a-1})\otimes (1,y_i,\dots,y_i^{b-1}).
$$
This is the bivariate specialization of multivariable Vandermonde determinants obtained from amalgams of matrices [2604.20390].

| Framework | Determinant / matrix | Structural feature |
|---|---|---|
| Exponent-pair determinant | $\Delta_X(x,y)=\det[x_i^{\alpha_j}y_i^{\beta_j}]$ | Alternating basis elements in $DR_n$ |
| Separated-variable grid | $(X\times Y,P\odot Q)$ | Product factorization into univariate determinants |
| Homogeneous evaluation matrix | $A_{a,b}(p)=[p(a_r,b_s)]$ | Rank bound and closed square-case formula |
| Grid-Vandermonde | $V_{(a,b)}(x,y)$ | Separation as a sum of factorizing terms |

The coexistence of these models shows that the phrase “bivariate Vandermonde determinant” does not denote a single canonical object. This suggests that the subject is best understood as a family of determinant identities organized by the choice of bivariate basis and by the geometry of the evaluation set.

## 2. Alternating diagonal coinvariants and Dyck-path indexing

In the diagonal-coinvariant setting, Jiang gives an explicit basis for the alternating part $\mathcal A$ of the diagonal coinvariant ring $DR_n$ in terms of bivariate Vandermonde determinants, answering a question of Stump [2508.12521]. The indexing set is the set
$$
L^+_{n,n}=\{\pi\in\{N,E\}^{2n}:\pi\text{ ends at }(n,n)\text{ and lies weakly above the line }y=x\}
$$
of ordinary Dyck paths of semilength $n$.

For each $\pi\in L^+_{n,n}$, two integer sequences of length $n$ are defined. The first is the usual area-sequence
$$
\operatorname{area}(\pi)=(a_1(\pi),\dots,a_n(\pi)).
$$
The second is the dinv-sequence
$$
d_i(\pi)=\left|\left\{j>i: a_j(\pi)\in\{a_i(\pi),a_i(\pi)-1\}\right\}\right|,
$$
so that
$$
\operatorname{dinv}(\pi)=(d_1(\pi),\dots,d_n(\pi)).
$$
From these statistics one forms
$$
X(\pi)=\bigl((d_1(\pi),a_1(\pi)),(d_2(\pi),a_2(\pi)),\dots,(d_n(\pi),a_n(\pi))\bigr).
$$

The main theorem states that
$$
\{\Delta_{X(\pi)}(x,y)\mid \pi\in L^+_{n,n}\}
$$
is a $\mathbb C$-basis of the alternating component $\mathcal A$ of $DR_n$ [2508.12521]. Concretely,
$$
\Delta_{X(\pi)}(x,y)=\det\bigl[x_i^{d_j}y_i^{a_j}\bigr]_{1\le i,j\le n}.
$$
Each such determinant is manifestly alternating under the simultaneous permutation of the index set $\{1,\dots,n\}$ in $(x_1,\dots,x_n)$ and in $(y_1,\dots,y_n)$, so it transforms by the sign character under the diagonal $S_n$-action.

The proof combines several structural facts. No two pairs $(d_i,a_i)$ coincide for a single $\pi$, so each determinant is nonzero. If $\pi\neq\pi'$, then $X(\pi)$ and $X(\pi')$ are distinct as multisets of pairs, so the determinants are distinct. Finally, $|L^+_{n,n}|$ is the $n$th Catalan number $\operatorname{Cat}_n$, which equals $\dim \mathcal A$. These facts together show that the Catalan-many determinants are linearly independent and span exactly $\mathcal A$ [2508.12521].

The significance of this construction is twofold. First, it gives an explicit $S_n$-alternating basis formed by bivariate Vandermonde-type determinants. Second, it provides a direct combinatorial description of the alternating part of the diagonal coinvariant ring in terms of Dyck-path statistics. In this setting, bivariate Vandermonde determinants are not merely interpolation devices; they are canonical basis vectors in a representation-theoretic object.

## 3. Separation of variables on tensor-product grids

A distinct line of work studies bivariate Vandermonde determinants on tensor-product grids whose variables separate. Let $|X|=m$, $|Y|=n$, with $n=m$ or $n=m+1$, and suppose $P(x)$ and $Q(y)$ satisfy the block-semiseparable structure described in equation (1) of the paper, with $p_j(x)$ and $q_j(y)$ monic of degree $j$ for $j=1,\dots,n-1$. Then
$$
(X\times Y,P\odot Q)
=\pm\Bigl(\prod_{j=1}^n (X,P_{:,j})\Bigr)\cdot \Bigl(\prod_{i=1}^m (Y,Q_{i,:})\Bigr),
$$
where $(X,P_{:,j})$ is the univariate Vandermonde determinant of the $j$th column of $P$ over $X$, and similarly for $(Y,Q_{i,:})$ [1311.6455].

The proof proceeds by induction. The base case $m=1$ is direct. For general $m$ and $n$, the $mn\times mn$ Vandermonde matrix is written in block form, a univariate factor $(X,P_{:,1})$ is extracted, and the Schur-complement formula is applied to remove the first row-block and first column-block. This introduces a factor $\prod_{j=2}^n (y_j-y_1)^m$ and reduces the size from $(m,n)$ to $(n-1,m)$. After interchanging the roles of $x$ and $y$, the induction hypothesis applies. A key one-variable identity is
$$
(Y,A)=\pm\Bigl(\prod_{j=2}^n (y_j-y_1)\Bigr)\,(\widetilde Y,\widetilde A),
$$
where
$$
\widetilde A(y)=\frac{A(y)-A(y_1)}{y-y_1}.
$$
This reduction shows how two-variable structure can collapse to one-variable determinants under strong separation hypotheses [1311.6455].

The principal application is to Padua and Padua-like points. For even $n$, the Padua-like set is written as $A_n=A_n^o\cup A_n^e$, and for the classical Padua choice $x_i=\cos((i-1)\pi/n)$ and $y_j=\cos((j-1)\pi/(n+1))$ one obtains
$$
(A_n,B_n)=\pm (A_n^o,T_{n/2})\times (A_n^e,T^e_{n/2}),
$$
with
$$
T^e_{n/2}=a(x)\,B_{n/2-1}\cup b(y)\,B_{n/2-1}.
$$
The second factor is exactly of the separated-variable type, so Proposition 3.1 applies and yields a complete factorization of the Padua Vandermonde determinant into one-dimensional determinants in $x$ and $y$ [1311.6455]. This proves in full generality an explicit factorization conjectured in Bos–Vianello (2009).

A frequent misconception is that every bivariate Vandermonde determinant should factor as a single product of univariate Vandermondes. The separated-variable theory shows that such factorization is available under a specific block-semiseparable hypothesis on the polynomial basis and on almost-square tensor-product grids; it is not presented as a universal phenomenon.

## 4. Homogeneous polynomial evaluation matrices

For a homogeneous polynomial
$$
p(x,y)=\sum_{i=0}^k \alpha_i x^{k-i}y^i,
$$
the evaluation matrix $A_{a,b}(p)=[p(a_r,b_s)]$ provides a particularly transparent bridge between bivariate and univariate Vandermonde determinants. Because
$$
A_{a,b}(p)=V_a^{(k)}D_\alpha (W_b^{(k)})^T,
$$
one has
$$
\operatorname{rank}A_{a,b}(p)\le k+1.
$$
Hence if $n\ge k+2$, then $A_{a,b}(p)$ is an $n\times n$ matrix of rank at most $k+1<n$, and therefore
$$
\det A_{a,b}(p)=0
$$
[2601.17626].

The borderline case $n=k+1$ is square, and the determinant becomes explicit:
$$
\det\bigl(A_{a,b}(p)\bigr)
=
(-1)^{\binom{k+1}{2}}
\Bigl(\prod_{i=0}^k \alpha_i\Bigr)
\Bigl(\prod_{1\le i<j\le k+1}(a_j-a_i)\Bigr)
\Bigl(\prod_{1\le i<j\le k+1}(b_j-b_i)\Bigr).
$$
Here $W_b^{(k)}$ is the usual Vandermonde in ascending powers, while $V_a^{(k)}$ differs from the standard form only by reversing columns, which contributes the sign $(-1)^{\binom{k+1}{2}}$ [2601.17626].

Several classical determinants appear as special cases. For $p(x,y)=(x+y)^k$, one recovers the determinant formula with coefficient product $\prod_{i=0}^k \binom{k}{i}$, and vanishing for $n\ge k+2$. For
$$
p(x,y)=\sum_{i=0}^k x^{k-i}y^i,
$$
one has $\alpha_i\equiv 1$ and
$$
p(a,b)=\frac{a^{k+1}-b^{k+1}}{a-b}
$$
when $a\neq b$, so the evaluation matrix agrees with the classical quotient-Vandermonde matrix. For
$$
p(x,y)=\sum_{i=0}^k (-1)^i x^{k-i}y^i,
$$
the sign from $\prod \alpha_i$ cancels the sign from $V_a^{(k)}$, and the determinant is exactly the product of the two ordinary Vandermondes [2601.17626].

When $n\le k$, the factorization is rectangular, so the determinant is expanded by Cauchy–Binet over $n$-element subsets $I\subset\{0,\dots,k\}$. Each minor is a generalized Vandermonde determinant, and standard symmetric-function identities rewrite these minors using complete homogeneous symmetric polynomials $H_m$. This yields a closed expansion
$$
\det A_{a,b}(p)
=
\operatorname{Vand}(a)\operatorname{Vand}(b)
\sum_I
\Bigl(\prod_{i\in I}\alpha_i\Bigr)
\det[H_{\,k-i_j-(n-j)}(a)]
\det[H_{\,i_j-(n-j)}(b)].
$$
In particular, if the support of the $\alpha_i$ has size $<n$, then $\det A=0$ [2601.17626].

The same paper also treats the sum-form $p(x,y)=f(x+y)$, obtaining an explicit determinant formula and an equivariance law under linear changes of variables in $GL_2(\mathbb C)$, and derives a non-vanishing bound over finite fields via the Schwartz–Zippel lemma [2601.17626]. In this framework, the bivariate determinant is controlled entirely by the one-variable Vandermonde determinants in the evaluation vectors and by the coefficient data of $p$.

## 5. Multivariable separation formulae and the bivariate grid-Vandermonde

Brown derives two general separation formulae for multivariable Vandermonde determinants by expressing the full matrix as an amalgam, or rowwise Kronecker product, of smaller Vandermonde matrices. In the bivariate case, with $N_1=a$, $N_2=b$, the determinant is attached to
$$
V_{(a,b)}(x,y),
$$
an $ab\times ab$ matrix whose $i$th row is
$$
(1,x_i,\dots,x_i^{a-1})\otimes(1,y_i,\dots,y_i^{b-1}).
$$
The first formula expresses $\det V_{(a,b)}$ as a sum over pairs of standard tableaux
$$
\alpha\in \operatorname{SYT}(b^a),\qquad \beta\in \operatorname{SYT}(a^b),
$$
with integer coefficients $\Phi_{\alpha,\beta}$, and each term is a product of determinants in fewer variables:
$$
\prod_i \det V_a(\cdots)\;\prod_j \det V_b(\cdots).
$$
The second formula is a fully symmetric $S_{ab}$-sum with sign $\varepsilon(\sigma)$ and hook-length normalization
$$
H_{a,b}=\prod_{i=0}^{b-1}\frac{(a+i)!}{i!}.
$$
Both identities decompose the bivariate determinant into completely factorising one-variable Vandermonde factors [2604.20390].

The $2\times 2$ case is especially explicit. Here
$$
V_{(2,2)}(x,y)=
\begin{pmatrix}
1&x_1&y_1&x_1y_1\\
1&x_2&y_2&x_2y_2\\
1&x_3&y_3&x_3y_3\\
1&x_4&y_4&x_4y_4
\end{pmatrix},
$$
and the first separation formula reduces to the two-term identity
$$
\det V_{(2,2)}
=
(x_2-x_1)(x_4-x_3)(y_3-y_1)(y_4-y_2)
-
(x_3-x_1)(x_4-x_2)(y_2-y_1)(y_4-y_3).
$$
The symmetric form is
$$
\det V_{(2,2)}
=
\frac1{12}\sum_{\sigma\in S_4}\varepsilon(\sigma)\,
(x_{\sigma(2)}-x_{\sigma(1)})(x_{\sigma(4)}-x_{\sigma(3)})
(y_{\sigma(3)}-y_{\sigma(1)})(y_{\sigma(4)}-y_{\sigma(2)}).
$$
Each term manifestly factors as a product of four one-variable Vandermonde factors in the $x_i$’s and $y_i$’s respectively [2604.20390].

This result is structurally different from the separated-variable product formula of the tensor-grid setting. Here the determinant is not represented as one product but as a signed sum of completely factorising terms. That distinction is important: it shows that “separation” can mean exact product factorization in some regimes and tableau-indexed additive decomposition in others.

## 6. Projective identities, Vandermonde-like analogues, and open directions

A projective version of the subject appears in the bivariate specialization of the higher-dimensional Vandermonde determinant identity. In projective $2$-space with homogeneous coordinates $X,Y,Z$, let
$$
\Lambda=(\lambda_0,\lambda_1,\dots,\lambda_{m+1}),
\qquad
\lambda_i=a_iX+b_iY+c_iZ,
$$
and form the Veronese-block matrix $M_\Lambda$ whose rows are the coefficient vectors of all products
$$
\Lambda^\sigma=\prod_{i\in \sigma}\lambda_i
$$
over all $\sigma\subset I$ with $|\sigma|=m$. Then
$$
\det M_\Lambda
=
\prod_{0\le i<j<k\le m+1}
\det
\begin{pmatrix}
a_i&b_i&c_i\\
a_j&b_j&c_j\\
a_k&b_k&c_k
\end{pmatrix}.
$$
In particular, $\det M_\Lambda$ vanishes exactly when some triple of the lines $\{\lambda_i=0\}$ in $\mathbf P^2$ become concurrent [1405.0993]. Here the Vandermonde principle is expressed not through evaluation of monomials at points, but through products of linear forms and a universal concurrency detector.

A different analogue is provided by the CI-matrix, whose entries are elementary symmetric polynomials in all variables except one. If
$$
M_{j,k}=e_{n-j}(u_i:i\in P_k)\quad (1\le j<n),\qquad M_{n,k}=1,
$$
then
$$
\det M(u_1,\dots,u_n)=\prod_{1\le i<j\le n}(u_j-u_i).
$$
Although this matrix is not bivariate, it shows that classical Vandermonde determinants persist under substantial changes of basis: monomials may be replaced by the “omit-one” elementary-symmetric basis without changing the determinant [1910.13858]. This is relevant because many bivariate constructions likewise depend more on collision behavior and degree structure than on a unique preferred basis.

Vandermonde-type determinants also appear in probabilistic applications. The $4\times4$ determinants
$$
F_{m,n}(x,y,z,t)=
\det
\begin{pmatrix}
1&x&x^m&x^n\\
1&y&y^m&y^n\\
1&z&z^m&z^n\\
1&t&t^m&t^n
\end{pmatrix},
\qquad
G_{m,n}(x,y,z,t)=
\det
\begin{pmatrix}
1&x^m&x^n&x^{m+n}\\
1&y^m&y^n&y^{m+n}\\
1&z^m&z^n&z^{m+n}\\
1&t^m&t^n&t^{m+n}
\end{pmatrix}
$$
factor as the full six-factor Vandermonde prefactor
$$
(y-x)(z-x)(t-x)(z-y)(t-y)(t-z)
$$
times multiple sums with strictly positive integer coefficients, and therefore vanish exactly when two of $x,y,z,t$ coincide [1811.09841]. The same work states that finding a fully explicit “bivariate Vandermonde” formula in general remains an open problem.

Taken together, these results delineate the modern scope of the subject. In diagonal coinvariants, bivariate Vandermonde determinants furnish an explicit Catalan basis [2508.12521]. On almost-square tensor-product grids, they factor into one-dimensional determinants [1311.6455]. For homogeneous evaluation matrices, they are governed by rank bounds and closed square-case formulas [2601.17626]. In the grid-Vandermonde setting, they admit separation identities indexed by tableaux and permutations [2604.20390]. In projective geometry and related analogues, they detect concurrency and other collision phenomena [1405.0993]. This suggests that the unifying content of the theory lies not in a single determinant formula, but in a common algebra of antisymmetry, collision divisibility, and basis-dependent factorization.

Source: https://www.emergentmind.com/topics/bivariate-vandermonde-determinants