Proper Jordan schemes exist. First examples, computer search, patterns of reasoning. An essay
Mikhail Klin, Mikhail Muzychuk, Sven Reichard

TL;DR
This paper proves the existence of proper Jordan schemes, providing initial examples, infinite classes, and a construction method, supported by computer experiments, diagrams, and theoretical reasoning.
Contribution
It establishes the existence of proper Jordan schemes, introduces new examples and classes, and outlines a construction method for schemes of certain orders and ranks.
Findings
First examples of proper Jordan schemes with orders 15, 24, 40
Infinite classes of Jordan schemes of rank 5 and higher
A construction method for schemes with order n=binomial(3^d+1,2)
Abstract
A special class of Jordan algebras over a field of characteristic zero is considered. Such an algebra consists of an -dimensional subspace of the vector space of all square matrices of a fixed order over . It contains the identity matrix, the all-one matrix; it is closed with respect to \correction{matrix transposition}, Schur-Hadamard (entrywise) multiplication and the Jordan product , where is the usual matrix product. The suggested axiomatics (with some natural additional requirements) implies an equivalent reformulation in terms of symmetric binary relations on a vertex set of cardinality . The appearing graph-theoretical structure is called a Jordan scheme of order and rank . A significant source of Jordan schemes stems from the symmetrization of association schemes. Each such structure is called a non-proper Jordan scheme. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Finite Group Theory Research · Graph theory and applications
