MétaCan
Menu
Back to cohort

Loci of complex polynomials, part I

2014· article· en· W2036883687 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueTransactions of the American Mathematical Society · 2014
Typearticle
Languageen
FieldMathematics
TopicMeromorphic and Entire Functions
Canadian institutionsWestern University
FundersNatural Sciences and Engineering Research Council of CanadaBulgarian Academy of SciencesBulgarian National Science Fund
KeywordsAlgorithmAnnotationArtificial intelligenceMathematicsComputer science

Abstract

fetched live from OpenAlex

The classical Grace theorem states that every circular domain in the complex plane <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper C"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">C</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {C}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> containing the zeros of a polynomial <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p left-parenthesis z right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">p(z)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> contains a zero of any of its apolar polynomials. We say that a closed domain <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Omega subset-of-or-equal-to double-struck upper C Superscript asterisk"> <mml:semantics> <mml:mrow> <mml:mi mathvariant="normal"> Ω </mml:mi> <mml:mo> ⊆ </mml:mo> <mml:msup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">C</mml:mi> </mml:mrow> <mml:mo> ∗ </mml:mo> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">\Omega \subseteq \mathbb {C}^*</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a <italic>locus</italic> of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p left-parenthesis z right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">p(z)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> if it contains a zero of any of its apolar polynomials and is the smallest such domain with respect to inclusion. In this work we establish several general properties of the loci and show, in particular, that the property of a set being a locus of a polynomial is preserved under a Möbius transformation. We pose the problem of finding a locus inside the smallest disk containing the roots of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="p left-parenthesis z right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">p(z)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and solve it for polynomials of degree <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="3"> <mml:semantics> <mml:mn>3</mml:mn> <mml:annotation encoding="application/x-tex">3</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . Numerous examples are given.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.740
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.055
GPT teacher head0.291
Teacher spread0.235 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it