Abstract
A longstanding conjecture of Reay asserts that every set X of (m− 1)(d+ 1) +k+ 1 points in general position in Rd has a partition X1, X2,⋯ , Xmsuch that∩i=1mconvXiis at least k -dimensional. Using the tools developed in and oriented matroid theory, we prove this conjecture for d= 4 and d= 5. How about, to that end, we introduce the notion of a k -lopsided oriented matroid and we characterize these combinatorial objects for certain values of k. Divisibility properties for subsets of Rd with other independence conditions are also obtained, thus settling several particular cases of a generalization of Reay’s conjecture.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.