نتایج جستجو برای: covering techniques
تعداد نتایج: 676792 فیلتر نتایج به سال:
Two different relaxed versions of Gummelt’s aperiodic cluster covering rules are considered. These relaxed covering rules produce certain random tiling type structures, which are precisely characterized, along with their relationships to various other random tiling ensembles. One variant of the relaxed covering rules allows for a natural realization in terms of a vertex cluster. It is shown wit...
Article history: Received 15 April 2014 Received in revised form 29 September 2014 Accepted 28 October 2014 Available online 4 November 2014
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...
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...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید