0-Cyclic Equalizability of Binary Words Characterized by Hamming Weight

Sarunyu Thongjarast

cs.CR, math.CO

Submitted: 2026-07-20

Comments: 20 pages, 5 figures. Code available at https://github.com/SThongjarast/Binary-Equalization

Code: https://github.com/SThongjarast/Binary-Equalization

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Related papers

• SoK: AI-Augmented Binary Reversing
• Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
• Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
• Efficient Fuzzy PSI under One-Sided Assumptions
• Sealing the Audit-Runtime Gap for LLM Skills
• Token Composition: A Graph Based on EVM Logs