Eulerian calculus. I: Univariable statistics (Q1332357): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Foata, Dominique / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Victor Ufnarovski / rank
Normal rank
 
Property / author
 
Property / author: Foata, Dominique / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Victor Ufnarovski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.1994.1039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056504617 / rank
 
Normal rank

Revision as of 20:09, 19 March 2024

scientific article
Language Label Description Also known as
English
Eulerian calculus. I: Univariable statistics
scientific article

    Statements

    Eulerian calculus. I: Univariable statistics (English)
    0 references
    0 references
    0 references
    7 May 1995
    0 references
    The paper is the first one in a series of three articles. Let \(j,k\) be fixed nonnegative integers, \(X\) be an alphabet consisting of the numbers \(1, 2, \dots, r = j + k\). For every word \(w = x_ 1 x_ 2 \dots x_ m\) in this alphabet let \(v = y_ 1 y_ 2 \dots y_ m\) be the nondecreasing arrangement of the letters in \(w\). The following statistics are defined: \(\text{exc}_ k w\) is the number of \(i\) such that either \(x_ i > y_ i\), or \(x_ i = y_ i\) and \(x_ i > j\); \(\text{des}_ k w\) is the number of \(i\) such that either \(x_ i > x_{i + 1}\), or \(x_ i = x_{i + 1}\) and \(x_ i > j\); (here \(x_{m + 1} = j + 1/2)\). Case \(k = 0\) corresponds to the classic definitions of the exceedances and descents. The main result of the article is the construction of a transformation \(F_ k\), such that \(\text{des}_ k w = \text{exc}_ k F_ k(w)\). Several formulas for related generating functions are obtained. The last section is devoted to the application of those results to the case of permutations (\(r = m\) and all letters in \(w\) are different).
    0 references
    MacMahon theorem
    0 references
    bijective proof
    0 references
    fundamental transformation
    0 references
    elementary symmetric functions
    0 references
    Eulerian polynomial
    0 references
    Eulerian calculus
    0 references
    statistics
    0 references
    exceedances
    0 references
    descents
    0 references
    generating functions
    0 references
    permutations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references