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...
Saved in:
| Main Authors: | Chong-Yun Chao, Caroline I. Deisher |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1982-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171282000696 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Enumeration Degrees of the Bounded Sets
by: Boris Y. Solon
Published: (2022-06-01) -
Fields of sets, set functions, set function integrals, and finite additivity
by: William D. L. Appling
Published: (1984-01-01) -
A note of equivalence classes of matrices over a finite field
by: J. V. Brawley, et al.
Published: (1981-01-01) -
About Not Countable Ideals in a Semi-Lattice of the Enumeration Degrees
by: B. I. Solon, et al.
Published: (2015-02-01) -
About Not Countable Ideals in a Semi-Lattice of the Enumeration Degrees
by: B. I. Solon, et al.
Published: (2015-03-01)