Cycle indices and subgroup lattices (Q685578): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3964574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Burnside's combinatorial lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adams operations and \(\lambda\)-operations in \(\beta\)-rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: λ-Operations in β-rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting with groups and rings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Patterns with a Given Automorphism Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Structures and Group Invariant Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pólya's Counting Theorem and a Class of Tensor Identities / rank
 
Normal rank

Latest revision as of 10:46, 22 May 2024

scientific article
Language Label Description Also known as
English
Cycle indices and subgroup lattices
scientific article

    Statements

    Cycle indices and subgroup lattices (English)
    0 references
    24 May 1994
    0 references
    The present paper is devoted to calculations both in the incidence algebra of the subgroup lattice \(L_ G\) of a finite group \(G\) and of the poset \(P_ G\) of conjugacy classes of subgroups. Such calculations occur in the framework of enumeration of orbits with prescribed stabilizer class (cf. Burnside's Lemma). The authors in particular introduce a generalization of the cycle index polynomial that allows better to organize things. Assume that \(\Delta\) is a mapping from \(P_ G\) to an algebra \(\mathbb{A}\) over the rationals, which we assume canonically to be embedded into the incidence algebra over \(P_ G\), and that \(F\leq H\) are subgroups of \(G\), then the cycle index with respect to \(\Delta\) is defined to be \[ \text{Cyc} (F,H;\Delta):={1 \over | H |} \sum_{h \in H} \Delta (\langle \text{h} \rangle \vee F). \] An application is a Pólya-like substitution formula for the inventory with respect to a wreath product action.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    incidence algebra
    0 references
    subgroup lattice
    0 references
    finite group
    0 references
    cycle index polynomial
    0 references
    cycle index
    0 references
    substitution formula
    0 references
    wreath product
    0 references
    0 references
    0 references