Counting the number of p\(\times q\) integer matrices more concordant than a given matrix (Q1061192)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting the number of p\(\times q\) integer matrices more concordant than a given matrix |
scientific article; zbMATH DE number 3908592
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting the number of p\(\times q\) integer matrices more concordant than a given matrix |
scientific article; zbMATH DE number 3908592 |
Statements
Counting the number of p\(\times q\) integer matrices more concordant than a given matrix (English)
0 references
1985
0 references
The author gives a characterization, an algorithm, and an enumeration formula for sets of integer matrices whose partial sum matrices (all entries to the left and above a given entry) are greater than or equal to those of a given matrix. This gives results on matrices with row, column sums specified.
0 references
nonnegative matrices
0 references
fixed marginals
0 references
Fréchet bounds
0 references
lattice structure
0 references
counting
0 references
more concordant partial ordering
0 references
