Báo cáo toán học: " Generating of Minimal Unavoidable Sets" pps

... during the past decade, the extracellular deposits of beta- amyloid [A ] peptides forming plaques and the intracellular neurofibrillary tangles have been regarded as the major histopathological ... overnight incubation with a primary antibody (Abcam, Cambridge, MA, USA) was performed for the specific binding to A peptides on the HeLa cells. - 2 - Abstract The existence...

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

... direct consequence of Theorem 2.1 we obtain Consequence 2.1. Applying transformation L and R on minimal unavoidable sets leads to minimal unavoidable sets again. The proofs of the following lemmas ... a minimal unavoidable set. If Y can be obtained from X by applying first some transformation RC or LC, and then some transformation Generating of Minimal Unavoidable Sets...

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

... expressed as a rational linear combination of products of single and double Euler sums of weight n. We define the weight of a product of Euler sums as the sum of the arguments appearing in the product. ... theorem, where we treat the triple sums as unknowns. Thus we then know that there is an evaluation of the triple sums in terms of rational linear combinations of...

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

... problem of generating a random element of J(P) for an arbitrary finite poset P, we will have solved the problem of generating random d-factors of bipartite planar graphs, the problem of generating random ... q k of being picked. We might try to choose q so as to maximize the collective probability of the elements of rank k, but even using this optimal q we might h...

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

... = k ≥ 2andlets =(s i ) be an infinite rational Beatty sequence with modulus P/Q. (i) The Beatty sequence S is isomorphic to one of the Q finite Beatty sequences of the form  i P Q + T Q  :0≤ ... Since finite Beatty sequences can be regarded as a generalisation of finite arithmetic progressions, their sumsets are of special interest. In this paper, I shall give som...

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

... u. The proof of our theorem now follows from a sequence of lemmas. The first lemma shows in passing that small subpartitions of S(m) have no corners at all. Lemma 2. Let (k, ) be a corner of u ∈ ... following ad hoc definition. the electronic journal of combinatorics 11(2) (2005), #N5 3 Reconstruction of Partitions Oliver Pretzel Department of Mathematics, Imperial College...

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

... separates all the sets of at most  vertices of G.The dedicated terminology [12] for such codes is (1, ≤ ) -identifying codes. ThesetsI(X)are said to be the identifying sets of the corresponding ... sets of at most  vertices of G,andifalltheI(X, C)’s are nonempty then we say that C covers the sets of at most  vertices of G.WesaythatC is a code identifying set...

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

... Univ. Press, 1997). the electronic journal of combinatorics 12 (2005), #R56 5 Asymptotics of generating the symmetric and alternating groups John D. Dixon School of Mathematics and Statistics Carleton ... (x, y)ofelementsfromA n (respectively, S n ) such that the parts of Π are the orbits of the group x, y generated by x and y. Similarly let g A (Π) and g...

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

... = 3 n−1 +1 2 ; the electronic journal of combinatorics 13 (2006), #R31 3 Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees Mark Lipson ∗ Harvard University Department of Mathematics Cambridge, ... sites: the leftmost k sites and the site immediately to the left of π i . One child is of form 1A, one is of form 2A, and the others are...

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

... finitely many such values of x. the electronic journal of combinatorics 15 (2008), #R89 2 Asymptotics of coefficients of multivariate generating functions: improvements for smooth points Alexander ... coefficients F β as β → ∞ for large classes of series that arise often in applications. In this article we further their program of asymptotics of coefficients of...

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

... the generated bracketing covers. the electronic journal of combinatorics 15 (2008), #R95 2 Construction of Minimal Bracketing Covers for Rectangles Michael Gnewuch Department of Computer Science, ... covers of C d of cardi- nality Λ to construct δ -bracketing covers of R d of cardinality at most Λ 2 (cf. [11, Lemma 1.18]); that is why we can restrict ourselves...

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

... be the permutation corresponding to the transposed of B. We start with A 0,0 . Let A x,z be the matrix we have after k − 1 steps. Let the first row of A x,z be row number r and the first column of ... first column of A x,z be column number s of the original A 0,0 . Let the number of erased columns j such that j < p r be t k and the number the electronic...

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

... (7) the electronic journal of combinatorics 17 (2010), #R1 3 Asymptotics of Some Convolutional Recurrences Edward A. Bender ∗ Department of Mathematics University of California, San Diego La ... a product of the r eciprocal of binomial coefficients, which satisfies the conditions of Theorems 1 and 2. A more general case of interest is when f(n, k) takes the fo rm of the pr...

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

... (11) 3 Enumeration of m-tuples of Permutations More generally, we may consider the m-tuples of permutations of S n with exactly k occurrences of “ R m ”. Denote by D(n, k) the number of such multiple ... electronic journal of combinatorics 17 (2010), #R131 6 Enumeration of Restricted Permutation Triples Xiaojing Chen School of Mathematics and Computational Science China...

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

... graph P (n) of order n constructed in the proof of Lemma 4.2 is only defined for n ≥ 12 . Next we consider the existence of k-traceable graphs of order k + 1. Skupien [12] calls a graph of order ... achment in C, i.e., A = N C (H 1 ). Let U be the set of successors of vertices of A on C, and let W be the set of predecessors of vertices of A on C. We first note that U and...

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