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

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

2008
Jürgen Jost

If M is compact Kählerian and ρ is semi-simple, that is that the Zariski closure of the image of ρ in GL(n,C) is semi-simple 1, by means of a result of Donaldson (in the case of Riemann surfaces, [5]) and Corlette (in the higher dimensional case, [4]), there exists a unique harmonic metric u on V, equivalently, a ρ-equivariant harmonic map from the universal covering M̃ of M into Pn := GL(n,C)/U...

2009
SAMUEL BLOOM

In this paper, we define the fundamental group of a topological space and explore its structure, and we proceed to prove Van-Kampen’s Theorem, a powerful result useful for calculating the fundamental groups of spaces which decompose into spaces whose fundamental groups are already known. With these tools, we show that the circle, 2-sphere, torus, and figure-8 space are topologically distinct. W...

Journal: :Optimization Letters 2009
Leo Liberti Nelson Maculan Yue Zhang

We use reformulation techniques to model and solve a complex sphere covering problem occurring in the configuration of a gamma ray machine radiotherapy equipment unit.

Journal: :Optical Engineering 2007

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز 1382

‏‎in this research,the authors conducted a study comparing two groups of male and female english language learners studying in a elt institute,in terms of their performance on their achievement test including listening comprehension,vocabulary,grammar,and reading comprehension and found no significant difference between the group except in listening comprehension part of the test in which the f...

Journal: :Discrete Mathematics 1988

Journal: :Scientific American 1870

Journal: :Europasian Journal of Medical Sciences 2020

Journal: :Theory of Computing 2006
Anupam Gupta Aravind Srinivasan

In the Covering Steiner problem, we are given an undirected graph with edgecosts, and some subsets of vertices called groups, with each group being equipped with a non-negative integer value (called its requirement); the problem is to find a minimum-cost tree which spans at least the required number of vertices from every group. The Covering Steiner problem is a common generalization of the k-M...

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

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