Generalized Vandermonde determinants

By H. P. Schlickewei, C. Viola. 2000

68 citations recorded by the source corpus.

This paper is organized as follows: In this chapter we give a general background. In chapter 2 we give some important definitions to be used in the following. In chapter 3 we prove an expression for a generalized Vandermonde determinant (from now on abbreviated as GVD) with λ1 = 2 in terms of the elementary symmetric polynomials en. In chapter 4 we prove an expression for an arbitrary GVD and finally in chapter 5 we discuss how the new results are related to previous work. The GVD are intimately connected to the symmetric group and to partitions as was outlined in [17]. A partition [17] of η ∈ N is any finite sequence

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/b3eeca9f241bfbb3308b5ee841e3103143afe9ae

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Marc E. Pfetsch
2. François Margot

Citations in the corpus

• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing (2012, background): “, [44]), which is easil y een to have full rank as well; see also [34].”