![Enumeration of mosaics](https://imsc.uni-graz.at/fripertinger/icons/next.png) |
![Publications, to be read](https://imsc.uni-graz.at/fripertinger/icons/up.png) |
![Random generation of linear codes](https://imsc.uni-graz.at/fripertinger/icons/previous.png) |
Endofunctions of given cycle type |
Endofunctions of given cycle type
Jointly written with PETER SCHÖPF. The Annales des
Sciences Mathematiques du Quebec ISSN 0707-9109 23 (2),
173 - 187, 1999.
Abstract: Iteration of an endofunction f on a finite set
X defines cycles of f. To a given set L of lengths and to a given
function m: L→ ℕ0, the number of all those
functions having m(l) cycles of length l in L and possibly other
cycles of length l not in L will be computed. Furthermore by
introducing group actions the number of patterns of these functions
can be derived from the Cauchy-Frobenius Lemma. We compare these
solutions with the results derived from combinatorial species
theory.
harald.fripertinger "at" uni-graz.at, May 6,
2024
![Enumeration of mosaics](https://imsc.uni-graz.at/fripertinger/icons/next.png) |
![Publications, to be read](https://imsc.uni-graz.at/fripertinger/icons/up.png) |
![Random generation of linear codes](https://imsc.uni-graz.at/fripertinger/icons/previous.png) |
![Uni-Graz](https://imsc.uni-graz.at/fripertinger/icons/kfug_klkl.gif) |
![Mathematik](https://imsc.uni-graz.at/fripertinger/icons/mathlogokl.gif) |
![UNIGRAZ online](https://imsc.uni-graz.at/fripertinger/icons/icon_social_ugo.png) |
GDPR |
Endofunctions of given cycle type |
![Valid HTML 4.0 Transitional](//www.w3.org/Icons/valid-html40-blue) |
![Valid CSS!](//jigsaw.w3.org/css-validator/images/vcss-blue) |