Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Simple Proof of Schmidt's Conjecture

Published 16 Mar 2012 in math.CO | (1203.3731v2)

Abstract: For any integer $r \geq 1$, the sequence of numbers ${{c{(r)}{k}}}{k \geq 0} $ is defined implicitly by [\sum_k\binom{n}{k}r\binom{n+k}{k}r = \sum_k\binom{n}{k}\binom{n+k}{k}c{(r)}_k,\quad n=0,1,2,...] Asmus Schmidt conjectured that all $c{(r)}_k$ are integers. We give a new proof of this fact.

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.

Collections

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