๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Clarke subdifferential of the distance function of a closed set

โœ Scribed by James V Burke; Michael C Ferris; Maijian Qian

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
589 KB
Volume
166
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the uniformity of the closed-set latt
On the uniformity of the closed-set lattice of a tree
โœ K.M. Koh; K.S. Poh ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 578 KB

Denote by e\*(L) and ~,(L) respectively the upper length and lower length of a finite lattice L. The lattice L is said to be uniform if for each integer k with e,(L) < k < ยข\*(L) there exists in L a maximal chain of length k. It is shown that the closed-set lattice of a finite graph G is uniform if

The polarisability of LiCl as a function
The polarisability of LiCl as a function of bond distance
โœ D.G. Bounds; J.H.R. Clarke; A. Hinchliffe ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 232 KB

We report a near-Hartree-Fock-limit calculation of the variation of the polarisability of LiCl with bond distance over the range 200 to 2Oao. The results, which are of interest in the IBC model of light scattering, are broadly similar to corresponding calculations on Eie2 and He2.

On the lower length of the closed-set la
On the lower length of the closed-set lattice of a tree
โœ K.M. Koh; K.S. Poh ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 395 KB

Let L(T) be the closed-set latice of a tree T. The lower length l, (L(T)) of L (T) is defined as Call a set S of vertices in T a sparse set if d(x, y)/> 3 for any two distinct vertices x, y in S. The sparsity y(T) of T is defined as y(T) = max {Isl: s is a sparse set of T}. We prove that, for any