The filling problem in the cube (Q262301): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-015-9725-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A generalization of Caratheodory's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally Connected Arrays on the <i>n</i>-Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of triangles covering the center of an \(n\)-set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COBOUNDARY EXPANDERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution of the \(n\)-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal and integral currents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling Riemannian manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Gromov's systolic estimate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the edges of the n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of s-dimensional faces in a complex: An analogy between the simplex and the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal number of faces in cubical complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological connectivity of random 2-complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Gromov's method of selecting heavily covered points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological connectivity of random <i>k</i> -dimensional complexes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-015-9725-7 / rank
 
Normal rank

Latest revision as of 12:48, 9 December 2024

scientific article
Language Label Description Also known as
English
The filling problem in the cube
scientific article

    Statements

    The filling problem in the cube (English)
    0 references
    0 references
    29 March 2016
    0 references
    combinatorial geometry
    0 references
    isoperimetry
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references