arXiv (All)
open access
Congruence Jumping in Polynomial Divisibility Systems: Arithmetic Structure and Solution Sets
Let $A$ and $B$ be polynomials with integer coefficients. We study nonzero integer solutions of $$y\mid A(x),\qquad x\mid B(y),$$ using quotient transformations that may change the polynomial pair. We call this process \emph{congruence jumping}. We establish a general reciprocal-polynomial rule gove
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
- On finite groups whose coprime graph is a divisor graph#1143581
- $13$ unknowns over quadratic integer rings and Lucas congruences#799593
- Locus: A Framework for Exploring and Optimizing Point Addition Hardware for Zero-Knowledge Proofs#1013004
- Locus: A Framework for Exploring and Optimizing Point Addition Hardware for Zero-Knowledge Proofs#965328
- On graphs with modularity zero or near-zero#971647
Record · ID 1155743
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