2024-08-11T02:15:21Z
https://meral.edu.mm/oai
oai:meral.edu.mm:recid/4805
2021-12-13T08:06:48Z
1582963302567:1597824273898
user-ucsy
Analyzing, Visualizing, and Searching for small size Balanced sets
Cuong, Nguyen Phu
Nedev, Zhivko
Tin, Duong Trung
Tu, Le Anh
We describe the design and implementation of a computer application that can search for a small size balanced set modulo p, with p prime. Additionally, the application can”analyze” and ”visualize” any given balanced set to show graphically the dependancies between the elements of the set. A nonempty set S of residues modulo N is balanced if for each x ∈ S, there is a d with 0 <d ≤ N/2 such that x ± d mod N both lie in S; we use α(N) to denote the minimum cardinality of a balanced set modulo N. Small size balanced sets are needed for a winning strategy in the Vector game which was introduced together with balanced sets in [5] .
2013-02-26
http://hdl.handle.net/20.500.12678/0000004805
https://meral.edu.mm/records/4805