English
Related papers

Related papers: A new class of irreducible pentanomials for polyno…

200 papers

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

Number Theory · Mathematics 2010-11-23 Liping Wang , Qiang Wang

In this article we study the irreducibility of polynomials of the form $x^n+\epsilon_1 x^m+p^k\epsilon_2$, $p$ being a prime number. We will show that they are irreducible for $m=1$. We have also provided the cyclotomic factors and…

Number Theory · Mathematics 2019-07-10 Biswajit Koley , A. Satyanarayana Reddy

We give, in this paper, all bi-unitary perfect polynomials over the prime field $\mathbb{F}_2$, with at most four irreducible factors.

Number Theory · Mathematics 2022-05-24 Olivier Rahavandrainy

Let $q$ be a power of a prime and $\mathbb{F}_q$ be a finite field with $q$ elements. In this paper, we propose four families of infinite classes of permutation trinomials having the form $cx-x^s + x^{qs}$ over $\mathbb{F}_{q^2}$, and…

Information Theory · Computer Science 2018-05-29 Dabin Zheng , Mu Yuan , Long Yu

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

Symbolic Computation · Computer Science 2010-10-04 Yao Sun , Dingkang Wang

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…

Information Theory · Computer Science 2016-05-23 Kangquan Li , Longjiang Qu , Chao Li , Shaojing Fu

We give all bi-unitary non splitting even perfect polynomials over the prime field of two elements, which are divisible by Mersenne irreducible polynomials raised to special exponents. We also identify all bi-unitary perfect polynomials…

Number Theory · Mathematics 2022-05-10 Olivier Rahavandrainy

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Number Theory · Mathematics 2020-08-05 Zeyu Guo

Let $q=2^m.$ In a recent paper \cite{Zhang3}, Zhang and Zheng investigated several classes of permutation pentanomials of the form $\epsilon_0x^{d_0}+L(\epsilon_{1}x^{d_1}+\epsilon_{2}x^{d_2})$ over ${\mathbb F}_{q^3}~(d_0=1,2,4)$ from some…

Number Theory · Mathematics 2025-01-28 Tongliang Zhang , Lijing Zheng , Hengtai Wang , Jie Peng , Yanjun Li

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Number Theory · Mathematics 2018-11-21 Domingo Gómez-Pérez , László Mérai , Igor E. Shparlinski

Finite field multiplier is mainly used in error-correcting codes and signal processing. Finite field multiplier is regarded as the bottleneck arithmetic unit for such applications and it is the most complicated operation over finite field…

Information Theory · Computer Science 2023-09-15 Saeideh Nabipour , Gholamreza Zare Fatin , Javad Javidan

In this paper, we give a complete classification of extensions of finite irreducible conformal modules over rank two Lie conformal algebras.

Representation Theory · Mathematics 2025-01-06 Lipeng Luo , Yucai Su , Mengjun Wang

A. Mukhopadhyay, M. R. Murty and K. Srinivas (http://arxiv.org/abs/0808.0418) have recently studied various arithmetic properties of the discriminant $\Delta_n(a,b)$ of the trinomial $f_{n,a,b}(t) = t^n + at + b$, where $n \ge 5$ is a fixed…

Number Theory · Mathematics 2008-11-11 I. E. Shparlinski

Floating point multiplication is a crucial operation in high power computing applications such as image processing, signal processing etc. And also multiplication is the most time and power consuming operation. This paper proposes an…

Hardware Architecture · Computer Science 2019-12-17 S Arish , R. K. Sharma

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

Number Theory · Mathematics 2023-03-08 Zhang Weilin , Yuan Pingzhi

In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…

Number Theory · Mathematics 2014-06-03 Xiaoer Qin , Guoyou Qian , Shaofang Hong

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

Number Theory · Mathematics 2014-03-12 Jean Bourgain , Sergei Konyagin , Igor Shparlinski

We give a new algorithm for performing the distinct-degree factorization of a polynomial P(x) over GF(2), using a multi-level blocking strategy. The coarsest level of blocking replaces GCD computations by multiplications, as suggested by…

Data Structures and Algorithms · Computer Science 2010-04-20 Richard Brent , Paul Zimmermann

We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…

High Energy Physics - Phenomenology · Physics 2009-10-28 A. V. Kotikov

In this paper, we classify the finite dimensional irreducible modules for affine BMW algebra over an algebraically closed field with arbitrary characteristic.

Quantum Algebra · Mathematics 2012-06-19 Hebing Rui
‹ Prev 1 3 4 5 6 7 10 Next ›