Article contents
ORDERING INTEGER VECTORS FOR COORDINATE DELETIONS
Published online by Cambridge University Press: 01 June 1997
Abstract
Given a family of sets/vectors of the same cardinality/dimension you get the shadow by deleting one element/coordinate from a set/vector in all possible ways. You find the family with the smallest shadow by ordering all sets/vectors. The set case was solved by Kruskal (1963), and Katona (1966), and has many applications. We study two orderings which solve the 0, 1 vector case, and give the shadow size.
- Type
- Research Article
- Information
- Copyright
- The London Mathematical Society 1997
- 6
- Cited by