Diophantine approximation of polynomials over $\mathbb{F}_q[t]$ satisfying a divisibility condition
Shuntaro Yamagishi

TL;DR
This paper investigates Diophantine approximation for polynomials over finite fields, establishing estimates for fractional parts under divisibility conditions and extending results to linear combinations, advancing understanding in finite field polynomial approximation.
Contribution
It introduces new estimates for fractional parts of polynomials over finite fields satisfying divisibility conditions and extends these results to linear combinations, filling a gap in finite field Diophantine approximation.
Findings
Established bounds for fractional parts of polynomials over finite fields
Extended approximation results to linear combinations of such polynomials
Analogous divisibility conditions to intersective polynomials in integers
Abstract
Let denote the ring of polynomials over , the finite field of elements. We prove an estimate for fractional parts of polynomials over satisfying a certain divisibility condition analogous to that of intersective polynomials in the case of integers. We then extend our result to consider linear combinations of such polynomials as well.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Analytic Number Theory Research · Algebraic Geometry and Number Theory
