Inicio Nosotros Búsquedas
Buscar en nuestra Base de Datos:     
Palabra: GAUGE GROUPS (Palabras)
2 registros cumplieron la condición especificada en la base de información BIBCYT. ()
Registro 1 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Lupton, Gregory ; Christopher Philliips, N. ; L. Schochet, Claude
Título: Banach algebras and rational homotopy theory
Páginas/Colación: pp. 267-295
Fecha: January 2009
Transactions of the American Mathematical Society Vol. 361, no. 1 January 2009
Información de existenciaInformación de existencia

Palabras Claves: Palabras: COMMUTATIVE BANACH ALGEBRA COMMUTATIVE BANACH ALGEBRA, Palabras: FUNCTION SPACE FUNCTION SPACE, Palabras: GAUGE GROUPS GAUGE GROUPS, Palabras: GENERAL LINEAR GROUP GENERAL LINEAR GROUP, Palabras: MAXIMAL IDEAL SPACE MAXIMAL IDEAL SPACE, Palabras: RATIONAL H-SPACE RATIONAL H-SPACE, Palabras: RATIONAL HOMOTOPY THEORY RATIONAL HOMOTOPY THEORY, Palabras: SPACE OF LAST COLUMNS SPACE OF LAST COLUMNS

Resumen
It is proved herein that any absolute minimizer for a suitable Hamiltonian is a viscosity solution of the Aronsson equation:

Let $ A$be a unital commutative Banach algebra with maximal ideal space $ \operatorname{Max}(A).$We determine the rational H-type of $ \operatorname{GL}_n (A),$the group of invertible $ n \times n$matrices with coefficients in $ A,$in terms of the rational cohomology of $ \operatorname{Max} (A).$We also address an old problem of J. L. Taylor. Let $ \operatorname{Lc}_n (A)$denote the space of ``last columns'' of $ \operatorname{GL}_n (A).$We construct a natural isomorphism

$\displaystyle {\Check{H}}^s (\operatorname{Max} (A); \mathbb{Q} ) \cong \pi_{2 n - 1 - s} (\operatorname{Lc}_n (A)) \otimes \mathbb{Q} $

for $ n > \frac{1}{2} s + 1$which shows that the rational cohomology groups of $ \operatorname{Max} (A)$are determined by a topological invariant associated to $ A.$As part of our analysis, we determine the rational H-type of certain gauge groups $ F (X, G)$for $ G$a Lie group or, more generally, a rational H-space.

Registro 2 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Rapetti, Francesca ; Dubois, François ; Bossavit, Alain
Título: Discrete Vector Potentials for Nonsimply Connected Three-Dimensional Domains
Páginas/Colación: pp. 1505- 1527
Url: Ir a http://epubs.siam.org/sam-bin/dbq/article/41264http://epubs.siam.org/sam-bin/dbq/article/41264
Siam Journal on Numerical Analysis Vol. 41, no. 4 Aug/Oct 2004
Información de existenciaInformación de existencia

Palabras Claves: Palabras: DISCRETE GAUGE CONDITION DISCRETE GAUGE CONDITION, Palabras: DIVERGENCE-FREE VECTOR FIELDS DIVERGENCE-FREE VECTOR FIELDS, Palabras: EDGE ELEMENTS EDGE ELEMENTS, Palabras: HOMOLOGY GROUPS HOMOLOGY GROUPS, Palabras: NONSIMPLY CONNECTED DOMAINS NONSIMPLY CONNECTED DOMAINS

Resumen
In this paper, we focus on the representation of a divergence-free vector field, defined, on a connected nonsimply connected domain $\Omega \subset \R^3$ with a connected boundary $\Gamma$, by its curl and its normal component on the boundary. The considered problem is discretized with H(curl)- and H(div)-conforming finite elements. In order to ensure the uniqueness of the vector potential, we propose a spanning tree methodology to identify the independent edges. The topological features of the domain under consideration are analyzed here by means of the homology groups of first and second order.

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno

Generados por el servidor 'bibcyt.ucla.edu.ve' (18.226.87.83)
Adaptive Server Anywhere (07.00.0000)
ODBC
Sesión="" Sesión anterior=""
 ejecutando Back-end Alejandría BE 7.0.7b0 ** * *
18.226.87.83 (NTM) bajo el ambiente Apache/2.2.4 (Win32) PHP/5.2.2.
usando una conexión ODBC (RowCount) al manejador de bases de datos..
Versión de la base de información BIBCYT: 7.0.0 (con listas invertidas [2.0])

Cliente: 18.226.87.83
Salida con Javascript
** Back-end Alejandría BE 7.0.7b0 *