The mean value of Frobenius numbers with three arguments
Frolenkov Dmitriy
TL;DR
This paper derives an asymptotic formula for the average Frobenius number when three integers are involved, using novel methods including a new approach by Ustinov, Rodseth's algorithm, and bounds on exponential sums.
Contribution
It introduces a new method for analyzing the mean value of Frobenius numbers with three arguments, advancing understanding in number theory.
Findings
Established an asymptotic formula for the mean Frobenius number with three arguments.
Developed a new analytical method involving exponential sum bounds.
Applied Rodseth's algorithm in the context of Frobenius number analysis.
Abstract
We prove an asymptotic formula for the mean value of Frobenius numbers with three arguments. To prove this we use a new method invented by A. Ustinov, Rodseth's algorithm an bounds for exponential sums.
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
TopicsGraph theory and applications · Commutative Algebra and Its Applications · Coding theory and cryptography