✦ LIBER ✦

An extremal problem for extensions of a sesquillinear form

✍ Scribed by Chandler Davis

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 586 KB
Volume: 13
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(76)90046-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The solution to an extremal problem on b

The solution to an extremal problem on balanced extensions of graphs

✍ A. Ruciński; A. Vince 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 694 KB

An extremal problem for antichains of su

An extremal problem for antichains of subsets of a multiset

✍ G.F. Clements 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 850 KB

A multiset M is a finite set consisting of several different kinds of elements, and an antichain F is a set of incomparable subsets of M. With P and \_F denoting respectively the set of subsets which contain an element of F or are contained in an element of F, we find the best upper bound for min(lF

An extremal problem for the spectral rad

An extremal problem for the spectral radius of a graph

✍ Miroslav Fiedler 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 519 KB

An extremal problem for paths in biparti

An extremal problem for paths in bipartite graphs

✍ A. Gyárfás; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

An Extremal Problem for Families of Pair

An Extremal Problem for Families of Pairs of Subspaces

✍ Meir Katchalski; Roy Meshulam 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 108 KB

We consider the following vector space analogue of a problem in extremal sel theory. Let \(g(k, l)\) denote the maximal \(t\) for which there exist \(t\) pairs of linear subspaces \(\left(U_{1}, V_{1}\right) \ldots\), \(\left(U_{i}, V_{i}\right)\) of a real vector space \(H\), such that \(\operatorn

A Newton-type algorithm for solving an e

A Newton-type algorithm for solving an extremal constrained interpolation problem

✍ Krassimira Vlachkova 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 856 KB

Given convex scattered data in R 3 we consider the constrained interpolation problem of finding a smooth, minimal L p -norm (1 < p < ∞) interpolation network that is convex along the edges of an associated triangulation. In previous work the problem has been reduced to the solution of a nonlinear sy