Coordinate deletion of zeroes
From MaRDI portal
Publication:2325751
Abstract: For a family , define the -shadow of to be the set obtained from by removing from any of its vectors one coordinate that equals zero. Given the size of , how should we choose to minimise its -shadow? Our aim in this paper is to show that, for any , the family of all sequences with at most zeros has minimal -shadow. We actually give the exact best for every size.
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.
Recommendations
Cites work
- An inequality related to the isoperimetric inequality
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Nonexistence of a Kruskal-Katona type theorem for subword orders
- Ordering Integer Vectors for Coordinate Deletions
Cited in
(3)
This page was built for publication: Coordinate deletion of zeroes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325751)