Improved bounds on the number of ways of expressing t as a binomial coefficient

MaRDI QIDQ5445368zbMATH OpenFDO

Authors Daniel M. Kane

Publication date 4 March 2008

Full work available at URL https://eudml.org/doc/129919

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Binomial coefficients; factorials; (q)-identities (11B65)

Recommendations

• scientific article; zbMATH DE number 2124079
• scientific article; zbMATH DE number 3914325
• On the Number of Times an Integer Occurs as a Binomial Coefficient
• New upper bounds for the number of partitions into a given number of parts
• scientific article; zbMATH DE number 3559645

Cited in

(5)

• scientific article; zbMATH DE number 3914325 (Why is no real title available?)
• scientific article; zbMATH DE number 2124079 (Why is no real title available?)
• Repetitions of multinomial coefficients and a generalization of Singmaster's conjecture
• Large minimal invariable generating sets in the finite symmetric groups
• Singmaster-type results for Stirling numbers and some related diophantine equations

This page was built for publication: Improved bounds on the number of ways of expressing \(t\) as a binomial coefficient

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