Related papers: A problem on polynomial maps over finite fields

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

In this paper we describe graded automorphisms and antiautomorphisms of finite order on matrix algebras endowed with a group gradings by a finite abelian group over an arbitrary algebraically closed field of charcteristic different from 2.

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

We describe the set of characteristic polynomials of abelian varieties of dimension 4 over finite fields.

We determine the automorphism group for a large class of affine quadric hypersurfaces over a field, viewed as affine algebraic varieties. In particular, we find that the group of real polynomial automorphisms of the n-sphere is just the…

This paper is devoted to a study of the automorphism groups of three series of finite dimensional special odd Hamiltonian superalgebras $\mathfrak{g}$ over a field of prime characteristic. Our aim is to characterize the connections between…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

This paper came to existence out of the desire to understand iterations of strictly triangular polynomial maps over finite fields. This resulted in two connected results: First, we give a generalization of $\F_p$-actions on $\F_p^n$ and…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

Trinomial hypersurfaces form a natural class of affine algebraic varieties closely connected with varieties admitting a torus action of complexity one. We investigate orbits of the automorphism group on these hypersurfaces. We prove that…

The maps $x \mapsto ax^{2^k}+b$ defined over finite fields of characteristic two can be related to the duplication map over binary supersingular elliptic curves. Relying upon the structure of the group of rational points of such curves we…

We continue our study of residual properties of mapping tori of free group endomorphisms. In this paper, we prove that each of these groups are virtually residually (finite $p$)-groups for all but finitely many primes$p$. The method…

The lecture, given at the ICM 2014 in Seoul, explores several problems of analytic number theory in the context of function fields over a finite field, where they can be approached by methods different than those of traditional analytic…

A slip on a paper concerning near-vector spaces is fixed. New characterization of near-vector spaces determined by finite fields is provided and the number (up to the isomorphism) of these spaces is exhibited.

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…