Báo cáo toán học: "On the Hyperbolicity of Some Systems of Nonlinear " pps

... ξ 4 v 33 v 15 v 24 , (6.7) On the Hyperbolicity of some Systems of Nonlinear 111 The solvability of the Cauchy problem for the equations (1.5) strongly depends on the hyperbolicity of the system (1.1). So, ... hyperbolic. 3. Proof of the Theorem 2.8 for the Case n =2 Suppose that A T = A, i.e. a 12 = a 21 . We prove that the system (1.1) is hyper- bolic...

Ngày tải lên: 06/08/2014, 05:20

... by x p the g.c.d. of the first term of f u and the first term of f v , by x t the g.c.d. of the first term of f u and the second term of f v , by x r the g.c.d. of the second term of f u and the second ... Marcel in Theorem 2.1. We obtain also a primary decomposition of the presentation ideal of the Symmetric algebra Sym(I) in Theorem 3.1. All these resu...

Ngày tải lên: 06/08/2014, 05:20

... Thus, the the existence of a SOMA(n − 1,n) is equivalent to the existence of n − 1 MOLS of order n, and hence to the existence of a projective plane of order n.Ifnis a power of a prime then there exists ... construct the graph Φ(A)forAas follows. The vertex- set of Φ(A) is the union of A, the cartesian product {1, ,n}×{1, ,n},theset the electronic journal of...

Ngày tải lên: 07/08/2014, 06:20

... and T  is one of the two components of T − e. (This is well defined since, for T  being the other component of T − e,thesets(T  ),(T  ) form a partition of (T ).) The width of the branch-decomposition ... branch-decomposition (T,τ) is the maximum of the widths of the edges of T ,andthe branch-width of M is the minimal width over all branch-decompositi...

Ngày tải lên: 07/08/2014, 06:23

... of the letter a.Thenumber may thus be regarded as the frequency of the letter a. We are interested in the exponential growth rate of s n,n . This leads to the question whether sequences of ... <q<∞. The function F (q) is called the free energy of the model. More can be said about the properties of the free energy by using convexity arguments. These ar...

Ngày tải lên: 07/08/2014, 08:20

... proof is the main focus of the present work: Theorem. The number of ASMs of size n with the 1 of the first row in the (i + 1) st position and the 1 of last row in the (j + 1) st position is the ... number of ASMs of size n is the same as the number of TSSCPPs of size 2n: A n = A n (1) = U 0 n (1) 4 The proof 4.1 ASM counting as the partition function...

Ngày tải lên: 07/08/2014, 21:20

... 1). There are integers r and s such that the local graph of each vertex of Γ is the disjoint union of r copies of the s-clique. Furthermore, v = 1 + rs + s 2 r(r − 1), k = rs and λ = s − 1. The ... diam(Γ)). The subgraph Γ 1 (u) is called the local graph of a vertex u and the degree of u is the number of neighbors of u, i.e., |Γ 1 (u)|. For two vertices u, w ∈...

Ngày tải lên: 08/08/2014, 12:22

... statistical analysis of the capacity of N∗Nakagami-m channels. Specifically, we have studied the influence of the severity of fading and the number of hops on the PDF, CDF, LCR, and ADF of the channel capacity. ... levels r. Furthermore, the variance of the channel capacity decreases by increasing the number of hops, while increase in the severity of fading...

Ngày tải lên: 20/06/2014, 20:20

... α(j) = 0, 0 ≤ j ≤ n. Then the solution of (4.4) and (4.5) is bounded if and only if the condition (5.5) is satisfied. Proof. The proof is immediate consequence from proof of Theorem 4.3 with Remark ... condition for the boundedness of all solutions of (1.1) and the scalar case of (1.1), respectively. The next result provides a sufficient condition for the boundedness of...

Ngày tải lên: 20/06/2014, 20:20

... h 4" alt =""

Ngày tải lên: 05/08/2014, 09:46