Carries, group theory, and additive combinatorics

2013/09/02 by Persi Diaconis, Diaconis, Persi, Xuancheng Shao +4 · 1 citation
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Group Theory (math.GR) #Limits and Structures in Graph Theory #Number Theory (math.NT) #math.CO #math.GR #math.NT

paper · pdf · doi:10.48550/arxiv.1309.0434

arxiv created 2013/09/02 · openalex publication_date 2013/09/02 · arxiv updated 2013/09/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Given a group G and a normal subgroup H we study the problem of choosing coset representatives with few carries.

Cited by

• Combinatorics of balanced carries

Related

• Groups and Combinatorial Number Theory
• Cosets, genericity, and the Weyl group
• Normal covering numbers for S_n and A_n and additive combinatorics
• Regular sets and counting in free groups
• The Herzog-Schönheim conjecture for solvable groups