Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cyclic Group Spectra for Some Small Relation Algebras (2403.15939v1)

Published 23 Mar 2024 in math.LO, cs.DM, and math.CO

Abstract: The question of characterizing the (finite) representable relation algebras in a nice" way is open. The class $\mathbf{RRA}$ is known to be not finitely axiomatizable in first-order logic. Nevertheless, it is conjectured thatalmost all'' finite relation algebras are representable. All finite relation algebras with three or fewer atoms are representable. So one may ask, Over what cardinalities of sets are they representable? This question was answered completely by Andr\'eka and Maddux (``Representations for small relation algebras,'' \emph{Notre Dame J. Form. Log.}, \textbf{35} (1994)); they determine the spectrum of every finite relation algebra with three or fewer atoms. In the present paper, we restrict attention to cyclic group representations, and completely determine the cyclic group spectrum for all seven symmetric integral relation algebras on three atoms. We find that in some instances, the spectrum and cyclic spectrum agree; in other instances, the spectra disagree for finitely many $n$; finally, for other instances, the spectra disagree for infinitely many $n$. The proofs employ constructions, SAT solvers, and the probabilistic method.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (13)
  1. Comer schemes, relation algebras, and the flexible atom conjecture. In Relational and algebraic methods in computer science, volume 13896 of Lecture Notes in Comput. Sci., pages 17–33. Springer, Cham, [2023] ©2023.
  2. Directed Ramsey and anti-Ramsey schemes and the flexible atom conjecture. Internat. J. Algebra Comput., 33(8):1571–1598, 2023.
  3. Improved bounds on the size of the smallest representation of relation algebra 3265subscript326532_{65}32 start_POSTSUBSCRIPT 65 end_POSTSUBSCRIPT. Algebra Universalis, 83(3):Paper No. 32, 18, 2022.
  4. Chromatic graphs, Ramsey numbers and the flexible atom conjecture. Electron. J. Combin., 15(1):Research paper 49, 8, 2008.
  5. Representations for small relation algebras. Notre Dame J. Formal Logic, 35(4):550–562, 1994.
  6. S. D. Comer. Color schemes forbidding monochrome triangles. In Proceedings of the fourteenth Southeastern conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1983), volume 39, pages 231–236, 1983.
  7. Improved lower bounds on the size of the smallest solution to a graph colouring problem, with an application to relation algebra. Journal on Relational Methods in Computer Science, 2, 2013.
  8. Symmetric complete sum-free sets in cyclic groups. Israel J. Math., 227(2):931–956, 2018.
  9. Representability is not decidable for finite relation algebras. Trans. Amer. Math. Soc., 353(4):1403–1425, 2001.
  10. Relation algebras by games, volume 147 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 2002. With a foreword by Wilfrid Hodges.
  11. James Mathew Koussas. Finite relation algebras. J. Symb. Log., 88(2):874–888, 2023.
  12. Roger D. Maddux. Finite, integral, and finite-dimensional relation algebras: a brief history. volume 127, pages 117–130. 2004. Provinces of logic determined.
  13. Roger D. Maddux. Relation algebras, volume 150 of Studies in Logic and the Foundations of Mathematics. Elsevier B. V., Amsterdam, 2006.

Summary

We haven't generated a summary for this paper yet.