Equivalence classes of functions on finite sets
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 RD relative to permutation groups G and H where RD is the set of all functions from a finite set D to a finite set R, G...
Main Authors: | Chong-Yun Chao, Caroline I. Deisher |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
1982-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171282000696 |
Similar Items
-
The classification of some fuzzy subgroups of finite groups under a natural equivalence and its extension, with particular emphasis on the number of equivalence classes
by: Ndiweni, Odilo
Published: (2007) -
Algorithmes combinatoires et Optimisation
by: Manoussakis, Georgios Oreste
Published: (2017) -
Enumerating algebras over a finite field
by: Michael Vaughan-Lee
Published: (2013-09-01) -
Promoting generalization of coin value relations with young children via equivalence class formation
by: Roberts, Creta M.
Published: (2011) -
Fields of sets, set functions, set function integrals, and finite additivity
by: William D. L. Appling
Published: (1984-01-01)