𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Infima of universal energy functionals on homotopy classes

✍ Scribed by Stefan Bechtluft-Sachs


Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
138 KB
Volume
279
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

We consider the infima $ \hat E $(f) on homotopy classes of energy functionals E defined on smooth maps f: M^n^ β†’ V^k^ between compact connected Riemannian manifolds. If M contains a sub‐manifold L of codimension greater than the degree of E then $ \hat E $(f) is determined by the homotopy class of the restriction of f to M \ L. Conversely if the infimum on a homotopy class of a functional of at least conformal degree vanishes then the map is trivial in homology of high degrees. (Β© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)


πŸ“œ SIMILAR VOLUMES


A combinatorial characterization of cert
✍ Tran van Trung πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 303 KB

## Abstract A new lower bound on the size of ϡ‐almost strongly universal~2~ classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of Ο΅ βˆ’ ASU~2~ classes of hash functions meeting the Stinson bound in terms of combinatorial designs. Β© 1994

On a Class of Subharmonic Functions
✍ P. K. Jain; P. N. Gupta; V. P. Gupta πŸ“‚ Article πŸ“… 1973 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 1 views
On the functional representation of bond
✍ U. Dinur; A. T. Hagler πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 380 KB

## Abstract __Ab initio__ calculations are used to test the ability of various representations to reproduce bond energies. It is found that expansion in 1/__R__, where __R__ is the bond length, is remarkably efficient and is consistently better than the usual __R__ expansion. A quadratic form in 1/

On the Learnability of Rich Function Cla
✍ Joel Ratsaby; Vitaly Maiorov πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 202 KB

The probably approximately correct (PAC) model of learning and its extension to real-valued function classes sets a rigorous framework based upon which the complexity of learning a target from a function class using a finite sample can be computed. There is one main restriction, however, that the fu