View : 154 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author김은미*
dc.date.accessioned2026-07-21T16:31:13Z-
dc.date.available2026-07-21T16:31:13Z-
dc.date.issued2026*
dc.identifier.issn0022-314X*
dc.identifier.otherOAK-39893*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/275845-
dc.description.abstractIn 1999, Stanton conjectured that if t≥4 and n≠t+1, then ct(n)≤ct+1(n), where ct(n) is the number of t -core partitions of n . This conjecture has since been proven. An analogous result exists for self-conjugate t -core partitions: for t≥9 or t=6,8 and n sufficiently large, it follows that sct(n)<sct+2(n), where sct(n) is the number of self-conjugate t -core partitions of n . In this article, we extend these results to a more general class of partitions. Let cs,t(n) be the number of s -asymmetric t -core partitions of n . Using the circle method, we derive an asymptotic formula for cs,t(n) for s≥0 and t−s≥10. This asymptotic formula is then applied to prove that cs,t(n)≤cs,t+2(n) for sufficiently large n . Furthermore, we show that if t−s is odd, the inequality cs,t(n)≤cs,t+1(n) holds for n≫0. © 2026 Elsevier Inc.*
dc.languageEnglish*
dc.publisherAcademic Press Inc.*
dc.subjectInteger partitions*
dc.subjects-asymmetric partition*
dc.subjectStanton type inequality*
dc.subjectt-core partition*
dc.titleStanton type inequality for s-asymmetric t-core partitions*
dc.typeArticle*
dc.relation.volume288*
dc.relation.indexSCIE*
dc.relation.indexSCOPUS*
dc.relation.startpage1*
dc.relation.lastpage13*
dc.relation.journaltitleJournal of Number Theory*
dc.identifier.doi10.1016/j.jnt.2026.03.007*
dc.identifier.wosidWOS:001770006500001*
dc.identifier.scopusid2-s2.0-105038441588*
dc.author.googleKim E.*
dc.contributor.scopusid김은미(56147492200)*
dc.date.modifydate20261022151844*
Appears in Collections:
연구기관 > 수리과학연구소 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE