On MacDonald's Symmetric Functions
Copyright policy )On MacDonald's Symmetric Functions
An algorithm for computing Macdonald's two-parameter symmetric functions is suggested. A transition matrix from the basis of power sums to the basis of Macdonald's functions is constructed recursively (with respect to the dominance partial order on partitions) by a method analogous to Shoji's method of computing the Green functions of \(\text{GL}(n,q)\).
- University of Illinois at Chicago United States
- University of Illinois System United States
Representation theory for linear algebraic groups, Symmetric functions and generalizations, algorithm, Exact enumeration problems, generating functions, Macdonald's functions, transition matrix, Green functions, characters of general linear groups
Representation theory for linear algebraic groups, Symmetric functions and generalizations, algorithm, Exact enumeration problems, generating functions, Macdonald's functions, transition matrix, Green functions, characters of general linear groups
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!