The diameter of a directed graph is the maximum of the lengths of the shortest paths between all pairs of vertices. A directed graph is said to be tightly oriented if it has the same diameter as its undirected image graph. Our main result is tight orientations for all sufficiently large toroids, exc
Integrability for the Jacobian of Orientation Preserving Mappings
โ Scribed by H. Brezis; N. Fusco; C. Sbordone
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 157 KB
- Volume
- 115
- Category
- Article
- ISSN
- 0022-1236
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An algorithm for computing electron repulsion integrals ERIs oriented to the general contraction scheme is presented. The accompanying coordinate expansion ลฝ . ACE method of Ishida is utilized to derive an efficient algorithm. The performance ลฝ . 2 estimated with the floating-point operation FLOP c
ร 4 ร 4 ร 4 mapping. Given a sequence x in D and two real sequences t and s ร 4 5 5 we prove that if x is bounded, then lim Tx y x s 0. The conditions on n n ยช ฯฑn n D , X, and T are shown which guarantee the weak and strong convergence of the Ishikawa iteration process to a fixed point of T.