Related papers: On Canonical Subfield Preserving Polynomials
We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…
To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces of…
In this paper, as an analogue of the integer case, we define congruence preserving functions over the residue class rings of polynomials over finite fields. We establish a counting formula for such congruence preserving functions, determine…
We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…
We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…
We study non-linear surjective mappings on subsets of ${\cal M}_n(F)$, which preserve the zeros of some fixed polynomials in noncommuting variables. Keywords: Matrix algebra, Multilinear polynomials, Preservers.
In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…
A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
We derive a canonical form for smooth vector fields on $\Re^{n+1}$. We use this to demonstrate the local multi-Hamiltonian nature of the corresponding flows. Associated with the canonical form is an inhomogenious linear PDE whose solutions…
In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…
Canonical functions are a powerful concept with numerous applications in the study of groups, monoids, and clones on countable structures with Ramsey-type properties. In this short note, we present a proof of the existence of canonical…
The aim of this paper is to unveil an unexpected relationship between the normal form of a polynomial with respect to a polynomial ideal and the more geometric concept of orthogonality. We present a new way to calculate the normal form of a…
The polyadic integer numbers, which form a polyadic ring, are representatives of a fixed congruence class. The basics of polyadic arithmetic are presented: prime polyadic numbers, the polyadic Euler function, polyadic division with a…
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.