Skip to article Metriq PRISM Laboratory Back to research
← All researchMF-PRISM-MATH-2026-06 / interactive guide

THE IDEA, MADE VISIBLE

Count every way. Notice what is missing.

Inspect the paper’s actual finite certificates, one subset sum at a time.

Candidate resolutionFinite Certificates for Three Unresolved Cardinal-Function Ranges
Explore the idea
Count every way. Notice what is missing.Certificate C reaches target 24 in 5 ways. Its positive coefficient range is {1, 3, 4, 5}.EXACT SUBSET-SUM MULTIPLICITIES2atom 15atom 26atom 39atom 410atom 511atom 613atom 7128 subsets of 7 positions
Calculated illustration · change the inputs to inspect the mechanism.
01 / 04Guided chapter

Choose the atoms

Equal numbers still occupy distinct positions. Choosing the first 2 is a different subset from choosing the second 2.

24
Subsets
128
Target
24
Representations
5

Certificate C reaches target 24 in 5 ways. Its positive coefficient range is {1, 3, 4, 5}.

P(z) = ∏ (1 + zᵃ); [zᵗ]P(z) = number of subsets with sum t

TRY THIS

Choose certificate C and target 11, then 21, then 24. Their multiplicities are 3, 4 and 5.

What this experiment represents. Exact integer enumeration of the three finite certificates printed in MATH-2026-06. The infinite Cantor extensions and publication-priority questions are not verified by this browser experiment.

Source manuscript & release ↗Read the full explanation ↓

MF-PRISM-MATH-2026-06 / v2.2

Candidate preprint · Not peer reviewed

Finite Certificates for Three Unresolved Cardinal-Function Ranges

Version 2.2 presents three exact finite subset-sum certificates for unresolved cardinal-function ranges, together with Cantor-set extensions and reproducible verification. The interactive explorer on this site visualizes the first two certificates; the canonical repository contains the complete current paper.

EditionVersion 2.2
Released18 July 2026
Reserved DOI10.5281/zenodo.21434632 Reserved · not published on Zenodo
Canonical record
01 Overview

The question, construction, and claim.

This page is an interactive guide to the preprint. The manuscript and source package remain the controlling research record.

CANDIDATE PREPRINT · NOT PEER REVIEWED. Version 2.2 contains three finite certificates; independent specialist review remains outstanding. This edition succeeds historical identifier MF-MATH-2026-06, whose release remains preserved. Metriq PRISM Laboratory is the organizational creator; Daniel H. Jeffery is Research Director and corresponding contributor. Review the current files on GitHub ↗
QUESTION

Can two ranges left blank in a recent classification table be realized as subset-sum representation counts?

CONSTRUCTION

How the paper approaches it

Compute coefficients of the finite generating polynomial ∏ᵢ(1 + zˣⁱ). Two short integer sequences yield the target coefficient ranges, then a uniquely represented Cantor tail preserves every multiplicity.

WHY IT MATTERS

What the result would establish

Unlike the other candidate arguments, the central certificates are finite and exactly enumerable. The remaining uncertainty concerns table interpretation, prior art, and novelty.

CANDIDATE MAIN RESULT

The current paper presents three exact finite certificates. This website explorer exposes the first two constructions and their Cantor-set extensions; Version 2.2 in GitHub contains the complete third certificate.

a = (1, 2, 2, 3, 3) → range {1,2,3,4,5}
b = (1, 1, 2, 2, 3, 6) → range {1,2,3,5,6}
Append τₙ = 3⁻ⁿ to preserve the range on a Cantor set
Research status. This is a candidate result released for independent mathematical review. It is not peer reviewed, accepted, or presented as an established resolution. The source package identifies proof dependencies, verification limits, licensing, and review priorities.
02 Explorer

Work with the construction.

These interfaces reproduce finite structures and diagnostics described by the paper. They are explanatory tools, not substitutes for the infinite proofs.

INTERACTIVE EXPLOREREXACT SUBSET MULTIPLICITIES

Inspect each finite certificate.

Every bar is the exact number of indexed subsets that produce a given total. Select a bar to inspect the corresponding representations.

Sequence
Coefficient range
Indexed subsets
Total sum
Selected total
Representations

Coefficient spectrum

Selected representations

03 Proof structure

How the argument is assembled.

The paper separates the claim into proof obligations that can be reviewed independently.

01

Coefficient identity

The coefficient of zᵗ in ∏ᵢ(1 + zˣⁱ) counts subsets of the indexed sequence whose sum is t.

02

Certificate A

Expand (1 + z)(1 + z²)²(1 + z³)² and read the positive coefficient set {1,2,3,4,5}.

03

Certificate B

Expand (1 + z)²(1 + z²)²(1 + z³)(1 + z⁶) and obtain {1,2,3,5,6}, with multiplicity 4 omitted.

04

Cantorization

Append τₙ = 3⁻ⁿ. Unique tail representations and disjoint integer translates preserve the finite multiplicities while producing a Cantor set.

05

Third certificate

Version 2.2 adds a third finite witness, verified by exact polynomial multiplication and exhaustive enumeration. Consult the canonical repository for the sequence, range, and full proof.

04 Verification

Exact checks and their limits.

Verification scripts test finite identities and consistency conditions. They do not replace the symbolic proofs of infinite statements.

WEBSITE VERIFICATION SNAPSHOTCurrent paper v2.2 · explorer covers certificates A–B
MF-PRISM-MATH-2026-06 exact verification
===================================
Certificate A
  sequence: (1, 2, 2, 3, 3)
  total sum: 11
  coefficients: (1, 1, 2, 4, 3, 5, 5, 3, 4, 2, 1, 1)
  coefficient range: [1, 2, 3, 4, 5]
  coefficient sum: 32 = 2^5
  polynomial: 1 + z + 2z^2 + 4z^3 + 3z^4 + 5z^5 + 5z^6 + 3z^7 + 4z^8 + 2z^9 + z^10 + z^11
  checks: DP = direct enumeration; palindromic; no zero coefficients; PASS

Certificate B
  sequence: (1, 1, 2, 2, 3, 6)
  total sum: 15
  coefficients: (1, 2, 3, 5, 5, 5, 6, 5, 5, 6, 5, 5, 5, 3, 2, 1)
  coefficient range: [1, 2, 3, 5, 6]
  coefficient sum: 64 = 2^6
  polynomial: 1 + 2z + 3z^2 + 5z^3 + 5z^4 + 5z^5 + 6z^6 + 5z^7 + 5z^8 + 6z^9 + 5z^10 + 5z^11 + 5z^12 + 3z^13 + 2z^14 + z^15
  checks: DP = direct enumeration; palindromic; no zero coefficients; PASS

Cantor tail
  tau_n = 3^{-n}
  total = 1/2
  tail after n = 1/(2*3^n) < 1/3^n
  distinct integer translates have separation at least 1 > 1/2
  uniqueness/disjointness checks: PASS

ALL EXACT CHECKS PASSED
05 Figures

Formula-derived visuals.

The source package includes the scripts and files used to generate these figures.

Representation-count spectra for the two finite certificates.
Representation-count spectra for the two finite certificates.
How a uniquely represented Cantor tail preserves the finite coefficient range.
How a uniquely represented Cantor tail preserves the finite coefficient range.
06 Independent review

Where criticism is most valuable.

A useful review identifies the exact theorem, equation, inference, or prior-art issue involved and distinguishes fatal defects from repairable exposition.

REVIEW TARGET 01

Table interpretation

Confirm the classification classes and that the cited table leaves exactly the claimed entries unresolved.

REVIEW TARGET 02

Polynomial expansions

Verify both identities with repeated sequence values treated as distinct indices.

REVIEW TARGET 03

Novelty and Cantorization

Search for equivalent finite witnesses and audit the uniqueness, separation, and homeomorphism arguments for the tail extension.

Research disclosure. The source package contains the paper-specific authorship, AI-assistance, licensing, and reproducibility disclosures. AI systems are not listed as authors; Metriq Foundation accepts responsibility for releasing the work as a candidate result.
07 Citation

Cite the version you reviewed.

State that the result was a candidate preprint and had not undergone peer review at the time of citation.

Metriq PRISM Laboratory. (2026). Finite Certificates for Three Unresolved Cardinal-Function Ranges (Version 2.2) [Candidate research preprint]. Metriq Foundation, Inc. https://doi.org/10.5281/zenodo.21434632

In this paper