Lower bound for balanced sets

DOI10.1016/j.tcs.2012.06.016zbMath1257.11026OpenAlexW2079356720MaRDI QIDQ690486

Zhivko Nedev

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.016

zbMATH Keywords

balanced sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13) Extremal combinatorics (05D99)

Related Items (3)

Unique differences in symmetric subsets of \(\mathbb F_p\) ⋮ An algorithm for finding a nearly minimal balanced set in 𝔽_{𝕡} ⋮ Unique sums and differences in finite abelian groups

Cites Work

• Unnamed Item
• Addition of sequences in general fields
• A surprising determinantal inequality for real matrices
• An \(O(n)\)-round strategy for the Magnus-Derek game
• The Magnus-Derek game
• An algorithm for finding a nearly minimal balanced set in 𝔽_{𝕡}
• BALANCED SETS AND THE VECTOR GAME

This page was built for publication: Lower bound for balanced sets