Relational structures having finitely many full-cardinality restrictions
| Autor: | Robert E. Woodrow, Maurice Pouzet, Peter C. Gibson |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Discrete mathematics
Isomorphism type Hypergraph Relational structure 010102 general mathematics 0102 computer and information sciences Construct (python library) 01 natural sciences Theoretical Computer Science Combinatorics Cardinality 010201 computation theory & mathematics Discrete Mathematics and Combinatorics Profile Isomorphism 0101 mathematics Special case Mathematics |
| Zdroj: | Discrete Mathematics. 291(1-3):115-134 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2004.04.024 |
| Popis: | Considering an arbitrary relational structure on an infinite groundset, we analyze the implications of the following finiteness hypothesis (H): for some infinite cardinality μ there exist only finitely many isomorphism types of substructures of size μ. We show that the class C of relational structures satisfying (H) is intimately related to an explicit family of linear orders. Based on this, we show how to construct every member of C, up to isomorphism, thereby describing C completely. As an application, we characterize the profile of a relational structure that satisfies (H). Our work extends earlier published results concerning the special case of hypergraphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect