Premium
Ordering Integer Vectors for Coordinate Deletions
Author(s) -
Danh TranNgoc,
Daykin David E.
Publication year - 1997
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/s0024610797004821
Subject(s) - cardinality (data modeling) , shadow (psychology) , integer (computer science) , combinatorics , dimension (graph theory) , set (abstract data type) , mathematics , vector space , discrete mathematics , computer science , geometry , data mining , psychology , psychotherapist , programming language
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.