Related papers: Outer factorizations in one and several variables

In this paper we first offer an alternative approach to extend the original Fueter's Theorem in Dunkl-Clifford analysis to a version of the higher order case. Then this result is used to prove a generlized version of Fueter's Theorem with…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Classification theorems for linear differential equations in two real variables, possessing eigenfunctions in the form of the polynomials (the generalized Bochner problem) are given. The main result is based on the consideration of the…

In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…

We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.

Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…

Let L be any number field or $\mathfrak{p}$-adic field and consider F:=(f_1,...,f_k) where f_i is in L[x_1,...,x_n]\{0} for all i and there are exactly m distinct exponent vectors appearing in f_1,...,f_k. We prove that F has no more than…

An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…

We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

We analyze transverse thrust in the framework of Soft Collinear Effective Theory and obtain a factorized expression for the cross section that permits resummation of terms enhanced in the dijet limit to arbitrary accuracy. The factorization…

We give a new algorithm for the construction of the unique superoptimal analytic approximant of a given continuous matrix-valued function on the unit circle, making use of exterior powers of operators in preference to spectral or {\em…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…

Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…

In binary polynomial optimization, the goal is to find a binary point maximizing a given polynomial function. In this paper, we propose a novel way of formulating this general optimization problem, which we call factorized binary polynomial…

We give a proof of a conjecture of Lehrer and Shoji regarding the occurrences of the exterior powers of the reflection representation in the cohomology of Springer fibers. The actual theorem proved is a slight extension of the original…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for…