Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 167 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Coefficients of a relative of cyclotomic polynomials (1209.6026v1)

Published 26 Sep 2012 in math.NT and math.CO

Abstract: Let $N=p_1p_2... p_n$ be a product of $n$ distinct primes. Define $P_N(x)$ to be the polynomial $(1-xN)\prod_{1\leq i<j\leq n}(1-x{N/(p_ip_j)})/\prod_{i=1}n (1-x{N/p_i})$. (When $n=2$, $P_{pq}(x)$ is the $pq$-th cyclotomic polynomial, and when $n=3$, $P_{pqr}(x)$ is $(1-x)$ times the $pqr$-th cyclotomic polynomial.) Let the height of a polynomial be the maximum absolute value of one of its coefficients. It is well known that the height of $\Phi_{pq}(x)$ is 1, and Gallot and Moree showed that the same is true for $P_{pqr}(x)$ when $n=3$. We show that the coefficients of $P_N(x)$ depend mainly on the relative order of sums of residues of the form $p_j{-1} \pmod {p_i}$. This allows us to explicitly describe the coefficients of $P_N(x)$ when $n=3$ and show that the height of $P_N(x)$ is at most 2 when $n=4$. We also show that for any $n$ there exist $P_N(x)$ with height 1 but that in general the maximum height of $P_N(x)$ is a function depending only on $n$ with growth rate $2{n2/2+O(n\log n)}$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.