bromide
发表于 2025-4-1 04:40:54
http://reply.papertrans.cn/59/5820/581939/581939_61.png
ABYSS
发表于 2025-4-1 08:31:33
https://doi.org/10.1007/978-3-030-11102-1lattice path combinatorics; 8th conference on lattice path combinatorics; enumerative combinatorics; ke
affluent
发表于 2025-4-1 10:18:56
Springer Nature Switzerland AG 2019
起来了
发表于 2025-4-1 14:39:29
Lattice Path Combinatorics and Applications978-3-030-11102-1Series ISSN 1389-2177 Series E-ISSN 2197-795X
玷污
发表于 2025-4-1 21:56:28
,A Refinement of the Alladi–Schur Theorem,ears more than twice equals the number of partitions of . in which all parts differ by at least 3 and more than 3 if one of the parts is a multiple of 3. In this paper, we refine this result to one that counts the number of parts in the relevant partitions.