نتایج جستجو برای: 3n
تعداد نتایج: 2238 فیلتر نتایج به سال:
Polyunsaturated fatty acids (PUFAs) are important for immune function. Limited evidence indicates that immune cell activation involves endogenous PUFA synthesis, but this has not been characterised. To address this, we measured metabolism of 18:3n-3 in quiescent and activated peripheral blood mononuclear cells (PBMCs), and in Jurkat T cell leukaemia. PBMCs from men and women (n = 34) were incub...
I maintain that quantum mechanics is fundamentally about a system of N particles evolving in three-dimensional space, not the wave function evolving in 3N-dimensional space. 1. Introduction. What is quantum mechanics fundamentally about? I believe that quantum mechanics is fundamentally about particles: quantum mechanics describes the behavior of systems of particles evolving in three-dimension...
It is well known that for each n ≡ 1 or 3 (mod 6) there is a planar Steiner quasigroup (briefly, squag) of cardinality n (Doyen (1969) and Quackenbush (1976)). A simple squag is semi-planar if every triangle either generates the whole squag or the 9-element subsquag (Quackenbush (1976)). In fact, Quakenbush has stated that there should be such semi-planar squags. In this paper, we construct a s...
In this article, a four-phase dual armature-winding wound-field doubly salient machine with distributed field magnetomotive forces (DAW-WFDSM-DF) and corresponding double-redundant rectifier circuit are proposed to improve the electromagnetic performance of traditional WFDSM in terms output voltage ripple, fault-tolerant capability capability. Firstly, due uniformly machine, more feasible stato...
It is well-known (as a special case of the path-path Ramsey number) that in every 2-coloring of the edges of K3n−1, the complete graph on 3n− 1 vertices, there is a monochromatic P2n, a path on 2n vertices. Schelp conjectured that this statement remains true if K3n−1 is replaced by any host graph on 3n − 1 vertices with minimum degree at least 3(3n−1) 4 . Here we propose the following stronger ...
The complexity of the dual basis of a type I optimal normal basis of Fqn over Fq was determined to be 3n − 3 or 3n − 2 according as q is even or odd, respectively, by Z.-X. Wan and K. Zhou in 2007. We give a new proof to this result by clearly deriving the dual of a type I optimal basis with the aid of a lemma on the dual of a polynomial basis.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید