Báo cáo toán học: "RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS" pdf
... 3). We use the fact that there is a bijection between rhombus tilings of the hexagon and perfect matchings of the hexagon s ‘dual’ graph G (see Figure 2 for the construction of the dual graph and Figure ... are missing. In particular, Problem 4 of [8] asks for a formula for the number of rhombus tilings of a regular hexagon, where two of the six ce...
Ngày tải lên: 07/08/2014, 06:20
...
Ngày tải lên: 05/08/2014, 15:21
... 27-51. Vietnam Journal of Mathematics 34:1 (2006) 41–49 Strong Insertion of a Contra - Continuous Function * Majid Mirmiran Department of Mathematics, University of Isfahan Isfahan 81746-73441, Iran Received ... the insertion of a contra-continuous function between two comparable real-valued functions on such topological spaces that Λ−sets are open [3]. A real-valued fun...
Ngày tải lên: 06/08/2014, 05:20
Báo cáo toán học: " Efficiency of Embedded Explicit Pseudo Two-Step RKN Methods on a Shared Memory Parallel Computer" ppsx
... f-evaluations of s components of the big vector F(t n e + h n c, Y n ) over a number of available processors. An additional computational effort consists of a recomputation of the variable parameter ... sev- eral processors sharing a common memory with fast data access requiring less communication times, which is suited to the features of the EPTRKN methods. In addi...
Ngày tải lên: 06/08/2014, 05:20
Báo cáo toán học: "Critical subgraphs of a random graph" docx
... vertex-copies. Therefore, there exists ζ 5 < 1 such that at least one pair of the configuration will contain a point from each of T 1 u ,T v , and at least one pair will contain a point from each of T 2 u ,T v , with ... evolution of random graphs. Magayr Tud. Akad. Mat. Kutato Int. Kozl. 5 (1960), 17 - 61. [13] P. Erd˝os and A. R´enyi. On the existence of a factor...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "An extension of a criterion for unimodality" pps
... that if a sequence is log concave then it is unimodal [5]. A sufficient condition for log concavity of a polynomial is given by the location of its zeros: if all the zeros of a polynomial are real ... Combinatorics and Ge- ometry: an update. Contemporary Mathematics, 178, 71-84, 1994. [4] Stanley, R.: Log-concave and unimodal sequences in algebra, combinatorics and ge- ometry....
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "Translational tilings of the integers with long periods" ppt
... Z n . Remark. Under the assumptions of Theorem 4 max A =maxB, as the two sets cannot have two elements in common (0 and their common maximum) without violating unique represen- tation in A ⊕ B.SooneofmaxA,maxB ... uniquely expressible as a + b, a ∈ A, b ∈ B. We say then that A tiles the integers if translated at the locations B and it is well known that B must be a...
Ngày tải lên: 07/08/2014, 07:21
Báo cáo toán học: "Indecomposable tilings of the integers with exponentially long periods" potx
... indecomposable if and only its associated C1 array is minimal. (Connoisseurs may also note that the set of minimal C1 the electronic journal of combinatorics 12 (2005), #R36 6 a a a a a a a a a a a a a a a a a a a a a a a a z y x Figure ... A non-minimal inflate of a minimal cyclotomic array. It is quite easy to check that the inflate of a cyclotomic...
Ngày tải lên: 07/08/2014, 13:21
Báo cáo toán học: "Depth reduction of a class of Witten zeta functions" pdf
... ζ sl(4) (a, b, c, 0, 0, f ) can also be viewed as a Mordell-Tornheim sum with depth 3. The fact that every such sum can be expressed as a rational linear combination of products of single and double ... multiple zeta value of the form ζ sl(4) (a, b, c, d, 0 , f ) with a, b, c, d, f, ∈ N can be expressed as a rational linear combination of products of single and doub...
Ngày tải lên: 07/08/2014, 21:21
Báo cáo toán học: "Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover" pdf
... −D θ (G) − A θ (G). We call these sets of vertices the θ-partition classes of G. The Gallai-Edmonds Structure Theorem is usually stated in terms of the structure of maximum matchings of a graph with ... known that the matching polynomial of a graph G is equal to the charac- teristic polynomial of G if and only if G is a forest. To prove Theorem 3.3, the fol...
Ngày tải lên: 07/08/2014, 21:21