相关论文: Outer factorizations in one and several variables

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

In this paper we study the complexity of factorization of polynomials in the free noncommutative ring $\mathbb{F}\langle x_1,x_2,\dots,x_n\rangle$ of polynomials over the field $\mathbb{F}$ and noncommuting variables $x_1,x_2,\ldots,x_n$.…

We call a multivariable polynomial an Agler denominator if it is the denominator of a rational inner function in the Schur-Agler class, an important subclass of the bounded analytic functions on the polydisk. We give a necessary and…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

We investigate the Pick problem for the polydisk and unit ball using dual algebra techniques. Some factorization results for Bergman spaces are used to describe a Pick theorem for any bounded region in $\mathbb{C}^d$.

We present an operator approach to Rogers-type formulas and Mehler's formulas for the Al-Salam-Carlitz polynomials $U_n(x,y,a;q)$. By using the q-exponential operator, we obtain a Rogers-type formula which leads to a linearization formula.…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

A very short proof of the Fej\'er-Riesz lemma is presented in the matrix case

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…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

We study several natural multiplicity questions that arise in the context of the Birman-Schwinger principle applied to non-self-adjoint operators. In particular, we re-prove (and extend) a recent result by Latushkin and Sukhtyaev by…

We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…

Tensor expression simplification is an "ancient" topic in computer algebra, a representative of which is the canonicalization of Riemann tensor polynomials. Practically fast algorithms exist for monoterm canonicalization, but not for…

We present an elementary proof of a general version of Montel's theorem in several variables which is based on the use of tensor product polynomial interpolation. We also prove a Montel-Popoviciu's type theorem for functions…

The goal of this paper is to develop a Heine-Stieltjes theory for univariate linear differential operators of higher order. Namely, for a given given operator T=\sum_i Q_i(z)d^i/dz^i with polynomial coefficients Q_i(z) set r=max_i (deg…

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…

We give conditions under which the number of solutions of a system of polynomial equations over a finite field F_q of characteristic p is divisible by p. Our setup involves the substitution t_i |-> f_i(t_i) for auxiliary polynomials…

We prove smoothing estimates in Morrey-Campanato spaces for a Helmholtz equation $$ -Lu+zu=f, \qquad -Lu:=\nabla^{b}(a(x)\nabla^{b}u)-c(x)u, \qquad \nabla^{b}:=\nabla+ib(x) $$ with fully variable coefficients, of limited regularity, defined…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…