Equivalence classes of functions on finite sets

Chong-Yun Chao and Caroline I. Deisher

International Journal of Mathematics and Mathematical Sciences, 1982, vol. 5, 1-18

Abstract:

By using Pólya's theorem of enumeration and de Bruijn's generalization of Pólya's theorem, we obtain the numbers of various weak equivalence classes of functions in R D relative to permutation groups G and H where R D is the set of all functions from a finite set D to a finite set R , G acts on D and H acts on R . We present an algorithm for obtaining the equivalence classes of functions counted in de Bruijn's theorem, i.e., to determine which functions belong to the same equivalence class. We also use our algorithm to construct the family of non-isomorphic f m -graphs relative to a given group.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/5/305381.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/5/305381.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:305381

DOI: 10.1155/S0161171282000696

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().