MétaCan
Menu
Back to cohort
Record W7133020911

Weighted approximation in R[superscript]n

2004· dissertation· W7133020911 on OpenAlexfundno aff
Maritza Maria Branker

Bibliographic record

VenueTSpace · 2004
Typedissertation
Language
FieldMathematics
TopicHolomorphic and Operator Theory
Canadian institutionsnot available
FundersUniversity of Toronto
KeywordsPolynomialMultivariable calculusMinimax approximation algorithmWeight functionInterval (graph theory)Product (mathematics)Function (biology)
DOInot available

Abstract

fetched live from OpenAlex

The main body of this thesis is divided into three parts. Part 1, consisting of the first two chapters, contains all the required background material. We provide an overview of weighted potential theory and its application to the question of uniformly approximating continuous functions by functions of the form wnPn for a given weight w and a polynomial Pn of degree at most n. We also include the relevant pluripotential theory using Klimek's monograph as our primary reference. The basic results in weighted pluripotential theory were proven by Siciak, Bloom and by Bloom and Levenberg. Chapters 3 and 4 form Part 2 of the thesis. Chapter 3 consists of further results in weighted pluripotential theory. In the first section of Chapter 3 we establish some properties of the weighted pluricomplex Green function VΣ,Q. These include results concerning the behaviour of VΣ,Q under polynomial mappings, taking limits and on product sets. In the second section we prove some general results on the support Sw of the equilibrium measure. One notable result obtained is a characterization of the points in Sw. The focus of Chapter 4 is a generalized Weierstrass approximation problem. Specifically, we consider the question of uniform approximation by weighted multivariable polynomials on compact sets in [special characters omitted]. The final part of the thesis is a chapter on the approximation of continuous functions by multivariable incomplete polynomials in [special characters omitted]. Incomplete polynomials were first defined by G. G. Lorentz in the 1970s on the unit interval [0, 1] and they have been the subject of intense study in the general area of approximation theory. Recently, Kroó started to extend the theory of incomplete polynomials to [special characters omitted]. He obtained results on a restricted class of convex domains in [special characters omitted] which includes parallelograms with a vertex at the origin and sections of the unit disk with central angle less than π/2. We succeed in proving some general results in [special characters omitted] for n > 1 using weighted pluripotential techniques.

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.

How this classification was reachedexpand

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Qualitative · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.139
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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.031
GPT teacher head0.337
Teacher spread0.306 · 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

Classification

machine, unvalidated

Machine predicted; both teacher heads agree on what is shown here.

Study designQualitative
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicHolomorphic and Operator TheoryFrench-language works237,207