Papers
Topics
Authors
Recent
Search
2000 character limit reached

A matrix generalization of a theorem of Fine

Published 19 Apr 2017 in math.NT, cs.DM, and math.CO | (1704.05872v2)

Abstract: In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients $\binom{n}{m}$, for $m$ in the range $0 \leq m \leq n$, that are not divisible by $p$. We give a matrix product that generalizes Fine's formula, simultaneously counting binomial coefficients with $p$-adic valuation $\alpha$ for each $\alpha \geq 0$. For each $n$ this information is naturally encoded in a polynomial generating function, and the sequence of these polynomials is $p$-regular in the sense of Allouche and Shallit. We also give a further generalization to multinomial coefficients.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.