scientific article; zbMATH DE number 7204378

DOI10.4230/LIPICS.MFCS.2017.44zbMATH Open1441.20037MaRDI QIDQ5111259FDOQ5111259

Igor Potapov, Pavel Semukhin

Publication date: 26 May 2020

Title of this publication is not available (Why is that?)

Recommendations

• Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices
• The conjugacy problem in \(\mathrm{ Gl } ( n, \mathbb{Z} )\)
• Singular matrices and a uniform bound for congruence groups of \(SL_ n(\mathbb{Z})\)
• Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\)
• Conjugacy Problem in GL 2 (Z[ √-1 ]) and Units of Quadratic Extensions of Q(√-1)
• The 1-eigenspace for matrices in \(\mathrm{GL}_{2}(\mathbb Z_{\ell})\)
• Singular Gelfand-Tsetlin modules of \(\mathfrak{gl}(n)\)
• scientific article
• The subconvexity problem for \(\mathrm{GL}_2\)

zbMATH Keywords

automataformal languagesgeneral linear groupmatrix semigroupsmembership problemsingular matrices

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Matrices of integers (15B36) Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic systems of matrices (15A30) Linear algebraic groups over finite fields (20G40) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Title not available (Why is that?)
• Unsolvability in 3 × 3 Matrices
• Polynomial-time algorithm for the orbit problem
• On the Positivity Problem for Simple Linear Recurrence Sequences,
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidable and Undecidable Problems about Quantum Automata
• On Termination of Integer Linear Loops
• On the computational complexity of matrix semigroup problems
• Some decision problems on integer matrices
• Mathematical Foundations of Computer Science 2004
• Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
• On undecidability bounds for matrix decision problems
• Post correspondence problem for short words
• Mortality for 2 ×2 Matrices Is NP-Hard
• Title not available (Why is that?)
• Decidability of the Membership Problem for 2 × 2 integer matrices
• The Identity Problem for Matrix Semigroups in SL₂(ℤ) is NP-complete
• Vector Reachability Problem in SL(2, Z)
• Membership Problem for the Modular Group
• ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS
• Mortality Problem for 2×2 Integer Matrices

Cited In (8)

• On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond
• Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)
• The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
• Solving the membership problem for parabolic Möbius monoids
• On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
• Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
• On Reachability Problems for Low-Dimensional Matrix Semigroups
• Reachability Problems for One-Dimensional Piecewise Affine Maps

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111259)