English
Related papers

Related papers: Elements of high order in finite fields specified …

200 papers

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 $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…

Number Theory · Mathematics 2025-10-21 Joaquim Cera Da Conceição

For $q$ an odd prime power, we prove that there are always four consecutive primitive elements in the finite field $\mathbb{F}_{q}$ when $q> 2401$.

Number Theory · Mathematics 2021-09-27 Tamiru Jarso , Tim Trudgian

In this note, we give an upper bound for the number of elements from the interval $[1,p^{1/4e^{1/2}+\epsilon}]$ necessary to generate the finite field $\mathbb{F}_{p}$ with $p$ an odd prime.

Number Theory · Mathematics 2017-03-21 Marc Munsch

We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…

Number Theory · Mathematics 2018-09-05 Marley Young

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements, and let $m_1$ and $m_2$ be positive integers. Given polynomials $f_1(x), f_2(x) \in \mathbb{F}_q[x]$ with $\textrm{deg}(f_i(x)) \leq m_i$, for $i = 1, 2$, and such that the…

The tensor product of two differential forms of degree $p$ and $q$ is a multilinear form that is alternating in its first $p$ arguments and alternating in its last $q$ arguments. These forms, which are known as double forms or…

Numerical Analysis · Mathematics 2025-05-26 Yakov Berchenko-Kogan , Evan S. Gawlik

The purpose of this paper is to discuss representations of high order $C^0$ finite element spaces on simplicial meshes in any dimension. When computing with high order piecewise polynomials the conditioning of the basis is likely to be…

Numerical Analysis · Mathematics 2020-01-16 Kaibo Hu , Ragnar Winther

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…

Number Theory · Mathematics 2025-08-07 Stephen D. Cohen

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

Number Theory · Mathematics 2007-05-23 Roland Bacher

In this work, we classify all finite groups such that for every field extension F of \mathbb{Q}, F is the field of values of at most 3 irreducible characters.

Group Theory · Mathematics 2023-01-02 Juan Martínez

For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q)^{1/n} (n>e^{3+7/(q-1)^2}) is strictly increasing and the sequence…

Number Theory · Mathematics 2012-10-16 Zhi-Wei Sun

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

Number Theory · Mathematics 2019-09-12 László Mérai , Igor E. Shparlinski

We determine all isomorphism classes of hyperfields of a given finite order which can be obtained as quotients of finite fields of sufficiently large order. Using this result, we determine which hyperfields of order at most 4 are quotients…

Rings and Algebras · Mathematics 2020-07-01 Matthew Baker , Tong Jin

We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…

Group Theory · Mathematics 2013-01-23 Simon Guest , Joy Morris , Cheryl Praeger , Pablo Spiga

Let $F_q$ be a finite field of characteristic $p=2,3$. We give the number of irreducible polynomials $x^m+a_{m-1}x^{m-1}+...+a_0\in\F_q[x]$ with $a_{m-1}$ and $a_{m-3}$ prescribed for any given $m$ if $p=2$, and with $a_{m-1}$ and $a_1$…

Number Theory · Mathematics 2007-05-23 M. Moisio , K. Ranto

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

Combinatorics · Mathematics 2013-06-28 Yangzhou Hu

Given $\mathbb{F}_{q^{n}}$, a field with $q^n$ elements, where $q $ is a prime power and $n$ is positive integer. For $r_1,r_2,m_1,m_2 \in \mathbb{N}$, $k_1,k_2 \in \mathbb{N}\cup \{0\}$, a rational function $F = \frac{F_1}{F_2}$ in…

Number Theory · Mathematics 2023-07-26 Aakash Choudhary , R. K. Sharma

Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…

Commutative Algebra · Mathematics 2014-02-13 Tovohery Hajatiana Randrianarisoa
‹ Prev 1 4 5 6 7 8 10 Next ›