An algorithm for finding a nearly minimal balanced set in 𝔽_{𝕡}

DOI10.1090/S0025-5718-09-02237-6zbMath1223.11153OpenAlexW1526628995MaRDI QIDQ3055198

Zhivko Nedev

Publication date: 7 November 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-09-02237-6

zbMATH Keywords

algorithmfinite fieldcombinatorial gamesbalanced set

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (4)

An \(O(n)\)-round strategy for the Magnus-Derek game ⋮ Unique differences in symmetric subsets of \(\mathbb F_p\) ⋮ Lower bound for balanced sets ⋮ Unique sums and differences in finite abelian groups

Cites Work

• Unnamed Item
• Lower bound for balanced sets
• Differences of residues (mod p)
• Addition of sequences in general fields
• A surprising determinantal inequality for real matrices
• The Magnus-Derek game
• BALANCED SETS AND THE VECTOR GAME

This page was built for publication: An algorithm for finding a nearly minimal balanced set in 𝔽_{𝕡}