A diametric theorem for edges. R. Ahlswede and L.H. Khachatrian
|
|
- Leonard Henderson
- 5 years ago
- Views:
Transcription
1 A diametric theorem for edges R. Ahlswede and L.H. Khachatrian 1
2 1 Introduction Whereas there are vertex and edge isoperimetric theorems it went unsaid that diametric theorems are vertex diametric theorems. We complete the story by introducing edge diametric theorems into combinatorial extremal theory. Before we state our new edge diametric problem and its solution we sketch some key steps in the development of extremal set theory. We keep the notation of earlier papers. N denotes the set of positive integers and for i,j N, i < j, the set {i,j + 1,...,j} is abbreviated as [i,j]. We write [n] for [1,n]. For k,n N, k n, we set [n] = { F : F [1,n] }, A system of sets A [n] is called t intersecting, if ( ) [n] = {F [n] : F = k}. k A 1 A t for all A 1,A A. I(n,t) denotes the set of all such systems and we write I(n) for t = 1. We denote by I(n,k,t) the set of all k uniform t intersecting systems, that is, { ( )} [n] I(n,k,t) = A I(n,t) : A. k The investigation of the function M(n,t) = max A and M(n,k,t) = max A, 1 t k n, A I(n,t) A I(n,k,t) and the structure of maximal systems was initiated by Erdös, Ko, and Rado [6]. We also introduce the sets and K i (n,t) = { A [n] : A [t + i] t + i }, 0 i n t F i (n,k,t) = { F We also use the abbreviation F i = F i (n,k,t). (1.1) ( ) } [n] : F [t + i] t + i, 0 i n t k. (1.) There is a well known result of Katona, which determines the exact value of M(n,t) for all n,t Theorem Ka [9]. { K n t (n,t) if (n t) M(n,t) = (n,t) if (n t). K n t 1
3 Moreover, in the case (n t),t, K n t(n,t) is the unique optimal configuration, while in the case (n t),t, K n t 1(n,t) is the unique solution up to permutations of the ground set [n]. The proof of this Theorem in [9] is essentially based on a result concerning shadows of t intersecting systems. Recently we proved a long standing conjecture concerning the function M(n,k,t). Theorem AK []. For 1 t k n with (i) (k t + 1) ( ) ( ) + t 1 r+1 < n < (k t + 1) + t 1 r for some r N {0}, we have M(n,k,t) = F r and F r is up to permutations the unique optimum (by concention t 1 r for r = 0). = (ii) (k t + 1) ( + t 1 r+1) = n for r N {0} we have M(n,k,t) = F r = F r+1 and an optimal system equals up to permutations either F r or F r+1. For the proof we introduced the seemingly basic notion of what we called generating sets. In [] we presented a new compression method, which we called pushing pulling method and which led to new proofs for both, Theorem Ka and Theorem AK. The proof of our new result presented below is based on this method. There is a natural transition from [n] to {0, 1} n the set of binary words of length n: any set A [n] can be represented as word a n = (a 1,...,a n ) {0, 1} n, where { 1, if i A a i = 0, if i / A and conversely. The Hamming distance between a n = (a 1,...,a n ),b n = (b 1,...,b n ) {0, 1} n is defined as follows: d H (a n,b n ) = { j [n] : a j b j }. We say that A {0, 1} n has a diameter d if diam(a) max a n,b n A d H(a n,b n ) = d. D(n,d) denotes the set of all such systems. 3
4 Later, in order to avoid additional notation, we will denote (0, 1) images of the sets defined in (1.1) and (1.) again by K i (n,t) and F i (n,k,t). The n dimensional hypercube Q n is a graph with vertex set V(Q n ) = {0, 1} n and edge set E(Q n ) = { {a n,b n } : d(a n,b n ) = 1 }. Clearly, any A {0, 1} n can be embedded into graph Q n : V(A) = A (vertex set), E(A) = { (a n,b n ) : a n,b n A,d(a n,b n ) = 1 } (edge set). In the set theoretical language, we connect by an edge A 1,A [n], if A 1 A = 1 (symmetric difference). Two naturally arising functions concerning diametric problems are: V (n,d) = max A (vertex diametric function) A D(n,d) and E(n,d) = max E(A) (edge diametric function). A D(n,d) It seems that the definition of the second function is new. There is a well known result of Kleitman, which determines the exact value of V (n,d) for all n,d. Theorem Kl [10]. d ( n ) i=0 i, if d is even V (n,d) = d 1 ( n ) i=0 i, if d is odd. This result and Theorem Ka imply M(n,n d) = V (n,d). Actually it was shown in [1] that the two theorems can be easily derived from each other by passing through upsets. In connection with Theorem Kl we mention that recently we solved the problem of determination of V (n,d) (optimal anticodes) for nonbinary alphabets [3]. Now we present our new result. At first recall the definition of the sets K i (n,t) and define the set H(n) = { (a 1,...,a n ) {0, 1} n : a 1 = 1 }. Theorem. E ( H(n) ), if d = n 1 E(n,d) = E ( K d(n,n d) ), if d n and d E ( K d 1(n,n d) ), if d n and d. Remark: In addition to the optimal configuration in the Theorem we have for the case d = n, d also the optimal configuration K d (n,n d). Actually we can prove that all other optimal configurations can be obtained by permutations of the ground set [n] and of the alphabets in the components.
5 Reduction to upsets and left compressed sets We start with well known concepts. Definition.1. For any B [n] we define the upset U(B) = {B [n] : B B }. More generally, for B [n] we define the upset U(B) = B B U(B). For any C {0, 1} n the upset is defined analogously with respect to images. For any A {0, 1} n, any A = (a 1,...,a n ) A and 1 j n we define the transformation { (a 1,...,a j 1, 1,a j+1,...,a n ), if this is not an element of A T j (A) = A, otherwise and T j (A) = { T j (A) : A A }. Repeated applications of these transformations yield after finitely many steps an A {0, 1} n, for which T j (A ) = A for all 1 j n. Clearly, this set is an upset. For any A {0, 1} n the transformation T j has the following important properties, which can be easily shown: (i) It keeps the cardinality unchanged: T j (A) = A. (ii) It does not increase the diameter: diam ( T j (A) ) diam(a). (.1) (iii) It does not decrease the number of edges: E ( T j (A) ) E(A). Let UD(n,d) be the set of all upsets in D(n,d). We have E(n,d) = max E(A) = max E(A). (.) A D(n,d) A UD(n,d) On the other hand, if A {0, 1} n is an upset and has diameter d, then any A 1,A A have at least (n d) componentwise common 1 s. 5
6 Hence E(n,d) = max A D(n,d) E(A) = max E(A) = A UD(n,d) max E(A) (.3) A UI(n,n d) where the last formula concerns set systems and UI(n,n d) denotes the set of all (n d) intersecting systems which are also upsets. We note that clearly I(n,n d) D(n,d) holds. (.) Another well known notion is left compressedness. Definition.. For any B [n], any B B and 1 i,j n we set { {i} ( B {j} ), if i / B,j B, {i} ( B {j} ) / B S ij (B) = B, otherwise and S ij (B) = { S ij (B) : B B }. Definition.3. B [n] is said to be left compressed or stable if S ij (B) = B for all 1 i j n. It can be easily shown that we have the same properties with respect to transformation S ij as for T j in (.1). Therefore, using (.3) one gets E(n,d) = max E(A), (.5) A LUI(n,n d) where LUI(n,n d) is the set of all left compressed sets from UI(n,n d). Definition.. For a set A [n] and 1 i,j n we denote by A i,j the set which is obtained from the set A by exchanging the coordinates i,j in every A A. Let A LUI(n,t) and l < n be the largest integer, such that A is invariant under exchange operations in [1,l], i.e. A = A i,j for all 1 i,j l but A = A i,l+1 for some 1 i l. Moreover let A = {A A : A i,l+1 / A for some 1 i l}. (.6) We need the following simple, but important 6
7 Lemma 1. [] Let A and A be sets, which are defined just above and for A,A i A introduce the sets B = A [1,l], B i = A i [1,l], C = A [l+1,n], and C i = A i [l+1,n]. Then (i) l + 1 / A for all A A. (ii) Let A A and j A, 1 j l, then we have A j,l+1 / A. (iii) Let A A, then we have B C A for every B [1,l] with B = B. (iv) Let A A and D A A, then we have A i,l+1 D t for all 1 i l. (v) Let A 1,A A and B 1 + B l + t, then we have A 1 A t + 1. (vi) Let A A, then for any B [1,l] with B < B and C C we have (B C ) / A. (vii) Let A A, then for any C C, (B C ) A implies (B C ) A. Proof: The statement immediately follows from the left compressedness of A, the definition of A, and the maximality of l. The next obvious result shows that the counting of the edges for upsets can be done via cardinalities of the elements. Lemma. Let A [n] be an upset. Then E(A) = A A(n A ). We also need the following result of Harper. Theorem H. [7] (a special case) max E(A) is assumed at the set H(n) = { (a 1,...,a n ) {0, 1} n : a 1 = 1 }, A {0,1} n, A = n 1 that is, max E(A) = E( H(n) ). A {0,1} n, A = n 1 7
8 3 An auxiliary result Lemma 3. Let S [m] have the properties: (i) S is complement closed, that is A S A S, (ii) S is convex, i.e. A,C S and A B C B S. Then there exists an S S such that S I(m) and (m A ) m 1 (m A ) = m 1 S. (3.1) m A S A S Moreover, if S [m], then there exists an S S, S I(m) for which strict inequality in (3.1) holds. Proof: At first we notice that the identity in (3.1) follows from property (i). In the case S = [m], by taking S = {A [m] : 1 A} we have S I(m), S = S = m 1 and easily get (3.1) with equality in this case. Let now S [m], let B S be any element with minimal cardinality, and let i B. We consider the following partition of S: S = S 1. S. S 3. S, where S 1 = { A S : i A and ( A {i} ) S } S = { A S : i / A and ( A {i} ) S } S 3 = { A S : i A and ( A {i} ) / S } S = { A S : i / A and ( A {i} ) / S }. Clearly S 1 = S, S 3 = S and S 3, since i B S and B has minimal cardinality. It is easily seen that S 1 = {A : A S 1 } = S and S 3 = {A : A S 3 } = S. It is also easily verified that for every A S and A S S 3, A A holds. Hence, (S 1 S ), (S 1 S 3 ) I(m). Since S 3 = S, we get (m A ) = m S 3 + S. A S 3 S Hence, { } max (m A ), (m A ) A S 3 A S m ( S 3 + S ). (3.) On the other hand, by construction of S 1, S, and property S 1 = S we have m ( S 1 + S ) = (m A ) + (m A ) = (m A ) + S 1 + S. A S 1 A S A S 1 8
9 Hence A S 1 (m A ) = (m 1) ( S 1 + S ). (3.3) Therefore, from (3.), (3.3) we get { } max (m A ), (m A ) m ( S 3 + S )+ A S 1 S 3 A S 1 S + m 1 ( S 1 + S ) > m 1 ( S 1 + S + S 3 + S ) = m 1 S. Corollary. Let S [m] be defined as in Lemma 3 and let (3.1) hold for S S, S I(m), S = S. Then for any c R (m A + c) m + c 1 (m + c) A S (m A + c). (3.) A S Proof: We just notice that (3.) follows from (3.1) and the identities m + c 1 (m + c) A S = m + c 1 (m A + c) = m + c 1 (m + c) S = m 1 S + c S ( m S + c S ) and (m A + c) = (m A ) + c S. A S A S 9
10 Main step in the proof of the Theorem Let A D(n,d) be a set with E(A) = E(n,d). According to (.5) we can assume that A LUI(n,t), where t = n d. The main auxiliary result, which essentially proves the Theorem, is the following Lemma. Let A be the set, which is described just above. Then necessarily A is invariant under exchange operations in (i) [1,n], if d and d n 3 (ii) [1,n ], if d and d = n (.1) (iii) [1,n 1], if d and d n. Proof: Let l be the largest integer such that A i,j = A for all 1 i,j l. Assume in the opposite to (.1) l < n 1, (.) where n 1 {n,n 1,n} depends on the case. We are going to show that, under assumption (.) there exists a B I(n,t) (and hence B D(n,d)) with E(B) > E(A), which is a contradiction. For this we start with a partition A = l A(i), of the non empty set A defined in i=1 (.6), where A(i) = { A A : A [1,l] = i }. Of course, some of the A(i) s can be empty. In fact it follows from Lemma 1 (iv), (v) that A(i) = for all 1 i < t. We will show that all the A(i) s are empty. Suppose that A(i) for some i,t i l. We remind the reader that l + 1 / A for all A A (see Lemma 1 (i)). From Lemma 1 (iii) we know that ( ) l A(i) = A (i), (.3) i where A (i) = { A [l +,n] : A A(i) }. (.) Let us note that in the case n = l + 1 we have A (i) = and A (i) = 1. Now we consider the set Clearly B(i) = { B : B [1,l] = i 1,l + 1 B, ( B [l +,n] ) A (i) }. B(i) = and B(i) A = by Lemma 1 (ii). ( ) l A (i) (.5) i 1 10
11 With A(i) and B(i) we consider also the sets A(l + t i) and B(l + t i). Similar to (.3), (.5) we have ( ) l A(l + t i) = A (l + t i) l + t i ( ) l B(l + t i) = A (l + t i). (.6) l + t i 1 We distinguish two cases: a) i l + t i, b) i = l + t i. Case a): i l + t i From Lemma 1 (v) it follows that for B B(i), A A(j) with i+j B A t holds. Hence using this and Lemma 1 (iv) we have H 1 = (( A A( i) ) B(i) ) I(n,t) and H = (( A A(i) ) B( i) ) I(n,t). Let us show that which will be a contradiction. max { E(H 1 ), E(H ) } > E(A) = E(n,d), (.7) Using Lemma 1 (vi), (vii) one can easily show that the sets H 1, H, ( A A(j) ) are all upsets. Therefore, we have (by Lemma ) E(A) = E ( A A(l + t i) ) + (n A ) = E ( A A(i) ) + (n A ) E(H 1 ) = E ( A A(l + t i) ) + E(H ) = E ( A A(i) ) + A B( i) A A( i) A B(i) A A(i) (n A ) (.8) (n A ). Hence negation of (.7) is A A( i) A A(i) (n A ) A B(i) (n A ) A B( i) (n A ) (n A ). (.9) Since we have assumed A(i), then clearly A(l + t i) as well, because otherwise the first inequality of (.9) is false. 11
12 Using properties of the sets A(i), B(i) (see also (.3), (.5), (.6)) we can write (.9) in the form ( ) l ( ) l (n l t + i C ) (n i D ) l + t i i 1 ( ) l i D A (i) C A ( i) ( ) l (n i D ) l + t i 1 C A ( i) D A (i) (n l t + i C ). (.10) However (.10) implies (l i + 1)(i + 1 t) (l + t i)i, which is false, because t and consequently i > i + 1 t, l + t i > l i + 1. Hence A(i) = for all i l + t i. Case b): i = l + t i or i =. Here necessarily (l + t) and therefore by assumption (.) we have in (.1) l n in the case (i), l n in the case (ii), l n 3 in the case (iii). (.11) Recalling (.3) and (.) we have ( ) l + t A = ( ) l ( ) l + t A (.1) and any A A ( ). can be written in the form A = B C, where B = ( A [1,l] ) is any element of ( [l] ) ( ) ( ), C = A [l +,n A. We remind the reader again that l + 1 / A for all A A(i) A. Now we consider any element A = B. C, where B ( [l] ), C C [l +,n] and C A ( ). Of course, A A, since A is an upset and (B C) A A, (B C) (B C ). It is also clear by definition that, if A A, then A A ( ). Using Lemma 1 (iv) we can say more: A = B C A ( ) if and only if there is a C A ( ) with C C =, and hence with every C A ( ) ( ) ( ) we have also C = [l +,n] C A. Moreover, it is easily seen that A ( ) is a convex set. 1
13 Therefore A ( ) has the properties described ( in Lemma 3 and we can apply Lemma 3 and the Corollary to get an intersecting set A ) ( ) 1 A for which (3.3) holds: (m D + c) m + c 1 (m + c) D A 1( ) for m = n l 1 and any constant c. D A ( ) (m D + c) (.13) Now we denote by { B 1 = B : B [1,l] = l + t 1,l + 1 B, ( B [l +,n] ) ( )} l + t A 1 ( ) { ( ) l + t l + t A 1 = A A : ( A [l +,n] ) ( )} l + t A 1 (.1) and consider the following competitor of the set A: (( ( )) l + t H 3 = A A It is easily seen that H 3 I(n,t). A 1 ( l + t We are going to show (under assumption (.11)) that ) B 1 ). E(H 3 ) > E(A), (.15) which will be a contradiction. It is easily verified that both, H 3 and ( A A ( )), are upsets. Therefore, by Lemma we can write ( )) E(A) = l + t (A E A + (n A ) ( )) E(H 3 ) = l + t (A E A + Hence negation of (.15) is A A( ) (n A ) which can be written in the form (see (.1), (.13)) A A( ) A A 1( ) B 1 (n A ). A A 1( ) B 1 (n A ), 13
14 ( ) l D A ( ) ( ) l + 1 = and this is equivalent to (n D ) D A 1( ) l t + (l + 1) (n D ), D A ( ) (( ) ( )) l l + 1 (n D ) D A 1( ) However (.13) for m = n l 1, c = l t+ and (.16) imply which is false, since t and (.11) holds by assumption. D A 1( ) (n D ) (n D ). (.16) n t n t + 1 l t + l + 1, (.17) 5 Final step in the proof of the Theorem Let A D(n,d) be a set with E(A) = E(n,d). Of course, we can assume that A is maximal, that is A {A} / D(n,d) for all A / A. According to (.5), as in Lemma, we can also assume that A LU I(n, n d). In the case d = n 1, we just notice that any maximal set B D(n,n 1) has cardinality B = n 1. Now the statement E(n,n 1) = E ( H(n) ) immediately follows from Theorem H. In the case d, d n 3 we get from Lemma (i): A n d for all A A, since A is invariant in [1,n] and at the same time A I(n,n d). This implies A K d(n, n d) D(n, d) and by maximality of A we get A = K d(n,n d). Now we consider the case d, d = n. Looking at the proof of Lemma (ii) we see that in (.17) for t = n d =, l = n we have an equality, which means that Lemma (ii) can be slightly changed to (ii)* If d and d = n, then there exists an optimal set which is invariant in [1,n]. Therefore, in this case again we have E(n,d) = E ( K d(n,n d) ). 1
15 We verify (for d, d = n ) that E ( K d (n,n d) ) = E ( K d(n,n d) ) and hence K d (n,n d) is the second optimal configuration in this case (see the remark after the formulation of the Theorem). Finally, the case d, d n follows from Lemma (iii) by similar arguments. 6 References [1 ] R. Ahlswede and G. Katona, Contributions to the geometry of Hamming Spaces, Discrete Math. 17, 1, [ ] R. Ahlswede and L.H. Khachatrian, The complete intersection theorem for systems of finite sets, European J. Combin. 18, , [3 ] R. Ahlswede and L.H. Khachartian, The diametric theorem in Hamming Spaces optimal anticodes, Preprint , SFB 33 Diskrete Strukturen in der Mathematik, Universit at Bielefeld, Proceedings First INTAS International Seminar on Coding Theory and Combinatorics 1996, Thahkadzor, Armenia, 1 19, 6 11 October 1996; to appear in Advances in Applied Mathematics. [ ] R. Ahlswede and L.H. Khachatrian, A pushing pulling method: new proofs of intersection theorems, Preprint 97 03, SFB 33 Diskrete Strukturen in der Mathematik, Universit at Bielefeld, submitted to Combinatorica. [5 ] K. Engel, Sperner Theory, Encyclopedia of Math. and its Applications, Cambridge Univ. Press, [6 ] P. Erdös, Chao Ko and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford, 1, , [7 ] L.H. Harper, Optimal assignment of numbers to vertices, J. Soc. Industr. Appl. Math. 1(1), , 196. [8 ] L.H. Harper, Optimal numberings and isoperimetric problems on graphs, J. Combin. Theory 1, , [9 ] G. Katona, Intersection theorems for systems of finite sets, Acta Math. Acad. Sci. Hungar. 15, , 196. [10 ] D.J. Kleitman, On a combinatorial conjecture of Erdös, J. Combin. Theory 1, 09 1, [11 ] H.H. Lindsey, Assignment of numbers to vertices, Amer. Math. Monthly 71, ,
The edge-diametric theorem in Hamming spaces
Discrete Applied Mathematics 56 2008 50 57 www.elsevier.com/locate/dam The edge-diametric theorem in Hamming spaces Christian Bey Otto-von-Guericke-Universität Magdeburg, Institut für Algebra und Geometrie,
More informationThe Complete Intersection Theorem for Systems of Finite Sets
Europ. J. Combinatorics (1997) 18, 125 136 The Complete Intersection Theorem for Systems of Finite Sets R UDOLF A HLSWEDE AND L EVON H. K HACHATRIAN 1. H ISTORIAL B ACKGROUND AND THE N EW T HEOREM We are
More informationThe Intersection Theorem for Direct Products
Europ. J. Combinatorics 1998 19, 649 661 Article No. ej9803 The Intersection Theorem for Direct Products R. AHLSWEDE, H.AYDINIAN AND L. H. KHACHATRIAN c 1998 Academic Press 1. INTRODUCTION Before we state
More informationEdge Isoperimetric Theorems for Integer Point Arrays
Edge Isoperimetric Theorems for Integer Point Arrays R. Ahlswede, S.L. Bezrukov Universität Bielefeld, Fakultät für Mathematik Postfach 100131, 33501 Bielefeld, Germany Abstract We consider subsets of
More informationThe maximum product of sizes of cross-t-intersecting uniform families
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 60(1 (2014, Pages 69 78 The maximum product of sizes of cross-t-intersecting uniform families Peter Borg Department of Mathematics University of Malta Malta
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More informationA Hilton-Milner-type theorem and an intersection conjecture for signed sets
A Hilton-Milner-type theorem and an intersection conjecture for signed sets Peter Borg Department of Mathematics, University of Malta Msida MSD 2080, Malta p.borg.02@cantab.net Abstract A family A of sets
More information1 The Erdős Ko Rado Theorem
1 The Erdős Ko Rado Theorem A family of subsets of a set is intersecting if any two elements of the family have at least one element in common It is easy to find small intersecting families; the basic
More informationLinear independence, a unifying approach to shadow theorems
Linear independence, a unifying approach to shadow theorems by Peter Frankl, Rényi Institute, Budapest, Hungary Abstract The intersection shadow theorem of Katona is an important tool in extremal set theory.
More informationNon-trivial intersecting uniform sub-families of hereditary families
Non-trivial intersecting uniform sub-families of hereditary families Peter Borg Department of Mathematics, University of Malta, Msida MSD 2080, Malta p.borg.02@cantab.net April 4, 2013 Abstract For a family
More informationOn primitive sets of squarefree integers
On primitive sets of suarefree integers R. Ahlswede and L. Khachatrian Fakultät für Mathematik Universität Bielefeld Postfach 003 3350 Bielefeld and A. Sárközy * Eötvös Loránd University Department of
More informationErdős-Ko-Rado theorems on the weak Bruhat lattice
Erdős-Ko-Rado theorems on the weak Bruhat lattice Susanna Fishel, Glenn Hurlbert, Vikram Kamat, Karen Meagher December 14, 2018 Abstract Let L = (X, ) be a lattice. For P X we say that P is t-intersecting
More informationMore complete intersection theorems
More complete intersection theorems Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationTwo Problems in Extremal Set Theory
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Papers in Mathematics Mathematics, Department of April 2007 Two Problems in
More informationDAVID ELLIS AND BHARGAV NARAYANAN
ON SYMMETRIC 3-WISE INTERSECTING FAMILIES DAVID ELLIS AND BHARGAV NARAYANAN Abstract. A family of sets is said to be symmetric if its automorphism group is transitive, and 3-wise intersecting if any three
More informationAlmost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets
Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets Dániel Gerbner a Nathan Lemons b Cory Palmer a Balázs Patkós a, Vajk Szécsi b a Hungarian Academy of Sciences, Alfréd Rényi Institute
More informationCombinatorial Batch Codes and Transversal Matroids
Combinatorial Batch Codes and Transversal Matroids Richard A. Brualdi, Kathleen P. Kiernan, Seth A. Meyer, Michael W. Schroeder Department of Mathematics University of Wisconsin Madison, WI 53706 {brualdi,kiernan,smeyer,schroede}@math.wisc.edu
More informationA Diametric Theorem for Edges
Journal of Combinatorial Theory, Series A 92, 1-16 (2000) 111 doi: 1 O. 1006/jcta. 1 999.3009, available online at htlp://www.idealibrary.com on IDE J: l A Diametric Theorem for Edges R. Ahlswede and L.
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationarxiv: v3 [math.co] 23 Jun 2008
BOUNDING MULTIPLICATIVE ENERGY BY THE SUMSET arxiv:0806.1040v3 [math.co] 23 Jun 2008 Abstract. We prove that the sumset or the productset of any finite set of real numbers, A, is at least A 4/3 ε, improving
More informationProof of a Conjecture of Erdős on triangles in set-systems
Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,
More informationMultiply Erdős-Ko-Rado Theorem
arxiv:1712.09942v1 [math.co] 28 Dec 2017 Multiply Erdős-Ko-Rado Theorem Carl Feghali Department of Informatics, University of Bergen, Bergen, Norway feghali.carl@gmail.com December 29, 2017 Abstract A
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationIntersecting integer partitions
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 66(2) (2016), Pages 265 275 Intersecting integer partitions Peter Borg Department of Mathematics University of Malta Malta peter.borg@um.edu.mt Abstract If
More informationCross-Intersecting Sets of Vectors
Cross-Intersecting Sets of Vectors János Pach Gábor Tardos Abstract Given a sequence of positive integers p = (p 1,..., p n ), let S p denote the set of all sequences of positive integers x = (x 1,...,
More informationRegular bipartite graphs and intersecting families
Journal of Combinatorial Theory, Series A 155 (2018 180 189 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series A wwwelseviercom/locate/jcta Regular bipartite graphs and intersecting
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationThe Erdős-Hajnal hypergraph Ramsey problem
The Erdős-Hajnal hypergraph Ramsey problem Dhruv Mubayi Andrew Suk February 28, 2016 Abstract Given integers 2 t k +1 n, let g k (t, n) be the minimum N such that every red/blue coloring of the k-subsets
More informationForbidding complete hypergraphs as traces
Forbidding complete hypergraphs as traces Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Illinois Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics
More informationFamilies that remain k-sperner even after omitting an element of their ground set
Families that remain k-sperner even after omitting an element of their ground set Balázs Patkós Submitted: Jul 12, 2012; Accepted: Feb 4, 2013; Published: Feb 12, 2013 Mathematics Subject Classifications:
More informationAn Erdős-Ko-Rado problem on the strip
An Erdős-Ko-Rado problem on the strip Steve Butler 1 1 Department of Mathematics University of California, San Diego www.math.ucsd.edu/~sbutler GSCC 2008 12 April 2008 Extremal set theory We will consider
More informationTowards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem
Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem Ralph Howard Department of Mathematics, University of South Carolina Columbia, SC 29208, USA howard@math.sc.edu Gyula Károlyi Department
More informationCOM BIN ATOR 1 A L MATHEMATICS YEA R
0 7 8 9 3 5 2 6 6 7 8 9 2 3 '" 5 0 5 0 2 7 8 9 '" 3 + 6 + 6 3 7 8 9 5 0 2 8 6 3 0 6 5 + 9 8 7 2 3 7 0 2 + 7 0 6 5 9 8 2 3 + 6 3 5 8 7 2 0 6 9 3 + 5 0 7 8 9 9 8 7 3 2 0 + 5 6 9 7 8 9 8 7 + 3 2 5 6 0 2 8
More informationOn Perfect Codes and Related Concepts
Designs, Codes and Cryptography, 22, 221 237, 2001. c 2001 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. On Perfect Codes and Related Concepts R. AHLSWEDE H.K. AYDINIAN L.H. KHACHATRIAN
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More informationCombinatorics. Lectured by I. B. Leader. Michaelmas Term 2008, 2010 & 2012
Combinatorics Lectured by I B Leader Michaelmas Term 2008, 2010 & 2012 Chapter 1 Set Systems 1 Chapter 2 Isoperimetric Inequalities 10 Chapter 3 Intersecting Families 23 Chapter 3 Projections 28 Examples
More informationR u t c o r Research R e p o r t. Uniform partitions and Erdös-Ko-Rado Theorem a. Vladimir Gurvich b. RRR , August, 2009
R u t c o r Research R e p o r t Uniform partitions and Erdös-Ko-Rado Theorem a Vladimir Gurvich b RRR 16-2009, August, 2009 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew
More informationAn exact Turán result for tripartite 3-graphs
An exact Turán result for tripartite 3-graphs Adam Sanitt Department of Mathematics University College London WC1E 6BT, United Kingdom adam@sanitt.com John Talbot Department of Mathematics University College
More informationOn infinite permutations
On infinite permutations Dmitri G. Fon-Der-Flaass, Anna E. Frid To cite this version: Dmitri G. Fon-Der-Flaass, Anna E. Frid. On infinite permutations. Stefan Felsner. 2005 European Conference on Combinatorics,
More informationCovering the Convex Quadrilaterals of Point Sets
Covering the Convex Quadrilaterals of Point Sets Toshinori Sakai, Jorge Urrutia 2 Research Institute of Educational Development, Tokai University, 2-28-4 Tomigaya, Shibuyaku, Tokyo 5-8677, Japan 2 Instituto
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationVERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS
VERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS YI ZHANG, YI ZHAO, AND MEI LU Abstract. We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in
More informationIntersecting families of sets and permutations: a survey
Intersecting families of sets and permutations: a survey arxiv:1106.6144v1 [math.co] 30 Jun 2011 Peter Borg Department of Mathematics, University of Malta, Msida MSD 2080, Malta p.borg.02@cantab.net August
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationA DEGREE VERSION OF THE HILTON MILNER THEOREM
A DEGREE VERSION OF THE HILTON MILNER THEOREM PETER FRANKL, JIE HAN, HAO HUANG, AND YI ZHAO Abstract An intersecting family of sets is trivial if all of its members share a common element Hilton and Milner
More informationCocliques in the Kneser graph on line-plane flags in PG(4, q)
Cocliques in the Kneser graph on line-plane flags in PG(4, q) A. Blokhuis & A. E. Brouwer Abstract We determine the independence number of the Kneser graph on line-plane flags in the projective space PG(4,
More informationA bijective proof of Shapiro s Catalan convolution
A bijective proof of Shapiro s Catalan convolution Péter Hajnal Bolyai Institute University of Szeged Szeged, Hungary Gábor V. Nagy {hajnal,ngaba}@math.u-szeged.hu Submitted: Nov 26, 2013; Accepted: May
More informationThe expansion of random regular graphs
The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d 3, almost all d-regular graphs on {1, 2,..., n} have edge-expansion ratio at least c d d (if nd is
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More informationA Lemma on the Minimal Counter-example of Frankl s Conjecture
A Lemma on the Minimal Counter-example of Frankl s Conjecture Ankush Hore email: ankushore@gmail.com Abstract Frankl s Conjecture, from 1979, states that any finite union-closed family, containing at least
More informationExtremal Cases of the Ahlswede-Cai Inequality. A. J. Radclie and Zs. Szaniszlo. University of Nebraska-Lincoln. Department of Mathematics
Extremal Cases of the Ahlswede-Cai Inequality A J Radclie and Zs Szaniszlo University of Nebraska{Lincoln Department of Mathematics 810 Oldfather Hall University of Nebraska-Lincoln Lincoln, NE 68588 1
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More informationMaximal Symmetric Difference-Free Families of Subsets of [n]
arxiv:1010.2711v1 [math.co] 13 Oct 2010 Maximal Symmetric Difference-Free Families of Subsets of [n] Travis G. Buck and Anant P. Godbole Department of Mathematics and Statistics East Tennessee State University
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationEquitable Colorings of Corona Multiproducts of Graphs
Equitable Colorings of Corona Multiproducts of Graphs arxiv:1210.6568v1 [cs.dm] 24 Oct 2012 Hanna Furmańczyk, Marek Kubale Vahan V. Mkrtchyan Abstract A graph is equitably k-colorable if its vertices can
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationAdditive Combinatorics and Szemerédi s Regularity Lemma
Additive Combinatorics and Szemerédi s Regularity Lemma Vijay Keswani Anurag Sahay 20th April, 2015 Supervised by : Dr. Rajat Mittal 1 Contents 1 Introduction 3 2 Sum-set Estimates 4 2.1 Size of sumset
More informationCitation for pulished version (APA): Henning, M. A., & Yeo, A. (2016). Transversals in 4-uniform hypergraphs. Journal of Combinatorics, 23(3).
Syddansk Universitet Transversals in 4-uniform hypergraphs Henning, Michael A; Yeo, Anders Published in: Journal of Combinatorics Publication date: 2016 Document version Forlagets udgivne version Document
More informationNote Erdős Ko Rado from intersecting shadows
Note Erdős Ko Rado from intersecting shadows Gyula O. H. Katona Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences 1053 Budapest, Reáltanoda u. 13 15., Hungary e-mail: ohatona@renyi.hu
More informationOn completing partial Latin squares with two filled rows and at least two filled columns
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(2) (2017), Pages 186 201 On completing partial Latin squares with two filled rows and at least two filled columns Jaromy Kuhl Donald McGinn Department of
More information--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationThe Erd s-ko-rado property of various graphs containing singletons
The Erd s-ko-rado property of various graphs containing singletons Peter Borg and Fred Holroyd Department of Mathematics, The Open University, Walton Hall, Milton Keynes MK7 6AA, United Kingdom p.borg.02@cantab.net
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationOff-diagonal hypergraph Ramsey numbers
Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationNonnegative k-sums, fractional covers, and probability of small deviations
Nonnegative k-sums, fractional covers, and probability of small deviations Noga Alon Hao Huang Benny Sudakov Abstract More than twenty years ago, Manickam, Miklós, and Singhi conjectured that for any integers
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationColoring Uniform Hypergraphs with Few Colors*
Coloring Uniform Hypergraphs with Few Colors* Alexandr Kostochka 1,2 1 University of Illinois at Urbana-Champaign, Urbana, Illinois 61801; e-mail: kostochk@mathuiucedu 2 Institute of Mathematics, Novosibirsk
More informationarxiv: v2 [math.co] 3 Jan 2019
IS THE SYMMETRIC GROUP SPERNER? arxiv:90.0097v2 [math.co] 3 Jan 209 LARRY H. HARPER AND GENE B. KIM Abstract. An antichain A in a poset P is a subset of P in which no two elements are comparable. Sperner
More informationWeak Separation, Pure Domains and Cluster Distance
Discrete Mathematics and Theoretical Computer Science DMTCS vol (subm, by the authors, 1 1 Weak Separation, Pure Domains and Cluster Distance Miriam Farber 1 and Pavel Galashin 1 1 Department of Mathematics,
More informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
More informationErdös-Ko-Rado theorems for chordal and bipartite graphs
Erdös-Ko-Rado theorems for chordal and bipartite graphs arxiv:0903.4203v2 [math.co] 15 Jul 2009 Glenn Hurlbert and Vikram Kamat School of Mathematical and Statistical Sciences Arizona State University,
More informationJ. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE
J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationGame saturation of intersecting families
Cent. Eur. J. Math. 129) 2014 1382-1389 DOI: 10.2478/s11533-014-0420-3 Central European Journal of Mathematics Game saturation of intersecting families Research Article Balázs Patkós 1, Máté Vizer 1 1
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationGRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY. Hamid-Reza Fanaï
Opuscula Mathematica Vol. 30 No. 3 2010 http://dx.doi.org/10.7494/opmath.2010.30.3.271 GRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY Hamid-Reza Fanaï Abstract. In this paper, we give a sufficient condition
More informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationGame saturation of intersecting families
Game saturation of intersecting families Balázs Patkós Máté Vizer November 30, 2012 Abstract We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = {1,
More informationZero-one laws for multigraphs
Zero-one laws for multigraphs Caroline Terry University of Illinois at Chicago AMS Central Fall Sectional Meeting 2015 Caroline Terry (University of Illinois at Chicago) Zero-one laws for multigraphs October
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationOn a correlation inequality of Farr
On a correlation inequality of Farr Colin McDiarmid, Department of Statistics Oxford University Abstract Suppose that each vertex of a graph independently chooses a colour uniformly from the set {1,...,
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More informationOn non-antipodal binary completely regular codes
On non-antipodal binary completely regular codes J. Borges, J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Bellaterra, Spain. V.A. Zinoviev Institute
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationOn Locating-Dominating Codes in Binary Hamming Spaces
Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More information