Carries, group theory, and additive combinatorics

DOI10.4169/AMER.MATH.MONTHLY.121.08.674zbMATH Open1310.05210arXiv1309.0434OpenAlexW2963119210WikidataQ58122291 ScholiaQ58122291MaRDI QIDQ5246409FDOQ5246409

Authors: Persi Diaconis, Xuancheng Shao, Kannan Soundararajan 

Publication date: 21 April 2015

Published in: The American Mathematical Monthly (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1309.0434

Recommendations

• Carries and the arithmetic progression structure of sets
• Carries, shuffling, and symmetric functions
• On the number of carries occurring in an addition mod \(2^k -1\)
• Minimizing the number of carries in addition
• Combinatorics of balanced carries

zbMATH Keywords

carriesbalanced arithmetic

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Arithmetic combinatorics; higher degree uniformity (11B30) Extremal combinatorics (05D99)

Cited In (6)

• Carries and the arithmetic progression structure of sets
• Combinatorics of balanced carries
• Carries and a map on the space of rational functions
• Combinatorial number theory and additive group theory. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse)
• Title not available (Why is that?)
• A robust version of Freiman's $3k-4$ theorem and applications

This page was built for publication: Carries, group theory, and additive combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5246409)