arXiv (All)
open access
Positivity of Second-Order Nearly Linearly Recurrent Sequences
Nearly linear recurrences generalise linear recurrences and can be represented as special cases of both linear time-invariant systems in control theory and linear-constraint loops in program analysis. We formulate the Positivity Problem for such recurrences: given a recurrence and initial values, de
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- AltGDA Achieves Global $O(1/T)$ Ergodic Convergence in Matrix Games#1117707
- On the coupled stability thresholds of graded linear series#128327
- Riordan array representation of recursive polynomial sequences, orthogonal polynomial sequences, and $d$-orthogonal polynomial sequences#793072
- Riordan array representation of recursive polynomial sequences, orthogonal polynomial sequences, and $d$-orthogonal polynomial sequences#789068
- Computational complexity of static output feedback stabilization#1155325
Record · ID 1062782
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive