combinatorics / Enumerative Combinatorics, Symmetric Functions

Record Compositions of Alternating Permutations

Amdeberhan, Shareshian and Stanley showed a function from the theory of partition Eisenstein series counts alternating permutations with a given record partition, and asked whether a similar theory exists for record compositions, suggesting a role for noncommutative symmetric functions. The paper solves that open problem with a product formula.

20Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsJul 14, 2026Significance 20/100Registry: unreviewed

Record Compositions of Alternating Permutations

Prior state unknownproved

Amdeberhan, Shareshian and Stanley showed a function from the theory of partition Eisenstein series counts alternating permutations with a given record partition, and asked whether a similar theory exists for record compositions, suggesting a role for noncommutative symmetric functions. The paper solves that open problem with a product formula.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Amdeberhan, Shareshian and Stanley showed a function from the theory of partition Eisenstein series counts alternating permutations with a given record partition, and asked whether a similar theory exists for record compositions, suggesting a role for noncommutative symmetric functions. The paper solves that open problem with a product formula.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.