Publication date
March 1989
DOI Publisher
Academic Press Limited. Published by Elsevier Ltd. ISSN
0195-6698Abstract
In this note we give a simple proof of a special case of the Pólya enumeration theorem, and also a new proof of Burnside's lemma
In this note we give a simple proof of a special case of the Pólya enumeration theorem, and also a new proof of Burnside's lemma
This thesis concerns the combinatorics and algebra of set systems. Let V be a set of size n. We defi...
This thesis concerns the combinatorics and algebra of set systems. Let V be a set of size n. We defi...
Let G be a permutation group acting on a set Ω of size n∈ℕ and let 1≤k<(n−1)/2. Livingstone and Wagn...
AbstractLet G be a finite group which acts on a set S. We present a method of computing the entire d...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
This master's thesis explores the area of combinatorics concerned with counting mathematical objects...
AbstractIf G is any finite Abelian group defineγ(G)=∑i(ei−1)where ei are the canonic invariants of G...
AbstractIf G is a finite Abelian group, for what number s is it true that an arbitrary sequence of l...
AbstractLet G be a finite group which acts on a set S. We present a method of computing the entire d...
AbstractFor permutation groups G of finite degree we define numbers tB(G)=|G|-1∑R∈G∏1(1a1(g))bi, whe...
AbstractLet G be a finite group acting on a finite set S. Burnside's formula expresses the number of...
AbstractThe cycle index polynomial of combinatorial analysis is discussed in various contexts
AbstractAn elementary combinatorial proof of the Cayley-Hamilton theorem is given. At the conclusion...
AbstractThis paper is inspired by the paper Some Canonical Sequences of Integers by Bernstein and Sl...
We present a combinatorial mechanism for counting certain objects associated to a variety over a fin...
This thesis concerns the combinatorics and algebra of set systems. Let V be a set of size n. We defi...
This thesis concerns the combinatorics and algebra of set systems. Let V be a set of size n. We defi...
Let G be a permutation group acting on a set Ω of size n∈ℕ and let 1≤k<(n−1)/2. Livingstone and Wagn...
AbstractLet G be a finite group which acts on a set S. We present a method of computing the entire d...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
This master's thesis explores the area of combinatorics concerned with counting mathematical objects...
AbstractIf G is any finite Abelian group defineγ(G)=∑i(ei−1)where ei are the canonic invariants of G...
AbstractIf G is a finite Abelian group, for what number s is it true that an arbitrary sequence of l...
AbstractLet G be a finite group which acts on a set S. We present a method of computing the entire d...
AbstractFor permutation groups G of finite degree we define numbers tB(G)=|G|-1∑R∈G∏1(1a1(g))bi, whe...
AbstractLet G be a finite group acting on a finite set S. Burnside's formula expresses the number of...
AbstractThe cycle index polynomial of combinatorial analysis is discussed in various contexts
AbstractAn elementary combinatorial proof of the Cayley-Hamilton theorem is given. At the conclusion...
AbstractThis paper is inspired by the paper Some Canonical Sequences of Integers by Bernstein and Sl...
We present a combinatorial mechanism for counting certain objects associated to a variety over a fin...
This thesis concerns the combinatorics and algebra of set systems. Let V be a set of size n. We defi...
This thesis concerns the combinatorics and algebra of set systems. Let V be a set of size n. We defi...
Let G be a permutation group acting on a set Ω of size n∈ℕ and let 1≤k<(n−1)/2. Livingstone and Wagn...
Add to ORKG