Báo cáo toán học: "Cyclic partitions of complete uniform hypergraphs" pptx

... follows. 3 Cyclic partitions of general complete hypergraphs By ˜ K n we denote the complete hyper gr aph on the set of vertices V n , i.e. the hypergraph with the set of edges consisting of all non ... the complete k -uniform hypergraph of order n, 1  k  n−1, i.e. the hypergraph with the set V n = {1, 2, , n} of vertices and the set  V n k  of edges. If there exist...

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

... properties of cyclic permu- tations of r. In Section 3, we consider more general cases. 2 Properties of cyclic permutations of a sequence In this section, we study pro perties of cyclic permutations of ... permutations of a sequence of vectors and uniformly partition sets of many new combinatorial structures. Based on the rightmost lowest point of a lattice path, Woan [24...

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

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

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

... from the beginning of this proof. Thus, in either case x is locally equivalent to y, and the theorem is proved. ✷ PROOFOFTHEOREM2. The proof below exactly follows the proof of Proposition 5.1 ... transversals of V are locally equivalent, and the distance between any two of them does not exceed 2n − 1. Some examples of thick subsets: one-element sets, cycles of size 3, subspaces o...

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

... examples of fixing sets of non-trivial finite groups are of the form {1, . . . , k } for some k. If the fixing set of every non-trivial finite group is of this form, then the computation of a fixing ... element of the stabilizer of S. This clearly requires at least ⌈ n−1 k+1 ⌉ vertices, so fix(Inf k (K n )) = ⌈ n−1 k+1 ⌉. It seems likely that the proof of Theorem 1 6 could extend...

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

... colors and suppose we have the complete set of orbits of θ on V (k) , each of the f orm A, A θ , A θ 2 , . . . . Within each of these orbits, color the elements of the form A θ s with color c i if ... two automorphisms of X is again an automorphism of X, and the composition of a q-antimorphism of X with an automorphism of X is a q- antimorphism of X. Since α 1,1  ≤ A...

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

... calculation of the character of S n on the homology of the order complex of L A col , s n and using a formula of Orlik & Solomon [10] we are able to describe the character of S n on the cohomology of ... appears in a generic fiber of a projection of the braid arrangement. The study of the intersection lattice of the arrangement leads to the definition of lattices of...

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

... simple proof of a nice formula for the means and covari- ances of the diagonal sums of a uniformly random boxed plane parition. An a × b × c boxed plane partition is an a × b grid of integers ... combinatorics 8 (2001), #N1 3 Diagonal Sums of Boxed Plane Partitions David B. Wilson Microsoft Research One Microsoft Way Redmond, WA 98052 dbwilson@microsoft.com Submitted: December 8,...

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

... goal of this paper is to complete the study of factorisation of balanced complete bipartite graphs K n,n into factors each of whose components are K p,q . This subject began with the study of star-factorisations ... undirected) graphs. An F -factor of G is a spanning subgraph of G whose components are all isomorphic to F .A (complete) F -factorisation of G is a decompositi...

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