MétaCan
Menu
Back to cohort
Record W85188401

An improved bound on correlation between polynomials over Z_m and MOD_q.

2006· article· en· W85188401 on OpenAlexaboutno aff
Arkadev Chattopadhyay

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsnot available
Fundersnot available
KeywordsCombinatoricsBoolean functionMathematicsPrime (order theory)Upper and lower boundsFunction (biology)PolynomialDegree (music)Discrete mathematicsPhysicsMathematical analysis
DOInot available

Abstract

fetched live from OpenAlex

achatt3cs.mcgill.ca Let m, q> 1 be two integers that are co-prime and A be any subset of Zm. Let P be any multi-variate polynomial of degree d in n variables over Zm. We show that the MODq boolean function on n variables has correlation at most exp(−Ω(n/(m2 m−1)d)) with the boolean function f defined by f(x) = 1 iff P (x) ∈ A for all x ∈ {0, 1}n. This improves on the bound of exp(−Ω(n/(m2m)d)) obtained in the breakthrough work of Bourgain [3] and Green et al. [9]. Our calculation is also slightly shorter than theirs. Our result immediately implies the bound of exp(−Ω(n/4d)) for the special case of m = 2. This bound was first reported in the recent work of Viola [11]. [11] states that it is not clear how to extend their method to general m. 1

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.007
metaresearch head score (Gemma)0.035
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.018
Threshold uncertainty score0.061

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.035
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0040.004
Science and technology studies0.0020.003
Scholarly communication0.0030.010
Open science0.0030.005
Research integrity0.0020.006
Insufficient payload (model declined to judge)0.0180.005

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.018
GPT teacher head0.291
Teacher spread0.273 · 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

Citations4
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicLimits and Structures in Graph TheoryFrench-language works237,207