English
Related papers

Related papers: On the height of cyclotomic polynomials

200 papers

We compute the stable Faltings height of the hyperelliptic curve $X_n\colon y^2=x^{n}-1$ for every odd integer $n\ge 3$ in terms of special values of Euler's gamma function. In particular, we prove the bounds $$-0.975n<…

Number Theory · Mathematics 2026-01-22 Robert Wilms

Let $\sigma=(\sigma_1,..., \sigma_N)$, where $\sigma_i =\pm 1$, and let $C(\sigma)$ denote the number of permutations $\pi$ of $1,2,..., N+1,$ whose up-down signature $\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i$, for $i=1,...,N$. We prove that…

Combinatorics · Mathematics 2007-05-23 F. C. S. Brown , T. M. A. Fink , K. Willbrand

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Number Theory · Mathematics 2019-02-20 Alexei Entin

Let $p$ be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the $p$-th cyclotomic polynomial $\Phi_p(t)=1+t+\dots+t^{p-1}$ is the minimal polynomial of $e^{2\pi i/p}$ over…

History and Overview · Mathematics 2022-10-28 Tom Moshaiov

Using the $q$-Wilf--Zeilberger method and a $q$-analogue of a "divergent" Ramanujan-type supercongruence, we give several $q$-supercongruences modulo the fourth power of a cyclotomic polynomial. One of them is a $q$-analogue of a…

Number Theory · Mathematics 2020-04-23 Victor J. W. Guo

Previously Heyman and Shparlinski gave an asymptotic formula with error term for the number of Eisenstein polynomials of fixed degree and bounded height. Let $\psi(f)$ denote the number of primes for which a polynomial $f$ is Eisenstein. We…

Number Theory · Mathematics 2019-01-28 Shilin Ma , Kevin McGown , Devon Rhodes , Mathias Wanner

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

Number Theory · Mathematics 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

Combinatorics · Mathematics 2025-11-06 Owen John Levens

Borwein and Choi conjectured that a polynomial $P(x)$ with coefficients $\pm1$ of degree $N-1$ is cyclotomic iff $$P(x)=\pm \Phi_{p_1}(\pm x)\Phi_{p_2}(\pm x^{p_1})\cdots \Phi_{p_r}(\pm x^{p_1p_2\cdots p_{r-1}})$$ where $N=p_1p_2\cdots…

Number Theory · Mathematics 2018-08-01 Shaofang Hong , Wei Cao

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

Combinatorics · Mathematics 2023-08-24 John Byrne , Michael Tait

We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the…

Combinatorics · Mathematics 2014-09-23 Colin Cooper , Alan Frieze , Ryuhei Uehara

A \emph{quasi-polynomial} is a function defined of the form $q(k) = c_d(k) k^d + c_{d-1}(k) k^{d-1} + ... + c_0(k)$, where $c_0, c_1, ..., c_d$ are periodic functions in $k \in \Z$. Prominent examples of quasi-polynomials appear in…

Combinatorics · Mathematics 2008-03-03 Matthias Beck , Steven Sam , Kevin Woods

Downward collapse (a.k.a. upward separation) refers to cases where the equality of two larger classes implies the equality of two smaller classes. We provide an unqualified downward collapse result completely within the polynomial…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel

A cyclotomic polynomial Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd prime factors. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Eli…

Number Theory · Mathematics 2012-07-30 Yves Gallot , Pieter Moree

We compute the asymptotic number of monic trace-one integral polynomials with Galois group $C_3$ and bounded height. For such polynomials we compute a height function coming from toric geometry and introduce a parametrization using the…

Number Theory · Mathematics 2023-10-30 Shubhrajit Bhattacharya , Andrew O'Desky

Recently, Blanco-Chac\'on proved the equivalence between the Ring Learning With Errors and Polynomial Learning With Errors problems for some families of cyclotomic number fields by giving some upper bounds for the condition number…

Number Theory · Mathematics 2020-12-15 Antonio J. Di Scala , Carlo Sanna , Edoardo Signorini

The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…

Combinatorics · Mathematics 2026-02-25 S. R. Mane

Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…

Number Theory · Mathematics 2011-09-23 Aleksandr Tuxanidy , Qiang Wang

Consider $f:\Omega^n_K \to \mathbf{C}$ a function from the $n$-fold product of multiplicative cyclic groups of order $K$. Any such $f$ may be extended via its Fourier expansion to an analytic polynomial on the polytorus $\mathbf{T}^n$, and…

Classical Analysis and ODEs · Mathematics 2025-05-15 Joseph Slote , Alexander Volberg , Haonan Zhang

We show that there are at most $O_{n,\epsilon}(H^{n-2+\sqrt{2}+\epsilon})$ monic integer polynomials of degree $n$ having height at most $H$ and Galois group different from the full symmetric group $S_n$, improving on the previous 1973…

Number Theory · Mathematics 2014-02-26 Rainer Dietmann
‹ Prev 1 3 4 5 6 7 10 Next ›