Geodesic
Yet Another Solution to the Burnside Problem for Matrix Semigroups
Canadian mathematical bulletin, Tome 55 (2012) no. 1, pp. 188-192

Voir la notice de l'article provenant de la source Cambridge University Press

We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
DOI : 10.4153/CMB-2011-030-1
Mots-clés : 20M30, 20M32, Burnside problem, kernel category 
Steinberg, Benjamin. Yet Another Solution to the Burnside Problem for Matrix Semigroups. Canadian mathematical bulletin, Tome 55 (2012) no. 1, pp. 188-192. doi: 10.4153/CMB-2011-030-1
@article{10_4153_CMB_2011_030_1,
     author = {Steinberg, Benjamin},
     title = {Yet {Another} {Solution} to the {Burnside} {Problem} for {Matrix} {Semigroups}},
     journal = {Canadian mathematical bulletin},
     pages = {188--192},
     year = {2012},
     volume = {55},
     number = {1},
     doi = {10.4153/CMB-2011-030-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2011-030-1/}
}
TY  - JOUR
AU  - Steinberg, Benjamin
TI  - Yet Another Solution to the Burnside Problem for Matrix Semigroups
JO  - Canadian mathematical bulletin
PY  - 2012
SP  - 188
EP  - 192
VL  - 55
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-2011-030-1/
DO  - 10.4153/CMB-2011-030-1
ID  - 10_4153_CMB_2011_030_1
ER  - 
%0 Journal Article
%A Steinberg, Benjamin
%T Yet Another Solution to the Burnside Problem for Matrix Semigroups
%J Canadian mathematical bulletin
%D 2012
%P 188-192
%V 55
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-2011-030-1/
%R 10.4153/CMB-2011-030-1
%F 10_4153_CMB_2011_030_1

[1] [1] Almeida, J., Margolis, S. W., Steinberg, B., and Volkov, M. V., Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc. 361(2009), no. 3, 1429–1461. doi:10.1090/S0002-9947-08-04712-0 Google Scholar

[2] [2] Berstel, J. and Reutenauer, C., Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science 12, Springer-Verlag, Berlin, 1988. Google Scholar

[3] [3] Curtis, C. W. and Reiner, I., Representation theory of finite groups and associative algebras. John Wiley & Sons, New York, 1988. Reprint of the 1962 original. Google Scholar

[4] [4] de Luca, A. and Varricchio, S., Finiteness and regularity in semigroups and formal languages. EATCS Monographs in Theoretical Computer Science, Springer-Verlag, Berlin, 1999. Google Scholar

[5] [5] Freedman, A., Gupta, R. N., and Guralnick, R. M., Shirshov's theorem and representations of semigroups. Olga Taussky-Todd: in memoriam. Pacific J. Math. (1997) Special Issue, 159–176. Google Scholar

[6] [6] Le Saëc, B., Pin, J.-E., and Weil, P., Semigroups with idempotent stabilizers and applications to automata theory. Internat. J. Algebra Comput. 1(1991), no. 3, 291–314. doi:10.1142/S0218196791000195 Google Scholar

[7] [7] McNaughton, R. and Zalcstein, Y., The Burnside problem for semigroups. J. Algebra 34(1975), 292–299. doi:10.1016/0021-8693(75)90184-2 Google Scholar

[8] [8] Okniński, J., Semigroups of Matrices. Series in Algebra 6, World Scientific Publishing, River Edge, NJ, 1998. Google Scholar

[9] [9] Rhodes, J. and Steinberg, B., The q-Theory of Finite Semigroups. Springer Monographs in Mathematics, Springer, New York, 2009. Google Scholar

[10] [10] Rhodes, J. and Tilson, B., The kernel of monoid morphisms. J. Pure Appl. Algebra 62(1989), no. 3, 227–268. doi:10.1016/0022-4049(89)90137-0 Google Scholar

[11] [11] Schützenberger, M. P., Finite counting automata. Information and Control 5(1962), 91–107. doi:10.1016/S0019-9958(62)90244-9 Google Scholar

[12] [12] Straubing, H., The Burnside problem for semigroups of matrices. In: Combinatorics on Words. Academic Press, Toronto, 1983, pp. 279–295. Google Scholar

Cité par Sources :