A generalization of the binomial coefficients

DOI10.1016/0012-365X(92)90138-6MaRDI QIDQ1199481zbMATH OpenFDO

Authors Daniel E. Loeb

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9502218

zbMATH Keywords

binomial coefficientsfactorial

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65)

Abstract: We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici `a d'eterminer est la meilleure g'en'eralisation possible des factorielles et des coefficients du bin^oome. On s'interesse `a plusieurs exemples, `a leurs propri'et'es combinatoires, et aux differentes relations qu'ils mettent en jeu.

Review text

The author presents a new definition of the factorial which generalizes the standard one, and studies the binomial coefficients it induces along with their combinatorial properties. The generalization of the factorial is called Roman factorial \(\lfloor n\rceil!\) defined by \(\lfloor n\rceil!=1\times 2\times 3\times\cdots\times n\) for nonnegative integer and \[ \lfloor n\rceil!={(-1)^{n+1}\over(-n-1)!} \] for negative integer \(n\). The Roman coefficients are defined by \[ \lfloor{a\atop b}\rceil={\lfloor a\rceil!\over\lfloor b\rceil!\lfloor a-b\rceil!} \] for any real numbers \(a\) and \(b\).

Recommendations

• Integer binomial plan: a generalization on factorials and binomial coefficients
• Sequence factorial and its applications
• A new generalization of binomial coefficients
• Rising binomial coefficients -- type 1: extensions of Carlitz and Riordan
• Negation of binomial coefficients

Cites work

• A generalization of the binomial coefficients
• A generalization of the Stirling numbers
• Banach algebras, logarithms, and polynomials of convolution type
• More on the umbral calculus, with emphasis on the \(q\)-umbral calculus
• Sets with a negative number of elements
• Subspaces, subsets, and partitions
• The algebra for formal series. II: Sheffer sequences
• The algebra of formal series
• The iterated logarithmic algebra
• The iterated logarithmic algebra. II: Sheffer sequences
• Umbral calculus and special functions

Cited in

(24)

• Series with general exponents
• The iterated logarithmic algebra
• Sets with a negative number of elements
• A generalization of the Stirling numbers
• A generalization of the binomial coefficients
• On a generalization of binomial coefficients
• Negation of binomial coefficients
• Sequence factorial and its applications
• Integer binomial plan: a generalization on factorials and binomial coefficients
• scientific article; zbMATH DE number 5647843 (Why is no real title available?)
• Generalizations of a theorem about the binomial coefficient
• scientific article; zbMATH DE number 3989351 (Why is no real title available?)
• The generalization of the binomial theorem
• Some combinatorics of factorial base representations
• On arithmetic table of quadratic polynomial with negative exponent
• A Note on Extended Binomial Coefficients
• Rising binomial coefficients -- type 1: extensions of Carlitz and Riordan
• Baxter algebras and the umbral calculus
• scientific article; zbMATH DE number 7732123 (Why is no real title available?)
• A generalized binomial theorem for induced weak compositions
• On binomial coefficients of real arguments
• Obtuse matrix of arithmetic table
• The space of two-sided generalized Fibonacci sequences
• Shuffle series

This page was built for publication: A generalization of the binomial coefficients

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