Skip to main content

Integer Vectors and Matrices

  • Chapter
  • First Online:
  • 552 Accesses

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 59))

Abstract

When we compute arithmetical algorithms in a sofic number system, we perform arithmetical operations with the entries of its transformations, intervals and vectors. These operations are algorithmic provided the entries are rational numbers. Since we work with projective matrices and vectors, we can assume that their entries are integers whose greatest common divisor is 1. Then each projective tensor, matrix or vector with rational entries has exactly two representations with coprime integers.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Delacourt, M., Kůrka, P.: Finite state transducers for modular Möbius number systems. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012, volume 7464 of LNCS, pp. 323–334. Springer (2012)

    Google Scholar 

  2. Raney, G.N.: On continued fractions and finite automata. Mathematische Annalen 206, 265–283 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  3. Konečný, M.: Real functions incrementally computable by finite automata. Theor. Comput. Sci. 315(1), 109–133 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kůrka, P., Vávra, T.: Analytic functions computable by finite state transducers. In: Holzer, M., Kutrib, M. (eds.) Implementation and Application of Automata, volume 8587 of LNCS, pp. 252–263. Springer (2014)

    Google Scholar 

  5. Kůrka, P.: Stern-Brocot graph in Möbius number systems. Nonlinearity 25, 57–72 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kůrka, P.: Fast arithmetical algorithms in Möbius number systems. IEEE Trans. Comput. 61(8), 1097–1109 (2012)

    Article  MathSciNet  Google Scholar 

  7. Kůrka, P., Delacourt, M.: The unary arithmetical algorithm in bimodular number systems. In: 2013 IEEE 21st Symposium on Computer Arithmetic ARITH-21, pp. 127–134. IEEE Computer Society (2013)

    Google Scholar 

  8. Kůrka, P.: The exact real arithmetical algorithm in binary continued fractions. In: 2015 IEEE 22nd Symposium on Computer Arithmetic ARITH-22, pp. 168–175. IEEE Computer Society (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petr Kůrka .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Kůrka, P. (2016). Integer Vectors and Matrices. In: Dynamics of Number Systems. Studies in Systems, Decision and Control, vol 59. Springer, Cham. https://doi.org/10.1007/978-3-319-33367-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33367-0_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33366-3

  • Online ISBN: 978-3-319-33367-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics