English
Related papers

Related papers: Several Classes of Permutation Trinomials over $\m…

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

Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…

Symbolic Computation · Computer Science 2007-05-23 Martin Ziegler

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Number Theory · Mathematics 2020-03-13 Lucas Reis , Sávio Ribas

We show the existence of many infinite classes of permutations over finite fields and bent functions by extending the notion of linear translators, introduced by Kyureghyan [12]. We call these translators Frobenius translators since the…

Commutative Algebra · Mathematics 2018-01-26 Nastja Cepak , Enes Pasalic , Amela Muratović-Ribić

For finite permutation groups, simplicity of the augmentation submodule is equivalent to $2$-transitivity over the field of complex numbers. We note that this is not the case for transformation monoids. We characterize the finite…

Combinatorics · Mathematics 2018-05-01 M. H. Shahzamanian , B. Steinberg

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

Rings and Algebras · Mathematics 2026-01-15 Maithri K. , Vadiraja Bhatta G. R. , Indira K. P. , Prasanna Poojary

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

Let z be a primitive fifth root of unity and let F be the cyclotomic field F=Q(z). Let O be the ring of integers. We compute the Voronoi polyhedron of binary Hermitian forms over F and classify GL_2(O)-conjugacy classes of perfect forms.…

Number Theory · Mathematics 2009-01-22 Dan Yasaki

We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$…

Number Theory · Mathematics 2020-12-29 Yanbin Zheng , Yuyin Yu

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Rings and Algebras · Mathematics 2025-01-07 Alina G. Goutor

Let $q$ be a prime power, $\mathbb F_q$ be the finite field of order $q$ and $\mathbb F_q(x)$ be the field of rational functions over $\mathbb F_q$. In this paper we classify all rational functions $\varphi\in \mathbb F_q(x)$ of degree 3…

Number Theory · Mathematics 2019-02-06 Andrea Ferraguti , Giacomo Micheli

The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.

Number Theory · Mathematics 2011-01-18 Petur Birgir Petersen

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Number Theory · Mathematics 2010-08-12 Melsik K. Kyuregyan , Gohar M. Kyureghyan

In this paper we constructed new q-extension of Bernstein polynomials. Fron those q-Berstein polynomials, we give some interesting properties and we investigate some applications related this q-Bernstein polynomials.

Number Theory · Mathematics 2015-05-19 Taekyun Kim

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

High Energy Physics - Theory · Physics 2009-10-31 P. Bantay

We introduce a notion of permutation presentations of modules over finite groups, and completely determine finite groups over which every module has a permutation presentation. To get this result, we prove that every coflasque module over a…

Group Theory · Mathematics 2007-05-23 Takeshi Katsura

Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all…

Number Theory · Mathematics 2021-05-18 Richard P. Brent , Paul Zimmermann

The aim of this paper is to survey some known results about mapping class group quotients by powers of Dehn twists, related to their finite dimensional representations and to state some open questions. One can construct finite quotients of…

Geometric Topology · Mathematics 2021-09-10 Louis Funar

In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i(x^{p^m}+x+\delta)^{s_i}-x$ over $\mathbb{F}_{p^{2m}}$, where for $1\leq i \leq k,$ $s_i, m$ are positive integers,…

Number Theory · Mathematics 2024-09-30 Danyao Wu , Pingzhi Yuan , Huanhuan Guan , Juan Li

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…

Number Theory · Mathematics 2016-05-25 Andreas Weingartner
‹ Prev 1 8 9 10 Next ›