Change search
ReferencesLink to record
Permanent link

Direct link
A combinatorial theory of higher-dimensional permutation arrays
2000 (English)In: Advances in Applied Mathematics, ISSN 0196-8858, E-ISSN 1090-2074, Vol. 25, no 2, 194-211 p.Article in journal (Refereed) Published
Abstract [en]

We define a class of hypercubic (shape [n](d)) arrays that in a certain sense are d-dimensional analogs of permutation matrices with our motivation from algebraic geometry. Various characterizations of permutation arrays are proved. an efficient generation algorithm is given, and enumerative questions are discussed although not settled. There is a partial order on the permutation arrays, specializing to the Bruhat order on S-n, when d equals 2, and specializing to the lattice of partitions of a d-set when n equals 2.

Place, publisher, year, edition, pages
2000. Vol. 25, no 2, 194-211 p.
Keyword [en]
permutations, high-dimensional, flags, intersections, Bruhat order, partition lattice
URN: urn:nbn:se:kth:diva-20017ISI: 000089174400003OAI: diva2:338710
QC 20100525Available from: 2010-08-10 Created: 2010-08-10Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Linusson, Svante
In the same journal
Advances in Applied Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 9 hits
ReferencesLink to record
Permanent link

Direct link