Sum-free cyclic multi-bases and constructions of Ramsey algebras
From MaRDI portal
(Redirected from Publication:476331)
Abstract: Given , is called a emph{cyclic basis} if , emph{symmetric} if implies , and emph{sum-free} if . We ask, for which , can the set of non-identity elements of be partitioned into symmetric sum-free cyclic bases? If, in addition, we require that distinct cyclic bases interact in a certain way, we get a proper relation algebra called a Ramsey algebra. Ramsey algebras (which have also been called Monk algebras) have been constructed previously for . In this manuscript, we provide constructions of Ramsey algebras for every positive integer with , with the exception of and .
Recommendations
Cites work
- scientific article; zbMATH DE number 3853122 (Why is no real title available?)
- Combinatorial Relations and Chromatic Graphs
- Extremal bases for finite cyclic groups
- On the exact order of asymptotic bases and bases for finite cyclic groups
- Relation algebras by games
- Some Varieties Containing Relation Algebras
Cited in
(7)- There is no finite-variable equational axiomatization of representable relation algebras over weakly representable relation algebras
- Subcompletions of representable relation algebras
- Comer schemes, relation algebras, and the flexible atom conjecture
- Edge colourings and qualitative representations of chromatic algebras
- Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
- Representability of Ramsey relation algebras
- A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\mathbb{Z} / p \mathbb{Z}\)
This page was built for publication: Sum-free cyclic multi-bases and constructions of Ramsey algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476331)