Báo cáo toán học: "Minimal weight in union-closed families" pptx

... vertices) n-separating union-closed family of minimal weight. In the third section, we use Theorem 3 together with Reimer’s Theorem to obtain lower bounds on the weight of n-separating union-closed ... reduced to a unique separating union-closed family in this way. Such separating union-closed families will be the main object we study in this paper. Before proving anything ab...

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

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

... b 1 (mod 2 α 1 ). Since k is even, b 1 − 1 is relatively prime to 2 α 1 . Combining this with the relations discussed in the m odd case and applying the Chinese Remainder Theorem results in q, q  relatively ... main theorem for T containing only reflections, we call this the reflection main theorem. We then generalize to all T ∈ D n m . 3 Preliminaries and the Main Lemma Before proving the...

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

... main tool is an algebraic theorem by Alon called Combinatorial Nullstellensatz. Keywords: graph labelling, neighbour distinguishing total weighting, total list weighting, vertex colouring 1 Introduction Let ... Therefore mind(T G ) = min {mind(P G ), mind(R)} ≤ mind(P G ). In view of conjecture 1, we would be pleased if we could show that tmind(G) = 1 for each graph G. In other words, we...

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

... points, lines and flags) with |P| = v and |L| = b satisfying the following axioms: (1) each line is incident with k points; (2) each point is incident with r lines; (3) two distinct points are incident ... the configuration is realized with points and lines in the projective plane. The arrows indicate that the corresponding points are at in nity, together with the line through them. while th...

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

... vectors in (G 0 |G 0 ) are in the same connected component in F 01 . Proof. Let (u 0 | v 0 )and(u 1 | v 1 ) be any two distinct vertices in (G 0 |G 0 ). We show that there is a path in F 01 joining ... these families in a future paper. The computational complexity of finding robust solutions, inspired by research in [2], appears in [4]. Organization of the paper: In Section 2...

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

... that in Lemma 4, below, we need to use three extra columns to ‘connect’ two corner-avoiding minimal percolating sets. The next lemma explains our interest in corner-avoiding minimal percolating ... corner-avoiding minimal percolating set. Then, using Lemma 5, we put about √ m of these together to form a long thin minimal percolating set with the right density. Finally we shall use Lemma 6...

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

... distinction between minimally detectable change and minimally important change. Appreciating and acknowledging this distinction enhances the interpretation of change scores of a measurement instrument. Comparison ... in health-related quality of life. J Clin Epidemiol 1999, 52:861-873. 11. Wyrwich KW, Nienaber NA, Tierney WM, Wolinsky FD: Linking clinical relevance and statistical significa...

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

... et al. [8] and references therein. As main improvements in this article with regard to previous works in the literature we can cite the following: (1) The deviating argument τ depends at each ... solution of (1) in Y if x ∗ ≤ x (respectively, x ∗ ≥ x) for any other solution x ∈ Y . Notice that the least solution in a subset Y is a minimal solution in Y , but the converse is false i...

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

... giving instructions. T23 felt that a persistence in doing routine activities in Chinese might result in teacher-fronted lessons in which individual students might only be speaking and practicing ... Shih-Chang Hsin. 2011. The development of TCSL teacher training in Taiwan . In Teaching and learning Chinese in global contexts, eds. Linda Tsung and Ken Cruickshank, 165-180. Co...

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