English
Related papers

Related papers: Multivariate Polya-Schur classification problems i…

200 papers

In the first part of this series we characterized all linear operators on spaces of multivariate polynomials preserving the property of being non-vanishing in products of open circular domains. For such sets this completes the multivariate…

Complex Variables · Mathematics 2012-04-18 Julius Borcea , Petter Brändén

We consider homogeneous multiaffine polynomials whose coefficients are the Pl\"ucker coordinates of a point $V$ of the Grassmannian. We show that such a polynomial is stable (with respect to the upper half plane) if and only if $V$ is in…

Complex Variables · Mathematics 2019-08-15 Kevin Purbhoo

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…

Complex Variables · Mathematics 2022-03-04 Greg Knese

We introduce and study the notion of conic stability of multivariate complex polynomials in $\mathbb{C}[z_1,\ldots, z_n]$, which naturally generalizes the stability of multivariate polynomials. In particular, we generalize Borcea's and…

Complex Variables · Mathematics 2018-05-07 Thorsten Jörgens , Thorsten Theobald

We describe all linear operators on spaces of multivariate polynomials preserving the property of being non-vanishing in open circular domains. This completes the multivariate generalization of the classification program initiated by…

Complex Variables · Mathematics 2008-11-17 Julius Borcea , Petter Brändén

In this note we attempt to develop an analog of P\'olya-Schur theory describing the class of univariate hyperbolicity preservers in the setting of linear finite difference operators. We study the class of linear finite difference operators…

Classical Analysis and ODEs · Mathematics 2013-06-25 P. Brändén , I. Krasikov , B. Shapiro

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

Classical Analysis and ODEs · Mathematics 2008-03-04 Steve Fisk

Following the classical approach of P\'olya-Schur theory we initiate in this paper the study of linear operators acting on $\mathbb{R}[x]$ and preserving either the set of positive univariate polynomials or similar sets of non-negative and…

Classical Analysis and ODEs · Mathematics 2008-01-22 Julius Borcea , Alexander Guterman , Boris Shapiro

In 1952 Lee and Yang proposed the program of analyzing phase transitions in terms of zeros of partition functions. Linear operators preserving non-vanishing properties are essential in this program and various contexts in complex analysis,…

Complex Variables · Mathematics 2012-04-18 Julius Borcea , Petter Brändén

The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…

Complex Variables · Mathematics 2022-05-18 Oskar Jakub Szymański , Michał Wojtylak

In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…

Representation Theory · Mathematics 2024-06-19 Marino Romero , Nolan Wallach

The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…

Combinatorics · Mathematics 2016-04-15 Petter Brändén , Madeleine Leander

A polynomial $p \in \mathbb{R}[z_1, \cdots, z_n]$ is called real stable if it is non-vanishing whenever all the variables take values in the upper half plane. A well known result of Elliott Lieb and Alan Sokal states that if $p$ and $q$ are…

Functional Analysis · Mathematics 2017-04-21 Mohan Ravichandran

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

Rings and Algebras · Mathematics 2019-01-31 Jurij Volčič

Univariate polynomials with only real roots -- while special -- do occur often enough that their properties can lead to interesting conclusions in diverse areas. Due mainly to the recent work of two young mathematicians, Julius Borcea and…

Complex Variables · Mathematics 2009-11-19 David G. Wagner

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

Algebraic Geometry · Mathematics 2025-08-07 Sebastian Debus , Cordian Riener , Robin Schabert

A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…

Combinatorics · Mathematics 2025-07-17 Xinxuan Wang

We study linear operators preserving the property of being a volume polynomial. More, precisely we show that a linear operator preserves this property if the associated symbol is itself a volume polynomial. This can be seen as an analogue…

Algebraic Geometry · Mathematics 2026-01-21 Lukas Grund , Hendrik Süß

The aim of this paper is to make a systematical study on the stability of polynomials in combinatorics. Applying the characterizations of Borcea and Br\"and\'en concerning linear operators preserving stability, we present criteria for real…

Combinatorics · Mathematics 2021-06-25 Ming-Jian Ding , Bao-Xuan Zhu

We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…

Data Structures and Algorithms · Computer Science 2016-10-04 Prasad Raghavendra , Nick Ryder , Nikhil Srivastava
‹ Prev 1 2 3 10 Next ›