MétaCan
Menu
Back to cohort
Record W1550281741 · doi:10.1017/s1446788715000488

NORMING SETS AND RELATED REMEZ-TYPE INEQUALITIES

2015· article· en· W1550281741 on OpenAlexaff

Bibliographic record

VenueJournal of the Australian Mathematical Society · 2015
Typearticle
Languageen
FieldMathematics
TopicMathematical functions and polynomials
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsHypersurfaceLebesgue measureMeasure (data warehouse)Lebesgue integrationStandard probability spaceInequalityAlgebraic number

Abstract

fetched live from OpenAlex

The classical Remez inequality [‘Sur une propriété des polynomes de Tchebycheff’,Comm. Inst. Sci. Kharkov13(1936), 9–95] bounds the maximum of the absolute value of a real polynomial $P$ of degree $d$ on $[-1,1]$ through the maximum of its absolute value on any subset $Z\subset [-1,1]$ of positive Lebesgue measure. Extensions to several variables and to certain sets of Lebesgue measure zero, massive in a much weaker sense, are available (see, for example, Brudnyi and Ganzburg [‘On an extremal problem for polynomials of $n$ variables’,Math. USSR Izv.37(1973), 344–355], Yomdin [‘Remez-type inequality for discrete sets’,Israel. J. Math.186(2011), 45–60], Brudnyi [‘On covering numbers of sublevel sets of analytic functions’,J. Approx. Theory162(2010), 72–93]). Still, given a subset $Z\subset [-1,1]^{n}\subset \mathbb{R}^{n}$ , it is not easy to determine whether it is ${\mathcal{P}}_{d}(\mathbb{R}^{n})$ -norming (here ${\mathcal{P}}_{d}(\mathbb{R}^{n})$ is the space of real polynomials of degree at most $d$ on $\mathbb{R}^{n}$ ), that is, satisfies a Remez-type inequality: $\sup _{[-1,1]^{n}}|P|\leq C\sup _{Z}|P|$ for all $P\in {\mathcal{P}}_{d}(\mathbb{R}^{n})$ with $C$ independent of $P$ . (Although ${\mathcal{P}}_{d}(\mathbb{R}^{n})$ -norming sets are precisely those not contained in any algebraic hypersurface of degree $d$ in $\mathbb{R}^{n}$ , there are many apparently unrelated reasons for $Z\subset [-1,1]^{n}$ to have this property.) In the present paper we study norming sets and related Remez-type inequalities in a general setting of finite-dimensional linear spaces $V$ of continuous functions on $[-1,1]^{n}$ , remaining in most of the examples in the classical framework. First, we discuss some sufficient conditions for $Z$ to be $V$ -norming, partly known, partly new, restricting ourselves to the simplest nontrivial examples. Next, we extend the Turán–Nazarov inequality for exponential polynomials to several variables, and on this basis prove a new fewnomial Remez-type inequality. Finally, we study the family of optimal constants $N_{V}(Z)$ in the Remez-type inequalities for $V$ , as the function of the set $Z$ , showing that it is Lipschitz in the Hausdorff metric.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.009
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.012
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.003
Scholarly communication0.0030.006
Open science0.0020.003
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0090.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.146
GPT teacher head0.354
Teacher spread0.208 · 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; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations6
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueJournal of the Australian Mathematical SocietySame topicMathematical functions and polynomialsFrench-language works237,207