𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower Bounds for the Energy of Unit Vector Fields and Applications

✍ Scribed by Etienne Sandier


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
460 KB
Volume
152
Category
Article
ISSN
0022-1236

No coin nor oath required. For personal study only.

✦ Synopsis


We prove lower bounds for the Dirichlet energy of a unit vector field defined in a perforated domain of R 2 with nonzero degree on the outer boundary in terms of the total diameter of the holes. We use this to derive lower bounds, and then compactness results for sequences (u = ) of minimizers or almost-minimizers of Ginzburg Landau functionals with coupling constant 1Γ‚= 2 tending to + . 1998 Academic Press

Introduction

Let g: S 1 Γ„ S 1 map the circle to itself, with winding number d. It is well known that, if d{0, then g cannot be extended to a continuous map u: D Γ„ S 1 defined on the whole disk. In fact this follows from a density result of Schoen and Uhlenbeck (1983, J. Differential Geom. 18, 253 268) no finite energy extension can be defined on the whole disk. However extensions can be defined on the disk less one or several holes. The smaller the holes are, the greater the energy of the extension.

In the following, we will write

for the energy of a map u defined on 0. We will call radius of a compact set A/R 2 and write |A| the infimum over all finite coverings of A by open disks D 1 , ..., D n of the sum r 1 + } } } +r n where r i is the radius of D i . We can define the radius of any compact subset of a metric space in the exact same way. We give a proof of the following result article no. FU973170


πŸ“œ SIMILAR VOLUMES


Lower Bounds for the Energy of Unit Vect
✍ Etienne Sandier πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 29 KB

A mistake in the proof of Theorem 1 occurred which was pointed out to the author by Tristan RivieÁ re. It is stated there that the constant C depends only on the domain and the H 1Γ‚2 norm of the boundary data. It really should be the H s -norm for some s>1Γ‚2 for the result to be correct. The proble

Hilbert Class Field Towers of Function F
✍ Alexandre Temkine πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 184 KB

We obtain lower bounds for the asymptotic number of rational points of smooth algebraic curves over finite fields. To do this we construct infinite Hilbert class field towers with good parameters. In this way we improve bounds of Serre, Perret, and Niederreiter and Xing.

Accurate lower and upper bounds of the e
✍ H. Taşeli πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 474 KB πŸ‘ 2 views

Trigonometric basis sets are used in a Rayleigh-Ritz variational method for computing two-sided eigenvalue bounds of the Schrodinger equation in one dimension. The method is based on truncating the infinite interval and solving an eigenvalue problem which obeys the von Neumann and the Dirichlet boun

A nonlinear programming approach to lowe
✍ I. Porras; D. Matthew Feldmann; Frederick W. King πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 170 KB πŸ‘ 3 views

Lower-bound estimates for the ground-state energy of the helium atom are determined using nonlinear programming techniques. Optimized lower bounds are determined for single-particle, radially correlated, and general correlated wave functions. The local nature of the method employed makes it a very s

Upper and lower bounds for the average-c
✍ Pippenger, Nicholas πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 125 KB πŸ‘ 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent