In this paper, the authors present a generalization of a theorem by Mandel that allows for the determination of the covector set of an oriented matroid from its set of topes using the composition condition. They extend this result to conditional oriented matroids and show that the covector set can also be determined by its set of topes, but using the face symmetry condition instead. This generalization is particularly useful for representing geometrical configurations in terms of conditional oriented matroids, which are more suitable for computer calculations. The authors provide an example application of their generalized theorem to apartments of hyperplane arrangements. They describe the structure of these apartments in terms of conditional oriented matroids and propose an algorithm to convert them into such representations. Additionally, they demonstrate how this algorithm can be used to compute the f-polynomial as an extension example. Overall, this paper offers a refined understanding and insight into the relationship between topes and covector sets in both oriented and conditional oriented matroids. The application to hyperplane arrangements highlights the practical implications and computational advantages associated with using conditional oriented matroids in geometric configurations.
The authors found a new way to figure out the covector set of an oriented matroid by looking at its topes. A conditional oriented matroid is a special kind of matroid that also has a covector set determined by its topes, but using a different condition called face symmetry. This new idea is helpful for representing shapes in computer calculations. They used this idea to describe apartments made up of flat surfaces and came up with a way to convert them into conditional oriented matroids. They also created an algorithm to calculate something called the f-polynomial using this method. This paper helps us understand how topes and covector sets are related in different types of math problems, and it shows us how we can use these ideas in real-life situations like arranging flat surfaces."
Definitions
- Generalization: A new idea or concept that applies to many different situations.
- Theorem: A statement or idea that has been proven true.
- Covector set: A collection of mathematical objects that represent certain properties or characteristics.
- Oriented matroid: A type of mathematical structure used to study relationships between objects.
- Topes: Special elements within a mathematical structure that help determine other properties.
- Conditional oriented matroids: Another type of mathematical structure similar to oriented matroids but with additional conditions.
- Face symmetry condition: A specific rule or requirement for determining certain properties within a conditional oriented matroid.
- Geometrical configurations: Different arrangements or shapes made up of points, lines, and surfaces
Generalizing Mandel's Theorem for Oriented and Conditional Oriented Matroids
In this paper, the authors present a generalization of a theorem by Mandel that allows for the determination of the covector set of an oriented matroid from its set of topes using the composition condition. This result is extended to conditional oriented matroids, where it can be determined by its set of topes using the face symmetry condition instead. This generalization offers a refined understanding and insight into the relationship between topes and covector sets in both types of matroids. Furthermore, it provides practical implications and computational advantages when used with geometric configurations represented as conditional oriented matroids.
Mandel's Theorem
Mandel’s theorem states that if two sets A and B are related by some bijection f:A→B such that for all x∈A there exists y∈B such that x⊆f(x)⊆y then A is equal to B up to complementation (i.e., A=B). In other words, given two sets A and B related by some bijection f:A→B such that each element in A has an associated element in B which contains it, then those two sets are equivalent up to complementation.
Extending Mandel's Theorem
The authors extend this result to conditional oriented matroids (COMs), which are more suitable for computer calculations than traditional oriented matroids (OMs). They show that the covector set can also be determined by its set of topes using the face symmetry condition instead of composition condition as in OMs. Additionally, they provide an example application of their generalized theorem to apartments of hyperplane arrangements.
Application Example: Hyperplane Arrangements
The authors describe how their generalized theorem can be used to represent apartments in terms hyperplane arrangements as COMs rather than OMs. To do so, they propose an algorithm which converts these apartments into COM representations while preserving their structure. As an extension example, they demonstrate how this algorithm can be used compute the f-polynomial associated with these hyperplane arrangements as well.
Conclusion
Overall, this paper offers a detailed look at how Mandel’s theorem can be applied not only to OMs but also COMs when dealing with geometrical configurations represented as such structures. It provides useful insights into how topes and covectors relate within both types of matroids while demonstrating practical applications through its example application on hyperplane arrangements and computation algorithms proposed therein
A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented matroid can also be determined by its set of topes, but by using the face symmetry condition. It permits to represent geometrical configurations in terms of conditional oriented matroids, more suitable for computer calculations. We treat apartments of hyperplane arrangements as example.
