The (<i>q</i><i>r</i>)-Simon Newcomb problem (Q3663306): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A simple solution of Simon Newcomb's problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4146776 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequences and inversions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Combinatorial Property of q-Eulerian Numbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simon Newcomb’s Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of permutations via skew-hooks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3243274 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The (<i>q</i><i>r</i>)-Simon Newcomb problem |
scientific article |
Statements
The (<i>q</i><i>r</i>)-Simon Newcomb problem (English)
0 references
1981
0 references
\(r\)-major index
0 references
sequences
0 references
linear recurrence
0 references
\(r\)-descent number
0 references
