2000 character limit reached
Pattern Recognition on Oriented Matroids: Decompositions of Topes, and Dehn-Sommerville Type Relations
Published 13 Mar 2017 in math.CO | (1703.04508v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.