Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We study the problem of determining the minimal degree <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="d left-parenthesis m right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>d</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>m</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">d(m)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of a polynomial that has all coefficients in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartSet 0 comma 1 EndSet"> <mml:semantics> <mml:mrow> <mml:mo fence="false" stretchy="false">{</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo fence="false" stretchy="false">}</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\{0,1\}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and a zero of multiplicity <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="m"> <mml:semantics> <mml:mi>m</mml:mi> <mml:annotation encoding="application/x-tex">m</mml:annotation> </mml:semantics> </mml:math> </inline-formula> at <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="negative 1"> <mml:semantics> <mml:mrow> <mml:mo> − </mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">-1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We show that a greedy solution is optimal precisely when <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="m less-than-or-equal-to 5"> <mml:semantics> <mml:mrow> <mml:mi>m</mml:mi> <mml:mo> ≤ </mml:mo> <mml:mn>5</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">m\leq 5</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , mirroring a result of Boyd on polynomials with <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="plus-or-minus 1"> <mml:semantics> <mml:mrow> <mml:mo> ± </mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">\pm 1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> coefficients. We then examine polynomials of the form <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="product Underscript e element-of upper E Endscripts left-parenthesis x Superscript e Baseline plus 1 right-parenthesis"> <mml:semantics> <mml:mrow> <mml:munder> <mml:mo> ∏ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>e</mml:mi> <mml:mo> ∈ </mml:mo> <mml:mi>E</mml:mi> </mml:mrow> </mml:munder> <mml:mo stretchy="false">(</mml:mo> <mml:msup> <mml:mi>x</mml:mi> <mml:mi>e</mml:mi> </mml:msup> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\prod _{e\in E} (x^e+1)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , where <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper E"> <mml:semantics> <mml:mi>E</mml:mi> <mml:annotation encoding="application/x-tex">E</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a set of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="m"> <mml:semantics> <mml:mi>m</mml:mi> <mml:annotation encoding="application/x-tex">m</mml:annotation> </mml:semantics> </mml:math> </inline-formula> positive odd integers with distinct subset sums, and we develop algorithms to determine the minimal degree of such a polynomial. We determine that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="d left-parenthesis m right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>d</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>m</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">d(m)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> satisfies inequalities of the form <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2 Superscript m Baseline plus c 1 m less-than-or-equal-to d left-parenthesis m right-parenthesis less-than-or-equal-to StartFraction 103 Over 96 EndFraction dot 2 Superscript m Baseline plus c 2"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mi>m</mml:mi> </mml:msup> <mml:mo>+</mml:mo> <mml:msub> <mml:mi>c</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mi>m</mml:mi> <mml:mo> ≤ </mml:mo> <mml:mi>d</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>m</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo> ≤ </mml:mo> <mml:mfrac> <mml:mn>103</mml:mn> <mml:mn>96</mml:mn> </mml:mfrac> <mml:mo> ⋅ </mml:mo> <mml:msup> <mml:mn>2</mml:mn> <mml:mi>m</mml:mi> </mml:msup> <mml:mo>+</mml:mo> <mml:msub>
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it