pith. sign in

arxiv: math/0601756 · v1 · submitted 2006-01-31 · 🧮 math.CO

A polynomial generalization of the power-compositions determinant

classification 🧮 math.CO
keywords alphabetamathbfcompositionsdeterminantformulacaseconjecture
0
0 comments X
read the original abstract

Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of indeterminates. For $\bm{\alpha}$ and ${\bm{\beta}}$ two $p$-compositions of $n$, define $(\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_{\bm{\alpha},{\bm{\beta}}\in C(n,p)}((\mathbf{x}+\bm{\alpha})^{\bm{\beta}})$. In the case $x_1=...=x_p$ the formula gives a proof of a conjecture by C.~Krattenthaler.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.