...
首页> 外文期刊>Research in Number Theory >Generalizations of Alder’s conjecture via a conjecture of Kang and Park
【24h】

Generalizations of Alder’s conjecture via a conjecture of Kang and Park

机译:艾尔猜想通过康帕克猜想的猜想概括

获取原文
           

摘要

Let Δ d ( a , b ) ( n ) = q d ( a ) ( n ) - Q d ( b ) ( n ) documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$arDelta _d^{(a,b)}(n) = q_d^{(a)}(n) - Q_d^{(b)}(n)$$end{document} where q d ( a ) ( n ) documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$q_d^{(a)}(n)$$end{document} counts the number of partitions of n into parts with difference at least d and size at least a , and Q d ( b ) ( n ) documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$Q_d^{(b)}(n)$$end{document} counts the number of partitions into parts ≡ ± b mod d + 3 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$equiv pm b left( mathrm {mod} d + 3ight) $$end{document} . In 1956, Alder conjectured that Δ d ( 1 , 1 ) ( n ) ≥ 0 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$arDelta _d^{(1,1)}(n) ge 0$$end{document} for all positive n and d . This conjecture was proved partially by Andrews in 1971, by Yee in 2008, and was fully resolved by Alfes, Jameson and Lemke Oliver in 2011. Alder’s conjecture generalizes several well-known partition identities, including Euler’s theorem that the number of partitions of n into odd parts equals the number of those into distinct parts, as well as the first of the famous Rogers–Ramanujan identities. In 2020, Kang and Park constructed an extension of Alder’s conjecture which relates to the second Rogers–Ramanujan identity by considering the difference Δ d ( a , b , - ) ( n ) = q d ( a ) ( n ) - Q d ( b , - ) ( n ) documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$arDelta _d^{(a,b,-)}(n) = q_d^{(a)}(n) - Q_d^{(b,-)}(n)$$end{document} , where Q d ( b , - ) ( n ) documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$Q_d^{(b,-)}(n)$$end{document} counts the number of partitions into parts ≡ ± b mod d + 3 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$equiv pm b left( mathrm {mod} d + 3ight) $$end{document} excluding the part d + 3 - b documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$d+3-b$$end{document} . Kang and Park conjectured that Δ d ( 2 , 2 , - ) ( n ) ≥ 0 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$arDelta _d^{(2,2,-)}(n)ge 0$$end{document} for all d ≥ 1 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$dge 1$$end{document} and n ≥ 0 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$nge 0$$end{document} , and proved this when d = 2 r - 2 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$d = 2^r - 2$$end{document} and n is even. Here, we prove Kang and Park’s conjecture for all d ≥ 62 documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setle
机译:让Δd(a,b)(n)= qd(a)(n) - q d(b)(n) documentclass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts } usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsideDemargin} { - 69pt} begin {document} $$ vardelta _d ^ {(a,b)}( n)= q_d ^ {(a)}(n) - q_d ^ {(b)}(n)$$ end {document}其中qd(a)(n) documentclass [12pt] {minimal} usepackage { ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ q_d ^ {(a)}(n)$$ end {document}将n的分区数分为差异至少d和尺寸至少a,q d(b)(n) documentclass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssysfs} usepackage {mathrsfs} usepackage {mathek} setLength { oddsidemargin} { - 69pt} begin {Document} $$ Q_D ^ {(b)}(n) $$ end {document}将分区数分成部分≡±b mod d + 3 documentClass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} {-69pt} begin {document} $$ secriv pm b left( mathrm {mod} d + 3 右)$$ 结束{document}。在1956年,亚拉德猜测Δd(1,1)(n)≥0 documentclass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy } usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ vardelta _d ^ {(1,1)}(n) ge 0 $$$ end {文件}为所有正面N和D.该猜想由1971年由Andrews于2008年由Andrews证明,2011年是Alfes,Jameson和Lemke Oliver的完全解决。艾尔特的猜想概括了几个着名的分区身份,包括欧拉的定理,包括N的分区数量奇数部分等于陷入不同零件的人数,以及着名的罗杰斯 - ramanujan身份中的第一个。 2020年,康与公园通过考虑差Δd(a,b, - )(n)= qd(a) - q d(b)来构建桤木猜想的延伸,这与第二rogers-ramanujan身份有关。 , - )(n) documentclass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssys} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ vardelta _d ^ {(a,b, - )}(n)= q_d ^ {(a)}(n) - q_d ^ {(b, - )}(n)$$ end {document},其中q d(b, - )(n) documentclass [12pt] {minimal} usepackage {ammath} usepackage {keysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeez} setLength { oddsideDemargin} { - 69pt} begin {document} $$ q_d ^ {(b, - )}(n)$$ 结束{document}将分区数分成部分≡±b mod d + 3 documentClass [12pt] {minimal} usepackage {ammath} usepackage {keysym} usepackage {amsfonts} usepackage {amsymb} usepackage {ams BSY} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} {-69pt} begin {document} $$$ sectiv pm b left( mathrm {mod} d + 3 右) $$ end {document}排除部分d + 3 - b documentclass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsideDemargin} { - 69pt} begin {document} $$ d + 3-b $$$ end {document}。康和公园猜测δd(2,2, - )(n)≥0 documentClass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssymb} usepackage { AMSBSY} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} {-69pt} begin {document} $$$ vardelta _d ^ {(2,2, - )}(n) ge 0 $$ 结束{document}对于所有d≥1 documentclass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssys} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ d ge $$$ en {document}和n≥0 documentclass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsideDemargin} { - 69pt} begin {document} $$ n ge 0 $ $ end {document},并证明了d = 2 r - 2 documentclass [12pt] {minimal} usepackage {ammath} usepackage {keysym} usepackage {amsfonts} usep Ackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsideDemargin} {-69pt} begin {document} $$ d = 2 ^ r - 2 $$ end {document}甚至是。在这里,我们证明了所有D≥62 documentClass [12pt] {minimal} usepackage {ammath} usepackage {isysym} usepackage {amssymb} usepackage {amsbsy} usepackage {amsbsy} usepackage {mathrsfs } usepackage {supmeek} setle

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号