Pith. sign in

REVIEW 1 cited by

The Lee-Yang and P\'olya-Schur Programs. I. Linear Operators Preserving Stability

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0809.0401 v3 pith:P3TYZLB7 submitted 2008-09-02 math.CV cond-mat.stat-mechmath-phmath.COmath.MP

The Lee-Yang and P\'olya-Schur Programs. I. Linear Operators Preserving Stability

classification math.CV cond-mat.stat-mechmath-phmath.COmath.MP
keywords linearoperatorspreservingnon-vanishingolya-schurpolynomialsprogramproperties
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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, probability theory, combinatorics, and matrix theory. We characterize all linear operators on finite or infinite-dimensional spaces of multivariate polynomials preserving the property of being non-vanishing whenever the variables are in prescribed open circular domains. In particular, this solves the higher dimensional counterpart of a long-standing classification problem originating from classical works of Hermite, Laguerre, Hurwitz and P\'olya-Schur on univariate polynomials with such properties.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On Factorizing Aggregate Counting Distributions into Independent Latent Processes

    math-ph 2026-07 accept novelty 7.0

    Every aggregate counting distribution admits a poset of positive factorizations into independent latent processes, and the maximum latent entropy (factorization entropy) is attained at maximal atomizations.