Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot

Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot

Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot

... such a graph G with no independent set of size at least N d k d −0.5 . the electronic journal of combinatorics 16 (2009), #R71 5 Chromatic number for a generalization of Cartesian product graphs Daniel ... of graphs. A d-fold grid over G is a graph obtained from a d-dimensional rectangular grid of vertices by placing a graph from G on each of the lines parall...
Ngày tải lên : 07/08/2014, 21:21
  • 9
  • 263
  • 0
Báo cáo toán học: "Lower Bound for the Size of Maximal Nontraceable Graphs." pot

Báo cáo toán học: "Lower Bound for the Size of Maximal Nontraceable Graphs." pot

... subgraph of G induced by U. AgraphG is hamiltonian if it has a hamiltonian cycle (a cycle containing all the vertices of G), and traceable if it has a hamiltonian path (a path containing all the ... 2005 2000 Mathematics Subject Classification: 05C38 Abstract Let g(n) denote the minimum number of edges of a maximal nontraceable graph of order n. Dudek, Katona and Wojda (200...
Ngày tải lên : 07/08/2014, 13:21
  • 9
  • 298
  • 0
Báo cáo toán học: "DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS" pptx

Báo cáo toán học: "DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS" pptx

... new determinant as possible (as a polynomial in x), and finally find a bound for the degree of the remaining polynomial factor. For big parts of the proof we shall write y for x+m. We feel that this makes ... observation makes it apparent that similar replace- ments in the rest of Step 1 of Proposition 5 will produce a valid proof of Lemma 7. In particular, in (4.17), in t...
Ngày tải lên : 07/08/2014, 06:20
  • 62
  • 398
  • 0
Báo cáo toán học: "Mixing time for a random walk on rooted trees" pot

Báo cáo toán học: "Mixing time for a random walk on rooted trees" pot

... 2009 Mathematics S ubject Classification: 60J10, 05E99 Abstract We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure ... x) for all x). A common way to quantify convergence rates of Markov chains is to use separation distance, introduced by Aldous and Dia conis [2],[3]. They define the separation di...
Ngày tải lên : 08/08/2014, 01:20
  • 13
  • 352
  • 0
Báo cáo toán học: " Colored partitions and a generalization of the braid arrangemen" docx

Báo cáo toán học: " Colored partitions and a generalization of the braid arrangemen" docx

... U A =  H A H of an arrangement A. The result by Ziegler & ˇ Zivaljevi´c is actually far more general and is valid for general arrangements of linear subspaces. Here, we state an equivariant version ... 138–140. [2] C .A. Athanasiadis, Characteristic polynomials of subspace arrangements and finite fields, (Preprint 1996). [3] A. Bj¨orner and J.W. Walker, A homotopy complement...
Ngày tải lên : 07/08/2014, 06:20
  • 12
  • 410
  • 0
Báo cáo toán học: " General decay for a wave equation of Kirchhoff type with a boundary control of memory type" pdf

Báo cáo toán học: " General decay for a wave equation of Kirchhoff type with a boundary control of memory type" pdf

... doi:10.1016/S0362-546X(01)00781-7 24. Aassila, M, Cavalcanti, MM, Domingos Cavalcanti, VN: Existence and uniform decay of the wave equation with nonlinear boundary damping and boundary memory source term. Calc Var. 15, 155–180 ... of Kirchhoff type with nonlinear damping terms. J Math Anal Appl. 204, 729–753 (1996). doi:10.1006/jmaa.1996.0464 8. Nishihara, K, Yamada, Y: On global solution...
Ngày tải lên : 20/06/2014, 21:20
  • 15
  • 653
  • 0
Báo cáo toán học: "Gray Codes for A-Free Strings" ppsx

Báo cáo toán học: "Gray Codes for A-Free Strings" ppsx

... a m−1 because D ends in A . Therefore, a m−r a m−1 = a 0 a r−1 ,andbit( m − r )of AA is one. For 1 ≤ i ≤ m ,let i ∈ AA denote that bit ( m − i )of AA is 1 (similarly for AA + and AA − ). If a m−r a m−1 has even ... a corresponding prefix a 0 a p−1 of A. Call B a base of A if B = a 0 a p−1 for some period p> 0of A. For any base B of A,...
Ngày tải lên : 07/08/2014, 06:20
  • 29
  • 336
  • 0
Báo cáo sinh học: " Periodic solutions for a class of higher order difference equations" potx

Báo cáo sinh học: " Periodic solutions for a class of higher order difference equations" potx

... equations Huantao Zhu 1 and Weibing Wang ∗2 1 Hunan College of Information, Changsha, Hunan 410200, P.R. China 2 Department of Mathematics, Hunan University of Science and Technology, Xiangtan, ... Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Periodic solutions for a class o...
Ngày tải lên : 18/06/2014, 22:20
  • 14
  • 314
  • 0
Báo cáo toán học: " Spectrum sensing for cognitive radio exploiting spectrum discontinuities detection" potx

Báo cáo toán học: " Spectrum sensing for cognitive radio exploiting spectrum discontinuities detection" potx

... (bassem.zayen@eurecom.fr) Aawatif Hayar (a. hayar@greentic.uh2c.ma) ISSN 1687-1499 Article type Research Submission date 6 July 2011 Acceptance date 9 January 2012 Publication date 9 January 2012 Article ... that are well characterized by local irregularities in frequency. As a powerful mathematical tool for analyzing singularities and edges, the wavelet transform is employed to detect an...
Ngày tải lên : 20/06/2014, 20:20
  • 32
  • 402
  • 0
Từ khóa: