✦ LIBER ✦

Separating sets in interpolation and geometry

✍ Scribed by B. Polster

Publisher: Springer
Year: 1998
Tongue: English
Weight: 353 KB
Volume: 56
Category: Article
ISSN: 0001-9054
DOI: 10.1007/s000100050056

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geometry of interpolation sets in deriva

Geometry of interpolation sets in derivative free optimization

✍ A. R. Conn; K. Scheinberg; Luís N. Vicente 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 387 KB

The geometry of linear separability in d

The geometry of linear separability in data sets

✍ Adi Ben-Israel; Yuri Levin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We study the geometry of datasets, using an extension of the Fisher linear discriminant to the case of singular covariance, and a new regularization procedure. A dataset is called linearly separable if its different clusters can be reliably separated by a linear hyperplane. We propose a measure of l

Separating convex sets in the plane

✍ Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 329 KB

Connectivity and separating sets of cage

Connectivity and separating sets of cages

✍ Jiang, Tao; Mubayi, Dhruv 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraph G[S] has diameter at least g/2 , with equality only when distance g/2 occurs for at least two pairs of vertices in G[S]. This structural property is

On separating sets and menger's theorem

✍ Gabriel Dirac 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 998 KB

Interpolation problems and dense sets

✍ Yu. F. Korobeinik 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 663 KB