Cyclic group representations for relation algebras \(57_{65}\) and \(63_{65}\)

Jeremy F. Alm
Southern Illinois University


Abstract

We exhibit finite cyclic group representations for relation algebras \(57_{65}\) and \(63_{65}\). As a consequence, of the ten symmetric integral RAs on four atoms having at least one flexible atom, all are now known to have a representation over a finite cyclic group except for \(33_{65}\), which is not even known to be finitely representable.

1 Introduction↩︎

In a finite integral relation algebra (FIRA), an atom \(a\) is called flexible if there are no forbidden diversity cycles involving \(a\). Every FIRA with a flexible atom is representable over a countably infinite set. The Flexible Atom Conjecture (FAC) asserts that every such RA is actually representable over a finite set.

While a proof of the FAC seems out of reach at the moment, there is a years-long project underway to eliminate potential counterexamples. Many finite representations have been found, any many are finite group representations. Among symmetric FIRAs with at most four atoms and at least one flexible atom, all are known to have finite representations, save for the stubborn \(33_{65}\). (See [1] for the numbering system.) Most are known to have finite group representations, and most also have cyclic group representations. Some recent additions to the list of known group representations are \(31_{37}\), representable over \(\mathbb{Z}/ 33791\mathbb{Z}\), and \(32_{65}\), representable over \(\mathbb{Z}/ 751181\mathbb{Z}\) [2]; \(59_{65}\), representable over \(\mathbb{Z}/ 113\mathbb{Z}\) [3]; \(33_{37}\) representable over \(\mathbb{Z}/ 29\mathbb{Z}\), and \(35_{37}\), representable over \(\mathbb{Z}/ 3221\mathbb{Z}\) [4]; and \(1896_{3013}\), representable over \(\mathbb{Z}/1531\mathbb{Z}\) [5].

All over the cyclic representations in the previous paragraph were found using the method initiated in [6] and made substantially more powerful via an algorithmic speed-up in [7].

In this paper, we give cyclic representations for \(57_{65}\) and \(63_{65}\). For the former, it is the first known finite group representation; for the latter, it is the first known cyclic representation (to the best of our knowledge).

It is noteworthy that for small RAs, cyclic representations seem abundant. For example, all Ramsey relation algebras that are known to be representable have cyclic representations [8][10]. See also [11], summarized in Table 1, where the spectrum for cyclic representations was determined for all symmetric integral 3-atom algebras. (The ordinary spectra were determined in [12].)

Table 1: Summary of Results from [12] and [11]
Spec Cyclic Spec
\(1_7\) \(\{4\}\) \(\{4\}\)
\(2_7\) \(\{n \geq 6\}\) \(\{2k : k \geq 3\}\)
\(3_7\) \(\{2k : k \geq 3\}\) \(\{2k : k \geq 3\}\)
\(4_7\) \(\{ n \geq 9\}\) \(\{n \geq 9\}\setminus\{p, 2p : p \text{ prime} \}\)
\(5_7\) \(\{5\}\) \(\{5\}\)
\(6_7\) \(\{n \geq 8\}\) \(\{8\} \cup \{ n \geq 11 \}\)
\(7_7\) \(\{ n \geq 9\}\) \(\{n \geq 12\}\)

2 Cyclic Representations↩︎

Relation algebra \(63_{65}\) has two forbidden cycles, \(bbb\) and \(ccc\). We give a representation over \(\mathbb{Z}/ 29\mathbb{Z}\). Let

\[\begin{align} A &= \{3, 7, 8, 9, 11, 13, 16, 18, 20, 21, 22, 26\}\\ B &= \{1, 4, 10, 12, 17, 19, 25, 28\}\\ C &= \{2, 5, 6, 14, 15, 23, 24, 27\} \end{align}\]

This coloring, which also serves as proof that the Ramsey number \(R(4,3,3)\) is greater than 29, was noticed by the author in [13], where it is attributed to [14]. (Note that for Ramsey theory purposes, only the forbidden triangles are relevant.)

Relation algebra \(57_{65}\) has forbidden cycles \(ccc\) and \(cbb\). We give a representation over \(\mathbb{Z}/ 46\mathbb{Z}\).

Let

\[\begin{align} A &= \{1, 2, 9, 10, 12, 13, 15, 18, 20, 21, 22, 23, 24,\\ &\phantom{=} \;\;25, 26, 28, 31, 33, 34, 36, 37, 44, 45\}\\ B &= \{6, 7, 8, 14, 16, 30, 32, 38, 39, 40\}\\ C &= \{3, 4, 5, 11, 17, 19, 27, 29, 35, 41, 42, 43\} \end{align}\]

This representation was found with a SAT solver, but can be verified to be correct without a solver, and has been checked independently by Roger Maddux.

3 Conclusion↩︎

Of the symmetric integral RAs on four atoms, ten have at least one flexible atom. All but \(33_{65}\) were known to be finitely representable, and now all but \(33_{65}\) are known to be representable over a finite cyclic group.

The forbidden cycles for \(33_{65}\) are \(ccc\), \(bcc\), and \(cbb\). The symmetry in the forbidden 2-cycles, but asymmetry in the forbidden 1-cycles, presents a challenge.

The author has checked that \(33_{65}\) is not representable over \(\mathbb{Z}/ n\mathbb{Z}\) for any \(n\leq 100\), nor the symmetric group \(S_n\) for \(n\leq 5\).

Acknowledgements↩︎

The author wishes to thank Roger Maddux, for 20 years of conversation about the flexible atom conjecture, and his current MS student Eli Atkins, for his energy and fresh ideas that have given this university administrator a renewed sense of vigor.

4 Declarations↩︎

The author has no competing interests to declare that are relevant to the content of this article.

All relevant data are included in this article.

References↩︎

[1]
R. D. Maddux, Relation algebras, vol. 150. Elsevier B. V., Amsterdam, 2006, p. xxvi+731.
[2]
J. F. Alm, “Monk algebras and representability,” Algebra Universalis, vol. 87, no. 2, pp. Paper No. 13, 2026, doi: 10.1007/s00012-026-00927-w.
[3]
J. F. Alm and R. D. Maddux, “Finite representations for two small relation algebras,” Algebra Universalis, vol. 79, no. 4, pp. Paper No. 87, 4, 2018, doi: 10.1007/s00012-018-0570-4.
[4]
J. F. Alm and M. Levet, “Directed Ramsey and anti-Ramsey schemes and the flexible atom conjecture,” Internat. J. Algebra Comput., vol. 33, no. 8, pp. 1571–1598, 2023, doi: 10.1142/S0218196723500595.
[5]
J. F. Alm, “A finite representation of relation algebra \(1896_{3013}\),” Algebra Universalis, vol. 86, no. 1, pp. Paper No. 5, 3, 2025, doi: 10.1007/s00012-024-00881-5.
[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), 1983, vol. 39, pp. 231–236.
[7]
J. F. Alm and A. Ylvisaker, “A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\Bbb{Z}/p\Bbb{Z}\),” Theoret. Comput. Sci., vol. 791, pp. 127–131, 2019, doi: 10.1016/j.tcs.2019.05.019.
[8]
J. F. Alm, “401 and beyond: Improved bounds and algorithms for the Ramsey algebra search,” J. Integer Seq., vol. 20, no. 8, pp. Art. 17.8.4, 10, 2017.
[9]
J. F. Alm and J. Manske, “Sum-free cyclic multi-bases and constructions of Ramsey algebras,” Discrete Appl. Math., vol. 180, pp. 204–212, 2015, doi: 10.1016/j.dam.2014.08.002.
[10]
T. Kowalski, “Representability of Ramsey relation algebras,” Algebra Universalis, vol. 74, no. 3–4, pp. 265–275, 2015, doi: 10.1007/s00012-015-0353-0.
[11]
J. F. Alm, A. Bostic, C. Chenault, K. Coleman, and C. Culver, Cyclic group spectra for some small relation algebras,” in Relational and algebraic methods in computer science, vol. 14787, Springer, Cham, [2024] \copyright 2024, pp. 19–27.
[12]
H. Andréka and R. D. Maddux, “Representations for small relation algebras,” Notre Dame J. Formal Logic, vol. 35, no. 4, pp. 550–562, 1994, doi: 10.1305/ndjfl/1040408612.
[13]
K. Piwakowski and S. P. Radziszowski, \(30\leq R(3,3,4)\leq 31\),” J. Combin. Math. Combin. Comput., vol. 27, pp. 135–141, 1998.
[14]
J. G. Kalbfleisch, Thesis (Ph.D.)–University of Waterloo (Canada)Chromatic graphs and ramsey’s theorem. ProQuest LLC, Ann Arbor, MI, 1966.