On the complexity of the family of convex sets in \(\mathbb{R}^d\)

DOI10.1134/S0001434616030263zbMath1358.52023OpenAlexW2402082153MaRDI QIDQ325664

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

convex setsimplexcomplexity 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)

Cites Work

• Unnamed Item
• On the possibility of generalizing ``correction theorems
• Analogue of Men'shov's theorem on correction for discrete orthonormal systems
• Spaces generated by the generalized majorant of partial sums
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points

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