Clifford algebra as a bridge between discrete and continuous worlds (Q1668606)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Clifford algebra as a bridge between discrete and continuous worlds |
scientific article |
Statements
Clifford algebra as a bridge between discrete and continuous worlds (English)
0 references
29 August 2018
0 references
This short but intriguing study is focused on some discrete properties of real Clifford algebras. Beginning with the observation that due to Cartan-Dieudonné theorem the automorphisms of quadratic spaces are essentially generated by binary operations (reflections), the author raises the question how much of the structure of \({C\ell}(\mathbb{R}^{k,l})\) is encoded in the binary representation of the dimension \(n=k+l\) and index of the corresponding inner product \(\nu=k-l\). In particular, it is shown very neatly how the last significant digits in this representation encode the whole structure of the algebra and thus may be used to construct the spinorial chessboard in a straightforward way. The relation with the principal automorphism (and anti-automorphism) is also clarified in this context. Next, the author concentrates on neutral spaces \(\nu=0\) working with the extended Fock basis and defines the \(h\) and \(g\) signatures as binary-valued vectors obtained via the action of null elements and the principal automorphism on simple spinors, showing that those are in fact matrix indices. Finally, the Clifford algebra of neutral spaces is invoked in the treatment of the so-called SAT problem in combinatorics. The ideal of primitive idempotents is used for the construction of the corresponding Boolean algebra. Curiously enough, it turns out that the unsatisfiability condition is equivalent to a simple geometric symmetry property of this ideal. The text is rather comprehensive (without sacrificing mathematical rigor) and does not require a solid background in Clifford algebras, but specialists may also find it very interesting and benefit from the new insight it has to offer, as well as from the list of open problems at the end.
0 references
Clifford algebra
0 references
binary integers
0 references
permutation matrices
0 references
satisfiability problems
0 references
combinatorial problems
0 references
discrete problems
0 references