Parking Functions of Types A and B
Copyright policy )Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parking functions. We use an analogous embedding for type B non-crossing partitions in order to answer a question raised by R. Stanley on the edge labeling of the type B non-crossing partitions lattice.
Combinatorics of partially ordered sets, symmetric group, maximal chains, Combinatorial aspects of partitions of integers, parking function, Group actions on posets, etc., edge-labeling, Representations of finite symmetric groups, lattice of non-crossing partitions, Cayley graph, refinement order
Combinatorics of partially ordered sets, symmetric group, maximal chains, Combinatorial aspects of partitions of integers, parking function, Group actions on posets, etc., edge-labeling, Representations of finite symmetric groups, lattice of non-crossing partitions, Cayley graph, refinement order
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).12 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.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% 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!