Abstract
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and undecidability for matrices over certain commutative and non-commutative polynomial rings. As consequences, we deduce that positivity is decidable for simple unitary linear recurrence sequences and undecidable for linear recurrence sequences over commutative polynomial rings. As a byproduct, we also prove a free version of Pólya's theorem.
| Original language | English |
|---|---|
| Pages (from-to) | 255-275 |
| Number of pages | 21 |
| Journal | Linear Algebra and Its Applications |
| Volume | 722 |
| DOIs | |
| Publication status | Published - 1 Oct 2025 |
Austrian Fields of Science 2012
- 101001 Algebra
- 101013 Mathematical logic
Keywords
- Linear recurrence sequence
- Matrix moment sequence
- Positivity
- Undecidability
Fingerprint
Dive into the research topics of 'Positive moments forever: Undecidable and decidable cases'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver