On the complexity of the family of convex sets in R^d

DOI10.1134/S0001434616030263MaRDI QIDQ325664zbMATH OpenOpenAlexFDO

Authors Vladimir V. Pernay

Publication date 18 October 2016

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0001434616030263

zbMATH Keywords

simplexconvex setcomplexity of a family of subsets of a \(d\)-cubegeneralized majorant of partial sumsKhinchine's inequality

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Combinatorial complexity of geometric structures (52C45)

Recommendations

• A note on convex subsets of \(\mathbb Z^k\)
• A fractional Helly theorem for convex lattice sets
• Convexity, complexity, and high dimensions
• An upper-bound theorem for families of convex sets
• Piercing families of convex sets with the \(d\)-intersection property in \(\mathbb R^{d}\)

Cites work

• scientific article; zbMATH DE number 5723533 (Why is no real title available?)
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
• Analogue of Men'shov's theorem on correction for discrete orthonormal systems
• On the possibility of generalizing ``correction theorems
• Spaces generated by the generalized majorant of partial sums

Cited in

(3)

• Convexity, complexity, and high dimensions
• A note on convex subsets of \(\mathbb Z^k\)
• On the complexity of representing sets of vertices in the \(N\)-cube

This page was built for publication: On the complexity of the family of convex sets in \(\mathbb{R}^d\)

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