Báo cáo toán học: "Aperiodic non-isomorphic lattices with equivalent percolation and random-cluster models" docx

... it: a similarity degree measure, a string editing distance (Wagner and Fischer, 1974) and a tree editing distance 1 (Zhang and Shasha, 1989). Section 4 discusses and evaluates these methods and ... paral- lelisms with respect to those appearing in the gcd of the other pairs. Percentages were then rescaled from 0 to 1, in order to emphasize differences 286 Recognizing Textu...

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

... alt =""

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

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

... alt =""

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

... alt =""

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

... alt =""

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

... alt =""

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

... alt =""

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

... alt =""

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

... permutation π n Recognizing Group Languages with OBDDs 371 For a fixed n,anordering of the variables x 1 ,x 2 , ,x n is a permutation π on the set {1, 2, ,n}, i.e., an element of the symmetric group S n .Wenowde- fine ... the OBDD computes the Boolean function. Fig. 1. An OBDD with the permutation π(1) =2, π(2) =4, π(3) =3, π(4) =1 Recognizing Group Languages with OBDDs 37...

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

... ✷ Summarizing, we now know all extremal graphs, G with f (G)=2δ +1. The connected extremal graphs are those given in Theorem 3 along with the trivial ones with only 2δ + 1 vertices. We noticed that ... the sense that there exist graphs of minimum degree δ with no longer paths. Our purpose in this article is to characterize all such extremal graphs. For a graph G with...

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

... A Note on Sparse Random Graphs and Cover Graphs ∗ Tom Bohman † Alan Frieze ‡ Mikl´os Ruszinko Đ Lubos Thoma ả Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, ... a constant κ<2/3, then it outputs a cover graph whp. Note that the output graph will have whp girth equal to 4. On a related note we point to [8] which surveys constructions of no...

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

... of u and v induces an isomorphism of H as a plane hypergraph. the electronic journal of combinatorics 17 (2010), #R48 4 Aperiodic non-isomorphic lattices with equivalent percolation and random-cluster ... Bollob´as, B., and Riordan, O. (2008) Percolation o n dual lattices with k-fold sym- metry. Random Structures and Algorithms 32 463–472. [4] Fortuin, C. M., and...

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

... paper we introduce multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomi- als is defined in terms of a deletion-contraction-extraction ... Polynomial for Special Classes of Hypergraphs Here we study the multivariate chromatic polynomials of complete r-uniform hypergraphs, complete r-unifo...

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