Decomposing replicable functions

Simple item page
dc.creatorMcKay, John
dc.creatorSevilla, David
dc.date2008-03-24
dc.date2008-03-25
dc.date.accessioned2026-07-07T09:57:25Z
dc.date.available2026-07-07T09:57:25Z
dc.descriptionWe describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
dc.description25 pages, 2 data tables; to be published in LMS Journal of Computation and Mathematics. v2: page format adjustment
dc.identifierhttps://arxiv.org/abs/0803.3419
dc.identifierhttp://arxiv.org/abs/0803.3419
dc.identifierLMS Journal of Computation and Mathematics 11 (June 2008), p. 146-171. ISSN 1461-1570.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167334
dc.subjectNumber Theory
dc.subjectSymbolic Computation
dc.subjectRepresentation Theory
dc.subject11F11, 30F35 (Primary); 68W30 (Secondary)
dc.titleDecomposing replicable functions
dc.typetext

Files

Collections

arXiv