Related papers: Bounded and unbounded polynomials and multilinear …

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…

A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…

It is known that if $M,\,N$ are continuous two-variable means such that $|M(x,y)-N(x,y)| < |x-y|$ for every $x,\ y$ with $x\ne y$, then there exists a unique invariant mean (which is continuous too). We are looking for invariant means for…

A field $k$ is called large if every irreducible $k$-curve with a $k$-rational smooth point has infinitely many $k$-points. Let $k$ be a perfect large field and let $f \in k[x]$. Consider the evaluation map $f_k: k \to k$. Assume that $f_k$…

For any infinite field k and any positive integer r, we show constructively that the map sending each polynomial P $\in$ k[x] to its r-th iterate is dominant in various inductive limit topologies on the space of all polynomials.

For given polynomial map $F:\C^2\to\C^2$ with nonvanishing jacobian we associate a variety whose homology or intersection homology describes the geometry of singularities at infinity of this map.

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…

In this note, we use elementary submodels to prove that a separable monotonically normal compactum can be mapped on a separable metric space via a continuous function whose fibers have cardinality at most 2.

We extend a theorem by Kleiner, stating that on a group with polynomial growth, the space of harmonic functions of polynomial of at most $k$ is finite dimensional, to the settings of locally compact groups equipped with measures with…

We show the existence of polynomial maps which have a regular bifurcation value, while over a neighbourhood of this value the fibres are connected and diffeomorphic.

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

We show that if there exists a topologically expansive homeomorphism on a uniform space, then the space is always a regular space. Through examples we show that in general composition of topologically expansive homeomorphisms need not be…

We define the compact universal cover of a compact, metrizable connected space (i.e. a continuum) X to be the inverse limit of all continua that regularly cover X. We show that such covers do indeed form an inverse system with bonding maps…

We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

A set $A$ in a finite dimensional Euclidean space is \emph{monovex} if for every two points $x,y \in A$ there is a continuous path within the set that connects $x$ and $y$ and is monotone (nonincreasing or nondecreasing) in each coordinate.…

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…