{"title":"Ramanujan的Theta函数与分部的奇偶性和分区的曲柄。","authors":"Koustav Banerjee, Manosij Ghosh Dastidar","doi":"10.1007/s00026-022-00615-1","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we explore intricate connections between Ramanujan’s theta functions and a class of partition functions defined by the nature of the parity of their parts. This consequently leads us to the parity analysis of the crank of a partition and its correlation with the number of partitions with odd number of parts, self-conjugate partitions, and also with Durfee squares and Frobenius symbols.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-022-00615-1.pdf","citationCount":"3","resultStr":"{\"title\":\"Ramanujan’s Theta Functions and Parity of Parts and Cranks of Partitions\",\"authors\":\"Koustav Banerjee, Manosij Ghosh Dastidar\",\"doi\":\"10.1007/s00026-022-00615-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we explore intricate connections between Ramanujan’s theta functions and a class of partition functions defined by the nature of the parity of their parts. This consequently leads us to the parity analysis of the crank of a partition and its correlation with the number of partitions with odd number of parts, self-conjugate partitions, and also with Durfee squares and Frobenius symbols.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00026-022-00615-1.pdf\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-022-00615-1\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-022-00615-1","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Ramanujan’s Theta Functions and Parity of Parts and Cranks of Partitions
In this paper, we explore intricate connections between Ramanujan’s theta functions and a class of partition functions defined by the nature of the parity of their parts. This consequently leads us to the parity analysis of the crank of a partition and its correlation with the number of partitions with odd number of parts, self-conjugate partitions, and also with Durfee squares and Frobenius symbols.
期刊介绍:
Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board.
The scope of Annals of Combinatorics is covered by the following three tracks:
Algebraic Combinatorics:
Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices
Analytic and Algorithmic Combinatorics:
Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms
Graphs and Matroids:
Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches