English
Related papers

Related papers: Upper Bounds for Cyclotomic Numbers

200 papers

We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.

Number Theory · Mathematics 2012-07-04 Bartlomiej Bzdega

We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…

Combinatorics · Mathematics 2025-10-09 Isabella Novik , Hailun Zheng

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Number Theory · Mathematics 2023-05-04 Dor Elboim , Ofir Gorodetsky

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Number Theory · Mathematics 2024-11-07 Antonio Cafure , Eda Cesaratto

A prime number $p$ is said to be irregular if it divides the class number of the $p$-th cyclotomic field $\mathbb{Q}(\zeta_{p}) = \mathbb{Q}(\mathbb{G}_m[p])$. In this paper, we study its elliptic analogue for the division fields of an…

Number Theory · Mathematics 2022-05-19 Naoto Dainobu , Yoshinosuke Hirakawa , Hideki Matsumura

Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…

General Mathematics · Mathematics 2025-10-10 N. A. Carella

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…

Information Theory · Computer Science 2017-10-04 Tao Bai , Yongbo Xia

We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…

Number Theory · Mathematics 2025-12-02 Zachary Couvillon , Anwesh Ray

It is known that two consecutive coefficients of a ternary cyclotomic polynomial $\Phi_{pqr}(x)=\sum_k a_{pqr}(k)x^k$ differ by at most one. In this paper we give a criterion on $k$ to satisfy $|a_{pqr}(k)-a_{pqr}(k-1)|=1$. We use this to…

Number Theory · Mathematics 2014-07-15 Bartlomiej Bzdega

We extend our previous results on the number of integers which are values of some cyclotomic form of degree larger than a given value (see \cite{FW1}), to more general families of binary forms with integer coefficients. Our main ingredient…

Number Theory · Mathematics 2023-06-06 Étienne Fouvry , Michel Waldschmidt

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…

Information Theory · Computer Science 2026-01-21 Jingjun Bao , Hanlin Zou

We use the circle method to count $\mathbb{F}_q(t)$-rational points of bounded naive height on a quadric hypersurface $X\subseteq \mathbb{P}^{n-1}$ defined over $\mathbb{F}_q$, provided that $\mathrm{char}(\mathbb{F}_q)>2$ and $n\ge 3$.…

Number Theory · Mathematics 2026-04-03 Johanna Mettasch

In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound…

Information Theory · Computer Science 2015-02-25 Alexey Frolov

Cantor primes are primes p such that 1/p belongs to the middle-third Cantor set. One way to look at them is as containing the base-3 analogues of the famous Mersenne primes, which encompass all base-2 repunit primes, i.e., primes consisting…

Number Theory · Mathematics 2012-05-04 Christian Salas

We investigate the interrelationships of three notions of primary units in the local cyclotomic field of $p$-th roots of~1($p$ being an odd prime number), especially with reference to global units.

Number Theory · Mathematics 2013-08-02 Chandan Singh Dalawat

Let $\Phi_{n}(q)$ denote the $n$-th cyclotomic polynomial in $q$. Recently, Guo and Schlosser [Constr. Approx. 53 (2021), 155--200] put forward the following conjecture: for an odd integer $n>1$, \begin{align*}…

Number Theory · Mathematics 2021-09-27 He-Xia Ni , Li-Yuan Wang , Hai-Liang Wu

For all positive integers $\ell$, we prove non-trivial bounds for the $\ell$-torsion in the class group of $K$, which hold for almost all number fields $K$ in certain families of cyclic extensions of arbitrarily large degree. In particular,…

Number Theory · Mathematics 2017-09-29 Christopher Frei , Martin Widmer

Suppose $q$ is a prime power and $f\in\mathbb{F}_q[x]$ is a univariate polynomial with exactly $t$ monomial terms and degree $<q-1$. To establish a finite field analogue of Descartes' Rule, Bi, Cheng, and Rojas (2013) proved an upper bound…

Number Theory · Mathematics 2016-07-07 Qi Cheng , Shuhong Gao , J. Maurice Rojas , Daqing Wan

Let l>=1 be an arbitrary odd integer and p,q and r primes. We show that there exist infinitely many ternary cyclotomic polynomials \Phi_{pqr}(x) with l^2+3l+5<= p<q<r such that the set of coefficients of each of them consists of the p…

Number Theory · Mathematics 2020-08-27 Pieter Moree , Eugenia Rosu
‹ Prev 1 3 4 5 6 7 10 Next ›