English

A polynomial generalization of the power-compositions determinant

Combinatorics 2007-05-23 v1

Abstract

Let C(n,p)C(n,p) be the set of pp-compositions of an integer nn, i.e., the set of pp-tuples α=(α1,...,αp)\bm{\alpha}=(\alpha_1,...,\alpha_p) of nonnegative integers such that α1+...+αp=n\alpha_1+...+\alpha_p=n, and x=(x1,...,xp)\mathbf{x}=(x_1,...,x_p) a vector of indeterminates. For α\bm{\alpha} and β{\bm{\beta}} two pp-compositions of nn, define (x+α)β=(x1+α1)β1...xp+αp)βp(\mathbf{x}+\bm{\alpha})^{\bm{\beta}} = (x_1+\alpha_1)^{\beta_1}... x_p+\alpha_p)^{\beta_p}. In this paper we prove an explicit formula for the determinant detα,βC(n,p)((x+α)β)\det_{\bm{\alpha},{\bm{\beta}}\in C(n,p)}((\mathbf{x}+\bm{\alpha})^{\bm{\beta}}). In the case x1=...=xpx_1=...=x_p the formula gives a proof of a conjecture by C.~Krattenthaler.

Keywords

Cite

@article{arxiv.math/0601756,
  title  = {A polynomial generalization of the power-compositions determinant},
  author = {Josep M. Brunat and Antonio Montes},
  journal= {arXiv preprint arXiv:math/0601756},
  year   = {2007}
}

Comments

11 pages, see also http://www-ma2.upc.edu/~montes/

R2 v1 2026-07-22T17:30:52.189Z