Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Combinatorial Aspects of Clifford Algebra
(MEDIETEKN O INTERAKTIONSDESIGN)
2002 (English)Conference paper, Published 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
2002.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-82643OAI: oai:DiVA.org:kth-82643DiVA: diva2:498413
Conference
, Proceedings of the International Workshop on Applications of Geometric Algebra
Note
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

urn-nbn

Altmetric score

urn-nbn
Total: 41 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf