{"title":"计算有多个最大模根的整数多项式","authors":"Artūras Dubickas, Min Sha","doi":"arxiv-2409.08625","DOIUrl":null,"url":null,"abstract":"In this paper, for positive integers $H$ and $k \\leq n$, we obtain some\nestimates on the cardinality of the set of monic integer polynomials of degree\n$n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These\ninclude lower and upper bounds in terms of $H$ for fixed $k$ and $n$. We also\ncount reducible and irreducible polynomials in that set separately. Our results\nimply, for instance, that the number of monic integer irreducible polynomials\nof degree $n$ and height at most $H$ whose all $n$ roots have equal moduli is\napproximately $2H$ for odd $n$, while for even $n$ there are more than\n$H^{n/8}$ of such polynomials.","PeriodicalId":501064,"journal":{"name":"arXiv - MATH - Number Theory","volume":"39 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Counting integer polynomials with several roots of maximal modulus\",\"authors\":\"Artūras Dubickas, Min Sha\",\"doi\":\"arxiv-2409.08625\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, for positive integers $H$ and $k \\\\leq n$, we obtain some\\nestimates on the cardinality of the set of monic integer polynomials of degree\\n$n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These\\ninclude lower and upper bounds in terms of $H$ for fixed $k$ and $n$. We also\\ncount reducible and irreducible polynomials in that set separately. Our results\\nimply, for instance, that the number of monic integer irreducible polynomials\\nof degree $n$ and height at most $H$ whose all $n$ roots have equal moduli is\\napproximately $2H$ for odd $n$, while for even $n$ there are more than\\n$H^{n/8}$ of such polynomials.\",\"PeriodicalId\":501064,\"journal\":{\"name\":\"arXiv - MATH - Number Theory\",\"volume\":\"39 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Number Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08625\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08625","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Counting integer polynomials with several roots of maximal modulus
In this paper, for positive integers $H$ and $k \leq n$, we obtain some
estimates on the cardinality of the set of monic integer polynomials of degree
$n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These
include lower and upper bounds in terms of $H$ for fixed $k$ and $n$. We also
count reducible and irreducible polynomials in that set separately. Our results
imply, for instance, that the number of monic integer irreducible polynomials
of degree $n$ and height at most $H$ whose all $n$ roots have equal moduli is
approximately $2H$ for odd $n$, while for even $n$ there are more than
$H^{n/8}$ of such polynomials.