Signs of Terms in a Combinatorial Recursion

DOI10.1137/0604044zbMATH Open0522.05010OpenAlexW2006263553MaRDI QIDQ3671995FDOQ3671995

Authors: Michael Zuker, Stephen M. Tanny 

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604044

zbMATH Keywords

binomial coefficientsrecursion sequenceasymptotic result for length of blockdecomposition into blocks

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumerative combinatorics (05A99) Recurrences (11B37)

Cites Work

• Title not available (Why is that?)
• Zeros of the functions \(f(n) = \sum\limits_{i=0} (-1)^i {n-2i \choose i}\)
• Some Combinatorial Identities of Bernstein
• Title not available (Why is that?)
• Analytic methods applied to a sequence of binomial coefficients

This page was built for publication: Signs of Terms in a Combinatorial Recursion

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