A generalization of the Syracuse algorithm in Fq[x]Export / Share Share this record       Export this recordPlumX View Altmetrics View AltmetricsMatthews, K.R. and Leigh, G. M. (1987) A generalization of the Syracuse algorithm in Fq[x]. Journal of Number Theory, 25 (3). pp. 274-278. ISSN 0022314X Full text not currently attached. Access may be available via the Publisher's website or OpenAccess link. Article Link: http://dx.doi.org/10.1016/0022-314X(87)90032-1 AbstractIn this note we remark that while much of the theory of a recent paper of Matthews and Watts on mappings T: Z → Z generalizing the Syracuse algorithm also goes over to mappings T: Fq[x] → Fq[x], the conjectural picture is not as clear for polynomials. We exhibit two divergent trajectories which possess an unexpected regularity, and which do not obey a certain expected uniformity of distribution.
Repository Staff Only: item control page |
|
|
| Login | DPI Staff queries on depositing or searching to era.daf.qld.gov.au | |
Export / Share
Export / Share