نتایج جستجو برای: society for range management

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

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده ادبیات و زبانهای خارجی 1390

abstract the present thesis seeks to critically read george orwell’s nineteen eighty-four and animal farm in the light of louis althusser’s thought and theory. the present thesis proceeds to examine and demonstrate althusser’s major concepts including ideological state apparatuses (isas), repressive state apparatuses (rsas), the structure, the subject, and ideological interpellation which r...

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

in this thesis, phosphorus ylides [phbppy], [no2bppy] and [brbppy] have been synthesized through the formation of phosphonium salt and dihydrogenation, followed by the reaction of pd(oac)2 and the orthopalladated dinuclear complexes [pd(?-cl)(phbppy)]2, [pd(?-cl)(no2bppy)]2 and [pd(?-cl)(brbppy)]2 have been produced. the reaction of dinuclear complexes and bidentate ligands [l = bipy (2,2-bipyr...

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

سازند پابده در برش دره شهر شامل 260متر شیل، شیل آهکی، مارن و آهک می باشد. مطالعات انجام شده بر روی فرامینیفرهای پلانکتون منجر به شناسایی و ارائه تعداد 12 بیوزون شده است. این بیوزون ها عبارتند از: بیوزون شماره یک: parasubbotina pseudobulloides partial-range zone ، بیوزون شماره دو: subbotina triloculinoides partial-range zone، بیوزون شماره سه: morozovella angulata partial-range zone ، بیوزون شمار...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده ادبیات و زبانهای خارجی 1390

august wilson is undoubtedly one of the rare black playwrights whose works have attracted streams of attention and worldwide audience. the present study aims at analyzing fences and piano lesson which are two of the most successful plays in his pittsburgh cycle from the perspective of michel foucault’s theories and ideas. studying these two plays from foucault’s perspective opens new windows in...

2002
PAUL ERDÖS

They also conjectured that for Jki<feâ£o, pk!(n)Spk2(n) and for ko<h<k2i pki(n)<pk2(n). They verify this conjecture for n^32. Recently Todd published a table of all the pkin) for n^lOO, and it is easy to verify the conjecture for w^glOO. I am unable to prove or disprove this conjecture. They also remark that pk0{n) differs from c-inm i0g n by i e s s than 1 for n^ 32; (2) shows that for large n...

2008
Jorge Antezana Enrique R. Pujals Demetrio Stojanoff

Given an r × r complex matrix T , if T = U |T | is the polar decomposition of T , then, the Aluthge transform is defined by ∆ (T ) = |T |U |T |. Let ∆n(T ) denote the n-times iterated Aluthge transform of T , i.e. ∆0(T ) = T and ∆n(T ) = ∆(∆n−1(T )), n ∈ N. We prove that the sequence {∆n(T )}n∈N converges for every r × r matrix T . This result was conjecturated by Jung, Ko and Pearcy in 2003. W...

1999
RITA CSÁKÁNY

We propose a homological approach to two conjectures descended from the Erdős-Ko-Rado Theorem, one due to Chvátal and the other to Frankl and Füredi. We apply the method to reprove, and in one case improve, results of these authors related to their conjectures.

Journal: :J. Comb. Theory, Ser. A 2011
Valentina Pepe Leo Storme Frédéric Vanhove

We consider Erdős-Ko-Rado sets of generators in classical finite polar spaces. These are sets of generators that all intersect non-trivially. We characterize the Erdős-Ko-Rado sets of generators of maximum size in all polar spaces, except for H(4n+ 1, q) with n ≥ 2.

Journal: :Discussiones Mathematicae Graph Theory 2012
Gyula O. H. Katona Ákos Kisvölcsey

A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős–Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corres...

Journal: :Electr. J. Comb. 1988
Ian Anderson

Let k and m be positive integers. A collection of k-multisets from {1, . . . ,m} is intersecting if every pair of multisets from the collection is intersecting. We prove that for m ≥ k +1, the size of the largest such collection is ( m+k−2 k−1 ) and that when m > k + 1, only a collection of all the k-multisets containing a fixed element will attain this bound. The size and structure of the larg...

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

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