On Iteration of Bijective Functions with Discontinuities

References

[1] C.A. Charalambides, Enumerative Combinatorics, Discrete Mathematics and Its Applications, Chapman & Hall/CRC, Boca Raton, 2002.
Search in Google Scholar Back to article
[2] L. Comtet, Advanced Combinatorics, D. Reidel Publishing Co., Dordrecht, 1974.10.1007/978-94-010-2196-8
Search in Google Scholar Back to article
[3] G. James and A. Kerber, The Representation Theory of the Symmetric Group, Encyclopedia of Mathematics and its Applications, 16, Addison-Wesley Publishing Co., Reading, 1981.
Search in Google Scholar Back to article
[4] A. Kerber, Applied Finite Group Actions, Algorithms and Combinatorics, 19, Springer-Verlag, Berlin, 1999.10.1007/978-3-662-11167-3
Search in Google Scholar Back to article
[5] M. Kuczma, B. Choczewski and R. Ger, Iterative Functional Equations, Encyclopedia of Mathematics and its Applications, 32, Cambridge University Press, Cambridge, 1990.10.1017/CBO9781139086639
Search in Google Scholar Back to article
[6] Report of Meeting, Aequationes Math. 91 (2017), no. 6, 1157–1204.10.1007/s00010-017-0530-7
Search in Google Scholar Back to article
[7] SYMMETRICA, 1987. A program system devoted to representation theory, invariant theory and combinatorics of finite symmetric groups and related classes of groups. Copyright by “Lehrstuhl II für Mathematik, Universität Bayreuth, 95440 Bayreuth”. Avaliable at http://www.algorithm.uni-bayreuth.de/en/research/SYMMETRICA/.
Search in Google Scholar Back to article