arXiv (All)
open access
Majorization and additive tuples in $\mathbb{Z}_2^n$
Majorization is a fundamental tool for comparing how "spread out" the entries of two vectors are. Key majorization results were obtained for the integers by Hardy, Littlewood and Pólya and for $\mathbb{Z}_p$ by Lev. In this paper, we establish a powerful majorization theorem in $\mathbb{Z}_2^n$ that
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimization of Quadratic Sieve Algorithm Implementation for Large Integer Factorization#974687
- NP-hardness of ideal lattice problems#1109858
- Finding a Shortest Vector and More in $2^{n/2+o(n)}$ Time using $q$-ary Coset Difference Tree#924895
- Finding a Shortest Vector and More in $2^{n/2+o(n)}$ Time using $q$-ary Coset Difference Tree#920661
- New Upper bounds on the Mondrian Art Problem#822406
Record · ID 984748
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive