Báo cáo toán học: "On the failing cases of the Johnson bound for error-correcting codes" docx

... cleavage of the aromatic fluoroquinolone core for the first time. Hence, two decades after the emergence of the notion of the non- biodegradability of fluoroquinolones, fungal degradation of all ... in the lipids of E. coli (Goldfine 1982). Two decades after the emergence of the notion of the non-biodegradability of FQs, briefly reviewed by Wetzstein et...

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

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

... by w. The multiplication of A by  n i=1 1 1−t i and the extraction of the coefficient of t r 1 t r 2 ···t r n in the result corresponds at the set theoretic level to the concatenation of the signed ... used, these are sophisticated, and the problem serves as a useful study of these techniques, and the algebraic analysis gives partial information about the formulat...

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

... from the recursion (1) and the value of b at the seed. It seems reasonable that these sets must form a partition, since the descendants of any seed depend on the value of b at the seed, and the ... that we have not assumed anything about the value of b(2)). To- gether these determine the values b(n) for an infinite subsequence of the arguments of b. For exam...

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

... reasoning to the above, the probability that both these edges appear in the same member of D π is exactly h−2 r−2 h−3 r−3 . There are (h −1)(h −2)(h −3)/2 pairs of adjacent edges of the form (a i ,a j ), ... X-factor of a graph is a set of vertex-disjoint copies of X which cover all the vertices of the graph). Let F 1 be such a factor. We repeat the following proce...

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

... entries of a height function matrix for an ASM should be thought of as ofset from the entries of the ASM itself. If the entries of the ASM lie on vertices in the square grid, then the entries of the height ... H S ,forS even (odd). Then H S preserves 2 of the colorings of the edges of S and reverses the colors in the other 14. Figure 6 shows the effect...

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

... will meet each of the original sets. Proof of Lemma 1. If we can find a set of f (d, g) points that meets the convex hull of every subset of g|Q| of the elements of Q,itwillmeeteveryoneofourpolytopes. In ... contained description of the authors’ recent proof 1 of the Hadwiger-Debrunner (p, q)conjecture. The content of the proof below is almost the same as th...

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

... long-term visit at the Mathemat- ical Institute of Cologne University. I thank the staff of the institute and personally P. Bundschuh for the brilliant working atmosphere I had there. References [1] ... j  , where n =0, 1, 2, . the electronic journal of combinatorics 11 (2004), #R22 2 2 Very-well-poised preliminaries The right-hand side of (1) defines the so-called Lege...

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

... partition made up of the parts of π that are <N. In light of (11) we see that if N is a part of π an even number of times, then O(π  )=O(¯π  )andif N appears an odd number of times in π,thenO(¯π  )=N ... (29) One can then pass to (3) and (4) by means of a 3 φ 2 transformation [2, p.242, eq.(III.13)], and the proof of Theorem 1 is easiest using (3) and (4). the elec...

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

... Hence there must beapathoforderk − p + 2 joining x and y in graph G.  Theorem 9 For odd integers k ≥ 5 T  (n, C k )=w(n, k − 1), where k ≤ n ≤ 2k − 2. Proof. The last part of the thesis of Theorem ... facts which are often used in the paper. Definition 1 The circumference c(G) of a graph G is the length of its longest cycle. Definition 2 The girth of a graph G is the...

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