Báo cáo toán học: "On the combinatorial structure of arrangements of oriented pseudocircles" ppsx

... vertex. 2. The initial vertex of the next edge is v(j, ∓k). 3. Determine the direction of the next edge by the sign of the entry ∓k in list j and the direction of the preceding edge according to the ... combining the information about the direction of the first edge with the corresponding crossing yields a rule for the direction of the second edge. If...

Ngày tải lên: 07/08/2014, 08: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

... 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

... follows from Theorem 3.1. (b) The proof of this part of the theorem is similar to the proof of Theorem 3.1, part (b). We are forced to place λ 1 − α 1 1’s in the first row, and when placing the remaining | ¯ λ|−|¯α|−|β| ... rl(α), the reverse lexicographic filling of α, and add the labelled boxes of rl(α)totherowsof ˆ β according to the Add algorithm. The only labels...

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

... 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

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

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

Ngày tải lên: 05/08/2014, 15: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