{"title":"幂次循环行列式","authors":"Michael J. Mossinghoff, Christopher G. Pinner","doi":"10.1215/00192082-10596890","DOIUrl":null,"url":null,"abstract":"Newman showed that for primes $p\\geq 5$ an integral circulant determinant of prime power order $p^t$ cannot take the value $p^{t+1}$ once $t\\geq 2.$ We show that many other values are also excluded. In particular, we show that $p^{2t}$ is the smallest power of $p$ attained for any $t\\geq 3$, $p\\geq 3.$ We demonstrate the complexity involved by giving a complete description of the $25\\times 25$ and $27\\times 27$ integral circulant determinants. The former case involves a partition of the primes that are $1\\bmod5$ into two sets, Tanner's \\textit{perissads} and \\textit{artiads}, which were later characterized by E. Lehmer.","PeriodicalId":56298,"journal":{"name":"Illinois Journal of Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Prime power order circulant determinants\",\"authors\":\"Michael J. Mossinghoff, Christopher G. Pinner\",\"doi\":\"10.1215/00192082-10596890\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Newman showed that for primes $p\\\\geq 5$ an integral circulant determinant of prime power order $p^t$ cannot take the value $p^{t+1}$ once $t\\\\geq 2.$ We show that many other values are also excluded. In particular, we show that $p^{2t}$ is the smallest power of $p$ attained for any $t\\\\geq 3$, $p\\\\geq 3.$ We demonstrate the complexity involved by giving a complete description of the $25\\\\times 25$ and $27\\\\times 27$ integral circulant determinants. The former case involves a partition of the primes that are $1\\\\bmod5$ into two sets, Tanner's \\\\textit{perissads} and \\\\textit{artiads}, which were later characterized by E. Lehmer.\",\"PeriodicalId\":56298,\"journal\":{\"name\":\"Illinois Journal of Mathematics\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Illinois Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1215/00192082-10596890\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Illinois Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1215/00192082-10596890","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Newman showed that for primes $p\geq 5$ an integral circulant determinant of prime power order $p^t$ cannot take the value $p^{t+1}$ once $t\geq 2.$ We show that many other values are also excluded. In particular, we show that $p^{2t}$ is the smallest power of $p$ attained for any $t\geq 3$, $p\geq 3.$ We demonstrate the complexity involved by giving a complete description of the $25\times 25$ and $27\times 27$ integral circulant determinants. The former case involves a partition of the primes that are $1\bmod5$ into two sets, Tanner's \textit{perissads} and \textit{artiads}, which were later characterized by E. Lehmer.
期刊介绍:
IJM strives to publish high quality research papers in all areas of mainstream mathematics that are of interest to a substantial number of its readers.
IJM is published by Duke University Press on behalf of the Department of Mathematics at the University of Illinois at Urbana-Champaign.