Lower bound for balanced sets
From MaRDI portal
Publication:690486
DOI10.1016/J.TCS.2012.06.016zbMATH Open1257.11026OpenAlexW2079356720MaRDI QIDQ690486FDOQ690486
Authors: 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
Recommendations
- Balanced minimum covers of a finite set
- scientific article; zbMATH DE number 3876428
- On linear balancing sets
- Upper bounds on minimum balanced bipartitions
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits
- Balanced subset sums in dense sets of integers
- scientific article; zbMATH DE number 4195978
- scientific article; zbMATH DE number 6302886
- Balanced 2-subsets
- An algorithm for finding a nearly minimal balanced set in \(\mathbb{F}_p\)
Other combinatorial number theory (11B75) Extremal combinatorics (05D99) Additive bases, including sumsets (11B13)
Cites Work
- Addition of sequences in general fields
- An \(O(n)\)-round strategy for the Magnus-Derek game
- The Magnus-Derek game
- A surprising determinantal inequality for real matrices
- An algorithm for finding a nearly minimal balanced set in \(\mathbb{F}_p\)
- BALANCED SETS AND THE VECTOR GAME
- Universal sets and the vector game
Cited In (9)
- Balanced 2-subsets
- An algorithm for finding a nearly minimal balanced set in \(\mathbb{F}_p\)
- Balanced minimum covers of a finite set
- The maximum number of balancing sets
- Title not available (Why is that?)
- Unique sums and differences in finite abelian groups
- On balanced sets mod p
- Unique differences in symmetric subsets of \(\mathbb F_p\)
- Balanced and absorbing subsets with empty interior
This page was built for publication: Lower bound for balanced sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690486)
