نتایج جستجو برای: covering surface

تعداد نتایج: 682939  

Journal: :Burns : journal of the International Society for Burn Injuries 1989
D Wassermann M Schlotterer

This survey analyses data from 17 French burn units with respect to age, severity of injury and survival of patients admitted to hospital during 1985. Of the 2398 patients treated, more than half were between 15 and 50 years old. About 90 per cent of the patients had burns covering less than 50 per cent of the body surface area. The overall mortality rate was 11.8 per cent. The LD50 for the 239...

Journal: :Eur. J. Comb. 2004
Ian P. Goulden Jin Ho Kwak Jaeun Lee

In a study of surface branched coverings, one can ask naturally: In how many different ways can a given surface be a branched covering of another given surface? This problem was studied by many authors in Quart. J. Math. Oxford Ser. 2 46 (1995) 485, Math. Scand. 84 (1999) 23, Discrete Math. 156 (1996) 141, Discrete Math. 183 (1998) 193, Discrete Math. (in press), European J. Combin. 22 (2001) 1...

Journal: :Bulletin of the American Mathematical Society 1926

2014
Selim G. Akl Robert Benkoczi Daya Ram Gaur Hossam S. Hassanein Shahadat Hossain Mark Thom

Article history: Received 15 April 2014 Received in revised form 29 September 2014 Accepted 28 October 2014 Available online 4 November 2014

Journal: :Applied Mathematics and Computation 2012
Leopold Koczan Pawel Zaprawa

Let F denote the class of all functions univalent in the unit disk and convex in the direction of the real axis. In the paper we discuss the functions of the class F which are n-fold symmetric, where n is positive even integer. For the class of such functions we find the Koebe set as well as the covering set, i.e. T f2F f ðDÞ and S f2F f ðDÞ. Moreover, the Koebe constant and the covering consta...

Journal: :J. Comb. Theory, Ser. A 1998
Yair Caro Raphael Yuster

For every fixed graph H, we determine the H-covering number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, C(H,Kn) = d dn 2h dn− 1 d ee, unless d is even, n = 1 mod d and n(n− 1)/d+ 1 = 0 mod (2h/d), in which case C(H,Kn) = d ( n 2 ) h e+ 1. Our m...

1999
M. A. Aguilar

Using fibre bundle theory we construct the universal covering group of U(n), Ũ(n), and show that Ũ(n) is isomorphic to the semidirect product SU(n)©s R. We give a bijection between the set of projective representations of U(n) and the set of equivalence classes of certain unitary representations of SU(n) ©s R. Applying Bargmann’s theorem, we give explicit expressions for the liftings of project...

2009
Ibrahim Assem Juan Carlos Bustamante Patrick Le Meur

In this paper, we study the covering theory of laura algebras. We prove that if a connected laura algebra is standard (that is, has a standard connecting component), then it has Galois coverings associated to the coverings of the connecting component. As a consequence, the first Hochschild cohomology group of a standard laura algebra vanishes if and only if it has no proper Galois coverings.

1998
Michael R. Douglas Brian R. Greene

We calculate the metric on the D-brane vacuum moduli space for backgrounds of the form C 3 /Γ for cyclic groups Γ. In the simplest procedure — starting with a flat " seed " metric on the covering space — we find that the resulting D-brane metric is not Ricci-flat. We argue that this is likely to be true of the true 0-brane metric at weak string coupling.

Journal: :Discrete Mathematics 2016
Michael E. Hoffman

A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c, c′) and Hom(c′, c) is nonempty for c 6= c′. If we keep in place the latter axiom but allow for more than one morphism between objects, we have a sort of generalized poset in which there are multiplicities attached to the covering relations, and possibly nontrivial au...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید