Coordinate deletion of zeroes (Q2325751)
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: Coordinate deletion of zeroes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coordinate deletion of zeroes |
scientific article |
Statements
Coordinate deletion of zeroes (English)
0 references
30 September 2019
0 references
Summary: For a family \(A\subseteq\{0,\ldots,k\}^n\), define the \(\delta\)-shadow of \(A\) to be the set obtained from \(A\) by removing from any of its vectors one coordinate that equals zero. Given the size of \(A,\) how should we choose \(A\) to minimise its \(\delta\)-shadow? Our aim in this paper is to show that, for any \(r,\) the family of all sequences with at most \(r\) zeros has minimal \(\delta\)-shadow. We actually give the exact best \(A\) for every size.
0 references
Kruskal-Katona theorem
0 references
lower shadow
0 references
0.7879188060760498
0 references
0.7441167831420898
0 references
0.7113447785377502
0 references