Báo cáo toán học: "vs Algebraic Characterizations of Completely Pseudo-Regular Codes" pps

... characterization of completely pseudo-regular codes in algebraic sense, which coincides with the one of Theorem 3.3. This proves the equivalence between combinatorial and algebraic approaches to completely pseudo-regular ... So, once proved, we speak indistinctly of one or another concept. Theorem 4.2 A se t of v ertices C ⊂ V of a graph Γ is a completely pseudo-regul...

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

... either a one vertex expansion of G or a vertex extension of G by a bipartite graph [toward showing that G  also satisfies (5.2)]. Suppose H is any induced subgraph of G  of odd order five or more, ... number of hamiltonian cycles]. If V (C) ⊆ V (G), then H is an induced subgraph of G and so has an even number of hamiltonian cycles. So suppose V (C) ⊆ V (G). If G  is a one vert...

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

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

... Schoof, R., Families of curves and weight distribution of codes, Bull.A.M.S., vol.32, 2 (1995),171-183 [12] Stepanov, S.A., Arithmetic of algebraic curves, New York, 1994 [13] Stichtenoth, H, Algebraic ... ‘safely’ be seen as a ‘random subset’ of F q or, equally, as the output of an experiment of ran- dom and independent selection of elements of F q , the probability of...

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

... numbers: 05A05, 05A15 A board B is a subset of [d] × [d](where[d]isdefinedtobe{1, 2, ,d})andtherook numbers r B k of a board are the number of subsets of B of size k such that no two elements have ... more elegant formula, as a corollary of more general reciprocity theorems. Here, fol- lowing a suggestion of Goldman, we provide a direct combinatorial proof of this new formula....

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

... isomorphism of Proposition 5.1 we transfer our probability distribution to the set of m–tuples of Young disgrams with total number of boxes equal to n. Then by (5.2) we see that the probability of an ... length of the longest increasing subsequence for signed permutations em- bedded into the symmetric group of odd order can also be interpreted in terms of rim hook tableaux, se...

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

... denote the number of times that π ∈ S m is contained in σ ∈ S n by ν(π, σ). If we divide this number by the total number of subsequences of σ of length m (for m ≤ n) we get the density of π in σ: d(π, ... the density of the permutation, since it removes no occurrences of π but adds some new ones, namely those in which the i th layer of π occurs in the layer a and the i +1 st l...

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

... formed. B specifies how often a representative vector of weight t is covered by the vectors in a given orbit of weight w. Orbits of weight w for which the corresponding row of B contains an entry ... indicates a new best result. The meaning of the annotations is given in the Key. The tables show the relative merits of the general algorithms in terms of the number of codewords g...

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

... purposes of proving that the game coloring number of Cartesian products is not bounded by a function of game coloring numbers of factor graphs. However the class of Cartesian products of stars ... the proof of this result more transparent, we introduce the so-called game of combinations which could also be of independent interest. At the end of this section we present some...

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

... representatives of g–orbits of edges. In other words, every pair of cycles of g of length k 1 , k 2 , with (k 1 , k 2 ) ∈ J, gives gcd(k 1 , k 2 ) distinct representatives. Since the number of cycles of ... of k–cycles in the representation of g as a product of disjoint cycles. Given a permutation g ∈ G, when we will speak of a “k–cycle of g” we will always mean a k–...

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