Categorical Equivalence of Finite Groups
نویسنده
چکیده
In [1] Bergman and Berman define the notion of categorically equivalent algebras. In [6] we introduce minimal relational sets and point out the relationship between categorical equivalence of algebras and minimal relational sets corresponding to the algebras. In this paper we shall describe the minimal relational sets assigned to finite groups, see Theorem 3.1. Moreover, by using this description, in Corollary 3.3 we shall show that two categorically equivalent finite groups are weakly isomorphic.
منابع مشابه
Effective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are rela...
متن کاملTHE CONNECTION BETWEEN SOME EQUIVALENCE RELATIONS ON FUZZY SUBGROUPS
This paper, deals with some equivalence relations in fuzzy subgroups. Further the probability of commuting two fuzzy subgroups of some finite abelian groups is defined.
متن کاملCategorical Morita Equivalence for Group-theoretical Categories
A finite tensor category is called pointed if all its simple objects are invertible. We find necessary and sufficient conditions for two pointed semisimple categories to be dual to each other with respect to a module category. Whenever the dual of a pointed semisimple category with respect to a module category is pointed, we give explicit formulas for the Grothendieck ring and for the associato...
متن کاملAutomorphism Groups of Countably Categorical Linear Orders are Extremely Amenable
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite ordered structures with finitely many partial equivalence relations with convex classes.
متن کاملEquivalence structures and isomorphisms in the difference hierarchy
We examine the notion of structures and functions in the Ershov difference hierarchy, and of equivalence structures in particular. A equivalence structure A = (A,E) has universe A = ω and an equivalence relation E. The equivalence class [a] of a ∈ A is {b ∈ A : aEb} and the character K of A is {〈k, n〉 ∈ (ω − {0}) : A has at least n classes of size k}. It is known that for any character K, there...
متن کامل