Báo cáo toán học: "Proof of the Razumov–Stroganov conjecture for some infinite families of link patterns" pdf
Báo cáo khoa học: A steady-state modeling approach to validate an in vivo mechanism of the GAL regulatory network in Saccharomyces cerevisiae ppt
... using the fsolve
Ó FEBS 2004 Mechanism of galactose signal transduction (Eur. J. Biochem. 271) 4073
A steady-state modeling approach to validate an
in vivo
mechanism
of the GAL regulatory network ... to the
mechanism f or transmission of the galactose signal from
the cytoplasm to the DNA Gal4 p Gal8 0p complex present
in the nucleus to...
Báo cáo toán học: " Pyramid-based image empirical mode decomposition for the fusion of multispectral and panchromatic images" pptx
... (2) image fusion using the
mixed IMFs of panchromatic and MS images; and (3)
quality assessment of the fused image. The test data
include SPOT images of a forest area and QuickBird
images of a ... C is the coefficient of correlation, F(i, j)andM
(i, j)arethegrayvalueofthefusedandMSimages,
respectively. μ
F
is the mean of fused image, μ
M
is the
mean of...
Báo cáo toán học: "Heterologous expression and optimization using experimental designs allowed highly efficient production of the PHY US417 phytase in Bacillus subtilis 168" ppt
... (2008) to determine the first amino acid of the mature
rPHY US417.
The temperature profile of rPHY US417 was obtained by determining its activity between 37
and 80 °C at pH 7.5. Thermostability ... for overproduction of recombinant proteins in Bacillus
is highly promising.
2
Abstract
To attempt cost-effective production of US417 phytase in Bacillus...
Báo cáo hóa học: " Research Article An Implicit Iterative Scheme for an Infinite Countable Family of Asymptotically Nonexpansive Mappings in Banach Spaces" pot
... for an In nite
Countable Family of Asymptotically Nonexpansive
Mappings in Banach Spaces
Shenghua Wang, Lanxiang Yu, and Baohua Guo
School of Mathematics and Physics, North China Electric Power ... subset of a reflexive Banach space E with a weakly continuous
dual mapping, and let {T
i
}
∞
i1
be an in nite countable family of asymptotically nonexpans...
Báo cáo toán học: "Bounds on the number of bound states for the Schroedinger equation in one and two dimensions " docx
... class="bi x0 y0 w1 h 1" alt =""
Báo cáo toán học: "When can the sum of (1/p)th of the binomial coefficients have closed form" pot
... of the pth powers of all of the binomial
coefficients of order n. There too, the methods described in [PWZ] can show that no
closed form exists for specific fixed values of p, but the general question ... for sums of powers of binomial coefficients, J.
Comb. Theory Ser. A
52
(1989), 77–83.
[McI] Richard J. McIntosh, Recurrences for alternating sums of powers of...
Báo cáo toán học: " Proof of the Alon-Tarsi Conjecture for n = 2r p" docx
... so
els (n) =ols (n) . On the other hand, Alon and Tarsi [1] conjectured:
Conjecture 1 (Alon-Tarsi) If n is even then els (n) =ols (n) .
Equivalently, the sum of the signs of all L ∈ LS (n) is nonzero. ... odd, then
AT (n) =0 and AT (n +1) =0 = AT( 2n) =0 .
Together, these imply the truth of the Alon-Tarsi conjecture for n =2
r
(p+1) for
any r ≥ 0 and...
Báo cáo toán học: "On edge colorings with at least q colors in every subset of p vertices" ppsx
... behavior of f(n, p, q) between the linear and quadratic orders of
magnitude, so for q
lin
≤ q ≤ q
quad
. In particular we show that that we can have at most
log p values of q which give a linear ... denotes the parity of the natural
number n,soitis1ifn is odd and 0 otherwise.
1.2 Edge colorings with at least q colors in every subset of p
vertice...
Báo cáo toán học: "Triangulations and the Haj´s Conjecture " ppt
... can go wrong. On the other
hand, he observed that locally planar graphs and triangulations of the projective
plane and the torus satisfy Haj´os Conjecture, and he conjectured that the same
holds ... satisfy the Haj´os
Conjecture?
For a graph H and a positive integer t,let
˜
H
t
be the graph obtained from the union
of H and the clique K
t
by adding all edges betwee...
Báo cáo toán học: "Proof of an intersection theorem via graph homomorphisms" docx
... homomorphism, ¯α(H
n
) ≥ ¯α(H) for any graph H.
We now can present the proof of the theorem.
Proof: Firstnotethatifp =1/2thenà
p
is the uniform measure and the theorem is
trivial because if a vector in ... measure on G
n
our theorem now translates precisely to
the statement ¯α(G
n
) ≤ p.
the electronic journal of combinatorics 13 (2006), #N6 2
Proof of an intersection theo...
Báo cáo toán học: "On Computing the Distinguishing Numbers of Trees and Forests" pps
... attention to computing the distinguish-
ing numbers of rooted trees.
3 Distinguishing labelings of rooted trees
In this section, we give a characterization of the distinguishing labelings of rooted ... the
symmetries of G because the only member of the automorphism group of (G, φ) is the identity
map. The distinguishing number of G, D(G), is the m...
Báo cáo toán học: "Proof of the Razumov–Stroganov conjecture for some infinite families of link patterns" pdf
... each t
i
, as should be. As a
the electronic journal of combinatorics 13 (2006), #R110 10
Proof of the Razumov–Stroganov conjecture
for some infinite families of link patterns
P. Zinn-Justin
Laboratoire ... prove the Razumov–Stroganov conjecture relating ground state of the O(1) loop
model and counting of Fully Packed Loops in the case of certain types...
Báo cáo toán học: "Proof of the combinatorial nullstellensatz over integral domains, in the spirit of Kouba" docx
... electronic journal of combinatorics 17 (2010), #N14 4
Proof of the combinatorial nullstellensatz over
integral domains, in the spirit of Kouba
Peter Heinig
Lehr- und Forschungseinheit M9
făur Angewandte ... carried out without change in the
setting of integral domains.
the electronic journal of combinatorics 17 (2010), #N14 3
Proof of Theorem 2. Let R...
Báo cáo toán học: "Proof of the (n/2 − n/2 − n/2) Conjecture for large n" pps
... |Y
′
| ≥ n/2 − n, then |Y | ≥ (1 −
√
3θ ) (n/2 − n). Since δ(X, V (G
1
)) ≥ n − n, we have
δ(X, Y ) ≥ |Y |− n
≥ (1 −
√
3θ ) (n/2 − n) − θn
>
1
2
−
√
3θ
2
− 2θ
n
≥
n
2
−
√
θn,
where the last ... graphs with
degree constraints.
the electronic journal of combinatorics 18 (2011), #P27 5
Proof of the (n/2 n/2 − n/2) Co...