A characterization of locally ordered ternary relations in terms of digraphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914038488760320 |
|---|---|
| author | Quintero, Guillermo Gamboa Matamala, Martín Peña, Juan Pablo |
| author_facet | Quintero, Guillermo Gamboa Matamala, Martín Peña, Juan Pablo |
| contents | In 1917, Huntington and Kline, followed by Huntington in 1924, studied systems of axioms for ternary relations aiming to capture the concepts of linear order (called betwenness) and cycle order, respectively. Among many other properties, they proved there are several independent set of axioms defining either linear order or cycle order. In this work, we consider systems arising from the four common axioms of linear order and cycle order, together with a new axiom F, stating that if a tuple abc is in the relation, then either cba or bca is in the relation as well. Although, at first glace this allows for a much richer type of systems, we prove that these are either of linear order or cycle order type. Our main result is a complete characterization of the finite systems satisfying the set of axioms {B, C, D, F, 2}, where B, C, D and 2 are axioms presented by Huntington. Unlike what happens in the previous situation, with this modification we obtain a larger family of systems which we characterize in terms of digraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_11956 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A characterization of locally ordered ternary relations in terms of digraphs Quintero, Guillermo Gamboa Matamala, Martín Peña, Juan Pablo Combinatorics Logic 51G05, 03B30, 05C62 In 1917, Huntington and Kline, followed by Huntington in 1924, studied systems of axioms for ternary relations aiming to capture the concepts of linear order (called betwenness) and cycle order, respectively. Among many other properties, they proved there are several independent set of axioms defining either linear order or cycle order. In this work, we consider systems arising from the four common axioms of linear order and cycle order, together with a new axiom F, stating that if a tuple abc is in the relation, then either cba or bca is in the relation as well. Although, at first glace this allows for a much richer type of systems, we prove that these are either of linear order or cycle order type. Our main result is a complete characterization of the finite systems satisfying the set of axioms {B, C, D, F, 2}, where B, C, D and 2 are axioms presented by Huntington. Unlike what happens in the previous situation, with this modification we obtain a larger family of systems which we characterize in terms of digraphs. |
| title | A characterization of locally ordered ternary relations in terms of digraphs |
| topic | Combinatorics Logic 51G05, 03B30, 05C62 |
| url | https://arxiv.org/abs/2509.11956 |