arXiv:1703.04508 [math.CO]AbstractReferencesReviewsResources
Pattern Recognition on Oriented Matroids: Decompositions of Topes, and Dehn-Sommerville Type Relations
Published 2017-03-13Version 1
If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T;R) of V(R) such that T is the sum of the topes of Q(T;R). If |Q(T;R)|>3, then the decomposition Q(T;R) of the tope T with respect to the symmetric cycle R satisfies certain Dehn-Sommerville type relations.
Comments: 5 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2305.09192 [math.CO] (Published 2023-05-16)
Decomposition of (infinite) digraphs along directed 1-separations
Some bounds on convex combinations of $ω$ and $χ$ for decompositions into many parts
arXiv:1910.06385 [math.CO] (Published 2019-10-14)
Decomposition of tripartite graphs into 5-cycles; A review and some more results