Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2025-01-01T08:32:09.873Z Has data issue: false hasContentIssue false
  • English
  • Français

Decomposing Replicable Functions

Published online by Cambridge University Press:  01 February 2010

J. McKay  and
David Sevilla
J. McKay
Affiliation:
Department of Computer Science, Concordia University, Montreal H3G 1M8, QC, Canada, [email protected]
David Sevilla
Affiliation:
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Altenbergerstrasse 69, A-4040 Linz, Austria, [email protected]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

Type
Research Article
Information
LMS Journal of Computation and Mathematics , Volume 11 , 2008 , pp. 146 - 171
Copyright
Copyright © London Mathematical Society 2008

References

1.Alexander, D., Cummins, C. J., McKay, J. and Simons, C., ‘Completely replicable functions’, Groups, combinatorics & geometry (Durham, 1990), London Math. Soc. Lecture Note Ser. 165 (Cambridge University Press, Cambridge, 1992) 87–98.CrossRefGoogle Scholar
2.Conway, J. H., McKay, J. and Sebbar, A., ‘On the discrete groups of moonshine’, Proc. Amer. Math. Soc. 132 (2004) 2233–2240.CrossRefGoogle Scholar
3.Conway, J. H. and Norton, S. P., ‘Monstrous moonshine’, Bull. London Math. Soc. 11 (1979) 308–339.CrossRefGoogle Scholar
4.Cummins, C. J., ‘Some comments on replicable functions’, Modern trends in Lie algebra representation theory (Queen's Univ., Kingston, ON, 1994), Queen's Papers in Pure and Appl. Math. 94 (1994) 48–55.Google Scholar
5.Ford, D., McKay, J. and Norton, S. P., ‘More on replicable functions’, Comm. in Algebra 22 (1994) 5175–5193.CrossRefGoogle Scholar
6.Gutierrez, J., Rubio, R. and Sevilla, D., ‘Unirational fields of transcendence degree one and functional decomposition’, Proceedings of International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, 167–175.Google Scholar
7.McKay, J., ‘Essentials of monstrous moonshine’, Groups and combinatorics – in memory of Michio Suzuki, Adv. Stud. Pure Math. 32 (2001) 347–353.CrossRefGoogle Scholar
8.Norton, S. P., ‘More on moonshine’, Computational group theory (London Academic Press, 1984) 185–193.Google Scholar
9.Gutierrez, J. and Sevilla, D., ‘Building counterexamples to generalizations for rational functions of Ritt's decomposition Theorem’, Journal of Algebra 303 (2006) 655–667.CrossRefGoogle Scholar
10.Sevilla, D., ‘Teoremas de Ritt y computatión de cuerpos unirracionales’, PhD Thesis, University of Cantabria, 2004.Google Scholar