相关论文: A classification of permutation polynomials of deg…
All simple weight modules with finite dimensional weight spaces over affine Lie algebras are classified.
Let $p$ be a prime and let $\mathbb{C}$ be the complex field. We explicitly classify the finite solvable irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ up to conjugacy. That is, we give a complete and irredundant list of…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
In this paper we give a module-theoretic description of the isomorphism classes of abelian varieties $A$ isogenous to $B^r$, where the characteristic polynomial $g$ of Frobenius of $B$ is an ordinary square-free $q$-Weil polynomial, for a…
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…
We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
In this article we compute the $q$th power values of the quadratic polynomials $f$ with negative squarefree discriminant such that $q$ is coprime to the class number of the splitting field of $f$ over $\mathbb{Q}$. The theory of unique…
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…
For any grading by an abelian group $G$ on the exceptional simple Lie algebra $\mathcal{L}$ of type $E_6$ or $E_7$ over an algebraically closed field of characteristic zero, we compute the graded Brauer invariants of simple…
We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…
In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full…
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…
Over a field of characteristic 0, every ring of invariants of a finite group is Cohen-Macaulay. This is not true for fields of positive characteristic. We consider permutation representations and their invariant rings over fields…
Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…
Let $p$ be an odd prime and $e$ be a positive integer. We completely explain the permutation binomials and trinomials arising from the reversed Dickson polynomials of the $(k+1)$-th kind $D_{n,k}(1,x)$ over $\mathbb{F}_{p^e}$ when…
We prove a necessary condition for some polynomials of degree 4e (e an odd number) to be APN over F q n for large n, and we investigate the polynomials f of degree 12.
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.