نتایج جستجو برای: maximal chain

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

Journal: :Transactions of the American Mathematical Society 2022

Let k k be any field and let alttext="upper G"> G encoding="application/x-tex">G a connected reductive alge...

2017
Zhisong Chen Shong-Iee Ivan Su

In the past decades, the inappropriate subsidy policies in many nations have caused problems such as serious oversupply, fierce competition and subpar social welfare in the photovoltaic (PV) industry in many nations. There is a clear shortage in the PV industry literature regarding how dual supply chains compete and the key decision issues regarding the competition between dual PV supply chains...

Journal: :European Journal of Operational Research 2007
Serge Haddad Patrice Moreaux

Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ordering theory has generated a lot of works on bounds computation. Maximal lower and minimal upper bounds of a Markov chain by a st-monotone one exist and can be efficiently computed. In the present work, we extend sim...

Journal: :American journal of physiology. Lung cellular and molecular physiology 2012
Emmy Manders Frances S de Man M L Handoko Nico Westerhof Hieronymus W H van Hees Ger J M Stienen Anton Vonk-Noordegraaf Coen A C Ottenheijm

We previously demonstrated that diaphragm muscle weakness is present in experimental pulmonary arterial hypertension (PH). However, the nature of this diaphragm weakness is still unknown. Therefore, the aim of this study was to investigate whether changes at the sarcomeric level contribute to diaphragm weakness in PH. For this purpose, in control rats and rats with monocrotaline-induced PH, con...

Journal: :Australasian J. Combinatorics 1992
K. M. Koh K. S. Poh

Let C(G) be the closed-set lattice of a graph G, and let l(f) denote the length of a chain r in C( G). The spectrum of £( G) is defined as the set S(£(G)) = {/(r) I r is a maximal chain in £(G)}. For every nontrivial graph G,S(£(G)) is a finite set of natural numbers greater than one. We prove in this paper that (*) for any finite set A of natural numbers greater than one, there exists a graph ...

Journal: :Applied General Topology 2006

1965
IRINA SHCHEPOCHKINA

The five simple exceptional complex Lie superalgebras of vector fields are described. One of them, kas, is new; the other four are explicitly described for the first time. All nonisomorphic maximal subalgebras of finite codimension of these Lie superalgebras, i.e., all other realizations of these Lie superalgebras as Lie superalgebras of vector fields, are also described; there are 14 of them a...

2007
JAN M. CAMERON

In this paper we prove that for a type II1 factor N with a Cartan maximal abelian subalgebra (masa), the Hochschild cohomology groups Hn(N, N)=0, for all n ≥ 1. This generalizes the result of Sinclair and Smith, who proved this for all N having separable predual.

2007
Andrei K. Lerner

We show that in the one-dimensional case the weighted Hardy–Littlewood maximal operator Mμ is bounded on BMO(μ) for arbitrary Radon measure μ, and that this is not the case in higher dimensions.

2004
Camelia Ciobanu C. Ciobanu

In this paper we consider Q the class of solvable Lie algebras L with the following property: if A is a subalgebra of L, then Φ(A) ⊆ Φ(L) (where Φ(L) denotes the Frattini subalgebra of L;that is Φ(L) is the intersection of all maximal subalgebras of L). The class Q is shown to contain all solvable Lie algebras whose derived algebra is nilpotent. Necessary conditions are found such that an ideal...

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

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