학술
Arithmetic Upper and Lower Bounds for the Denumerant Function II
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
We apply the elementary arithmetic argument of the first paper of this series (arXiv:2204.13689) to binomial coefficients, and obtain upper and lower bounds for Sylvester's denumerant function for arbitrary positive integers $a_1,\dots,a_k$ that sharpen those of Agnarsson.
The lower bound is a sum of binomial coefficients; it holds along the multiples of $\gcd(a_1,\dots,a_k)$ without assuming that a solution exists, and it is greater than the polynomial lower bound of the first paper.
In the upper bound the shift of Agnarsson's binomial coefficient is reduced.
관련 뉴스
'research' 카테고리 뉴스
Correction: Pupillary dynamics during hands-off L2 driving and transitions of control under high cognitive load
PLOS ONE
Correction: Ornamental motifs and visual concerns: Exploring aesthetic pleasure and conservation intention in architectural heritage renovation
PLOS ONE
Correction: Who is disrupting whom? Examining the nighttime activity patterns of humans and their dogs
PLOS ONE