نتایج جستجو برای: 2s
تعداد نتایج: 6212 فیلتر نتایج به سال:
For any positive integer s, a [2, 2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K1,2s+1) in a graph G has at least 3 edges in a block of degree at most two, then G has a [2, 2s]-factor. This extends the results of Hendry and Vogler and of Abderrezzak et al.
We present a search for direct CP violation in B → J/ψ K and B → ψ(2S)K decays. In a sample of 9.7 × 106 BB meson pairs collected with the CLEO detector, we have fully reconstructed 534 B → J/ψK and 120 B → ψ(2S)K decays with very low background. We have measured the CP -violating charge asymmetry to be (+1.8 ± 4.3[stat] ± 0.4[syst])% for B → J/ψ K and (+2.0 ± 9.1[stat]± 1.0[syst])% for B → ψ(2...
MitoNEET (mNT) is an outer mitochondrial membrane target of the thiazolidinedione diabetes drugs with a unique fold and a labile [2Fe-2S] cluster. The rare 1-His and 3-Cys coordination of mNT's [2Fe-2S] leads to cluster lability that is strongly dependent on the presence of the single histidine ligand (His87). These properties of mNT are similar to known [2Fe-2S] shuttle proteins. Here we inves...
Monolayer transition metal dichalcogenides (TMDs) host a variety of optically excited quasiparticle species that stem from two-dimensional confinement combined with relatively large carrier effective masses and reduced dielectric screening. The magnetic response these quasiparticles gives information on their spin valley configurations, nuanced interactions, insight into the underlying band str...
We consider matroids with the property that every subset of ground set size s is contained in a 2s-element circuit and t 2t-element cocircuit. say such matroid has (s,2s,t,2t)-property. A an (s,t)-spike if there partition into pairs union any Our main result all sufficiently large (s,2s,t,2t)-property are (s,t)-spikes, generalizing 2019 proved case where s=t. also present some properties (s,t)-...
Problem A1 We call a finite set of positive integers feasible if every member of S has the form 23, and no member of S divides any other member of S. We call a positive integer n feasible if n = ∑ S for some feasible set S. We are required to show that every positive integer is feasible. If not, then there exists a smallest infeasible number n. If n is even, say n = 2k for some positive integer...
Let A, B ⊆ R be finite, nonempty subsets, let s ≥ 2 be an integer, and let h1(A,B) denote the minimal number t such that there exist 2t (not necessarily distinct) parallel lines, l1, . . . , lt, l ′ 1, . . . , l ′ t , with A ⊆ ⋃t i=1 li and B ⊆ ⋃t i=1 l ′ i . Suppose h1(A,B) ≥ s. Then we show that: (a) if ||A| − |B|| ≤ s and |A|+ |B| ≥ 4s − 6s+ 3, then |A+B| ≥ (2− 1 s )(|A| + |B|)− 2s+ 1; (b) i...
Delsarte-Goethals-Seidel [9] studied finite subsets X in the unit sphere S = {x = (x1, x2, . . . , xn) ∈ R n | x1 + x 2 2 + · · · + x 2 n = 1} from the viewpoint of algebraic combinatorics. Here the following two parameters s = s(X) and t = t(X) play important roles. The s is called the degree of X and is defined as the number of distinct distances between two distinct elements of X, (then X is...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید