erdos-problems 0.1.0 → 0.1.1

package/README.md

@@ -2,18 +2,35 @@
 
 CLI atlas and staged research harness for Paul Erdos problems.
 
+## Install
+
+```bash
+npm install -g erdos-problems
+```
+
+Official package:
+- `erdos-problems`
+
+Official binary:
+- `erdos`
+
 ## Current shape
 
 - atlas layer for seeded Erdos problems
 - sunflower cluster as the first deep harness pack
-- initial seeded problems: `20`, `536`, `856`, `857`
 - lightweight `.erdos/` workspace state for active-problem selection
+- seeded atlas now includes open and solved problems beyond sunflower
+
+Seeded problems:
+- `18`, `20`, `89`, `536`, `542`, `856`, `857`, `1008`
 
 ## CLI
 
 ```bash
 erdos problem list
 erdos problem list --cluster sunflower
+erdos problem list --repo-status historical
+erdos problem list --harness-depth deep
 erdos problem use 857
 erdos problem show
 erdos cluster list
@@ -22,6 +39,11 @@ erdos workspace show
 erdos dossier show
 ```
 
+## Notes
+
+- `erdos-problems` is the canonical npm package name.
+- The compact unscoped alias `erdosproblems` is not publishable because npm rejects it as too similar to `erdos-problems`.
+
 ## Docs
 
 - `docs/ERDOS_PROBLEMS_REPO_SPEC.md`

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "erdos-problems",
-  "version": "0.1.0",
+  "version": "0.1.1",
   "description": "CLI atlas and staged research harness for Paul Erdos problems.",
   "type": "module",
   "bin": {

package/problems/1008/EVIDENCE.md

@@ -0,0 +1,4 @@
+# Problem 1008 Evidence
+
+- Historical solved entry.
+- Site records the problem as `PROVED (LEAN)`.

package/problems/1008/FORMALIZATION.md

@@ -0,0 +1,5 @@
+# Problem 1008 Formalization
+
+- Site badge: `PROVED (LEAN)`
+- Site also says: `Formalised statement? No`
+- Local interpretation: the solved status has Lean-verified proof metadata on the site, but we have not yet imported the supporting formal artifacts here.

package/problems/1008/REFERENCES.md

@@ -0,0 +1,5 @@
+# Problem 1008 References
+
+- Source page: <https://www.erdosproblems.com/1008>
+- Site badge: `PROVED (LEAN)`
+- Source credits Conlon, Fox, and Sudakov for the first affirmative proof.

package/problems/1008/STATEMENT.md

@@ -0,0 +1,9 @@
+# Problem 1008 Statement
+
+Source: <https://www.erdosproblems.com/1008>
+
+Normalized focus:
+- C4-free subgraphs inside dense graphs
+
+Core question:
+- Does every graph with `m` edges contain a C4-free subgraph with at least a constant multiple of `m^(2/3)` edges?

package/problems/1008/problem.yaml

@@ -0,0 +1,16 @@
+problem_id: "1008"
+display_name: "Erdos Problem #1008"
+title: "C4-Free Subgraph Density Problem"
+source:
+  site: "erdosproblems.com"
+  url: "https://www.erdosproblems.com/1008"
+  external_id: "1008"
+status:
+  site_status: "solved"
+  site_badge: "PROVED (LEAN)"
+  repo_status: "historical"
+cluster: "graph-theory"
+related_problems: []
+family_tags:
+  - "graph-theory"
+  - "cycles"

package/problems/18/EVIDENCE.md

@@ -0,0 +1,4 @@
+# Problem 18 Evidence
+
+- Atlas-only entry for now.
+- No local theorem harness or computational evidence has been attached yet.

package/problems/18/FORMALIZATION.md

@@ -0,0 +1,5 @@
+# Problem 18 Formalization
+
+- Site reports: `Formalised statement? Yes`
+- Local repo status: dossier only
+- Next step: link the referenced formal statement source into the dossier.

package/problems/18/REFERENCES.md

@@ -0,0 +1,6 @@
+# Problem 18 References
+
+- Source page: <https://www.erdosproblems.com/18>
+- Site badge: `OPEN`
+- Tags on source: `number theory`, `divisors`, `factorials`
+- Site notes a $250 reward and records the page as formally stated.

package/problems/18/STATEMENT.md

@@ -0,0 +1,12 @@
+# Problem 18 Statement
+
+Source: <https://www.erdosproblems.com/18>
+
+Normalized focus:
+- practical numbers
+- divisor-sum efficiency parameter `h(m)`
+- factorial specialization `h(n!)`
+
+Core question:
+- Are there infinitely many practical `m` with `h(m) < (log log m)^{O(1)}`?
+- Is `h(n!) < n^{o(1)}` or even `h(n!) < (log n)^{O(1)}`?

package/problems/18/problem.yaml

@@ -0,0 +1,17 @@
+problem_id: "18"
+display_name: "Erdos Problem #18"
+title: "Practical Numbers Divisor-Sum Efficiency"
+source:
+  site: "erdosproblems.com"
+  url: "https://www.erdosproblems.com/18"
+  external_id: "18"
+status:
+  site_status: "open"
+  site_badge: "OPEN"
+  repo_status: "cataloged"
+cluster: "number-theory"
+related_problems: []
+family_tags:
+  - "number-theory"
+  - "divisors"
+  - "factorials"

package/problems/542/EVIDENCE.md

@@ -0,0 +1,6 @@
+# Problem 542 Evidence
+
+- Historical solved entry.
+- Source reports:
+  - first question resolved affirmatively
+  - second question resolved negatively

package/problems/542/FORMALIZATION.md

@@ -0,0 +1,5 @@
+# Problem 542 Formalization
+
+- Site reports: `Formalised statement? No`
+- Local repo status: historical dossier only
+- Next step: capture a formalizable modern restatement if this cluster becomes active.

package/problems/542/REFERENCES.md

@@ -0,0 +1,5 @@
+# Problem 542 References
+
+- Source page: <https://www.erdosproblems.com/542>
+- Site badge: `SOLVED`
+- Source records the resolution by Schinzel and Szekeres and later sharpening by Chen.

package/problems/542/STATEMENT.md

@@ -0,0 +1,11 @@
+# Problem 542 Statement
+
+Source: <https://www.erdosproblems.com/542>
+
+Normalized focus:
+- subsets of `{1, ..., n}` with all pairwise least common multiples above `n`
+- reciprocal-sum control and divisor-avoidance density
+
+Core historical questions:
+- Must `sum_{a in A} 1/a <= 31/30`?
+- Must there be linearly many `m <= n` dividing no element of `A`?

package/problems/542/problem.yaml

@@ -0,0 +1,17 @@
+problem_id: "542"
+display_name: "Erdos Problem #542"
+title: "LCM-Free Sets Reciprocal Sum Bound"
+source:
+  site: "erdosproblems.com"
+  url: "https://www.erdosproblems.com/542"
+  external_id: "542"
+status:
+  site_status: "solved"
+  site_badge: "SOLVED"
+  repo_status: "historical"
+cluster: "number-theory"
+related_problems:
+  - "784"
+family_tags:
+  - "number-theory"
+  - "least-common-multiple"

package/problems/89/EVIDENCE.md

@@ -0,0 +1,4 @@
+# Problem 89 Evidence
+
+- Atlas-only entry for now.
+- No local computational or formalization artifacts are attached yet.

package/problems/89/FORMALIZATION.md

@@ -0,0 +1,5 @@
+# Problem 89 Formalization
+
+- Site reports: `Formalised statement? Yes`
+- Local repo status: dossier only
+- Next step: capture the formal statement link and relevant lower-bound references.

package/problems/89/REFERENCES.md

@@ -0,0 +1,6 @@
+# Problem 89 References
+
+- Source page: <https://www.erdosproblems.com/89>
+- Site badge: `OPEN`
+- Tags on source: `geometry`, `distances`
+- Source notes the Guth-Katz bound `>> n / log n` as the current near-solution benchmark.

package/problems/89/STATEMENT.md

@@ -0,0 +1,10 @@
+# Problem 89 Statement
+
+Source: <https://www.erdosproblems.com/89>
+
+Normalized focus:
+- distinct distances in the plane
+- near-optimal lower bounds
+
+Core question:
+- Does every set of `n` distinct points in `R^2` determine at least a constant multiple of `n / sqrt(log n)` distinct distances?

package/problems/89/problem.yaml

@@ -0,0 +1,16 @@
+problem_id: "89"
+display_name: "Erdos Problem #89"
+title: "Distinct Distances Lower Bound"
+source:
+  site: "erdosproblems.com"
+  url: "https://www.erdosproblems.com/89"
+  external_id: "89"
+status:
+  site_status: "open"
+  site_badge: "OPEN"
+  repo_status: "cataloged"
+cluster: "geometry"
+related_problems: []
+family_tags:
+  - "geometry"
+  - "distances"

package/src/atlas/catalog.js

@@ -1,9 +1,26 @@
 export const catalog = [
+  {
+    problemId: '18',
+    displayName: 'Erdos Problem #18',
+    title: 'Practical Numbers Divisor-Sum Efficiency',
+    siteStatus: 'open',
+    siteBadge: 'OPEN',
+    repoStatus: 'cataloged',
+    cluster: 'number-theory',
+    familyTags: ['number-theory', 'divisors', 'factorials'],
+    relatedProblems: [],
+    sourceUrl: 'https://www.erdosproblems.com/18',
+    shortStatement:
+      'Study whether infinitely many practical numbers admit polylogarithmic divisor-sum efficiency, and whether h(n!) is polylogarithmic.',
+    harnessDepth: 'dossier',
+    formalizationStatus: 'statement-formalized',
+  },
   {
     problemId: '20',
     displayName: 'Erdos Problem #20',
     title: 'Strong Sunflower Problem',
     siteStatus: 'open',
+    siteBadge: 'OPEN',
     repoStatus: 'active',
     cluster: 'sunflower',
     familyTags: ['sunflower', 'uniform-families'],
@@ -14,11 +31,28 @@ export const catalog = [
     harnessDepth: 'deep',
     formalizationStatus: 'active',
   },
+  {
+    problemId: '89',
+    displayName: 'Erdos Problem #89',
+    title: 'Distinct Distances Lower Bound',
+    siteStatus: 'open',
+    siteBadge: 'OPEN',
+    repoStatus: 'cataloged',
+    cluster: 'geometry',
+    familyTags: ['geometry', 'distances'],
+    relatedProblems: [],
+    sourceUrl: 'https://www.erdosproblems.com/89',
+    shortStatement:
+      'Ask whether every n-point set in the plane determines at least a constant multiple of n/sqrt(log n) distinct distances.',
+    harnessDepth: 'dossier',
+    formalizationStatus: 'statement-formalized',
+  },
   {
     problemId: '536',
     displayName: 'Erdos Problem #536',
     title: 'LCM Sunflower Analogue',
     siteStatus: 'open',
+    siteBadge: 'OPEN',
     repoStatus: 'cataloged',
     cluster: 'sunflower',
     familyTags: ['sunflower-analogue', 'number-theory'],
@@ -29,11 +63,28 @@ export const catalog = [
     harnessDepth: 'dossier',
     formalizationStatus: 'planned',
   },
+  {
+    problemId: '542',
+    displayName: 'Erdos Problem #542',
+    title: 'LCM-Free Sets Reciprocal Sum Bound',
+    siteStatus: 'solved',
+    siteBadge: 'SOLVED',
+    repoStatus: 'historical',
+    cluster: 'number-theory',
+    familyTags: ['number-theory', 'least-common-multiple'],
+    relatedProblems: ['784'],
+    sourceUrl: 'https://www.erdosproblems.com/542',
+    shortStatement:
+      'Control reciprocal sums of sets with all pairwise least common multiples above n, a problem resolved by Schinzel and Szekeres.',
+    harnessDepth: 'dossier',
+    formalizationStatus: 'unstarted',
+  },
   {
     problemId: '856',
     displayName: 'Erdos Problem #856',
     title: 'Harmonic LCM Sunflower Analogue',
     siteStatus: 'open',
+    siteBadge: 'OPEN',
     repoStatus: 'cataloged',
     cluster: 'sunflower',
     familyTags: ['sunflower-analogue', 'number-theory'],
@@ -49,6 +100,7 @@ export const catalog = [
     displayName: 'Erdos Problem #857',
     title: 'Sunflower Conjecture',
     siteStatus: 'open',
+    siteBadge: 'OPEN',
     repoStatus: 'active',
     cluster: 'sunflower',
     familyTags: ['sunflower', 'extremal-set-theory'],
@@ -65,12 +117,33 @@ export const catalog = [
       problemSolved: false,
     },
   },
+  {
+    problemId: '1008',
+    displayName: 'Erdos Problem #1008',
+    title: 'C4-Free Subgraph Density Problem',
+    siteStatus: 'solved',
+    siteBadge: 'PROVED (LEAN)',
+    repoStatus: 'historical',
+    cluster: 'graph-theory',
+    familyTags: ['graph-theory', 'cycles'],
+    relatedProblems: [],
+    sourceUrl: 'https://www.erdosproblems.com/1008',
+    shortStatement:
+      'Determine whether every graph with m edges contains a C4-free subgraph with a constant multiple of m^(2/3) edges.',
+    harnessDepth: 'dossier',
+    formalizationStatus: 'site-proved-lean',
+  },
 ];
 
 export function listProblems(filters = {}) {
   const cluster = filters.cluster ? String(filters.cluster).toLowerCase() : null;
+  const repoStatus = filters.repoStatus ? String(filters.repoStatus).toLowerCase() : null;
+  const harnessDepth = filters.harnessDepth ? String(filters.harnessDepth).toLowerCase() : null;
+
   return [...catalog]
     .filter((entry) => (cluster ? entry.cluster === cluster : true))
+    .filter((entry) => (repoStatus ? entry.repoStatus === repoStatus : true))
+    .filter((entry) => (harnessDepth ? entry.harnessDepth === harnessDepth : true))
     .sort((a, b) => Number(a.problemId) - Number(b.problemId));
 }
 

package/src/commands/problem.js

@@ -14,20 +14,39 @@ function parseListFilters(args) {
       index += 1;
       continue;
     }
+    if (token === '--repo-status') {
+      const repoStatus = args[index + 1];
+      if (!repoStatus) {
+        return { error: 'Missing repo status after --repo-status.' };
+      }
+      filters.repoStatus = repoStatus;
+      index += 1;
+      continue;
+    }
+    if (token === '--harness-depth') {
+      const harnessDepth = args[index + 1];
+      if (!harnessDepth) {
+        return { error: 'Missing harness depth after --harness-depth.' };
+      }
+      filters.harnessDepth = harnessDepth;
+      index += 1;
+      continue;
+    }
     return { error: `Unknown list option: ${token}` };
   }
   return { filters };
 }
 
 function printProblemTable(rows, activeProblem) {
-  console.log('ID   Site   Repo       Cluster     Active  Title');
+  console.log('ID   Site   Repo       Cluster         Depth    Active  Title');
   for (const row of rows) {
     const id = row.problemId.padEnd(4, ' ');
     const site = row.siteStatus.padEnd(6, ' ');
     const repo = row.repoStatus.padEnd(10, ' ');
-    const cluster = row.cluster.padEnd(11, ' ');
+    const cluster = row.cluster.padEnd(15, ' ');
+    const depth = row.harnessDepth.padEnd(8, ' ');
     const active = (row.problemId === activeProblem ? '*' : '-').padEnd(7, ' ');
-    console.log(`${id} ${site} ${repo} ${cluster} ${active} ${row.title}`);
+    console.log(`${id} ${site} ${repo} ${cluster} ${depth} ${active} ${row.title}`);
   }
 }
 
@@ -36,6 +55,7 @@ function printProblem(problem) {
   console.log(`Title: ${problem.title}`);
   console.log(`Source: ${problem.sourceUrl}`);
   console.log(`Site status: ${problem.siteStatus}`);
+  console.log(`Site badge: ${problem.siteBadge ?? problem.siteStatus}`);
   console.log(`Repo status: ${problem.repoStatus}`);
   console.log(`Cluster: ${problem.cluster}`);
   console.log(`Harness depth: ${problem.harnessDepth}`);
@@ -57,7 +77,7 @@ export function runProblemCommand(args) {
 
   if (!subcommand || subcommand === 'help' || subcommand === '--help') {
     console.log('Usage:');
-    console.log('  erdos problem list [--cluster <name>]');
+    console.log('  erdos problem list [--cluster <name>] [--repo-status <status>] [--harness-depth <depth>]');
     console.log('  erdos problem show <id>');
     console.log('  erdos problem use <id>');
     console.log('  erdos problem current');