Skip to main content

Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks

  • Conference paper
Rewriting Techniques and Applications (RTA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5117))

Included in the following conference series:

Abstract

Orthogonal diagrams represent decompositions of isometries of ℝn into symmetries and rotations. Some convergent (that is noetherian and confluent) rewrite system for this structure was introduced by the first author. One of the rules is similar to Yang-Baxter equation. It involves a map h : ]0, π[3 →]0, π[3.

In order to obtain the algebraic properties of h, we study the confluence of critical peaks (or critical pairs) for our rewrite system. For that purpose, we introduce parametric diagrams describing the calculation of angles of rotations generated by rewriting. In particular, one of those properties is related to the tetrahedron equation (also called Zamolodchikov equation).

This work has been partially supported by ANR project Invariants algébriques des systèmes informatiques (INVAL, ANR-05-BLAN-0267).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burroni, A.: Higher-dimensional word problems with applications to equational logic. Theoretical Computer Science 115, 43–62 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Crans, A.S.: Higher linear algebra. In: n-Categories: Foundations and Applications (2004)

    Google Scholar 

  3. Guiraud, Y.: Termination orders for 3-dimensional rewriting. Journal of Pure and Applied Algebra 207(2), 341–371 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Guiraud, Y.: The three dimensions of proofs. Annals of Pure and Applied Logic 141(1–2), 266–295 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lafont, Y.: Towards an algebraic theory of boolean circuits. Journal of Pure and Applied Algebra 184, 257–310 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lafont, Y.: Algebra and geometry of rewriting. Applied Categorical Structures 15, 415–437 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Rannou, P.: Théorie algébrique des circuits quantiques, circuits orthogonaux, et circuits paramétriques. Master thesis (2007)

    Google Scholar 

  8. Street, R.: Limits indexed by category-valued 2-functors. Journal of Pure and Applied Algebra 8, 149–181 (1976)

    Article  MathSciNet  Google Scholar 

  9. Street, R.: Higher categories, strings, cubes and simplex equations. Applied Categorical Structures 3, 29–77 & 303 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lafont, Y., Rannou, P. (2008). Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks. In: Voronkov, A. (eds) Rewriting Techniques and Applications. RTA 2008. Lecture Notes in Computer Science, vol 5117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70590-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70590-1_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70588-8

  • Online ISBN: 978-3-540-70590-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics