A separation theorem for totally-sewn 4-polytopes

DOI10.1556/012.2015.52.3.1316MaRDI QIDQ2973183zbMATH OpenOpenAlexFDO

Authors T. Bisztriczky, Ferenc Fodor

Publication date 31 March 2017

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL http://publicatio.bibl.u-szeged.hu/18229/1/separation-problem2014-10-28-szte-publicatio.pdf

zbMATH Keywords

separation problemGohberg-Markus-Hadwiger covering numberneighbourly 4-dimensional polytopestotally-sewn polytopes

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

• scientific article; zbMATH DE number 2068097
• Separation in totally-sewn 4-polytopes with the decreasing universal edge property
• Separation in semi-cyclic 4-polytopes
• Separation in neighbourly 4-polytopes
• The structure of the 4-separations in 4-connected matroids
• A four-vertex theorem for polygons and its generalization to polytopes
• On the universal partition theorem for 4-polytopes
• A generalized sewing construction for polytopes
• Four-dimensional polytopes of minimum positive semidefinite rank
• Separation in the polytope algebra

Cited in

(7)

• A generalized sewing construction for polytopes
• Covering the boundary of a convex body with its smaller homothetic copies
• On the illumination of a class of convex bodies
• Separation in neighbourly 4-polytopes
• scientific article; zbMATH DE number 2068097 (Why is no real title available?)
• Separation in totally-sewn 4-polytopes with the decreasing universal edge property
• Improved bounds for Hadwiger's covering problem via thin-shell estimates

This page was built for publication: A separation theorem for totally-sewn 4-polytopes

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