On balanced sets mod p

DOI10.1016/0097-3165(85)90059-7MaRDI QIDQ1065052zbMATH OpenOpenAlexFDO

Authors David R. Richman

Publication date 1985

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(85)90059-7

zbMATH Keywords

balanced setstwo sets of integers with equal sums

Mathematics Subject Classification ID

Elementary number theory (11A99)

Review text

Let p be a prime, and let n(p) denote the smallest value of n for which we can find \(2n+1\) integers (mod p), not all equal, such that, if any one of them is removed, the remaining ones can be divided into two sets of n elements with equal sums. It is shown that, if \(p>5\), n(p) lies between \(\frac{\log p}{2 \log \log p}\) and 3 log p.

Recommendations

• Lower bound for balanced sets
• An algorithm for finding a nearly minimal balanced set in \(\mathbb{F}_p\)
• Subset sums modulo a prime
• BALANCED SETS AND THE VECTOR GAME
• On the modular sumset partition problem

Cited in

(8)

• On the triplet-divisions of the set \(\{1,2,3,\cdots,p-2\}\)
• An algorithm for finding a nearly minimal balanced set in \(\mathbb{F}_p\)
• Equal moments division of a set
• Balanced subset sums in dense sets of integers
• On the modular sumset partition problem
• scientific article; zbMATH DE number 1985596 (Why is no real title available?)
• On sets whose subsets have integer mean
• Balanced Modular Parameterizations

This page was built for publication: On balanced sets mod p

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