PASCALIAN RECTANGLES MODULO<i>m</i> (Q3984680)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 29522
Language Label Description Also known as
default for all languages
No label defined
    English
    PASCALIAN RECTANGLES MODULO<i>m</i>
    scientific article; zbMATH DE number 29522

      Statements

      PASCALIAN RECTANGLES MODULO<i>m</i> (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      27 June 1992
      0 references
      Pascalian rectangles
      0 references
      Ramus formula
      0 references
      A recursive technique is developed for optimizing the sums \(V^ n_{m,k}=\sum_{j\equiv k\bmod(m)}{n\choose j}\). This yields two new proofs of the Ramus formula \[ V^ n_{m,k}={1\over m}\sum_{0\leq j<m}\bigl(2\cos{\pi j\over m}\bigr)^ n\cos{j(n-2k)\pi\over m}. \] These sums have applications in the study of fault tolerance in the hypercube computer.
      0 references

      Identifiers