SearcharxivSearch

arXiv subjects

David A. Andrews

Publications and source records attributed to David A. Andrews.

2 recordsLinked to original sources

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture

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 $34_{65}$. This leaves $33_{65}$ as the only remaining relation algebra in the family $N_{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 $33_{65}$ is not finitely representable on fewer than $24$ points, and that $33_{65}$ does not admit a cyclic group representation on fewer than $120$ points. We also employ a SAT solver to show that $34_{65}$ is not representable on fewer than $24$ points.

math.LO

A Reduced Upper Bound for an Edge-coloring Problem from Relation Algebra

We construct an edge-coloring of $K_{N}$ (for $N = 3432$) in colors red, dark blue, and light blue, such that there are no monochromatic blue triangles and such that the coloring satisfies a certain strong universal-existential property. The edge-coloring of $K_{N}$ depends on a cyclic coloring of $K_{17}$ whose two color classes are $K_{4}$-, $K_{4,3}$-, and $K_{5,2}$-free. This construction yields the smallest known representation of the relation algebra $32_{65}$, reducing the upper bound from 8192 to 3432.

math.CO