{"title":"BAZ volume 109 issue 2 Cover and Back matter","authors":"","doi":"10.1017/s0004972723001211","DOIUrl":"https://doi.org/10.1017/s0004972723001211","url":null,"abstract":"","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140253953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BAZ volume 109 issue 2 Cover and Front matter","authors":"","doi":"10.1017/s000497272300120x","DOIUrl":"https://doi.org/10.1017/s000497272300120x","url":null,"abstract":"","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140254285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"WEIERSTRASS ZETA FUNCTIONS AND p-ADIC LINEAR RELATIONS","authors":"DUC HIEP PHAM","doi":"10.1017/s0004972724000091","DOIUrl":"https://doi.org/10.1017/s0004972724000091","url":null,"abstract":"<p>We discuss the <span>p</span>-adic Weierstrass zeta functions associated with elliptic curves defined over the field of algebraic numbers and linear relations for their values in the <span>p</span>-adic domain. These results are extensions of the <span>p</span>-adic analogues of results given by Wüstholz in the complex domain [see A. Baker and G. Wüstholz, <span>Logarithmic Forms and Diophantine Geometry</span>, New Mathematical Monographs, 9 (Cambridge University Press, Cambridge, 2007), Theorem 6.3] and also generalise a result of Bertrand to higher dimensions [‘Sous-groupes à un paramètre <span>p</span>-adique de variétés de groupe’, <span>Invent. Math.</span> <span>40</span>(2) (1977), 171–193].</p>","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140097741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"NON-PÓLYA FIELDS WITH LARGE PÓLYA GROUPS ARISING FROM LEHMER QUINTICS","authors":"NIMISH KUMAR MAHAPATRA, PREM PRAKASH PANDEY","doi":"10.1017/s0004972724000108","DOIUrl":"https://doi.org/10.1017/s0004972724000108","url":null,"abstract":"<p>We construct a new family of quintic non-Pólya fields with large Pólya groups. We show that the Pólya number of such a field never exceeds five times the size of its Pólya group. Finally, we show that these non-Pólya fields are nonmonogenic of field index one.</p>","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140097559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ON THE SET OF KRONECKER NUMBERS","authors":"SAYAN GOSWAMI, WEN HUANG, XIAOSHENG WU","doi":"10.1017/s0004972724000133","DOIUrl":"https://doi.org/10.1017/s0004972724000133","url":null,"abstract":"A positive even number is said to be a Maillet number if it can be written as the difference between two primes, and a Kronecker number if it can be written in infinitely many ways as the difference between two primes. It is believed that all even numbers are Kronecker numbers. We study the division and multiplication of Kronecker numbers and show that these numbers are rather abundant. We prove that there is a computable constant <jats:italic>k</jats:italic> and a set <jats:italic>D</jats:italic> consisting of at most 720 computable Maillet numbers such that, for any integer <jats:italic>n</jats:italic>, <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972724000133_inline1.png\" /> <jats:tex-math> $kn$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> can be expressed as a product of a Kronecker number and a Maillet number in <jats:italic>D</jats:italic>. We also prove that every positive rational number can be written as a ratio of two Kronecker numbers.","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140071013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ON SOME CONGRUENCES INVOLVING CENTRAL BINOMIAL COEFFICIENTS","authors":"GUO-SHUAI MAO","doi":"10.1017/s0004972724000121","DOIUrl":"https://doi.org/10.1017/s0004972724000121","url":null,"abstract":"We prove the following conjecture of Z.-W. Sun [‘On congruences related to central binomial coefficients’, <jats:italic>J. Number Theory</jats:italic>13(11) (2011), 2219–2238]. Let <jats:italic>p</jats:italic> be an odd prime. Then <jats:disp-formula> <jats:alternatives> <jats:graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972724000121_eqnu1.png\" /> <jats:tex-math> $$ begin{align*} sum_{k=1}^{p-1}frac{binom{2k}k}{k2^k}equiv-frac12H_{{(p-1)}/2}+frac7{16}p^2B_{p-3}pmod{p^3}, end{align*} $$ </jats:tex-math> </jats:alternatives> </jats:disp-formula> where <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972724000121_inline1.png\" /> <jats:tex-math> $H_n$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> is the <jats:italic>n</jats:italic>th harmonic number and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972724000121_inline2.png\" /> <jats:tex-math> $B_n$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> is the <jats:italic>n</jats:italic>th Bernoulli number. In addition, we evaluate <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972724000121_inline3.png\" /> <jats:tex-math> $sum _{k=0}^{p-1}(ak+b)binom {2k}k/2^k$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> modulo <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972724000121_inline4.png\" /> <jats:tex-math> $p^3$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> for any <jats:italic>p</jats:italic>-adic integers <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972724000121_inline5.png\" /> <jats:tex-math> $a, b$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>.","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140071004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A NOTE ON JUDICIOUS BISECTIONS OF GRAPHS","authors":"SHUFEI WU, XIAOBEI XIONG","doi":"10.1017/s000497272400008x","DOIUrl":"https://doi.org/10.1017/s000497272400008x","url":null,"abstract":"Let <jats:italic>G</jats:italic> be a graph with <jats:italic>m</jats:italic> edges, minimum degree <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline1.png\" /> <jats:tex-math> $delta $ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and containing no cycle of length 4. Answering a question of Bollobás and Scott, Fan <jats:italic>et al.</jats:italic> [‘Bisections of graphs without short cycles’, <jats:italic>Combinatorics, Probability and Computing</jats:italic>27(1) (2018), 44–59] showed that if (i) <jats:italic>G</jats:italic> is <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline2.png\" /> <jats:tex-math> $2$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>-connected, or (ii) <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline3.png\" /> <jats:tex-math> $delta ge 3$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>, or (iii) <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline4.png\" /> <jats:tex-math> $delta ge 2$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and the girth of <jats:italic>G</jats:italic> is at least 5, then <jats:italic>G</jats:italic> admits a bisection such that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline5.png\" /> <jats:tex-math> $max {e(V_1),e(V_2)}le (1/4+o(1))m$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>, where <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline6.png\" /> <jats:tex-math> $e(V_i)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> denotes the number of edges of <jats:italic>G</jats:italic> with both ends in <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline7.png\" /> <jats:tex-math> $V_i$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. Let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline8.png\" /> <jats:tex-math> $sge 2$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> be an integer. In this note, we prove that if <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S000497272400008X_inline9.png\" /> <jats:tex-math> $delta ge 2s-1$ </jats:tex-math> </jat","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140071085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"EXTRACTION OF DENSITY-LAYERED FLUID FROM A POROUS MEDIUM","authors":"Jyothi Jose","doi":"10.1017/s000497272300000x","DOIUrl":"https://doi.org/10.1017/s000497272300000x","url":null,"abstract":"","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140076993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ON THE DIOPHANTINE EQUATION","authors":"ELCHIN HASANALIZADE","doi":"10.1017/s0004972724000066","DOIUrl":"https://doi.org/10.1017/s0004972724000066","url":null,"abstract":"<p>A generalisation of the well-known Pell sequence <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline2.png\"><span data-mathjax-type=\"texmath\"><span>${P_n}_{nge 0}$</span></span></img></span></span> given by <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline3.png\"><span data-mathjax-type=\"texmath\"><span>$P_0=0$</span></span></img></span></span>, <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline4.png\"><span data-mathjax-type=\"texmath\"><span>$P_1=1$</span></span></img></span></span> and <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline5.png\"><span data-mathjax-type=\"texmath\"><span>$P_{n+2}=2P_{n+1}+P_n$</span></span></img></span></span> for all <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline6.png\"><span data-mathjax-type=\"texmath\"><span>$nge 0$</span></span></img></span></span> is the <span>k</span>-generalised Pell sequence <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline7.png\"><span data-mathjax-type=\"texmath\"><span>${P^{(k)}_n}_{nge -(k-2)}$</span></span></img></span></span> whose first <span>k</span> terms are <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline8.png\"><span data-mathjax-type=\"texmath\"><span>$0,ldots ,0,1$</span></span></img></span></span> and each term afterwards is given by the linear recurrence <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline9.png\"><span data-mathjax-type=\"texmath\"><span>$P^{(k)}_n=2P^{(k)}_{n-1}+P^{(k)}_{n-2}+cdots +P^{(k)}_{n-k}$</span></span></img></span></span>. For the Pell sequence, the formula <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240305093818166-0200:S0004972724000066:S0004972724000066_inline10.png\"><span data-mathjax-type=\"texmath\"><span>$P^2_n+P^2_{n+1}=P_{2n+1}$</span></span></img></span></span> holds for all <span><span><img data-mime","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140043926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IDEMPOTENT GENERATORS OF INCIDENCE ALGEBRAS","authors":"N. A. KOLEGOV","doi":"10.1017/s0004972724000078","DOIUrl":"https://doi.org/10.1017/s0004972724000078","url":null,"abstract":"<p>The minimum number of idempotent generators is calculated for an incidence algebra of a finite poset over a commutative ring. This quantity equals either <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240304124645615-0035:S0004972724000078:S0004972724000078_inline1.png\"><span data-mathjax-type=\"texmath\"><span>$lceil log _2 nrceil $</span></span></img></span></span> or <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240304124645615-0035:S0004972724000078:S0004972724000078_inline2.png\"><span data-mathjax-type=\"texmath\"><span>$lceil log _2 nrceil +1$</span></span></img></span></span>, where <span>n</span> is the cardinality of the poset. The two cases are separated in terms of the embedding of the Hasse diagram of the poset into the complement of the hypercube graph.</p>","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140033940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}