Power-product matrix: nonsingularity, sparsity and determinant
Combinatorics
2021-04-13 v1 Rings and Algebras
Abstract
We prove the nonsingularity of a class of integer matrices V(n,d), namely power-product matrix, for positive integers n and d. Some technical proofs are mainly based on linear algebra and enumerative combinatorics, particularly the generating function method and involution principle. We will show that the matrix V(n,d) is nonsingular for all positive integers n and d, and often with sparse structure. Special attention is given to the computation of the determinant V(2,d) with positive integer d.
Keywords
Cite
@article{arxiv.2104.05209,
title = {Power-product matrix: nonsingularity, sparsity and determinant},
author = {Yi-Shuai Niu and Hu Zhang},
journal= {arXiv preprint arXiv:2104.05209},
year = {2021}
}
Comments
18 pages, 1 figure