[2508.00971] A note on multiset reconstruction from sum and pairwise products
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. arXiv Operational Status Get status notifications via email or slack
[2508.00971] A note on multiset reconstruction from sum and pairwise products Skip to main content Search arXiv Press Enter to search · Advanced search --> Mathematics > Combinatorics arXiv:2508.00971 (math) [Submitted on 1 Aug 2025] Title: A note on multiset reconstruction from sum and pairwise products Authors: Stella Jiahui Li View a PDF of the paper titled A note on multiset reconstruction from sum and pairwise products, by Stella Jiahui Li View PDF HTML (experimental) Abstract: Ballantine, Beck, and Merca defined a map $\mathrm{pre}_2$, which sends an integer partition $\lambda = (
Explore this link on the map →related reading
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Stirling numbers of the second kind - Wikipediaen.wikipedia.org
- Partitioning to solve Bin Packing Problemsarxiv.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Plus 2: Luyện đọc điền và đọc hiểu chuyên sâu (2024)ngoaingu24h.vn
- Permutation Check via Product Checkgeorgwiese.github.io
- nullstellensatzweb.math.princeton.edu
- Using Lean to Prove 1080 Setsabelianpi.dev
- Chữa Đề số 01ngoaingu24h.vn
- Pairing function - Wikipediaen.wikipedia.org
- Computational Complexityblog.computationalcomplexity.org
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu