The (qr)-Simon Newcomb problem

DOI10.1080/03081088108817417zbMATH Open0516.05004OpenAlexW2055136210MaRDI QIDQ3663306FDOQ3663306

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Combinatorial Property of q-Eulerian Numbers
• A simple solution of Simon Newcomb's problem
• Sequences and inversions
• A characterization of permutations via skew-hooks
• Simon Newcomb’s Problem

Cited In (12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3663306)