Related papers: Upper bounds on cyclotomic numbers

The ideal class monoid for an order $R$ in a finite field extension $E/F$ of a number field, denoted by $\overline{\mathrm{Cl}}(R)$, is a fundamental object to study in number theory which has useful applications in algebraic geometry and…

Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic…

We show that univariate trinomials $x^n + ax^s + b \in \mathbb{F}_q[x]$ can have at most $\delta \Big\lfloor \frac{1}{2} +\sqrt{\frac{q-1}{\delta}} \Big\rfloor$ distinct roots in $\mathbb{F}_q$, where $\delta = \gcd(n, s, q - 1)$. We also…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

In this note, we obtain an exact formula for the $q$-adic valuation of $\sigma_k(n)$ where $q$ is an odd prime, allowing us to derive an explicit upper bound which is asymptotically better than the previous bound obtained by Zhao when $n$…

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best…

We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.

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…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of given order and clique number. More precisely, let G be a graph of order n, let A be its adjacency matrix, and let D be the diagonal matrix…

We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant $C$ such that \[r(k+1, k+1) \leq k^{- C \frac{\log k}{\log \log k}} \binom{2k}{k}.\]

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

Cyclotomic coset is a classical notion in the theory of finite field which has wide applications in various computation problems. Let $q$ be a prime power, and $n$ be a positive integer coprime to $q$. In this paper we determine explicitly…

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

In this paper we study the distribution of the size of the value set for a random polynomial with degree at most $q-1$ over a finite field $\mathbb{F}_q$. We obtain the exact probability distribution and show that the number of missing…

Let A be a commutative ring and I an ideal of A with a reduction Q. In this paper we give an upper bound on the reduction number of I with respect to Q, when a suitable family of ideals in A is given. As a corollary it follows that if some…

In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…