MétaCan
Menu
Back to cohort
Record W2124655289 · doi:10.1017/s1446788711001133

GENERALIZED AMENABILITY PROPERTIES OF THE BEURLING ALGEBRAS

2010· article· en· W2124655289 on OpenAlexafffund
F. Ghahramani, Ebrahim Samei, Yong Zhang

Bibliographic record

VenueJournal of the Australian Mathematical Society · 2010
Typearticle
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsUniversity of SaskatchewanUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsContractible spaceBounded functionAbelian groupPure mathematicsGroup (periodic table)Character (mathematics)Banach algebraIdeal (ethics)Identity (music)Banach spaceDiscrete mathematicsCombinatoricsMathematical analysis

Abstract

fetched live from OpenAlex

Abstract We show that every one-codimensional closed two-sided ideal in a boundedly approximately contractible Banach algebra has a bounded approximate identity. We use this to give a complete characterization of bounded approximate contractibility of Beurling algebras associated to symmetric weights. We give a slight modification of a criterion for bounded approximate contractibility. We use our criterion to show that, for the quasi-SIN groups, in the presence of a certain growth condition on a weight, the associated Beurling algebra is boundedly approximately amenable if and only if it is boundedly approximately contractible. We show that approximate amenability of a Beurling algebra on an IN group necessitates the amenability of the group. Finally, we show that, for every locally compact abelian group, in the presence of a growth condition on the weight, 2n-weak amenability of the associated Beurling algebra is equivalent to every point-derivation vanishing at the augmentation character.

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.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.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.078
GPT teacher head0.347
Teacher spread0.269 · 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
Published2010
Admission routes2
Has abstractyes

Explore more

Same venueJournal of the Australian Mathematical SocietySame topicAdvanced Operator Algebra ResearchFrench-language works237,207