 |
|
|
|
|
 |
|
|
Counting Non-Isomorphic Relations
|
|
|
|
|
|
| Organization: | Universidad Autonoma de Querétaro |
| Department: | Facultad de Informatica |
|
|
|
|
|
|
| Instituto Technologico y de Estudios Superiores de Monterrey |
|
|
|
|
|
|
Counting of several families of relations is done under conjugacy equivalence by means of Burnside's lemma following the ideas of Davis. The families include relations in general, symmetric relations, reflexive relations and functions. Brief comments are included on equivalence relations and open problems at the end. Concrete implementations are offered using the programming language Mathematica.
|
|
|
|
|
|
|
|
For the newest resources, visit Wolfram Repositories and Archives »
