Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-08T15:27:03.212Z Has data issue: false hasContentIssue false
  • English
  • Français

ORDERING INTEGER VECTORS FOR COORDINATE DELETIONS

Published online by Cambridge University Press:  01 June 1997

TRAN-NGOC DANH  and
DAVID E. DAYKIN
TRAN-NGOC DANH
Affiliation:
Department of Mathematics, University of Ho Chi Min City, Ho Chi Min City, Vietnam
DAVID E. DAYKIN
Affiliation:
Department of Mathematics, University of Reading
Get access

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
Journal of the London Mathematical Society , Volume 55 , Issue 3 , June 1997 , pp. 417 - 426
Copyright
The London Mathematical Society 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)