Báo cáo toán học: "Random Subnetworks of Random Sorting Networks" pps

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

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

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

... number of orientations. If this problem is pursued based on the proof of this paper then a first step is finding an algorithm for generating the ideals of a poset in time proportional to the number of ... topological sort of the maximum directed subgraph of G corresponds to an acyclic orientation of G. Pruesse and Ruskey [1] showed that the prism of AO(G) is Hamiltonian in the c...

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

... first proof of (13) appears in [2]. It may be viewed as the first non- commutative extension of Euler’s evaluation of ζ(2n). Theorem 2 Let n be a positive integer, and let I denote the set of all ... identities of the form (17), then the number of (linearly independent) relations of this type can be computed via P´olya Theory (see, e.g., [8]) as the number of orbits in the actio...

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

... rational eigenvalues of the Laplacian (over any field of characteristic 0) of any simplicial complex are nonnegative. This fact follows from the positive semidefinitness of the Laplacian over . Proof of Bouc’s ... multiplicity of the irreducible E λ in the c-eigenspace of Λ E r equals the multiplicity of S λ in the c- eigenspace of L |λ|,r . Proof. Suppose |λ| =dimE. Then the...

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

... tree of p = 263498175 the electronic journal of combinatorics 9(2) (2003), #A1 10 [40] D. Zeilberger, A proof of Julian West’s conjecture that the number of two-stack- sortable permutations of ... of T(p) is a vertex labeled n, the largest entry of p.Ifa is the largest entry of p on the left of n,andb is the largest entry of p on the right of n, then the root will have t...

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

... be viewed as a generalization of the size of F . Define ex f (n, F ) to be the maximal value of e f (G)overallF -free graphs G of order n. This mimics the definition of the usual Tur´an function ... possible in the sense that both of these operations are necessary. The paper is organized as follows. We present two different proofs of Theorem 1. The first proof, in Section 3, goes vi...

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

...  n − δ 2 − δ + 1, where n is the order of D. Proof. Let D be the directed graph of order n obtained from the disjoint union of two copies H 1 and H 2 of the complete digraph K ( δ 2 ) and a ... Add arcs between the first δ − 1 vertices of P and H 1 such that each of the δ − 1 vertices of P has in-degree and out-degree equal to δ, and each vertex of H 1 is incident to at most o...

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

... → u ′ then the hole of u ′ is contained in the hole of u, with the vertices of the former a subset of the vertices of the latter. Therefore, every triangulation of the hole of u ′ can be extended ... triangulation of the hole of u. Lemma 3.2. The number of i-vints (i ≥ 3) that charge a fixed 3-v i nt is at most C i−1 − C i−2 , and this bound is tight in the worst case. The...

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