Báo cáo toán học: "A spectral characterization of monotonicity properties of normal linear operators with an aplication to nonlinear telegraph equation " pptx

... class="bi x0 y0 w1 h 2" alt =""

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

... class="bi x0 y0 w1 h 1" alt =""

Ngày tải lên: 05/08/2014, 15:21

... S 2 , whose members consist of the union of any element of F 1 with any element of F 2 . It is easy to see that the product of two cancellative families is also a cancellative family ((A 1 ,A 2 ) ... for any A, B, C in the family. Frankl and F¨uredi [2] call such families cancellative. We ask how large cancellative families can be. We define f(n) to be the size of the largest...

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

... sets of MOFS using another set of MOFS and an affine design. A special case is Laywine’s construction [2] (see also IV.20.8(3) in [1]), which uses a complete set of MOLS in place of the MOFS and ... has the parameters of the design of the points and hyperplanes of some affine geometry. With the usual design theory notation, an affine design AD(k, m)isanaffine 2-(v, k, λ)design,wit...

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

... possible to find a somewhat better bound. Observe that the denominator of each of our f λ ’s is (up to sign change) a product of cyclotomic polynomials. In fact, the power of the j th cyclotomic ... D(n). Proof. Consider the table of the characters χ N ; we are interested in the dimension of the row-span of this table. Since the dimension of the row-span of a matrix is eq...

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

... (A.2) establishes (2.10) and shows that there are no “gaps” in the asymptotics between cases (b) and (c). References [1] N. Bleistein and R. Handelsman, Asymptotic Expansions of Integrals, Dover Publica- tions, ... applies when n, b and k are such that h k n is neither close to 0 nor to 1. The result (2.10) has roughly the form of an exponential of a Gaussian, and it should be con...

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

... author thanks Prof. Yair Caro and Raphael Yuster for sending reference [7]. The author also thanks Prof. Cheng Zhao for his advice. References [1] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications ... Chunhui Lai, Upper bound and lower bound of f(n), J. Zhangzhou Teachers Col- lege(Natural Science Edition) 4(1)(1990) 29,30-34. [5] Chunhui Lai, On the size of graphs with all...

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

... edge-connectivity of cages Ping Wang 1∗ Baoguang Xu 2 Jianfang Wang 2 1 Department of Mathematics, Statistics and Computer Science, St.Francis Xavier University, Antigonish, NS, Canada, B2G 2W5, 2 Institute of ... cycle of G  to denote any cycle of G  having length less than g. ∗ Research supported by the Natural Sciences and Engineering Research Council of Canada the electron...

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

... A.J. van Zanten, “A note on balanced Gray codes”, submitted for publication. [10] A.J. van Zanten and I N. Suparta, “Totally balanced and exponentially balanced Gray codes”, Discrete Analysis and ... for the existence of exponentially balanced Gray codes is derived. The proof is much sim- pler than an earlier proof presented by van Zanten and Suparta (Discrete Analysis and Operation Resea...

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

... X k and every vertex belongs to W k . Thus all F −neighbors of x belong to an (m−1)n-element subset Y of the G−neighborhood of x in W k . Moreover all other (n − 1) vertices of F belong to an ... Faudree, Rousseau and Schelp [2] introduced an idea of measuring minimality with respect to size rather than order of the graphs G with G → (G 1 , G 2 ). Let e(G) be the...

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