COMPOSITION THEOREMS, MULTIPLIER SEQUENCES AND COMPLEX ZERO DECREASING SEQUENCES

By Thomas C. Craven, G. Csordas. 2004

93 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Applied Mathematics

View Paper: https://www.semanticscholar.org/paper/8f5ddb84d324d5a46bd009bd5aa788dec08fe7ec

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Julius Borcea
2. Petter Brand'en

In Applied Mathematics

1. Petter Brand'en
2. Julius Borcea
3. David G. Wagner
4. Robin Pemantle
5. Thomas M. Liggett
6. Daniel A. Spielman
7. Nikhil Srivastava
8. Adam W. Marcus

Citations in the corpus

• Multivariate Pólya–Schur classification problems in the Weyl algebra (2006, background): “multiplier sequences and finite order ones 3.1. Univariate and multivariate multiplier sequences. Let us first recall a few well-known properties of (usual) univariate multiplier sequences, see, e.g., [11]. Lemma 5. Let λ : N → R be a multiplier sequence. If 0 ≤ i ≤ j ≤ k are such that λ(i)λ(k) 6= 0 ”
• The Lee-Yang and Pólya-Schur programs. I. Linear operators preserving stability (2008, background): “This question has a long and distinguished history going back to Laguerre and Polya-Schur, see [11, 15 ] and the references therein.”