English
Related papers

Related papers: Stable and real-zero polynomials in two variables

200 papers

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

We show that smooth curves of monic complex polynomials $P_a (Z)=Z^n+\sum_{j=1}^n a_j Z^{n-j}$, $a_j : I \to \mathbb C$ with $I \subset \mathbb R$ a compact interval, have absolutely continuous roots in a uniform way. More precisely, there…

Classical Analysis and ODEs · Mathematics 2016-08-01 Adam Parusinski , Armin Rainer

Let $\Rx$ denote the ring of polynomials in $g$ freely non-commuting variables $x=(x_1,...,x_g)$. There is a natural involution * on $\Rx$ determined by $x_j^*=x_j$ and $(pq)^*=q^* p^*$ and a free polynomial $p\in\Rx$ is symmetric if it is…

Functional Analysis · Mathematics 2012-08-20 Sriram Balasubramanian , Scott McCullough

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

For distinct complex numbers $z_1,...,z_{2N}$, we give a polynomial $P(y_1,...,y_{2N})$ in the variables $y_1,...,y_{2N}$, which is homogeneous of degree $N$, linear with respect to each variable, $sl_2$-invariant with respect to a natural…

Quantum Algebra · Mathematics 2009-05-25 A. Varchenko

We prove that there is an absolute constant $c > 0$ such that every polynomial $P$ of the form $$P(z) = \sum_{j=0}^{n}{a_jz^j}\,, \quad |a_0| = 1\,, \quad |a_j| \leq M\,, \quad a_j \in \Bbb{C}\,, \quad M \geq 1\,,$$ has at most…

Classical Analysis and ODEs · Mathematics 2024-10-15 Tamás Erdélyi

A Lee-Yang polynomial $ p(z_{1},\ldots,z_{n}) $ is a polynomial that has no zeros in the polydisc $ \mathbb{D}^{n} $ and its inverse $ (\mathbb{C}\setminus\overline{\mathbb{D}})^{n} $. We show that any real-rooted exponential polynomial of…

Complex Variables · Mathematics 2024-10-10 Lior Alon , Alex Cohen , Cynthia Vinzant

Let $K$ be a field of characteristic $0$, and let $k \geq 2$ be an integer. We prove that every $K$-linear bijection $f \colon K[X] \to K[X]$ strongly preserving the set of $k$-free polynomials (or the set of polynomials with a $k$-fold…

Commutative Algebra · Mathematics 2025-07-31 Béranger Seguin

In this paper we show that if an entire function $f(z_1,z_2)$ of two (or more) complex variables verifies $\norm{f(z_1,z_2)}\leq K(\norm{P(z_1,z_2)})$, where $P(z_1,z_2)$ is a polynomial that is not a power in $\CC[[z_1,z_2]]$, and $K$ is…

Complex Variables · Mathematics 2019-07-02 Jorge Mozo Fernández

A non-zero constant Jacobian polynomial map $F=(P,Q):\mathbb{C}^2 \longrightarrow \mathbb{C}^2$ has a polynomial inverse if the component $P$ is a simple polynomial, i.e. if, when $P$ extended to a morphism $p:X\longrightarrow \mathbb{P}^1$…

Algebraic Geometry · Mathematics 2017-09-13 Nguyen Van Chau

Let $p_n(x)$ be orthogonal polynomials associated to a measure $d\mu$ of compact support in $R$. If $E\not\in supp(d\mu)$, we show there is a $\delta>0$ so that for all $n$, either $p_n$ or $p_{n+1}$ has no zeros in $(E-\delta, E+\delta)$.…

Classical Analysis and ODEs · Mathematics 2007-05-23 Sergey A. Denisov , Barry Simon

Every $n th$ order monic polynomial corresponds $n$-dimensional vector. If the given polynomial is stable that is all its roots lie in the open left half plane it is said to be Hurwitz polynomial and the corresponding vector is called…

Optimization and Control · Mathematics 2018-10-24 Vakif Dzhafarov , Özlem Esen , Taner Büyükköroğlu

Given a monic linear pencil L in g variables let D_L be its positivity domain, i.e., the set of all g-tuples X of symmetric matrices of all sizes making L(X) positive semidefinite. Because L is a monic linear pencil, D_L is convex with…

Rings and Algebras · Mathematics 2018-04-27 J. William Helton , Igor Klep , Scott McCullough

Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + \Lambda ^T \Lambda,$ where $L$…

Functional Analysis · Mathematics 2008-04-07 Damon M. Hay , J. William Helton , Adrian Lim , Scott McCullough

Let $I$ be a matroidal ideal of degrre $d$ of a polynomial ring $R=K[x_1,...,x_n]$, where $K$ is a field. Let astab$(I)$ and dstab$(I)$ be the smallest integer $n$ for which Ass$(I^n)$ and depth$(I^n)$ stabilize, respectively. In this…

Commutative Algebra · Mathematics 2022-07-19 Amir Mafi , Dler Naderi

Let $K$ be a field and $\phi(z)\in K[z]$ be a polynomial. Define $\Phi(z) := \frac{1}{\phi(z)} \in K(z).$ For $n \in\mathbb{N}^* $, let the $n$-th iterate of $\Phi(z)$ be defined as $\Phi^{(n)}(z) = \underbrace{\Phi \circ \Phi \circ \cdots…

Dynamical Systems · Mathematics 2025-02-13 Yang Gao Qingzhong Ji

Let $ P(z) $ be a polynomial of degree $ n $ having all zeros in $|z|\leq k$ where $k\leq 1,$ then it was proved by Dewan \textit{et al} that for every real or complex number $\alpha$ with $|\alpha|\geq k$ and each $r\geq 0$ $$…

Complex Variables · Mathematics 2013-04-03 N. A. Rather , Suhail Gulzar

For $n \times n$ matrices $A$ and $B$ define $$\eta(A,B)=\sum_{S}\det(A[S])\det(B[S']),$$ where the summation is over all subsets of $\{1,..., n\}$, $S'$ is the complement of $S$, and $A[S]$ is the principal submatrix of $A$ with rows and…

Spectral Theory · Mathematics 2008-07-28 Julius Borcea , Petter Brändén

We consider the group M of all polynomial matrices U(z) = U0 + U1*z + U2*z*z +...+Uk*z*...*z, k=0,1,... that satisfy equation U(z)*D*U(z)" = D with the diagonal n*n matrix D=diag{-1,1,1,...1}. Here n > 1, U(z)" = U0" + U1"*z + U2"*z*z +…

Group Theory · Mathematics 2007-05-23 Boris D. Lubachevsky
‹ Prev 1 4 5 6 7 8 10 Next ›