MétaCan
Menu
Back to cohort
Record W4415667429 · doi:10.55016/ojs/cdm.v20i2.75363

A bijection between the sets of $(a,b,b^2)$-generalized Motzkin paths avoiding $\mathrm{uvv}$-patterns and $\mathrm{uvu}$-patterns

2025· article· W4415667429 on OpenAlexvenueno aff
Yidong Sun, Cheng Sun, Xiuli Hao

Bibliographic record

VenueContributions to Discrete Mathematics · 2025
Typearticle
Language
FieldMathematics
TopicAdvanced Combinatorial Mathematics
Canadian institutionsnot available
Fundersnot available
KeywordsBijectionPath (computing)Quadrant (abdomen)Set (abstract data type)Lattice (music)

Abstract

fetched live from OpenAlex

A generalized Motzkin path, called G-Motzkin path for short, of length $n$ is a lattice path from $(0, 0)$ to $(n, 0)$ in the first quadrant of the XY-plane that consists of up steps $\mathrm{u}=(1, 1)$, horizontal steps $\mathrm{h}=(1, 0)$, vertical steps $\mathrm{v}=(0, -1)$ and down steps $\mathrm{d}=(1, -1)$. An $(a,b,c)$-G-Motzkin path is a weighted G-Motzkin path such that the $\mathrm{u}$-steps, $\mathrm{h}$-steps, $\mathrm{v}$-steps and $\mathrm{d}$-steps are weighted respectively by $1, a, b$ and $c$.Let $\tau$ be a word on $\{\mathrm{u}, \mathrm{h}, \mathrm{v}, \mathrm{d}\}$, denote by $\mathcal{G}_n^{\tau}(a,b,c)$ the set of $\tau$-avoiding $(a,b,c)$-G-Motzkin paths of length $n$ for a pattern $\tau$. In this paper, we consider the $\mathrm{uvv}$-avoiding $(a,b,c)$-G-Motzkin paths and provide a direct bijection $\sigma$ between $\mathcal{G}_n^{\mathrm{uvv}}(a,b,b^2)$ and $\mathcal{G}_n^{\mathrm{uvu}}(a,b,b^2)$. Finally, the set of fixed points of $\sigma$ is also described and counted.

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.004
metaresearch head score (Gemma)0.011
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Meta-epidemiology (narrow), Science and technology studies
Consensus categoriesMeta-epidemiology (narrow)
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.578
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.011
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0010.002
Science and technology studies0.0020.001
Scholarly communication0.0010.001
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0000.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.022
GPT teacher head0.340
Teacher spread0.318 · 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 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueContributions to Discrete MathematicsSame topicAdvanced Combinatorial MathematicsFrench-language works237,207