Related papers: A theorem of complete reducibility for exponential…
In Costa's paper published in 1977, he asks us whether every retract of $k^{[n]}$ is also the polynomial ring or not, where $k$ is a field. In this paper, we give an affirmative answer in the case where $k$ is a field of characteristic zero…
A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
We extend a factorization theorem by Gwo\'zdziewicz and Hejmej from the ring of formal power series to any complete regular local ring $ R $. More precisely, let $ f \in R $ and assume that its Newton polyhedron has a loose edge such that…
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.
We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…
In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
Two theorems of J. F. Ritt on decompositions of polynomials maps are generalized to a more general situation: for, so-called, reduction monoids ($(K[x], \circ)$ and $(K[x^2]x, \circ)$ are examples of reduction monoids). In particular,…
We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
In this paper we study the concept of radical factorization in the context of abstract ideal theory in order to obtain a unified approach to the theory of factorization into radical ideals and elements in the literature of commutative…
Let S be a polynomial ring over a field of characteristic zero in finitely may variables. Let T be an unramified, finitely generated extension of S with $T^\times = k^\times$. Then T = S.
The main theorem (2.2) consists in two characterizations of isomorphisms of factorial domains in terms of prime or primary rings elements, and unramified, flat or weakly injective affine schemes morphisms. In order to apply this theorem to…
Much work has been done on generalized factorization techniques in integral domains, namely $\tau$-factorization. There has also been substantial progress made in investigating factorization in commutative rings with zero-divisors. This…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
A classical tool in the study of real closed fields are the fields $K((G))$ of generalised power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…