On minimal easily computable dimension group algebras

02/20/2023

∙

Finite semisimple commutative group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized, and some sufficient conditions for this to happen are given. A method to build group algebras with this property is presented. Examples illustrating the main results are provided.

READ FULL TEXT

On minimal easily computable dimension group algebras

On the incomputability of computable dimension

On the dimension of ideals in group algebras, and group codes

Decidability of the isomorphism and the factorization between minimal substitution subshifts

On computable learning of continuous features

An effective version of definability in metric model theory

A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff

On ideals in group algebras: an uncertainty principle and the Schur product

On minimal easily computable dimension group algebras

Related Research

On the incomputability of computable dimension

On the dimension of ideals in group algebras, and group codes

Decidability of the isomorphism and the factorization between minimal substitution subshifts

On computable learning of continuous features

An effective version of definability in metric model theory

A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff

On ideals in group algebras: an uncertainty principle and the Schur product