arXiv (All)
open access
Sets of cardinality seven are not sum-dominant
We give a self-contained elementary proof of the known result that every set $A\subset\R$ of cardinality seven satisfies $|A+A|\le |A-A|$. The argument adapts Hegarty's method, using representation counts and the largest positive differences. An exact counting identity, two applications of the Cauch
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
- Measurable Matroids: Foundations and Min--Max Theorems#625056
- Measurable Matroids: Foundations and Min--Max Theorems#622783
- Vizing's theorem for signed multigraphs#1117820
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
Record · ID 1131257
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