MétaCan
Menu
Back to cohort
Record W2571931837 · doi:10.1142/s0129167x17500677

Completely bounded bimodule maps and spectral synthesis

2017· article· en· W2571931837 on OpenAlexfundno aff
Mahmood Alaghmandan, Ivan G. Todorov, Lyudmila Turowska

Bibliographic record

VenueInternational Journal of Mathematics · 2017
Typearticle
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsnot available
FundersQueen's UniversityChalmers Tekniska HögskolaQueen's University Belfast
KeywordsMathematicsBounded functionBimoduleTensor productCombinatoricsAlgebra over a fieldPure mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

We initiate the study of the completely bounded multipliers of the Haagerup tensor product [Formula: see text] of two copies of the Fourier algebra [Formula: see text] of a locally compact group [Formula: see text]. If [Formula: see text] is a closed subset of [Formula: see text] we let [Formula: see text] and show that if [Formula: see text] is a set of spectral synthesis for [Formula: see text] then [Formula: see text] is a set of local spectral synthesis for [Formula: see text]. Conversely, we prove that if [Formula: see text] is a set of spectral synthesis for [Formula: see text] and [Formula: see text] is a Moore group then [Formula: see text] is a set of spectral synthesis for [Formula: see text]. Using the natural identification of the space of all completely bounded weak* continuous [Formula: see text]-bimodule maps with the dual of [Formula: see text], we show that, in the case [Formula: see text] is weakly amenable, such a map leaves the multiplication algebra of [Formula: see text] invariant if and only if its support is contained in the antidiagonal of [Formula: see text].

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.001
metaresearch head score (Gemma)0.002
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.006
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0010.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0060.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.099
GPT teacher head0.402
Teacher spread0.304 · 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
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of MathematicsSame topicAdvanced Operator Algebra ResearchFrench-language works237,207