Change search
ReferencesLink to record
Permanent link

Direct link
Combinatorial Aspects of Clifford Algebra
2002 (English)Conference paper (Refereed)
Abstract [en]

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
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-82643OAI: diva2:498413
, Proceedings of the International Workshop on Applications of Geometric Algebra
NR 20140805Available from: 2012-02-12 Created: 2012-02-12Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Naeve, Ambjörn
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 29 hits
ReferencesLink to record
Permanent link

Direct link