Isoperimetric theorems in the binary sequences of finite lengths

DOI10.1016/S0893-9659(98)00091-3MaRDI QIDQ1808627zbMATH OpenFDO

Authors Rudolf Ahlswede, Ning Cai

Publication date 5 July 2000

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0893-9659(98)00091-3

zbMATH Keywords

binary sequencesdeletionsHamming distanceinsertionsisoperimetric problem

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Extremal set theory (05D05) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 3318606
• Isoperimetry in integer lattices
• Isoperimetric sets of integers
• scientific article; zbMATH DE number 18980
• scientific article; zbMATH DE number 2133152
• Isoperimetric Problem and Meta-fibonacci Sequences
• Isoperimetric inequalities for densities of lattice-periodic sets
• scientific article; zbMATH DE number 736286
• scientific article; zbMATH DE number 4039793
• The polytope of binary sequences with bounded variation

Cites work

• scientific article; zbMATH DE number 3570458 (Why is no real title available?)
• Optimal numberings and isoperimetric problems on graphs
• Shadows and isoperimetry under the sequence-subsequence relation

Cited in

(2)

• Isoperimetric Problem and Meta-fibonacci Sequences
• Integer subsets with high volume and low perimeter

This page was built for publication: Isoperimetric theorems in the binary sequences of finite lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808627)