Recurrences for alternating sums of powers of binomial coefficients (Q1801787): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(93)90058-g / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972206160 / rank
 
Normal rank

Latest revision as of 08:40, 30 July 2024

scientific article
Language Label Description Also known as
English
Recurrences for alternating sums of powers of binomial coefficients
scientific article

    Statements

    Recurrences for alternating sums of powers of binomial coefficients (English)
    0 references
    17 August 1993
    0 references
    Let \(A_ r(n)=\sum^ n_{k=-n}(-1)^ k{2n \choose n+k}^ r\) \((r=2,3,\dots)\). A recurrence for \(A_ r(n)\) with \(\left[{r+2 \over 2}\right]\) terms is obtained by an elementary method. Using asymptotics it is proved that this is the minimum number of terms in a recurrence for \(A_ r(n)\) if \(r\) is a prime or a power of 2. Let \(S_ r(n)=\sum^ n_{k=0}{n \choose k}^ r\). No lower bounds are known for the minimum number of terms in the recurrence for \(S_ r(n)\). Explicit recurrences for \(A_ r(n)\) for \(r=2,3,4,5,6\) and 7 are listed in the appendix.
    0 references
    alternating sums
    0 references
    powers of binomial coefficients
    0 references
    recurrence
    0 references

    Identifiers