Skip to main content
SpringerLink
Log in

Mortality Problem for 2×2 Integer Matrices

  • Conference paper
SOFSEM 2008: Theory and Practice of Computer Science (SOFSEM 2008)

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

Abstract

A given set F of n×n matrices is said to be mortal if the n×n null matrix belongs to the free semigroup generated by F. It is known that the mortality problem for 3×3 matrices with integer entries is undecidable [7],[3]. In this paper we prove that the mortality problem is decidable for any set of 2×2 integer matrices whose determinants assume the values 0,±1.

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

Access this chapter

Log in via an institution
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 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

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. Bournez, O., Branicky, M.: On the mortality problem for matrices of low dimensions. TCS 35(4), 433–488 (2002)

    MATH  MathSciNet  Google Scholar 

  2. Choffrut, C., Karhumäki, J.: Some decision problems on integer matrices. RAIRO/ITA 39(1), 125–132 (2005)

    MATH  Google Scholar 

  3. Halava, V., Harju, T.: Mortality in matrix semigroups. Amer. Math. Monthly 108(7), 649–653 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Krom, M., Krom, M.: Recursive solvability of problems with matrices. zwitschr. f. math. Logik und Grundlagen d. Math. 35, 437–442 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Krom, M., Krom, M.: More on mortality. Amer. Math. Monthly 97, 37–38 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lisitsa, A., Potapov, I.: Membership and reachibility problems for row-monomial transformations. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 623–634. Springer, Heidelberg (2004)

    Google Scholar 

  7. Paterson, M.S.: Unsolvability in 3×3 matrices. Stud. Appl. Math. 49, 105–107 (1970)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Politecnico di Milano, Piazza L.da Vinci, 32, 20133, Milano, Italy

    C. Nuccio & E. Rodaro

Authors
  1. C. Nuccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Rodaro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Viliam Geffert Juhani Karhumäki Alberto Bertoni Bart Preneel Pavol Návrat Mária Bieliková

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nuccio, C., Rodaro, E. (2008). Mortality Problem for 2×2 Integer Matrices. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77566-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77565-2

  • Online ISBN: 978-3-540-77566-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation