Results 51 to 60 of about 98,739 (338)

Etale and crystalline companions, I [PDF]

Épijournal de Géométrie Algébrique, 2022
Let $X$ be a smooth scheme over a finite field of characteristic $p$. Consider the coefficient objects of locally constant rank on $X$ in $\ell$-adic Weil cohomology: these are lisse Weil sheaves in \'etale cohomology when $\ell \neq p$, and ...
Kiran S. Kedlaya
doaj   +1 more source

On some permutation polynomials over finite fields

International Journal of Mathematics and Mathematical Sciences, 2005
Let p be prime, q=pm, and q−1=7s. We completely describe the permutation behavior of the binomial P(x)=xr(1+xes) (1≤e≤6) over a finite field Fq in terms of the sequence {an} defined by the recurrence relation an=an−1+2an−2−an−3 (n≥3) with initial ...
Amir Akbary, Qiang Wang
doaj   +1 more source

Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials

Известия Иркутского государственного университета: Серия "Математика", 2017
One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj   +1 more source

PERMUTATION POLYNOMIALS OF DEGREE 8 OVER FINITE FIELDS OF ODD CHARACTERISTIC [PDF]

Bulletin of the Australian Mathematical Society, 2019
We give an algorithmic generalisation of Dickson’s method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson’s idea is to formulate from Hermite’s criterion several polynomial equations satisfied by the ...
Xiang Fan
semanticscholar   +1 more source

Primitive polynomials over finite fields [PDF]

, 1992
In this note we extend the range of previously published tables of primitive polynomials over finite fields. For each p n > 10 50
Tom Hansen, G. Mullen
semanticscholar   +2 more sources

Irreducible compositions of polynomials over finite fields [PDF]

Designs, Codes and Cryptography, 2010
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
Melsik K. Kyuregyan, Gohar M. Kyureghyan
openaire   +2 more sources

A group action on multivariate polynomials over finite fields [PDF]

, 2018
Seja Fq o corpo finito com q elementos, onde q é a potência de um primo p. Recentemente, uma ação particular do grupo GL2 (Fq) sobre polinômios irredutíveis em Fq [X] foi introduzida e muitas questões relativas aos polinômios invariantes foram discutidas.
Lucas da Silva Reis
core   +1 more source

Sequences over Finite Fields Defined by OGS and BN-Pair Decompositions of PSL₂(q) Connected to Dickson and Chebyshev Polynomials

Mathematics, 2023
The factorization of groups into a Zappa–Szép product, or more generally into a k-fold Zappa–Szép product of its subgroups, is an interesting problem, since it eases the multiplication of two elements in a group and has recently been applied to public ...
Robert Shwartz, Hadas Yadayi
doaj   +1 more source

Exceptional Polynomials over Finite Fields

Finite Fields and Their Applications, 1995
The key breakthrough in the attempts to eliminate candidates for the monodromy groups of an indecomposable exceptional polynomial is generally considered to be the work of Fried et al. in 1993. However, they employed the classification of finite simple groups, among other things. The authors of the paper under review remedy this situation by confirming
Cohen, S.D., Matthews, R.W.
openaire   +4 more sources

Factoring with Pell conics

Lietuvos Matematikos Rinkinys, 2004
In the paper the Pell conics method for factoring integers, based on observations of Lemmer­meyer [2, 3], is presented explicitly. Moreover, a similar algorithm for factoring polynomials over finite fields is given.
Rasa Šleževičienė
doaj   +3 more sources