Separoid

In mathematics, a separoid is a binary relation between disjoint sets which is stable as an ideal in the canonical order induced by inclusion. Many mathematical objects which appear to be quite different, find a common generalisation in the framework of separoids; e.g., graphs, configurations of convex sets, oriented matroids, and polytopes.

Source: Wikipedia — Separoid (CC BY-SA 4.0)

Separoid

In mathematics, a separoid is a binary relation between disjoint sets which is stable as an ideal in the canonical order induced by inclusion. Many mathematical objects which appear to be quite different, find a common generalisation in the framework of separoids; e.g., graphs, configurations of convex sets, oriented matroids, and polytopes.

This neuron ends here.

Source: Wikipedia "Separoid" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy