Related papers: Solving $X^{q+1}+X+a=0$ over Finite Fields

Let $g>1$ be an integer and $f(X)\in{\mathbb Z}[X]$ a polynomial of positive degree with no multiple roots, and put $u(n)=f(g^n)$. In this note, we study the sequence of quadratic fields ${\mathbb Q}(\sqrt{u(n)}\,)$ as $n$ varies over the…

Let $q=p^r$ be the power of a prime $p$ and $(\beta_1,\ldots ,\beta_r)$ be an ordered basis of $\mathbb{F}_q$ over $\mathbb{F}_p$. For $$ \xi=\sum\limits_{j=1}^r x_j\beta_j\in \mathbb{F}_q \quad \mbox{with digits }x_j\in\mathbb{F}_p, $$ we…

Let $\mathbb{K}$ be a number field of degree $k$ and let $\mathcal{O}$ be an order in $\mathbb{K}$. A \emph{generalized number system over $\mathcal{O}$} (GNS for short) is a pair $(p,\mathcal{D})$ where $p \in \mathcal{O}[x]$ is monic and…

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…

The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a…

Following a systematic analysis of existing results, we investigate when complete interlacing between the zeros of distinct polynomial sequences, $\{\mathcal{P}_n\}$ and $\{\mathcal{G}_n\}$ can be achieved by using a naturally arising extra…

We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…

The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

In this paper the question of finding infinitely many solutions to the problem $-\Delta u+a(x)u=|u|^{p-2}u$, in $\mathbb{R}^N$, $u \in H^1(\mathbb{R}^N)$, is considered when $N\geq 2$, $p \in (2, 2N/(N-2))$, and the potential $a(x)$ is a…

We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

Permutation polynomials (PPs) of the form $(x^{q} -x + c)^{\frac{q^2 -1}{3}+1} +x$ over $\mathbb{F}_{q^2}$ were presented by Li, Helleseth and Tang [Finite Fields Appl. 22 (2013) 16--23]. More recently, we have constructed PPs of the form…

We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…

In this paper, we establish two finiteness results and propose a conjecture concerning the Pythagoras number $P(A)$ of a finitely generated real algebra $A$. Let $X \hookrightarrow \mathbb{P}^n$ be an integral projective surface over…

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…

We construct and study the properties of the precise boundary trace of positive solutions of $-\Delta u+u^q=0$ in a smooth bounded domain of $\mathbb R^N$, in the supercritical case $q\geq q_c=(N+1)/(N-1)$

Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…