An application of kissing numbers in sum-product estimates
Jozsef Solymosi, Ching Wong

TL;DR
This paper applies the concept of kissing numbers from convex geometry to improve sum-product estimates for finite sets of quaternions and certain matrices, revealing new connections between geometric and algebraic combinatorics.
Contribution
It introduces a novel application of kissing numbers to derive improved sum-product bounds for quaternions and specific matrix families.
Findings
Enhanced sum-product estimate for quaternions.
Application of geometric concepts to algebraic combinatorics.
Establishment of a new link between convex geometry and sum-product problems.
Abstract
The boundedness of the kissing numbers of convex bodies has been known to Hadwiger for long. We present an application of it to the sum-product estimate for finite sets of quaternions and of a certain family of well-conditioned matrices.
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
TopicsLimits and Structures in Graph Theory · Computational Geometry and Mesh Generation · Mathematical Approximation and Integration
