Pattern Recognition on Oriented Matroids: Decompositions of Topes, and Dehn-Sommerville Type Relations
Andrey O. Matveev

TL;DR
This paper explores the decomposition of topes in oriented matroids using symmetric cycles, revealing unique minimal subsets and establishing Dehn-Sommerville type relations for complex decompositions.
Contribution
It introduces a novel decomposition method for topes in oriented matroids and connects these decompositions to Dehn-Sommerville type relations, advancing theoretical understanding.
Findings
Unique minimal subsets Q(T;R) exist for topes T
Decompositions with more than three elements satisfy specific relations
Provides new insights into the structure of oriented matroids
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Topological and Geometric Data Analysis · Advanced Graph Theory Research
Pattern Recognition on Oriented Matroids:
Decompositions of Topes,
and Dehn–Sommerville Type Relations
Andrey O. Matveev
Abstract.
If is the vertex set of a symmetric cycle in the tope graph of a simple oriented matroid , then for any tope of there exists a unique inclusion-minimal subset of such that is the sum of the topes of .
If , then the decomposition of the tope with respect to the symmetric cycle satisfies certain Dehn–Sommerville type relations.
1. Introduction
Let be a simple (i.e., with no loops, parallel elements or antiparallel elements) acyclic oriented matroid on the ground set , with set of covectors and with set of topes , of rank . Let be a symmetric -cycle, with its vertex set , in the tope graph of such that .
Recall that the vertex set of the cycle is the set of topes of a rank oriented matroid denoted , see e.g. [3, Rem. 1.7], and thus by [1, Example 7.1.7] we can consider the representation of by a certain central line arrangement
[TABLE]
in the plane , with the set of corresponding normal vectors
[TABLE]
and with the standard scalar product .
For any tope of the oriented matroid there exists a unique inclusion-minimal subset such that
[TABLE]
see [3, Sect. 11.1].
If the tope graph is the hypercube graph on vertices, then for any odd integer , , by [3, Th. 13.6] there are precisely vertices of such that .
Let denote the subset of topes of with inclusion-maximal positive parts. For the positive tope of , by [3, Prop. 1.12(ii)] we have
[TABLE]
If
[TABLE]
then for the set of vectors (1.2) we have
[TABLE]
for any open half-space bounded by a -dimensional subspace of ; see e.g. [2, Proof of Prop. 2.33].
Denote by the number of feasible subsystems, of cardinality , of the infeasible system of homogeneous strict linear inequalities
[TABLE]
associated with the arrangement (1.1). Since the condition (1.3) holds, the quantities satisfy the relations (where is a formal variable)
[TABLE]
called the Dehn–Sommerville equations for the feasible subsystems of the system (1.4); see e.g. [2, Prop. 3.53].
In particular,
if , then
[TABLE]
if , then
[TABLE]
if , then
[TABLE]
For any , , by [2, Cor. 3.55(i)] we have
[TABLE]
Recall also that
[TABLE]
2. Decompositions of topes with respect to symmetric cycles in the tope graph, and Dehn–Sommerville type relations
Let be an arbitrary simple oriented matroid of rank , and let be a symmetric -cycle in the tope graph of .
Given a tope of , consider the corresponding decomposition
[TABLE]
of with respect to the cycle , for a unique inclusion-minimal subset of the vertex set of the cycle . Suppose that
[TABLE]
and consider the totally cyclic oriented matroid
[TABLE]
obtained from the rank oriented matroid with the set of topes by reorientation of on the negative part of the tope .
Associate with the abstract simplicial complex
[TABLE]
of acyclic subsets of the ground set of the oriented matroid its “long” -vector
[TABLE]
defined by
[TABLE]
In view of (1.5), we have
[TABLE]
Let us return to the symmetric cycle , and associate with the tope the abstract simplicial complex with the facet family
[TABLE]
where is the separation set of the topes and . By construction, the complex and the complex defined by (2.1) coincide, and we come to the following result:
Proposition 2.1**.**
Let be a symmetric cycle in the tope graph of a simple oriented matroid .
Let be a tope of such that for the unique inclusion-minimal subset of topes with the property
[TABLE]
we have
[TABLE]
(i)* The components of the long -vector of the complex*
[TABLE]
whose family of facets is defined by (2.2) satisfy the Dehn–Sommerville type relations
[TABLE]
In particular,
if , then
[TABLE]
if , then
[TABLE]
if , then
[TABLE]
the quantity is odd.
(ii)* For any , , we have*
[TABLE]
(iii)* We have*
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Björner A. , Las Vergnas M. , Sturmfels B. , White N. , Ziegler G.M. Oriented matroids. Second edition. Encyclopedia of Mathematics, 46. – Cambridge: Cambridge University Press, 1999.
- 2[2] Gainanov D.N. Graphs for pattern recognition. Infeasible systems of linear inequalities. – Berlin: De Gruyter, 2016.
- 3[3] Matveev A.O. Pattern recognition on oriented matroids. – Berlin: De Gruyter, 2017.
