{"title":"斯特林公式和鞍点法在两种不同轮廓上的奇异同一性","authors":"Hsien-Kuei Hwang","doi":"10.37236/11785","DOIUrl":null,"url":null,"abstract":"We prove the curious identity in the sense of formal power series:\\[\\int_{-\\infty}^{\\infty}[y^m]\\exp\\left(-\\frac{t^2}2+\\sum_{j\\ge3}\\frac{(it)^j}{j!}\\, y^{j-2}\\right)\\mathrm{d} t= \\int_{-\\infty}^{\\infty}[y^m]\\exp\\left(-\\frac{t^2}2+\\sum_{j\\ge3}\\frac{(it)^j}{j}\\, y^{j-2}\\right)\\mathrm{d} t,\\]for $m=0,1,\\dots$, where $[y^m]f(y)$ denotes the coefficient of $y^m$ in the Taylor expansion of $f$, which arises from applying the saddle-point method to derive Stirling's formula. The generality of the same approach (saddle-point method over two different contours) is also examined, together with some applications to asymptotic enumeration.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"16 1","pages":"0"},"PeriodicalIF":0.7000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Curious Identity Arising From Stirling's Formula and Saddle-Point Method on Two Different Contours\",\"authors\":\"Hsien-Kuei Hwang\",\"doi\":\"10.37236/11785\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove the curious identity in the sense of formal power series:\\\\[\\\\int_{-\\\\infty}^{\\\\infty}[y^m]\\\\exp\\\\left(-\\\\frac{t^2}2+\\\\sum_{j\\\\ge3}\\\\frac{(it)^j}{j!}\\\\, y^{j-2}\\\\right)\\\\mathrm{d} t= \\\\int_{-\\\\infty}^{\\\\infty}[y^m]\\\\exp\\\\left(-\\\\frac{t^2}2+\\\\sum_{j\\\\ge3}\\\\frac{(it)^j}{j}\\\\, y^{j-2}\\\\right)\\\\mathrm{d} t,\\\\]for $m=0,1,\\\\dots$, where $[y^m]f(y)$ denotes the coefficient of $y^m$ in the Taylor expansion of $f$, which arises from applying the saddle-point method to derive Stirling's formula. The generality of the same approach (saddle-point method over two different contours) is also examined, together with some applications to asymptotic enumeration.\",\"PeriodicalId\":11515,\"journal\":{\"name\":\"Electronic Journal of Combinatorics\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37236/11785\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37236/11785","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
A Curious Identity Arising From Stirling's Formula and Saddle-Point Method on Two Different Contours
We prove the curious identity in the sense of formal power series:\[\int_{-\infty}^{\infty}[y^m]\exp\left(-\frac{t^2}2+\sum_{j\ge3}\frac{(it)^j}{j!}\, y^{j-2}\right)\mathrm{d} t= \int_{-\infty}^{\infty}[y^m]\exp\left(-\frac{t^2}2+\sum_{j\ge3}\frac{(it)^j}{j}\, y^{j-2}\right)\mathrm{d} t,\]for $m=0,1,\dots$, where $[y^m]f(y)$ denotes the coefficient of $y^m$ in the Taylor expansion of $f$, which arises from applying the saddle-point method to derive Stirling's formula. The generality of the same approach (saddle-point method over two different contours) is also examined, together with some applications to asymptotic enumeration.
期刊介绍:
The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.