Coordinate deletion of zeroes

zbMATH Open1420.05173arXiv1901.09814MaRDI QIDQ2325751FDOQ2325751

Eero Räty

Publication date: 30 September 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: For a family $Asubseteqleft{0,dots,kight}^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.

Full work available at URL: https://arxiv.org/abs/1901.09814

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Ordering Integer Vectors for Coordinate Deletions
• scientific article; zbMATH DE number 1420982
• On shadows of intersecting families
• Publication:4945053
• On the shadow of squashed families of \(k\)-sets

zbMATH Keywords

Kruskal-Katona theoremlower shadow

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• An inequality related to the isoperimetric inequality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonexistence of a Kruskal-Katona type theorem for subword orders
• Ordering Integer Vectors for Coordinate Deletions

Cited In (3)

• Title not available (Why is that?)
• Ordering Integer Vectors for Coordinate Deletions
• Uniqueness in Harper's vertex-isoperimetric theorem

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)