Comer schemes, relation algebras, and the flexible atom conjecture

DOI10.1007/978-3-031-28083-2_2arXiv1905.11914OpenAlexW4323527467MaRDI QIDQ6174410

David A. Andrews, Michael Levet, Jeremy F. Alm

Publication date: 17 August 2023

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.11914

zbMATH Keywords

representationsflexible atom conjecturecomer schemes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Sum-free cyclic multi-bases and constructions of Ramsey algebras
• Representability of Ramsey relation algebras
• Combinatorial aspects of relations
• Relation algebras
• Chromatic graphs, Ramsey numbers and the flexible atom conjecture
• Difference sets and sum-free sets in groups of order 16
• Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\)
• Finite representations for two small relation algebras
• Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)
• A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\mathbb{Z} / p \mathbb{Z}\)
• A reduced upper bound for an edge-coloring problem from relation algebra
• Additive patterns in multiplicative subgroups
• NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS
• Some Varieties Containing Relation Algebras
• 401 and beyond: improved bounds and algorithms for the Ramsey algebra search
• Unnamed Item

This page was built for publication: Comer schemes, relation algebras, and the flexible atom conjecture