English

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture

Logic 2025-12-31 v7 Combinatorics Number Theory

Abstract

In this paper, we consider relational structures arising from Comer's finite field construction, where the cosets need not be sum free. These Comer schemes generalize the notion of a Ramsey scheme and may be of independent interest. As an application, we give the first finite representation of 346534_{65}. This leaves 336533_{65} as the only remaining relation algebra in the family N65N_{65} with a flexible atom that is not known to be finitely representable. Motivated by this, we complement our upper bounds with some lower bounds. Using a SAT solver, we show that 336533_{65} is not finitely representable on fewer than 2424 points, and that 336533_{65} does not admit a cyclic group representation on fewer than 120120 points. We also employ a SAT solver to show that 346534_{65} is not representable on fewer than 2424 points.

Cite

@article{arxiv.1905.11914,
  title  = {Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture},
  author = {Jeremy F. Alm and David A. Andrews and Michael Levet},
  journal= {arXiv preprint arXiv:1905.11914},
  year   = {2025}
}

Comments

Fundamenta Informaticae final journal version; previous conference version appeared in RAMiCS 2023

R2 v1 2026-06-23T09:29:27.007Z