✦ LIBER ✦

Derived and integrated sets of simple sets of polynomials in two complex variables

✍ Scribed by W.F Kumuyi; M Nassif

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 642 KB
Volume: 47
Category: Article
ISSN: 0021-9045
DOI: 10.1016/0021-9045(86)90018-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Robust stability of convex and compact s

Robust stability of convex and compact sets of complex polynomials

✍ Y.Q. Shi; H. Zhang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 499 KB

A necessary and sufficient condition for a convex and compact set of complex polynomials to be strictly Hurwitz is 9iven. The result implies and 9eneralizes several results on strict Hurwitz property of polynomials. In particular, our result covers the "edge theorem" fbr polytopes of strictly Hurwit

Representation of Ordinal Numbers and De

Representation of Ordinal Numbers and Derived Sets in Certain Continuous Sets

✍ Frederick Bagemihl 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Spaces of Lattice Diagram Polynomials in

Spaces of Lattice Diagram Polynomials in One Set of Variables

✍ Jean-Christophe Aval; François Bergeron; Nantel Bergeron 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Latent features with maximal correlation

Latent features with maximal correlation between two equal sets of variables

✍ René Henrion; Günter Henrion 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB 👁 1 views

If in two data tables X and Y objects are characterized by the same variables (measured at different occasions), then looking for common latent features should be more appropriate than choosing latent features in X and Y separately (e.g. as in canonical correlation or PLS). The procedure to be propo

On splitting sets in block designs and f

On splitting sets in block designs and finding roots of polynomials

✍ P.C. Van Oorschot; S.A. Vanstone 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

The general notion of t-splitting sets is introduced within the context of combinatorial block designs. A greatest lower bound on cardinality of such sets, and an upper bound on cardinality of the smallest such set in a given design are established. The abstraction of t-splitting sets is shown to pr

Separation of Two Sets in a Product Spac

Separation of Two Sets in a Product Space

✍ Reinhard Nehse 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

In order to prove fundamental assertions in several fields of mathematics (for instance in functional analysis and in optimization theory) i t is useful to have convenient separation theorems. The purpose of this paper is to give necessary conditions for convexity of sets in a product space which c