Abstract: In this paper we give sufficient conditions for a compactum in to have Carath'{e}odory number less than , generalizing an old result of Fenchel. Then we prove the corresponding versions of the colorful Carath'{e}odory theorem and give a Tverberg type theorem for families of convex compacta.
Recommendations
- Note on a theorem of Carlitz
- A bound on the Carathéodory number
- scientific article; zbMATH DE number 3838116
- A note on Carmichael numbers in residue classes
- A note on Carmichael numbers in residue classes
- An integer analogue of Carathéodory's theorem
- Comments on Carmichael numbers of order \(k\)
- Some aspects of Carmichael's conjecture
- The Caratheodory number for the k-core
Cites work
- scientific article; zbMATH DE number 4073077 (Why is no real title available?)
- scientific article; zbMATH DE number 480237 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- A Generalization of Radon's Theorem
- A Generalization of a Theorem of Fenchel
- A generalization of Caratheodory's theorem
- A quadratic lower bound for colourful simplicial depth
- A theorem on families of acyclic sets and its applications
- An Extension of the Ham Sandwich Theorem
- Colourful Linear Programming and its Relatives
- Colourful simplicial depth
- Dual theorems on central points and their generalizations
- ORBITOPES
- On the Field of Values of a Matrix
- Quadratically Many Colorful Simplices
- Tverberg's theorem via number fields
- Very colorful theorems
Cited in
(14)- On the Carathéodory number for strong convexity
- Symmetric interdiction for matching problems
- Carathéodory's theorem and \(H\)-convexity
- The Caratheodory number for the k-core
- A quantitative version of Carathéodory's theorem for convex sets
- A point in an \(nd\)-polytope is the barycenter of \(n\) points in its \(d\)-faces
- Sets with at most two-valued metric projection on a normed plane
- Colorful Carathéodory, Helly and sierksma numbers of convexity spaces
- An inequality for the matrix pressure function and applications
- Stronger data poisoning attacks break data sanitization defenses
- Linear positive systems may have a reachable subset from the origin that is either polyhedral or nonpolyhedral
- On Carathéodory theorem
- scientific article; zbMATH DE number 3927796 (Why is no real title available?)
- scientific article; zbMATH DE number 1467418 (Why is no real title available?)
This page was built for publication: Notes about the Carathéodory number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714989)