A simple proof of Schmidt's conjecture

DOI10.1080/10236198.2013.838564MaRDI QIDQ2941695zbMATH OpenOpenAlexWikidataFDO

Authors Thotsaporn Thanatipanonda

Publication date 24 August 2015

Published in Journal of Difference Equations and Applications (Search for Journal in Brave)

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

zbMATH Keywords

difference equationSchmidt's problemZeilberger's algorithm

Mathematics Subject Classification ID

Binomial coefficients; factorials; (q)-identities (11B65) Elementary classical functions (33B99)

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

Cites work

• Binomial identities -- combinatorial and algorithmic aspects
• Factors of alternating sums of products of binomial and q-binomial coefficients
• Generalized \(q\)-Legendre polynomials
• Proof of some conjectures of Z.-W. Sun on congruences for Apéry polynomials

Cited in

(4)

• Two simple proofs for a theorem of Schaefer, Wolff and Arendt
• A simple proof of the Bieberbach conjecture
• A simple proof of a theorem of Schmerl and Trotter for permutations
• Beyond Zudilin's conjecturedq-analogue of Schmidt's problem

This page was built for publication: A simple proof of Schmidt's conjecture

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