Related papers: Iterated polynomials are dense
Infinitesimal conformal transformations of $R^n$ are always polynomial and finitely generated when $n>2$. Here we prove that the Lie algebra of infinitesimal conformal polynomial transformations over $R^n$, $n>1$, is maximal in the Lie…
A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…
A graph is $k$-gap-planar if it has a drawing in the plane such that every crossing can be charged to one of the two edges involved so that at most $k$ crossings are charged to each edge. We show this class of graphs has linear expansion.…
In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…
We show that for every positive integer $k$, there exist $k$ consecutive primes having the property that if any digit of any one of the primes, including any of the infinitely many leading zero digits, is changed, then that prime becomes…
A large class of real $3$-dimensional nilpotent polynomial vector fields of arbitrary degree is considered. The aim of this work is to present general properties of the discrete and continuous dynamical systems induced by these vector…
Diestel, Hundertmark and Lemanczyk asked whether every $k$-tangle in a graph is induced by a set of vertices by majority vote. We reduce their question to graphs whose size is bounded by a function in $k$. Additionally, we show that if for…
Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…
The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form…
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…
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…
Based on many experts' former work in the Jacobian conjecture and an essential analysis of intrinsic topology of linear maps, I completely prove the Jacobian conjecture by demonstrating the injectivity of real Keller map of any…
We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…
For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…
We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.
We determine the probability that a random polynomial of degree $n$ over $\mathbb{Z}_p$ has exactly $r$ roots in $\mathbb{Q}_p$, and show that it is given by a rational function of $p$ that is invariant under replacing $p$ by $1/p$.
Let $K$ be any field with $\textup{char}K\neq 2,3$. We classify all cubic homogeneous polynomial maps $H$ over $K$ with $\textup{rk} JH\leq 2$. In particular, we show that, for such an $H$, if $F=x+H$ is a Keller map then $F$ is invertible,…
We show that the iterated images of a Jacobian pair stabilize; that is, the k-th iterates of a polynomial map of complex two-space to itself with a nonzero constant Jacobian determinant all have the same image for sufficiently large k. More…