Related papers: Permuting the roots of univariate polynomials whos…
We give an explicit description of the arithmetic-geometric extension of iterated Galois groups of rational functions. This yields a complete solution to the extension problem when either the arithmetic or the geometric iterated Galois…
The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…
Fix a degree $d$ projective curve $X \subset \mathbb{P}^r$ over an algebraically closed field $K$. Let $U \subset (\mathbb{P}^r)^*$ be a dense open subvariety such that every hyperplane $H \in U$ intersects $X$ in $d$ smooth points. Varying…
Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…
We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new…
We propose a new method to compute the unipotent radical $R_u(H)$ of the differential Galois group $H$ associated to a parameterized second-order homogeneous linear differential equation of the form \[\tfrac{\partial^2}{\partial…
Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…
The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…
We prove a general independent equidistribution result for Gauss sums associated to $n$ monomials in $r$ variable multiplicative characters over a finite field, which generalizes several previous equidistribution results for Gauss and…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
Let E/F be a quadratic number (resp. p-adic) field extension, and F' an odd degree cyclic field extension of F. We establish a base-change functorial lifting of automorphic (resp. admissible) representations from the unitary group U(3,E/F)…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…
Let $K$ be a field, and let $f\in K(z)$ be a rational function of degree $d\geq 2$. The Galois group of the field extension generated by the preimages of $x_0\in K$ under all iterates of $f$ naturally embeds in the automorphism group of an…
A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…
We prove that the polynomial invariants of a permutation group are Cohen-Macaulay for any choice of coefficient field if and only if the group is generated by transpositions, double transpositions, and 3-cycles. This unites and generalizes…
Given an arbitrary field $F$, we describe all Galois extensions $L/F$ whose Galois groups are isomorphic to the group of upper triangular unipotent 4-by-4 matrices with entries in the field of two elements.
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…
In this paper, we consider the family of hyperbolic quadratic polynomials parametrised by a complex constant; namely $P_{c}(z) = z^{2} + c$ with $|c| < 1$ and the family of hyperbolic cubic polynomials parametrised by two complex constants;…