arXiv (All)
open access
The satisfiability threshold of random linear equations over finite commutative rings
We extend the study of random linear equations over finite fields to equations over finite commutative rings. We characterize precisely when the satisfiability threshold occurs at a sublinear scale; namely, when the random system become unsatisfiable with high probability with a number of constraint
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
- Strongly Refuting Semirandom Linear Systems in Subexponential Time#1078123
- On the computation of rational solutions of underdetermined systems over a finite field#228842
- Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size#971974
- Markov chains arising in the study of random matrices over pro-finite rings#1154757
- Random Algebraic Geometry Codes Approach the Half-Singleton Bound for Insertions and Deletions#974018
Record · ID 1049026
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