arXiv (All)
open access
Mertens products in arithmetic progressions over function fields
We prove a function field analogue of Mertens' formula for Euler products over prime polynomials in arithmetic progressions in $\mathbb{F}_q[t]$, the counterpart of a formula of Languasco and Zaccagnini over the integers. An elementary argument shows that the product over the prime polynomials of 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
- Mertens products in arithmetic progressions over function fields#783521
- Omega bound for the Piltz divisor problem#1118893
- Notes on Mitsui's Prime Number Theorem with Siegel zeros#984784
- A difference formula of $p$-adic height pairings via the Bloch-Kato logarithm map#1130280
- The minimal periodicity for integral bases of pure number fields#670378
Record · ID 785111
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