2000 character limit reached
Finite representations for two small relation algebras
Published 30 Nov 2017 in math.LO and math.RA | (1712.00129v1)
Abstract: In this note, we give two different proofs that relation algebra $52_{65}$ is representable over a finite set. The first is probabilistic, and uses Johnson schemes. The second is an explicit group representation over $ (\mathbb{Z}/2\mathbb{Z}){10}$. We also give a finite representation of $59_{65}$ over $\mathbb{Z}/113\mathbb{Z}$ using a technique due to Comer.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.