HackerPapers

arXiv:2207.01094math.RA

A Prolog assisted search for new simple Lie algebras

David Cushing, George W. Stagg, David I. Stewart

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We describe some recent computer investigations with the `Constraint Logic Programming over Finite Domains' -- CLP(FD) -- library in the Prolog programming environment to search for new simple Lie algebras over the field $\GF(2)$ of $2$ elements. Motivated by a paper of Grishkov et. al., we specifically look for those with a `thin decomposition', and we settle one of their conjectures. We extrapolate from our results the existence of two new infinite families of simple Lie algebras, in addition to finding seven new sporadic examples in dimension $31$. We also better contextualise some previously discovered simple algebras, putting them into families which do not seem to have ever appeared in the literature, and give an updated table of those currently known.

arXiv comments
47 pages
Journal reference
DOI
Subjects
math.RARings and Algebras cs.LOLogic in Computer Science

On Hacker News

No comments linking this paper were found in the collected sources. Found in 2 HN submissions from Jul 2022 to Jan 2023. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.