Related papers: Triangular polynomial maps in characteristic $p$

We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

In this article, we classify invariants and conjugacy classes of triangular polynomial maps. We make these classifications in dimension 2 over domains containing $\Q$, dimension 2 over fields of characteristic $p$, and dimension 3 over…

We consider a region in the complex plane enclosed by a deltoid curve inscribed in the unit circle, and define a family of polynomials $P_n$ that satisfy the same recurrence relation as the Faber polynomials for this region. We use this…

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

The aim of this paper is mainly to build a new representation-theoretic realization of finite root systems through the so-called Frobenius-type triangular matrix algebras by the method of reflection functors over any field. Finally, we give…

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…

In this paper Fourier transform of multivariate orthogonal polynomials on the simplex is presented. A new family of multivariate orthogonal functions is obtained by using the Parseval's identity and several recurrence relations are derived.

Polynomial maps attached to polynomials of an Ore extension are naturally defi ned. In this setting we show the importance of pseudo-linear transformations and give some applications. In particular, factorizations of polynomials in an Ore…

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

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 compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

Let $G$ be a simply connected and simple algebraic group defined and split over a finite prime field $\mathbb{F}_p$ of $p$ elements. In this paper, using an $\mathbb{F}_p$-linear map splitting Frobenius endomorphism on a hyperalgebra…