Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Identity and Group Problems for Complex Heisenberg Matrices

Published 11 Jul 2023 in cs.DM and math.CO | (2307.05283v2)

Abstract: We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by Blondel and Megretski (2004). This fundamental problem is known to be undecidable for $\mathbb{Z}{4 \times 4}$ and decidable for $\mathbb{Z}{2 \times 2}$. The Identity Problem has been recently shown to be in polynomial time by Dong for the Heisenberg group over complex numbers in any fixed dimension with the use of Lie algebra and the Baker-Campbell-Hausdorff formula. We develop alternative proof techniques for the problem making a step forward towards more general problems such as the Membership Problem. Using our techniques we also show that the problem of determining if a given set of Heisenberg matrices generates a group can be decided in polynomial time.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. The identity problem for matrix semigroups in SL(2,ℤ)2ℤ(2,\mathbb{Z})( 2 , blackboard_Z ) is NP-complete. In Proceedings of SODA 2017, pages 187–206. SIAM, 2017. doi:10.1137/1.9781611974782.13.
  2. On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups. International Journal of Foundations of Computer Science, 21(6):963–978, 2010. doi:10.1142/S0129054110007660.
  3. A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups. Groups Complexity Cryptology, 8(1):69–74, 2016. doi:10.1515/gcc-2016-0003.
  4. Vincent D. Blondel and Alexandre Megretski, editors. Unsolved problems in mathematical systems and control theory. Princeton University Press, 2004.
  5. Jean-Luc Brylinski. Loop spaces, characteristic classes, and geometric quantization. Birkhäuser, 1993.
  6. An exercise(?) in Fourier analysis on the Heisenberg group. Ann. Fac. Sci. Toulouse Math. (6), 26(2):263–288, 2017. URL: https://doi.org/10.5802/afst.1533.
  7. On the undecidability of freeness of matrix semigroups. International Journal of Algebra and Computation, 9(03n04):295–305, 1999. doi:10.1142/S0218196799000199.
  8. Some decision problems on integer matrices. RAIRO - Theoretical Informatics and Applications, 39(1):125–131, 2005. doi:10.1051/ita:2005007.
  9. The orbit problem in higher dimensions. In Proceedings of STOC 2013, pages 941–950. ACM, 2013. doi:10.1145/2488608.2488728.
  10. On the complexity of the orbit problem. Journal of the ACM, 63(3):23:1–23:18, 2016. doi:10.1145/2857050.
  11. On reachability problems for low-dimensional matrix semigroups. In Proceedings of ICALP 2019, volume 132 of LIPIcs, pages 44:1–44:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. doi:10.4230/LIPIcs.ICALP.2019.44.
  12. Complexity and randomness in the heisenberg groups (and beyond), 2021. URL: https://arxiv.org/abs/2107.02923, doi:10.48550/ARXIV.2107.02923.
  13. Decidability of membership problems for flat rational subsets of GL(2, ℚℚ\mathbb{Q}blackboard_Q) and singular matrices. In Ioannis Z. Emiris and Lihong Zhi, editors, ISSAC ’20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020, pages 122–129. ACM, 2020. doi:10.1145/3373207.3404038.
  14. A linear attack on a key exchange protocol using extensions of matrix semigroups. IACR Cryptology ePrint Archive, 2015:18, 2015.
  15. Ruiwen Dong. On the identity problem and the group problem for subsemigroups of unipotent matrix groups. CoRR, abs/2208.02164, 2022. arXiv:2208.02164, doi:10.48550/arXiv.2208.02164.
  16. Ruiwen Dong. On the identity problem for unitriangular matrices of dimension four. In Proceedings of MFCS 2022, volume 241 of LIPIcs, pages 43:1–43:14, 2022. doi:10.4230/LIPIcs.MFCS.2022.43.
  17. Ruiwen Dong. Semigroup Intersection Problems in the Heisenberg Groups. In In Proceedings of STACS 2023, volume 254 of LIPIcs, pages 25:1–25:18, 2023. doi:10.4230/LIPIcs.STACS.2023.25.
  18. On matrix powering in low dimensions. In Proceedings of STACS 2015, volume 30 of LIPIcs, pages 329–340, 2015. doi:10.4230/LIPIcs.STACS.2015.329.
  19. From classical theta functions to topological quantum field theory. In The influence of Solomon Lefschetz in geometry and topology, volume 621 of Contemprorary Mathematics, pages 35–68. American Mathematical Society, 2014. doi:10.1090/conm/621.
  20. Tero Harju. Post correspondence problem and small dimensional matrices. In Proceedings of DLT 2009, volume 5583 of LNCS, pages 39–46. Springer, 2009. doi:10.1007/978-3-642-02737-6_3.
  21. Leonid G. Khachiyan. Polynomial algorithms in linear programming. USSR Computational Mathematics and Mathematical Physics, 20(1):53–72, 1980.
  22. On the identity problem for the special linear group and the Heisenberg group. In Proceedings of ICALP 2018, volume 107 of LIPIcs, pages 132:1–132:15, 2018. doi:10.4230/lipics.icalp.2018.132.
  23. Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. Algebra and Computer Science, 677:138–153, 2016. doi:10.1090/conm/677/13625.
  24. Bertram Kostant. Quantization and unitary representations. In Lectures in Modern Analysis and Applications III, pages 87–208. Springer, 1970. doi:10.1007/BFb0079068.
  25. Lp metrics on the heisenberg group and the Goemans-Linial conjecture. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06), pages 99–108, 2006. doi:10.1109/FOCS.2006.47.
  26. Andrei A. Markov. On certain insoluble problems concerning matrices. Doklady Akademii Nauk SSSR, 57(6):539–542, 1947.
  27. Knapsack problem for nilpotent groups. Groups Complexity Cryptology, 9(1):87–98, 2017. doi:10.1515/gcc-2017-0006.
  28. On termination of integer linear loops. In Proceedings of SODA 2015, pages 957–969. SIAM, 2015. doi:10.1137/1.9781611973730.65.
  29. Michael S. Paterson. Unsolvability in 3×3333\times 33 × 3 matrices. Studies in Applied Mathematics, 49(1):105, 1970. doi:10.1002/sapm1970491105.
  30. Alexander Schrijver. Theory of Linear and Integer Programming. Wiley, 1998.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.