AbstractWe investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age indivisible relational structure which is not weakly indivisible
AbstractThe age of a relational structure A of signature μ is the set age(A) of its finite induced s...
AbstractThose unary algebras (A, ƒ) (A a set, ƒ a mapping from A into A) are characterized for which...
37 ppInternational audienceA sibling of a relational structure $R$ is any structure $S$ which can be...
AbstractWe investigate infinite versions of vector and affine space partition results, and thus obta...
11 pagesInternational audienceWe investigate infinite versions of vector and affine space partition ...
11 pagesInternational audienceWe investigate infinite versions of vector and affine space partition ...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
An L-structure M is said to be invisible if for any partition M = X ∨ Y, X or Y contains a copy of M...
AbstractA relationRisp-divisible if for any partition of its basis intop+1subsets,Ris embedded into ...
AbstractPrompted by a recent question of Hjorth [G. Hjorth, An oscillation theorem for groups of iso...
AbstractConsidering an arbitrary relational structure on an infinite groundset, we analyze the impli...
AbstractWe prove a Ramsey-style theorem for sequences of vectors in an infinite-dimensional vector s...
AbstractA metric space is indivisible if for any partition of it into finitely many pieces one piece...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
AbstractThe age of a relational structure A of signature μ is the set age(A) of its finite induced s...
AbstractThose unary algebras (A, ƒ) (A a set, ƒ a mapping from A into A) are characterized for which...
37 ppInternational audienceA sibling of a relational structure $R$ is any structure $S$ which can be...
AbstractWe investigate infinite versions of vector and affine space partition results, and thus obta...
11 pagesInternational audienceWe investigate infinite versions of vector and affine space partition ...
11 pagesInternational audienceWe investigate infinite versions of vector and affine space partition ...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
An L-structure M is said to be invisible if for any partition M = X ∨ Y, X or Y contains a copy of M...
AbstractA relationRisp-divisible if for any partition of its basis intop+1subsets,Ris embedded into ...
AbstractPrompted by a recent question of Hjorth [G. Hjorth, An oscillation theorem for groups of iso...
AbstractConsidering an arbitrary relational structure on an infinite groundset, we analyze the impli...
AbstractWe prove a Ramsey-style theorem for sequences of vectors in an infinite-dimensional vector s...
AbstractA metric space is indivisible if for any partition of it into finitely many pieces one piece...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
AbstractThe age of a relational structure A of signature μ is the set age(A) of its finite induced s...
AbstractThose unary algebras (A, ƒ) (A a set, ƒ a mapping from A into A) are characterized for which...
37 ppInternational audienceA sibling of a relational structure $R$ is any structure $S$ which can be...
DOI
Add to ORKG