نتایج جستجو برای: g x e interaction

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

Journal: :iranian biomedical journal 0
منیره مانی monireh mani تقی گل محمدی taghi golmohammadi شهناز خاقانی shahnaz khaghani زهرا زمانی zahra zamani کیهان آزادمنش kayhan azadmanesh رضا مشکانی reza meshkani پروین پاسالار

background: elevated level of plasma homocysteine has been related to various diseases. patients with hyperhomocysteinemia can develop hepatic steatosis and fibrosis. we hypothesized that oxidative stress induced by homocysteine might play an important role in pathogenesis of liver injury. also, the cellular response designed to combat oxidative stress is primarily controlled by the transcripti...

2009
JONATHAN WEITSMAN

We show that the Yang-Mills quantum field theory with momentum and spacetime cutoffs in four Euclidean dimensions is equivalent, term by term in an appropriately resummed perturbation theory, to a Fermionic theory with nonlocal interaction terms. When a further momentum cutoff is imposed, this Fermionic theory has a convergent perturbation expansion. To zeroth order in this perturbation expansi...

Journal: :bulletin of the iranian mathematical society 2014
f. de giovanni d. ‎imperatore

‎in 1970‎, ‎menegazzo [gruppi nei quali ogni sottogruppo e intersezione di sottogruppi massimali‎, ‎ atti accad‎. ‎naz‎. ‎lincei rend‎. ‎cl‎. ‎sci‎. ‎fis‎. ‎mat‎. ‎natur. 48 (1970)‎, ‎559--562.] gave a complete description of the structure of soluble $im$-groups‎, ‎i.e.‎, ‎groups in which every subgroup can be obtained as intersection of maximal subgroups‎. ‎a group $g$ is said to have the $fm$...

2010
Jonathan Pakianathan

ρ(e)(x) = e · x A1 = x = 1X(x) for all g, h ∈ G and x ∈ X. Thus ρ(gh) = ρ(g) ◦ ρ(h), ρ(e) = 1X and ρ is hence a homomorphism of monoids G → M(X). Then we note 1X = ρ(e) = ρ(gg ) = ρ(g) ◦ ρ(g) and similarly 1X = ρ(g) ◦ ρ(g) and so the ρ(g) are bijections G → G for all g ∈ G. Thus ρ is a homomorphism G → Σ(X). Given a homomorphism λ : G → Σ(X), in order for it to be the action homomorphism of an ...

Journal: :Discrete Mathematics 1996
Alexandr V. Kostochka Michael Stiebitz B. Wirth

One of the basic results in graph colouring is Brooks' theorem [-4] which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension of this result, Gallai [6] characterized the subgraphs of k-colour-critical graphs induced by the set of all vertices of degree k 1. The choosability version of Broo...

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

هدف اصلی این پایان نامه مطالعه وجود و منحصر بفردی چرخه های حدی برای سیستم های لیناردی به فرم x ?+f(x,x ?)x ?+g(x)=0 و x ?+f(x)x ?+g(x)=0 است. با استفاده از تئوری میدان های برداری چرخشی و قضیه معروف ژانگ ژیفان در رابطه با وجود و منحصر بفردی چرخه های حدی سیستم های لینارد فوق بحث کرده و ماهیت پایداری چرخه های حدی این سیستم ها را بررسی می کنیم.

‎‎Set X = { M11‎, ‎M12‎, ‎M22‎, ‎M23‎, ‎M24‎, ‎Zn‎, ‎T4n‎, ‎SD8n‎, ‎Sz(q)‎, ‎G2(q)‎, ‎V8n}‎, where M11‎, M12‎, M22‎, ‎M23‎, ‎M24 are Mathieu groups and Zn‎, T4n‎, SD8n‎, ‎Sz(q)‎, G2(q) and V8n denote the cyclic‎, ‎dicyclic‎, ‎semi-dihedral‎, ‎Suzuki‎, ‎Ree and a group of order 8n presented by                                      V8n = < a‎, ‎b | a^{2n} = b^{4} = e‎, ‎ aba = b^{-1}‎, ‎ab^{...

2006

Definition 1: An operation on a set G is a function ∗ : G×G→ G. Definition 2: A group is a set G which is equipped with an operation ∗ and a special element e ∈ G, called the identity, such that (i) the associative law holds: for every x, y, z ∈ G, x ∗ (y ∗ z) = (x ∗ y) ∗ z; (ii) e ∗ x = x = x ∗ e for all x ∈ G; (iii) for every x ∈ G, there is x′ ∈ G (so-called, inverse) with x ∗ x′ = e = x′ ∗ ...

Journal: :مهندسی عمران شریف 0
محمدعلی مهندسی دانشکده فنی مهندسی، دانشگاه آزاد اسلامی واحد علوم و تحقیقات علیرضا آذربخت گروه مهندسی عمران، دانشگاه اراک

s e l e c t i o n o f a p p r o p r i a t e g r o u n d m o t i o n i s a k e y e l e m e n t w i t h i n a n y s e i s m i c a s s e s s m e n t o f s t r u c t u r e s. m a n y m e t h o d o l o g i e s h a v e b e e n d e v e l o p e d i n o r d e r t o s e l e c t a n d s c a l e g r o u n d m o t i o n r e c o r d s f o r t h e p u r p o s e o f r e s p o n s e h i s t o r y a n a l y s i ...

2009
Yun Liu

We show that CG ({g}) is a subgroup CG ({g}) ≤ G. • Closure: For x, y ∈ GG ({g}), then xg = gx and yg = gy, so in particular gxy = xgy = xyg, so xy ∈ CG ({g}) • Inverses: For x ∈ CG ({g}) ⊆ G, ∃x−1 ∈ G s.t. xx−1 = x−1x = e, since G is a group. For g−1 ∈ G exists, then we can write gx−1g−1x = g (gx) x = g (xg) x = gg−1x−1x = e, which shows gx−1 = x−1g, so x−1 ∈ CG ({g}) • Identity: For e ∈ G, eg...

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

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