All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 123

Showing per page

Parabolic geometries determined by filtrations of the tangent bundle

Sagerschnig, Katja (2006)

Proceedings of the 25th Winter School "Geometry and Physics"

Summary: Let 𝔤 be a real semisimple | k | -graded Lie algebra such that the Lie algebra cohomology group H 1 ( 𝔤 - , 𝔤 ) is contained in negative homogeneous degrees. We show that if we choose G = Aut ( 𝔤 ) and denote by P the parabolic subgroup determined by the grading, there is an equivalence between regular, normal parabolic geometries of type ( G , P ) and filtrations of the tangent bundle, such that each symbol algebra gr ( T x M ) is isomorphic to the graded Lie algebra 𝔤 - . Examples of parabolic geometries determined by filtrations of the...

Paracompact subsets

Aull, C. E. (1967)

General Topology and its Relations to Modern Analysis and Algebra

Parallel programming and optimization of heat radiation intensity

Mlýnek, Jaroslav, Srb, Radek (2013)

Applications of Mathematics 2013

This article focuses on the practical possibilities of a suitable use of parallel programming during the computational processing of heat radiation intensity optimization across the surface of an aluminium or nickel mould. In practice, an aluminium or nickel mould is first preheated by infrared heaters located above the outer mould surface. Then the inner mould surface is sprinkled with a special PVC powder and the outer mould surface is continually warmed by infrared heaters. This is an energy-efficient...

Path-following the static contact problem with Coulomb friction

Haslinger, Jaroslav, Janovský, Vladimír, Kučera, Radek (2013)

Applications of Mathematics 2013

Consider contact problem with Coulomb friction on two planar domains. In order to find non-unique solutions we propose a new path following algorithm: Given a linear loading path we approximate the corresponding solution path. It consists of oriented piecewise linear branches connected by transition points. We developed a) predictor-corrector algorithm to follow oriented linear branches, b) branching and orientation indicators to detect transition points. The techniques incorporate semi-smooth Newton...

Peak functions on convex domains

Kolář, Martin (2000)

Proceedings of the 19th Winter School "Geometry and Physics"

Let Ω ⊂ ℂ n be a domain with smooth boundary and p ∈ ∂ Ω . A holomorphic function f on Ω is called a C k ( k = 0 , 1 , 2 , ⋯ ) peak function at p if f ∈ C k ( Ω ¯ ) , f ( p ) = 1 , and | f ( q ) | < 1 for all q ∈ Ω ¯ ∖ { p } . If Ω is strongly pseudoconvex, then C ∞ peak functions exist. On the other hand, J. E. Fornaess constructed an example in ℂ 2 to show that this result fails, even for C 1 functions, on a weakly pseudoconvex domain [Math. Ann. 227, 173-175 (1977; Zbl 0346.32026)]. Subsequently, E. Bedford and J. E. Fornaess showed that there is always a continuous peak function on a...

Currently displaying 1 – 20 of 123

Page 1 Next