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

DOI10.1134/S0001434616030263zbMATH Open1358.52023OpenAlexW2402082153MaRDI QIDQ325664FDOQ325664

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

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}\)

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)

Cites Work

• Title not available (Why is that?)
• 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

Cited In (3)

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

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)