Article
Integral Majorization Polytopes
Discrete Mathematics, Algorithms and Applications
Document Type
Article
Publication Date
9-1-2013
Keywords
- Ferrers diagram; Integer partition; Majorization; Polytope
Disciplines
Abstract
The majorization polytope M(a) consists of all vectors dominated (or majorized, to be precise) by a given vector a ∈ ℝn; this is a polytope with extreme points being the permutations of a. For integral vector a, let ν(a) be the number of integral vectors contained in M(a). We present several properties of the function ν and provide an algorithm for computing ν(a).
DOI
10.1142/S1793830913500195
Citation Information
Fuzhen Zhang and Geir Dahl. "Integral Majorization Polytopes" Discrete Mathematics, Algorithms and Applications Vol. 5 Iss. 3 (2013) p. 12pp ISSN: 1793-8309 Available at: http://works.bepress.com/fuzhen-zhang/58/
AMSC: 52B05, 05A17, 15A39