Carries, group theory, and additive combinatorics
Persi Diaconis, Xuancheng Shao, and Kannan Soundararajan
TL;DR
This paper investigates the problem of selecting coset representatives in a group with a normal subgroup to minimize carries, connecting concepts from group theory and additive combinatorics.
Contribution
It introduces a novel approach to choosing coset representatives with minimal carries, bridging group theory and additive combinatorics.
Findings
Identifies conditions for minimal carries in coset representatives
Establishes bounds on the number of carries in specific groups
Provides new insights into the structure of groups and their subgroups
Abstract
Given a group G and a normal subgroup H we study the problem of choosing coset representatives with few carries.
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 · Graph Labeling and Dimension Problems · Graph theory and applications