Yet another method of enumerating unmarked combinatorial objects (Q1173770): Difference between revisions

This paper gives an enumeration method for unmarked combinatorial objects which is based on a direct application of the starting step of Pólya's theorem, the Burnside lemma and a solution of simple matrix equations.

0 references

zbMATH Keywords

enumeration method

0 references

unmarked combinatorial objects

0 references

Pólya's theorem

0 references

Burnside lemma

0 references

reviewed by

Johann Cigler

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5585195

0 references

Identifiers

zbMATH Open document ID

0747.05011

0 references

DOI

10.1007/BF01240267

0 references

Mathematics Subject Classification ID

05A15

0 references

zbMATH DE Number

7394

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1173770

@@ Property / author @@
-Regina I. Tyshkevich
@@ Property / author: Regina I. Tyshkevich / rank @@
-Normal rank
@@ Property / reviewed by @@
-Johann Cigler
@@ Property / reviewed by: Johann Cigler / rank @@
-Normal rank
@@ Property / author @@
+Regina I. Tyshkevich
@@ Property / author: Regina I. Tyshkevich / rank @@
+Normal rank
@@ Property / reviewed by @@
+Johann Cigler
@@ Property / reviewed by: Johann Cigler / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585195
@@ Property / cites work: Q5585195 / rank @@
+Normal rank