Related papers: A problem on polynomial maps over finite fields

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

The odd-red bipartite perfect matching problem asks to find a perfect matching containing an odd number of red edges in a given red-blue edge-colored bipartite graph. While this problem lies in $\mathsf{P}$, its polyhedral structure remains…

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

This paper is concerned with the problem of determining the number of division algebras which share the same collection of finite splitting fields. As a corollary we are able to determine when two central division algebras may be…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

The present paper deals with permutations induced by tame automorphisms over finite fields. The first main result is a formula for determining the sign of the permutation induced by a given elementary automorphism over a finite field. The…

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 isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…

The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in…

This paper calculates the fluctuations of eigenvalues of polynomials on large Haar unitaries cut by finite rank deterministic matrices. When the eigenvalues are all simple, we can give a complete algorithm for computing the fluctuations.…

We present a list of all polynomial dominanting maps of the complex plane with branched value curve isomorphic to the complex line, up to polynomial automorphisms.

Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…

The goal of this paper is to present a number of problems about automorphism groups of nonpositively curved polyhedral complexes and their lattices, meant to highlight possible directions for future research.

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…

In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.

Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…

Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…

In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…