Let P be a finite group and denote by w（P） the set of its element orders. P is called k-recognizable by the set of its element orders if for any finte group G with ω（G） =ω（P） there are, up to isomorphism, k fi...Let P be a finite group and denote by w（P） the set of its element orders. P is called k-recognizable by the set of its element orders if for any finte group G with ω（G） =ω（P） there are, up to isomorphism, k finite groups G such that G ≌P. In this paper we will prove that the group Lp（3）, where p 〉 3 is a prime number, is at most 2-recognizable.展开更多
Unlike the traditional independent component analysis(ICA)algorithms and some recently emerging linear ICA algorithms that search for solutions in the space of general matrices or orthogonal matrices,in this paper we ...Unlike the traditional independent component analysis(ICA)algorithms and some recently emerging linear ICA algorithms that search for solutions in the space of general matrices or orthogonal matrices,in this paper we propose two new methods which only search for solutions in the space of the matrices with unitary determinant and without whitening.The new algorithms are based on the special linear group SL(n).In order to achieve our target,we first provide a representation theory for any matrix in SL(n),which only simply uses the product of multiple exponentials of traceless matrices.Based on the matrix representation theory,two novel ICA algorithms are developed along with simple analysis on their equilibrium points.Moreover,we apply our methods to the classical problem of signal separation.The experimental results indicate that the superior convergence of our proposed algorithms,which can be expected as two viable alternatives to the ICA algorithms available in publications.展开更多
For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G i...For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.展开更多
Structures of two classes of solvable subgroups in SL（3, C） are given in this paper, and the integrability of the 3-order Fuchsian equation which is integrable in the sense that its monodromy group is solvable is di...Structures of two classes of solvable subgroups in SL（3, C） are given in this paper, and the integrability of the 3-order Fuchsian equation which is integrable in the sense that its monodromy group is solvable is discussed.展开更多
基金Supported by the research council of College of Science, the University of Tehran (Grant No. 6103014-1-03)
文摘Let P be a finite group and denote by w（P） the set of its element orders. P is called k-recognizable by the set of its element orders if for any finte group G with ω（G） =ω（P） there are, up to isomorphism, k finite groups G such that G ≌P. In this paper we will prove that the group Lp（3）, where p 〉 3 is a prime number, is at most 2-recognizable.
文摘Unlike the traditional independent component analysis(ICA)algorithms and some recently emerging linear ICA algorithms that search for solutions in the space of general matrices or orthogonal matrices,in this paper we propose two new methods which only search for solutions in the space of the matrices with unitary determinant and without whitening.The new algorithms are based on the special linear group SL(n).In order to achieve our target,we first provide a representation theory for any matrix in SL(n),which only simply uses the product of multiple exponentials of traceless matrices.Based on the matrix representation theory,two novel ICA algorithms are developed along with simple analysis on their equilibrium points.Moreover,we apply our methods to the classical problem of signal separation.The experimental results indicate that the superior convergence of our proposed algorithms,which can be expected as two viable alternatives to the ICA algorithms available in publications.
基金This work has been supported by the Research Institute for Fundamental Sciences Tabriz,Iran.
文摘For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.
文摘Structures of two classes of solvable subgroups in SL（3, C） are given in this paper, and the integrability of the 3-order Fuchsian equation which is integrable in the sense that its monodromy group is solvable is discussed.
