On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
type: Item
instance of: scholarly article
title: On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
author: Paul C. Bell
author: Pavel Semukhin
author: Igor Potapov
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1902.10188
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11027/
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433286
zbMATH Keywords: linear recurrence sequences
zbMATH Keywords: Skolem's problem
zbMATH Keywords: mortality problem
zbMATH Keywords: matrix equations
zbMATH Keywords: primary decomposition theorem
zbMATH Keywords: Baker's theorem
MaRDI profile type: Publication
OpenAlex ID: W3129328269
cites work: Q4875224
cites work: Markov Chains and Unambiguous Büchi Automata
cites work: Algorithms in real algebraic geometry
cites work: MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
cites work: Mortality for 2 ×2 Matrices Is NP-Hard
cites work: The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete
cites work: Decidable and Undecidable Problems about Quantum Automata
cites work: Deciding stability and mortality of piecewise affine dynamical systems
cites work: The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
cites work: Complexity of stability and controllability of elementary hybrid systems
cites work: On the Complexity of the Orbit Problem
cites work: Q4598241
cites work: Q3139838
cites work: Q3807295
cites work: Q2955006
cites work: On the abc conjecture in algebraic number fields
cites work: A simple proof of the Skolem-Mahler-Lech theorem
cites work: Q5613964
cites work: Q5614003
cites work: Products of matrices and recursively enumerable sets
cites work: Q3998992
cites work: On NFAs where all states are final, initial, or both
cites work: On the Identity Problem for the Special Linear Group and the Heisenberg Group.
cites work: A note on recurring series
cites work: Factoring polynomials with rational coefficients
cites work: Mathematical Foundations of Computer Science 2004
cites work: Rational subsets of unitriangular groups
cites work: Q3671245
cites work: Mortality Problem for 2×2 Integer Matrices
cites work: On Termination of Integer Linear Loops
cites work: Solvability of Matrix-Exponential Equations
cites work: Decision Problems for Linear Recurrence Sequences
cites work: On the Positivity Problem for Simple Linear Recurrence Sequences,
cites work: Positivity Problems for Low-Order Linear Recurrence Sequences
cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros
cites work: Unsolvability in 3 × 3 Matrices
cites work: An Exact Method for Finding the Roots of a Complex Polynomial
cites work: Decidability of the Membership Problem for 2 × 2 integer matrices
cites work: Q5111259
cites work: Occurrence of zero in a linear recursive sequence
DOI: 10.1016/J.IC.2021.104736
description: scientific article; zbMATH DE number 7433286