MétaCan
Menu
Back to cohort
Record W2104751344 · doi:10.46298/dmtcs.2740

New Hopf Structures on Binary Trees

2009· article· en· W2104751344 on OpenAlexaff
Stefan Forcey, Aaron Lauve, Frank Sottile

Bibliographic record

VenueDiscrete Mathematics & Theoretical Computer Science · 2009
Typearticle
Languageen
FieldMathematics
TopicAdvanced Combinatorial Mathematics
Canadian institutionsToronto Metropolitan University
FundersNational Science Foundation
KeywordsPolytopeCombinatoricsMathematicsHypercubeHopf algebraFactorizationAlgebraic numberAlgebra over a fieldPure mathematics

Abstract

fetched live from OpenAlex

The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is nestled between two families of polytopes that certainly are not: the permutahedra $\mathfrak{S}_{\bullet}$ and associahedra $\mathcal{Y}_{\bullet}$. The maps $\mathfrak{S}_{\bullet} \twoheadrightarrow \mathcal{M}_{\bullet} \twoheadrightarrow \mathcal{Y}_{\bullet}$ reveal several new Hopf structures on tree-like objects nestled between the Hopf algebras $\mathfrak{S}Sym$ and $\mathcal{Y}Sym$. We begin their study here, showing that $\mathcal{M}Sym$ is a module over $\mathfrak{S}Sym$ and a Hopf module over $\mathcal{Y}Sym$. An elegant description of the coinvariants for $\mathcal{M}Sym$ over $\mathcal{Y}Sym$ is uncovered via a change of basis-using Möbius inversion in posets built on the $1$-skeleta of $\mathcal{M}_{\bullet}$. Our analysis uses the notion of an $\textit{interval retract}$ that should be of independent interest in poset combinatorics. It also reveals new families of polytopes, and even a new factorization of a known projection from the associahedra to hypercubes. Les multiplièdres $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ forment une famille de polytopes en provenant de l'étude des catégories supérieures et de la théorie de l'homotopie. Tandis que les multiplihèdres sont peu connus dans la communauté de la combinatoire algébrique, ils sont nichés entre deux familles des polytopes qui sont bien connus: les permutahèdres $\mathfrak{S}_{\bullet}$ et les associahèdres $\mathcal{Y}_{\bullet}$. Les morphismes $\mathfrak{S}_{\bullet} \twoheadrightarrow \mathcal{M}_{\bullet} \twoheadrightarrow \mathcal{Y}_{\bullet}$ dévoilent plusieurs nouvelles structures de Hopf sur les arbres binaires entre les algèbres de Hopf $\mathfrak{S}Sym$ et $\mathcal{Y}Sym$. Nous commençons son étude ici, en démontrant que $\mathcal{M}Sym$ est un module sur $\mathfrak{S}Sym$ et un module de Hopf sur $\mathcal{Y}Sym$. Une description élégante des coinvariants de $\mathcal{M}Sym$ sur $\mathcal{Y}Sym$ est trouvée par moyen d'une change de base―en utilisant une inversion de Möbius dans certains posets construits sur le $1$-squelette de $\mathcal{M}_{\bullet}$. Notre analyse utilise la notion d'$\textit{interval retract}$, qui devrait être intéressante par soi-même dans la théorie des ensembles partiellement ordonnés. Notre analyse donne lieu également à des nouvelles familles des polytopes, et même une nouvelle factorisation d'une projection connue des associahèdres aux hypercubes.

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.000
metaresearch head score (Gemma)0.001
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: Empirical
Teacher disagreement score0.011
Threshold uncertainty score0.035

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.001
Science and technology studies0.0020.002
Scholarly communication0.0030.003
Open science0.0000.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0110.002

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.019
GPT teacher head0.305
Teacher spread0.286 · 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

Citations5
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueDiscrete Mathematics & Theoretical Computer ScienceSame topicAdvanced Combinatorial MathematicsFrench-language works237,207