A separoid is a symmetric relation $\dagger \subset {2^S\atopwithdelims ()2}$ defined on disjoint pairs of subsets of a given set $S$ such that it is closed as a filter in the canonical partial order induced by the inclusion (i.e., $A\dagger B\preceq A^{\prime }\dagger B^{\prime }\iff A\subseteq A^{\prime }$ and $B\subseteq B^{\prime }$). We introduce the notion of homomorphism as a map which preserve the so-called “minimal Radon partitions” and show that separoids, endowed with these maps, admits an embedding from the category of all finite graphs. This proves that separoids constitute a countable universal partial order. Furthermore, by embedding also all hypergraphs (all set systems) into such a category, we prove a “stronger” universality property. We further study some structural aspects of the category of separoids. We completely solve the density problem for (all) separoids as well as for separoids of points. We also generalise the classic Radon’s theorem in a categorical setting as well as Hedetniemi’s product conjecture (which can be proved for oriented matroids).
@article{107984,
author = {Jaroslav Ne\v set\v ril and Ricardo Strausz},
title = {Universality of separoids},
journal = {Archivum Mathematicum},
volume = {042},
year = {2006},
pages = {85-101},
zbl = {1164.05468},
mrnumber = {2227115},
language = {en},
url = {http://dml.mathdoc.fr/item/107984}
}
Nešetřil, Jaroslav; Strausz, Ricardo. Universality of separoids. Archivum Mathematicum, Tome 042 (2006) pp. 85-101. http://gdmltest.u-ga.fr/item/107984/
Separoids, their categories and a Hadwiger-type theorem, Discrete Comput. Geom. 27(3) (2002), 377–385. | MR 1921560 | Zbl 1002.52008
Oriented Matroids, Encyclopedia of Mathematics and Its Applications 46, Cambridge University Press, 1993. (1993) | MR 1226888 | Zbl 0773.52001
Separoids and a characterisation of linear uniform oriented matroids, KAM-DIMATIA Series, Charles University at Prague 17 2002.
On the complexity of H-coloring, J. Combin. Theory, Ser. B 48(1) (1990), 92–110. An earlier version appeared in: Combinatorics, graph theory, and computing, Proc. 17th Southeast. Conf., Boca Raton/Fl. 1986, Congr. Numerantium 55, 284 (1986). (1990) | MR 1047555 | Zbl 0639.05023
Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and its Applications 28, Oxford University Press, 2004. | MR 2089014
Linear programming duality and morphisms, Comment. Math. Univ. Carolin. 40(3) (1999), 577–592. (1999) | MR 1732478
Matroïdes orientables, C. N. R. S. Paris, 1974. (1974)
Tverberg-type theorems for separoids, Discrete Comput. Geom. 35 (3) (2006), 513–523. | MR 2202117 | Zbl 1091.52500
A characterisation of cocircuit graphs of uniform oriented matroids, KAM-DIMATIA Series, Charles University at Prague 26 (565), 2002.
Counting polytopes via the Radon complex, J. Combin. Theory Ser. A 106(1) (2004), 109–121. | MR 2050119 | Zbl 1042.05024
Duality theorems for finite structures (characterising gaps and good characterisations), J. Combin. Theory Ser. B 80(1) (2000), 80–97. | MR 1778201 | Zbl 1024.05078
Combinatorial, algebraic and topological representations of groups, semigroups and categories, North-Holland Mathematical Library 22, North-Holland Publishing Co., Amsterdam, 1980. (1980) | MR 0563525
Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten, Math. Ann. 83 (1921), 113–115. (1921) | MR 1512002
Separoides, Situs Ser. B, Universidad Nacional Autónoma de México 5(1998), 36–41. (1998)
Separoides: el complejo de Radon, Master’s thesis, Universidad Nacional Autónoma de México, 2001.
On Radon’s theorem and representation of separoids, ITI Series, Charles University at Prague 32 (118), (2003).
On Separoids, PhD thesis, Universidad Nacional Autónoma de México, 2004.