John McKay

Origem: Wikipédia, a enciclopédia livre.
Ir para: navegação, pesquisa
John McKay
Matemática
Nascimento 1939 (75 anos)
Atividade
Campo(s) Matemática
Prêmio(s) Prêmio CRM-Fields-PIMS (2003)

John McKay (1939) é um matemático britânico-canadense. É professor da Universidade Concordia.

É conhecido pela descoberta do Monstrous moonshine.


Translation arrow.svg
Este artigo foi traduzido de uma versão noutra língua (versão original). Você pode continuar traduzindo ou colaborar em outras traduções.

Publicações[editar | editar código-fonte]

  • (1965) "Algorithm 262: Number of restricted partitions of N". Comm. ACM 8 (8). DOI:10.1145/365474.366060.
  • (1965) "Algorithm 263: Partition generator". Comm. ACM 8 (8). DOI:10.1145/365474.366063.
  • (1965) "Algorithm 264: Map of partitions into integers". Comm. ACM 8 (8). DOI:10.1145/365474.365501.
  • (1967) "On the representation of symmetric polynomials". Comm. ACM 10 (7): 428–429. DOI:10.1145/363427.363452.
  • (1967) "Symmetric group characters". Comm. ACM 10 (7): 451–452. DOI:10.1145/363427.363475.
  • (1967) "Algorithm 305: Symmetric polynomials". Comm. ACM 10 (7). DOI:10.1145/363427.363465.
  • (1967) "Algorithm 313: Multi-dimensional partition generator". Comm. ACM 10 (10). DOI:10.1145/363717.363783.
  • (1967) "Some computations for m-dimensional partitions". Proc. Camb. Phil. Soc. 63 (4): 1097–1100. DOI:10.1017/S0305004100042171.
  • (1968) "More amicable numbers". Math Comp. 22 (103): 677–678.
  • (1968) "Remark on algorithm 307: Symmetric group characters". Comm. ACM 11 (1): 14. DOI:10.1145/362851.362867.
  • (1968) "Remark on algorithm 305: Symmetric Polynomials". Comm. ACM 11 (4). DOI:10.1145/362991.363049.
  • (1968) "On the evaluation of multiplicative combinatorial expressions". Comm. ACM 11 (6). DOI:10.1145/363347.363357.
  • McKay, J. (1968), "A method of computing the character table of a finite group", in Churchhouse, R. F.; Herz, Computers in mathematical research, North-Holland Publishing 
  • (1969) "The construction of Janko's simple group of order 50232960". Bull. Lond. Math. Soc. 1 (2): 89–94. DOI:10.1112/blms/1.2.219-t.
  • (1970) "Amicable numbers and their distribution". Math. Comp. 24 (110): 431–432.
  • (1970) "Algorithm 371: Partitions in natural order". Comm. ACM 13 (1). DOI:10.1145/361953.361980.
  • (1970) "Algorithm 391: Unitary symmetric polynomials". Comm. ACM 13. DOI:10.1145/362705.362719.
  • McKay, J. (1970), "The construction of the character table of a finite group from generators and relations", in Leech, Computational problems in abstract algebra, Pergamon Press, pp. 89–100 
  • McKay, J. (1970), "Multi-dimensional partitions", in Welsh, Combinatorial theory and its applications, Academic Press 
  • McKay, J. (1971), "Subgroups and permutation characters", in Birkhoff; Hall, Proc. Symp. Pure Math. AMS-SIAM, pp. 171–181 
  • (1971) "The multiplier of the Higman-Sims simple group". Bulletin of the London Mathematical Society 3 (3): 283–285. DOI:10.1112/blms/3.3.283.
  • (1971) "The multiplier of the simple groups of order 604800 and 50232960". Journal of Algebra 17 (2): 262–272. DOI:10.1016/0021-8693(71)90033-0.
  • (1971) "Groups and subgroups, presentations and representations". Proc. 2nd ACM symposium on symbolic and algebraic manipulation. DOI:10.1145/800204.806274. 
  • (1972) "Irreducible representations of odd degree". Journal of Algebra 20 (2): 416–418. DOI:10.1016/0021-8693(72)90066-X.
  • (1973) "Arithmetic over a finite field, Algorithm 469". Comm. ACM 16 (11). DOI:10.1145/355611.362544.
  • (1974) "Algorithm 482:Transitivity sets". Comm. ACM 17 (8). DOI:10.1145/361082.361098.
  • McKay, J. (1974), "Computing with finite simple groups", Proceedings 2nd International conference in group theory, 372, Springer-Verlag, pp. 448–452 
  • (1976) "More about the Mathieu group". Canadian Journal of Mathematics 28: 929–937.
  • (1976) "The largest degrees of irreducible characters of the symmetric group". Mathematics of Computation 30 (135): 624–631.
  • (1978) "The non-abelian simple groups G, |G| < 106 - maximal subgroups". Mathematics of Computation 32 (144): 1293–1302.
  • (1979) "Polynomials with PSL(2,7) as Galois group". Journal of Number Theory 11 (1): 69–75. DOI:10.1016/0022-314X(79)90020-9.
  • (1979) "Some remarks on computing Galois groups". SIAM Journal on Computing 8: 344–347.
  • (1979) "The non-abelian simple groups G, |G| < 105 - minimal presentations". Communications in Algebra 7 (13): 1397–1406. DOI:10.1080/00927877908822409.
  • (1979) "The non-abelian simple groups G, |G\| < 106 - character tables". Comm. in Algebr 7 (13): 1407–1445. DOI:10.1080/00927877908822410.
  • (1979) "The non-abelian simple groups G, |G| < 106 - minimal generating pairs". Mathematics of Computation 33 (146): 812–814.
  • (1980) "Graphs singularities and finite groups". Proc. of 1979 Santa Cruz group theory conference 37: 183–186. 
  • (1981) "Cartan matrices, finite groups of quaternions, and Kleinian singularities". Proc. AMS 81: 153–154. DOI:10.1090/S0002-9939-1981-0589160-8.
  • (1981) "Second and fourth indices of plethysms". J. Math. Phys. 22 (12): 2770–2774. DOI:(5 pages) 10.1063/1.525183 (5 pages).
  • Ford, D. J.; McKay, J. (1982), "Representations and Coxeter graphs", The Geometric Vein, Springer-Verlag 
  • (1983) "The nonexistence of ovals in a projective plane of order 10". Discrete Math 45 (2–3): 319–321. DOI:10.1016/0012-365X(83)90049-3.
  • (1983) "The transitive groups of degree up to eleven". Comm. in Algebra 11 (7): 863–911. DOI:10.1080/00927878308822884.
  • Kolesova, G.; McKay, J. (1984), "Practical strategies for computing Galois groups", in Atkinson, M. D., Computing in Groups, Academic Press, pp. 297–299 
  • (1985) "Multiplicative products of η functions". Contemporary Mathematics 45: 89–98. American Math. Soc..
  • (1985) "Finite groups - Coming of age". Contemporary Mathematics 45. American Math. Soc..
  • (1985) "Actions of permutation groups on r-sets". Comm. in Algebra 13 (3): 619–630. DOI:10.1080/00927878508823180.
  • (1985) "Computing Galois groups over the rationals". J. Number theory 20 (3): 273–281. DOI:10.1016/0022-314X(85)90022-8.
  • (1986) "From polynomials to Galois groups" in International EUROCAL conference in computer algebra. {{{booktitle}}} 204: 535–536, Springer-Verlag. DOI:10.1007/3-540-15984-3_324. 
  • (1987) "Coda to a theorem of Schur". Crelle J. 377: 219–220.
  • (1987) "On computing discriminants". Amer. Math. Monthly 94 (6): 523–527.
  • McKay, J. (1988), "Advances in computational Galois theory", in Tangora, Computers in Algebra, 111, Marcel Dekker, pp. 99–101 
  • (1988) "A necessary condition for transitivity of a finite permutation group". Bull. Lond. Maths. Soc. 20 (3): 235–238. DOI:10.1112/blms/20.3.235.
  • Ford, D.; McKay, J. (1989), "Computation of Galois groups from polynomials over the rationals", in Chudnovsky; Jenks, Computer Algebra, 113, Marcel Dekker, pp. 145–150 
  • (1990) "The q-series of monstrous moonshine & the decomposition of the head characters". Comm. in Algebra 18 (1): 253–278. DOI:10.1080/00927879008823911.
  • (1989) "Ramifications of Ramanujan's work on eta-products". Proc. Indian Acad. Sci. 99: 221–229.
  • (1991) "A continued fraction and fixed-point-free permutations". Amer. Math. Monthly 98 (1): 25–26.
  • (1991) "A generalized Hecke operator and functions like j(z)". AMS Abstracts 12.
  • Alexander, D.; Cummins, C.; McKay, J.; Simons, C. (1992), Completely replicable functions, in Liebeck; Saxl, "Groups, Combinatorics and Geometry", LMS Lecture Note Series (Cam. Univ. Press) 165: 87–98 
  • (1992) "An ideal decomposition algorithm". AMS Abstracts 13.
  • (April 1992) "The Mathieu groups as Galois groups". AMS Abstracts.
  • (1994) "Symmetric functions, m-sets, and Galois groups". Math. Comp. 63 (208): 749–757. DOI:10.1090/S0025-5718-1994-1234424-5.
  • (1994) "More on replicable functions". Comm. in Algebra 22: 5175–5193. DOI:10.1080/00927879408825127.
  • McKay, J.. In: J.. Groups, Difference Sets and the Monster. [S.l.]: de Gruyter, 1995. p. 409. ISBN 3-11-014791-2
  • (1996) "Ideal Decompositions and Subfields". J. Symb. Comp. 21 (2): 133–137. DOI:10.1006/jsco.1996.0005.
  • (1996) "The marking of the Golay code". New Zealand J. Math. 25: 133–139. Predefinição:Citeseerx.
  • (1996) "On transitive permutation groups". J. of Mathematics & Computation 1.
  • (1996) "Spontaneous generation of modular invariants". Math. Comp. 65 (215): 1295–1309. DOI:10.1090/S0025-5718-96-00726-0.
  • (1997) "Computation of Galois groups over function fields". Math. Comp. 66 (218): 823–831. DOI:10.1090/S0025-5718-97-00831-4.
  • (1997) "Finding relations among the roots of an irreducible polynomial". Proceedings of ISSAC'97: 75–77. DOI:10.1145/258726.258752. 
  • (1997) "Computation of replicable functions on RISA/Asir". Proceedings of PASCO'97: 130–138. DOI:10.1145/266670.266713. 
  • (1997) "The essentials of moonshine" in ICU Suzuki Conf. {{{booktitle}}}. 
  • (1998) "Fuchsian groups, Schwarzians, and lattices". Comptes Rendus Acad. Sci. Paris 327 (4): 343–348. DOI:10.1016/S0764-4442(99)80045-7.
  • (1999) "The semi-affine Coxeter-Dynkin diagram and G < SU2". Can. J. Math. 51: 1226–1229.
  • McKay, J. (1999). "Semi-affine Coxeter-Dynkin graphs and G < SU2". arΧiv:math/9907089arΧiv:math/9907089. 
  • (2000) "Modular Solutions to Equations of Halphen Type". Proc. Roy. Soc. A 456: 261–294.
  • (2000) "Modular Invariants and Generalized Halphen Systems". C. R. M. Proc. 25: 181–195.
  • (2000) "Fuchsian groups, Automorphic functions, and Schwarzians". Math. Annalen 318 (2): 255–275. DOI:10.1007/s002080000116.
  • (2000) "Algorithmic Methods in Galois Theory". J. Symb. Comp. 30: 631–872. DOI:10.1006/jsco.2000.0389.
  • McKay, J.; Sebbar, A. (2001), "Arithmetic Semistable Elliptic Surfaces", Proceedings of Moonshine Workshop 
  • McKay, J.; Sebbar, A. (2001), "Proceedings on Moonshine and Related Topics", CRM Proceedings and Lecture Notes, 30 
  • (2002) "Monstrous Moonshine - Problems Arising I, Tate Characters".
  • (2004) "Principal Moduli and Class Fields". Bull. Lond. Math. Soc. 36 (1): 3–12. DOI:10.1112/S0024609303002583.
  • (2004) "On the discrete groups of Moonshine". Proc. Amer. Math. Soc. 132: 2233–2240. DOI:10.1090/S0002-9939-04-07421-0.
  • doi:10.1007/978-3-540-30308-4_10
    Esta citação será automaticamente completada em poucos minutos. Você pode furar a fila ou completar manualmente
  • McKay, John; Sevilla, David (2008). "Aplicacion de la descomposicion racional univariada a monstrous moonshine". arΧiv:0805.2311arΧiv:0805.2311. 
  • (2008) "Decomposing replicable functions". LMS J. Comput. Math. 11: 146–171.
  • McKay, J. (2009), "Introduction and Background", Groups and Symmetries. From Neolithic Scots to John McKay, CRM Proceedings and Lecture Notes, 47, Am. Math. Soc, pp. 1–2 
  • (2010) "Galois groups over function fields of positive characteristic". Proc. of the AMS 138: 1205–1212. DOI:10.1090/S0002-9939-09-10130-2.

Referências

Ligações externas[editar | editar código-fonte]

Ícone de esboço Este artigo sobre um(a) matemático(a) é um esboço. Você pode ajudar a Wikipédia expandindo-o.