Combinatorial Aspects of Clifford Algebra
2002 (English)Conference paper (Refereed)
In this paper we focus on some combinatorial aspects of Clifford algebra and show how this algebra allows combinatorial theorems - like e.g. Sperner’s lemma - to be “built into the algebraic background”, and become part of the structure of the algebra itself. We also give an example of how cumbersome combinatorial proofs can be “mechanized” and carried out in a purely computational manner.
Place, publisher, year, edition, pages
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-82643OAI: oai:DiVA.org:kth-82643DiVA: diva2:498413
, Proceedings of the International Workshop on Applications of Geometric Algebra
NR 201408052012-02-122012-02-12Bibliographically approved