The (qr)-Simon Newcomb problem

DOI10.1080/03081088108817417zbMath0516.05004OpenAlexW2055136210MaRDI QIDQ3663306

Don Rawlings

Publication date: 1981

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088108817417

zbMATH Keywords

sequenceslinear recurrence\(r\)-descent number\(r\)-major index

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (12)

A generalized Mahonian statistic on absorption ring mappings ⋮ Enumeration of permutations by descents, idescents, imajor index, and basic components ⋮ Mahonian and Euler-Mahonian statistics for set partitions ⋮ The r-major index ⋮ Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers ⋮ A new derivation of the generating function for the major index ⋮ q-counting \(n\)-dimensional lattice paths ⋮ Mahonian statistics on labeled forests ⋮ A classification of mahonian maj-inv statistics ⋮ Multicolored Simon Newcomb problems ⋮ Rook theory, compositions, and zeta functions ⋮ \(q\)-rook polynomials and matrices over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• A simple solution of Simon Newcomb's problem
• A characterization of permutations via skew-hooks
• Sequences and inversions
• A Combinatorial Property of q-Eulerian Numbers
• Simon Newcomb’s Problem

This page was built for publication: The (qr)-Simon Newcomb problem