Partitions of the set of natural numbers and symplectic homology
Igor Uljarevic

TL;DR
This paper proves Tamura's theorem on partitions of positive integers by employing positive -equivariant symplectic homology, extending classical results like Rayleigh-Beatty theorem.
Contribution
It introduces a novel proof of Tamura's theorem using symplectic homology, linking number partitions with symplectic topology techniques.
Findings
Tamura's theorem is proven using symplectic homology.
The approach generalizes classical partition theorems.
New connections between number theory and symplectic topology are established.
Abstract
We prove Tamura's theorem on partitions of the set of positive integers (a generalization of the more famous Rayleigh-Beatty theorem) using the positive -equivariant symplectic homology.
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.
