Hereditary rigidity, separation and density In memory of Professor I.G. Rosenberg
Lucien Haddad, Masahiro Miyakawa, Maurice Pouzet, Hisayuki Tatsumi

TL;DR
This paper investigates the properties of hereditarily rigid relations, especially focusing on the minimal number of linear orders needed to separate pairs of elements in finite and infinite sets, connecting the problem to set theory and topology.
Contribution
It establishes bounds and equalities for the minimal number of linear orders required for separation, linking the problem to the Generalized Continuum Hypothesis and topological density.
Findings
For finite sets, the minimal number of linear orders is bounded by a logarithmic function.
For infinite sets, the minimal number equals aleph-null under certain conditions.
The problem relates to set theory hypotheses like the GCH and topological properties of linear orders.
Abstract
We continue the investigation of systems of hereditarily rigid relations started in Couceiro, Haddad, Pouzet and Sch\"olzel [1]. We observe that on a set with elements, there is a hereditarily rigid set made of tournaments if and only if . We ask if the same inequality holds when the tournaments are replaced by linear orders. This problem has an equivalent formulation in terms of separation of linear orders. Let be the least cardinal such that there is a family of linear orders on an -element set such that any two distinct ordered pairs of distinct elements of are separated by some member of , then with equality if . We ask whether the equality holds for every . We prove that . If …
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
TopicsRings, Modules, and Algebras · Advanced Topology and Set Theory · Advanced Graph Theory Research
