Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

JSC
2008

favoriteEmaildiscussreport

55views more JSC 2008»

Algorithms for a class of infinite permutation groups

13 years 4 months ago

Algorithms for a class of infinite permutation groups

Download www.cip.mathematik.uni-stuttgart.de

Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer m such that it is affine on residue classes (mod m). This article describes a collection of algorithms and methods for computation in permutation groups and monoids formed by residue-class-wise affine mappings.

Stefan Kohl

Real-time Traffic

JSC 2008 | Positive Integer | Residue-class-wise Affine | Residue-class-wise Affine Mappings |

claim paper

Related Content

» Algorithms for ray class groups and Hilbert class fields

» Graph Isomorphism is in SPP

» SZK Proofs for BlackBox Group Problems

» Colored Hypergraph Isomorphism is Fixed Parameter Tractable

» Computing Polycyclic Quotients of Finitely LPresented Groups via Groebner Bases

» Annular embeddings of permutations for arbitrary genus

» A modification of Shanks babystep giantstep algorithm

» There Are Not Nonobvious Cyclic Affineinvariant Codes

» On the Sensitivity of CyclicallyInvariant Boolean Functions

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JSC
Authors	Stefan Kohl

Comments (0)