The edge-diametric theorem in Hamming spaces
|
|
- George Simon
- 5 years ago
- Views:
Transcription
1 Discrete Applied Mathematics The edge-diametric theorem in Hamming spaces Christian Bey Otto-von-Guericke-Universität Magdeburg, Institut für Algebra und Geometrie, Postfach 420, 3906 Magdeburg, Germany Received 3 April 2004; received in revised form 5 September 2004; accepted 2 November 2006 Available online 2 August 2007 Dedicated to the memory of Levon Khachatrian Abstract The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswede and Khachatrian [A diametric theorem for edges, J. Combin. Theory Ser. A ] Elsevier B.V. All rights reserved. Keywords: Diametric problem; Hamming space; Intersection theorem. Introduction Let H n ={,...,}n be the Hamming space, i.e. H n is equipped with the Hamming distance d H, where for a = a,...,a n, b = b,...,b n H n we have d Ha, b = {i : a i = b i }. The diameter of a subset A H n is defined by diama = max{d H a, b : a,b A}. For every integer d with 0 <d<nput D,n,d={A H n : diama d}. As usual, H n is also considered as a graph V, E with vertex set V=Hn and edge set E={{a,b} :d Ha, b=}. For every subset A V let EA ={{a,b} :a,b A, d H a, b = } be the edge set induced by A. The vertex-resp. edge diametric problem in Hamming space is to determine the function resp. V,n,d:= E,n,d:= max A D,n,d A max A D,n,d EA vertex-diametric function, edge-diametric function. Clearly, these problems can be formulated in every graph. address: christian.bey@mathematik.uni-magdeburg.de X/$ - see front matter 2007 Elsevier B.V. All rights reserved. doi:0.06/j.dam
2 C. Bey / Discrete Applied Mathematics Consider for every integer t with 0 <t<nthe following subsets of H n : F i,n,t:= {a H n : Ba {,...,t + 2i} t + i}, where Ba is defined for every a = a,...,a n H n by n t 0 i 2, Ba ={i {,...,n}:a i = }. Note that F i,n,tis the product of a ball with radius i on the first t + 2i coordinates and a Hamming space on the remaining n t 2i coordinates. Thus, F i,n,t D,n,n t for all i. The vertex-diametric problem in binary Hamming spaces was solved by Kleitman: Theorem Kleitman []. V2,n,d= F d/2 2,n,n d. For larger alphabets, the complete solution of the vertex-diametric problem is due to Ahlswede and Khachatrian: Theorem 2 Ahlswede and Khachatrian [2]. Let r be the largest nonnegative integer such that 2r d and r n d / 2 are satisfied. Then V,n,d= F r,n,n d. See [2] for a list of previously obtained partial results. Equivalent versions of the above theorems in terms of intersection instead of diametry were obtained by Katona [0] Theorem and Frankl and Tokushige [9] Theorem 2. Ahlswede and Khachatrian also solved the edge-diametric problem in binary Hamming spaces: Theorem 3 Ahlswede and Khachatrian [4]. { EF0 2,n, if d = n, E2,n,d= EF d/2 2,n,n d if d n 2. Here we continue these investigations by providing a solution for the edge-diametric problem for all other alphabet sizes: Theorem 4. Let 3. Then { EF0,n,n d if d = n,n 2, E,n,d= max EF i,n,n d if d<n 2. 0 i d/2 The maximum in Theorem 4 is attained at the largest nonnegative integer i for which 2i d and + + n d d 2i / + i i are satisfied. We remark without proof that, up to permutations of the coordinates and of the alphabets in the components, the F i,n,n d are the only optimal configurations. Our proof of Theorem 4 is based on the powerful methods developed by Ahlswede and Khachatrian in [,3]. 2. Reduction to an intersection problem Let N denote the set of positive integers. For i, j N put [i, j] ={i, i +,...,j} and [i] =[,i]. Further, let 2 [i] ={A : A [i]} and ={A [i] : A =k}. [i] k
3 52 C. Bey / Discrete Applied Mathematics Consider the set M =[, n] together with the partition M = M M n where M i ={j M : j i mod n}, i =,...,n. There is a natural bijection between the Hamming space H n and the set C n ={A M : A M i = for all i =,...,n}, which maps a = a,...,a n H n to A = n i= {a i n + i} C n. Accordingly, we define for every A Cn EA := {{A,A 2 }:A,A 2 A, A A 2 =2}, where A A 2 denotes the symmetric difference of A and A 2. Recall that a system of sets A 2 N is called t-intersecting if A A 2 t for all A,A 2 A. For m N let I m, t be the set of all t-intersecting systems A 2 [m], and put I n t ={A Cn : A In, t}. The following equality is now obvious: E,n,d= max A I n n d EA. We continue with the well-known notion of left-shifted set systems [8]. Definition. For any A 2 N,anyA A and i, j N let { {i} A\{j} if i/ A, j A, {i} A\{j} / A, S i,j A = A otherwise and S i,j A ={S i,j A : A A}. A family A 2 N is called left-shifted in T where T N ifs i,j A = A for all i, j T with i<j. The shift-operations S i,j have the following easy but important properties. Lemma 5. Let A 2 N and i, j N. Then: i S i,j A C n whenever A Cn and i, j M k for some k =,...,n, ii S i,j A = A, iii S i,j A I m, t whenever A I m, t and i, j [m], iv ES i,j A EA. Let LI n t ={A I n t : A is left-shifted in every M k,k=,...,n}. Now and Lemma 5 imply E,n,d= For any A 2 N let max 2 n d EA. A LI n BA ={A [n] :A A}. We note that if a H n and A Cn correspond under the bijection between Hn and Cn then Ba= A [n], where Ba is defined in Section.
4 C. Bey / Discrete Applied Mathematics The systems in LI n n d have the following easily verified properties: Lemma 6. Let A LI n t. Then i BA I n, t, i.e. A A 2 [n] t for all A,A 2 A, ii BA 2 [n] is an upset, i.e. B BA and B B 2 [n] imply B 2 BA. If in addition A ={A C n : A [n] BA} then iii EA = n B n B. 2 B BA and We note that iii applies for every A LI n n d with E,n,d= EA. By 2 and Lemma 6 we obtain a further reduction: E,n,d= max n B n B. 3 2 B I n,n d B B Given a family B 2 [n] and nonnegative real numbers weights ω i, i = 0,...,n, put ωb = B B ω B = n [n] B ω i i i=0 Mn, t, ω = max ωb. B I n,t We consider the weights ω i = n i n i. 4 Then, according to 3 we have E,n,d= Mn, n d,ω. 5 2 Let F i n, t ={B [n] : B [t + 2i] t + i} 2 [n], and recall the families F i,n,t H n defined in the previous section. With Lemma 6iii we obtain EF i,n,t = ωf 2 i n, t. 6 Finally, 5 and 6 show that Theorem 4 is equivalent to the following: Theorem 4. Let 3 and ω i = n i n i, i = 0,...,n. Then { ωf0 n, t if t =, 2, Mn, t, ω = max ωf in, t if t>2. 0 i n t/2 We remark that the cases t = orn sufficiently large follow from results of Frankl [7, Theorem 5.2, Remark 5.3 and Theorem 5.4].
5 54 C. Bey / Discrete Applied Mathematics Auxiliary results Lemma 7. Let S 2 [m] be a nonempty system of sets such that i S is complement-closed, i.e. A S implies A =[m]\a S and ii S is convex, i.e. A, C S and A B C imply B S. Furthermore, let ν 0 > ν > > ν m > 0 be real numbers. Put { } Q = min νi+ : 0 i<m. ν i Then there exists an intersecting subsystem I S such that νi νs. 7 + Q Proof. We follow the construction of an intersecting system I given in [4]. If S = 2 [m] we may take I ={A [m] :m A} since then + QνI = ν A + + Q ν A + ν A + + ν A = νs. A [m ] A [m ] Assume now that S = 2 [m] and choose a set B S such that B\{i} / S for some element i [m]. Consider the partition S = S S 2 S 3 S 4, where S ={A S : i A and A\{i} S}, S 2 ={A S : i/ A and A {i} S}, S 3 ={A S : i A and A\{i} / S}, S 4 ={A S : i/ A and A {i} / S}. Clearly, S ={A : A S }=S 2 and S 3 ={A : A S 3 }=S 4, and hence S = S 2 and S 3 = S 4. Further, S ={A {i} :A S 2 } and therefore νs = ν A = ν A + ν A = Q Q νs 2. 8 A S A S 2 A S 2 Now S S 3 is clearly an intersecting system. It is easily verified that also the system S S 4 is intersecting. We may assume that νs S 3 + Q νs, since otherwise we are done. Then necessarily νs 2 S 4 Q νs. 9 + Q Since B S 3 we have S 4 = S 3 =. Hence νs 4 >/QνS 4, and with 8 and 9 we obtain νs S 4 > Q νs 2 S 4 + Q νs. Remark. The proof shows that there is always an intersecting subsystem I S for which strict inequality in 7 holds unless S = 2 [m] and ν i+ /ν i is constant for i = 0,...,m.
6 A I C. Bey / Discrete Applied Mathematics Corollary 8. Let S 2 [m] be a nonempty system of sets as in Lemma 7. Further let > and c>0 be reals. Then there exists an intersecting subsystem I S with m A +c m A +c A + + /c A. 0 For m> there is an intersecting subsystem I S such that strict inequality in 0 holds. A S We continue with further auxiliary results. Recall the families F i n, t which we abbreviate here and in the next section by F i. Recall also the weights ω i which were defined in 4. Lemma 9. The sequence ωf i, i = 0,..., n t/2 is unimodal. More precisely, for 0 <r n t/2 we have ωf r ωf r if and only if + / + r + t. r Proof. The lemma follows by comparing the two numbers and ωf r \F r = t + r = t + r = t + r ωf r \F r = t + r 2 = t + r 2 n t 2r j ω j+t+r n t 2r j r n t 2r ω j j+t+r r n t 2r n t 2r We need also the following numerical fact. n t r + j n t r j + r + + r. Lemma 0. Let > and r n t/2. Then ωf r ωf r implies + + t / + s s for every positive integer s r. Moreover, for t>2 we have strict inequality in unless ωf r = ωf r and s = r. Proof. Put c = /. It suffices to show that + t / + t + / + s s c + s c + s for every integer s r. Note that the LHS is decreasing in t, the RHS is increasing in c, and equality holds for t, c = 2, 0.
7 56 C. Bey / Discrete Applied Mathematics Proof of Theorem 4 We prove Theorem 4. It follows essentially from the following two lemmas whose proofs utilize the methods from [] generating sets and [3] pushing pulling. Let LIn, t denote the set of all left-shifted t-intersecting systems B 2 [n]. Put F n t/2 + = F =. Lemma. Let r be the smallest nonnegative integer such that ωf r >ωf r+. Then every B LIn, t with ωb = Mn, t, ω is t-intersecting in [t + 2r], i.e. B B 2 [t + 2r] t for all B,B 2 B. This is a special case of [5, Lemma 29] let their,kbe our,n, and is thus not reproved here. Note that in [5] only the existence of a system B having the properties of Lemma is stated even under the weaker requirement ωf r ωf r+ ; this already would suffice for the following arguments, and that the proof there gives indeed the above stronger statement which, however, is only needed for uniqueness considerations. We remark that the existence of a system B with the properties in Lemma follows more generally for all weights which satisfy ω i ω i+, i = t,...,n, and ωf r ωf n t/2, see [6, Theorem 5]. Lemma 2. Let t 2. Let r be the largest integer such that t +2r n and ωf r <ωf r. Then every B LIn, t with ωb = Mn, t, ω is invariant under exchanging coordinates in [t + 2r], i.e. S i,j B = B for all i, j [t + 2r]. Proof. If t = 2 then r = 0 and ωf 0 >ωf by Lemma 9 note that 3. Lemma shows that B is invariant in [t]. Let t>2. We consider two cases, first let ωf r >ωf r+. By Lemma every B LIn, t with ωb=mn, t, ω is t-intersecting in [t +2r]. Let A={B [t +2r] :B B}. Then, since ωb = Mn, t, ω and ω i > 0 for i = t,...,n, necessarily and thus B ={B [n] :B [t + 2r] A}, ωb = ω A where the new weights ω t,...,ω t+2r are given by n t 2r ω i = j ω i+j = n t 2r j = t+2r n t 2r / + t + 2r i i n i j n i j Further, we clearly have A LIt + 2r, t. Let l t + 2r be the largest integer such that A is invariant under exchanging coordinates in [l]. Assume that l<t + 2r. 2 Consider the sets A ={A A : S l+,i A / A for some i l}, A ={A [l + 2,t + 2r] :A A }. Clearly, A = and hence A =. Now we state the following facts which among others follow from the pushing pulling method [3,4] see also [6]: i l t and l + t is even. ii A is complement-closed i.e. A A implies [l + 2,n]\A A, and A is convex i.e. A A 2 A 3 and A,A 3 A imply A 2 A..
8 C. Bey / Discrete Applied Mathematics iii For all intersecting subsystems I of A, ω A +l+t/2 l t + 2 ω A +l+t/2 2l +. 3 A I A A In view of i and 2 we may write l = t + 2s 2 for an integer s with s r. By ii we may apply Corollary 8 to the set system A 2 [t+2s,t+2r] ; this gives an intersecting system A A such that A A m A +c A + + /c A A m A +c A 4 for m = t + 2r l = 2r s + and any constant c. We put c = + s in order to get from 4 ω A +l+t/2 ω A +l+t/2 + + /c. 5 A A A A Now, recalling our choice of r, we obtain from Lemma /c > 2 + t /s = l t + 2 2l +, 6 which in view of 3 and 5 shows that the intersecting system A A contradicts fact iii. Thus, the assumption 2 is false, i.e. A and hence also B is invariant in [t + 2r]. Replacing r by r + in the above arguments including Lemma 0 except in 2, in the condition s r and in the conclusion that A is invariant in [t + 2r], yields a proof in the case ωf r = ωf r+. Proof of Theorem 4. Let B I n, t with Mn, t, ω = ωb. According to Lemma 5 we can assume that B LIn, t. Let r be the largest integer such that t + 2r n and ωf r ωf r hold. For t = and t = 2 we obtain from Lemma 9 note 3 that r = 0. Then Lemma gives B F 0, i.e. Mn, t, ω = ωf 0. Let t>2. By Lemma, B is t-intersecting in [t + 2r]. IfωF r <ωf r then Lemma 2 shows that B is also invariant in [t + 2r], which clearly implies B F r, i.e. Mn, t, ω = ωf r.ifωf r = ωf r then Lemma 2 shows that B is invariant in []. It follows B F r or B F r, i.e. Mn, t, ω = max{ωf r, ωf r }. References [] R. Ahlswede, L.H. Khachatrian, The complete intersection theorem for systems of finite sets, European J. Combin [2] R. Ahlswede, L.H. Khachatrian, The diametric theorem in Hamming spaces optimal anticodes, Adv. Appl. Math [3] R. Ahlswede, L.H. Khachatrian, A pushing pulling method: new proofs of intersection theorems, Combinatorica [4] R. Ahlswede, L.H. Khachatrian, A diametric theorem for edges, J. Combin. Theory Ser. A [5] Ch. Bey, The Erdős Ko Rado bound for the function lattice, Discrete Appl. Math [6] Ch. Bey, K. Engel, Old and new results for the weighted t-intersection problem via AK-methods, in: I. Althöfer, N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy, I. Wegener, Z. Zhang Eds., Numbers, Information and Complexity, Kluwer Academic Publishers, Boston, Dordrecht, London, 2000Special volume in honour of R. Ahlswede on occasion of his 60th birthday. [7] M. Deza, P. Frankl, Erdős Ko Rado theorem 22 years later, SIAM J. Algebraic Discrete Methods [8] P. Erdős, C. Ko, R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. II [9] P. Frankl, N. Tokushige, The Erdős Ko Rado theorem for integer sequences, Combinatorica [0] Gy. Katona, Intersection theorems for systems of finite sets, Acta Math. Hungar [] D. Kleitman, On a combinatorial conjecture of Erdős, J. Combin. Theory
A diametric theorem for edges. R. Ahlswede and L.H. Khachatrian
A diametric theorem for edges R. Ahlswede and L.H. Khachatrian 1 1 Introduction Whereas there are vertex and edge isoperimetric theorems it went unsaid that diametric theorems are vertex diametric theorems.
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 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 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 informationMinimal polynomials of the modified de Bruijn sequences
Discrete Applied Mathematics 156 (2008) 1549 1553 www.elsevier.com/locate/dam Minimal polynomials of the modified de Bruijn sequences Gohar M. Kyureghyan Department of Mathematics, Otto-von-Guericke University
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
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 informationAn estimate for the probability of dependent events
Statistics and Probability Letters 78 (2008) 2839 2843 Contents lists available at ScienceDirect Statistics and Probability Letters journal homepage: www.elsevier.com/locate/stapro An estimate for the
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 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 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 informationarxiv: v2 [cs.it] 25 Jul 2010
On Optimal Anticodes over Permutations with the Infinity Norm Itzhak Tamo arxiv:1004.1938v [cs.it] 5 Jul 010 Abstract Department of Electrical and Computer Engineering, Ben-Gurion University, Israel Moshe
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 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 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 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 informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationUniformly X Intersecting Families. Noga Alon and Eyal Lubetzky
Uniformly X Intersecting Families Noga Alon and Eyal Lubetzky April 2007 X Intersecting Families Let A, B denote two families of subsets of [n]. The pair (A,B) is called iff `-cross-intersecting A B =`
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 informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
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 informationAnother algorithm for nonnegative matrices
Linear Algebra and its Applications 365 (2003) 3 12 www.elsevier.com/locate/laa Another algorithm for nonnegative matrices Manfred J. Bauch University of Bayreuth, Institute of Mathematics, D-95440 Bayreuth,
More informationThe following two problems were posed by de Caen [4] (see also [6]):
BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES JIN ZHONG Abstract A matrix is binary if each of its entries is either or The binary rank of a nonnegative integer matrix A is the
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
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 informationJeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA
#A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department
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 informationTheoretical Computer Science
Theoretical Computer Science 406 008) 3 4 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Discrete sets with minimal moment of inertia
More informationSzemerédi-Trotter theorem and applications
Szemerédi-Trotter theorem and applications M. Rudnev December 6, 2004 The theorem Abstract These notes cover the material of two Applied post-graduate lectures in Bristol, 2004. Szemerédi-Trotter theorem
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 informationOn the Turán number of Triple-Systems
On the Turán number of Triple-Systems Dhruv Mubayi Vojtĕch Rödl June 11, 005 Abstract For a family of r-graphs F, the Turán number ex(n, F is the maximum number of edges in an n vertex r-graph that does
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 informationMinimum degree conditions for large subgraphs
Minimum degree conditions for large subgraphs Peter Allen 1 DIMAP University of Warwick Coventry, United Kingdom Julia Böttcher and Jan Hladký 2,3 Zentrum Mathematik Technische Universität München Garching
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
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 informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationSome Bounds for the Distribution Numbers of an Association Scheme
Europ. J. Combinatorics (1988) 9, 1-5 Some Bounds for the Distribution Numbers of an Association Scheme THOMAS BIER AND PHILIPPE DELSARTE We generalize the definition of distribution numbers of an association
More informationOn a kind of restricted edge connectivity of graphs
Discrete Applied Mathematics 117 (2002) 183 193 On a kind of restricted edge connectivity of graphs Jixiang Meng a; ;1, Youhu Ji b a Department of Mathematics, Xinjiang University, Urumqi 830046, Xinjiang,
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 informationEuropean Journal of Combinatorics
European Journal of Combinatorics 30 (2009) 1686 1695 Contents lists available at ScienceDirect European Journal of Combinatorics ournal homepage: www.elsevier.com/locate/ec Generalizations of Heilbronn
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 157 (2009 1696 1701 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Riordan group involutions and the -sequence
More informationJournal of Number Theory
Journal of Number Theory 129 (2009) 2766 2777 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt The critical number of finite abelian groups Michael Freeze
More informationTHE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS
SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp. 347-355, October 2002 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS BY HUA MAO 1,2 AND SANYANG LIU 2 Abstract. This paper first shows how
More informationThe Number of Independent Sets in a Regular Graph
Combinatorics, Probability and Computing (2010) 19, 315 320. c Cambridge University Press 2009 doi:10.1017/s0963548309990538 The Number of Independent Sets in a Regular Graph YUFEI ZHAO Department of Mathematics,
More informationPath decompositions and Gallai s conjecture
Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian
More informationarxiv: v1 [math.co] 17 Dec 2007
arxiv:07.79v [math.co] 7 Dec 007 The copies of any permutation pattern are asymptotically normal Milós Bóna Department of Mathematics University of Florida Gainesville FL 36-805 bona@math.ufl.edu Abstract
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
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 informationAn Introduction of Tutte Polynomial
An Introduction of Tutte Polynomial Bo Lin December 12, 2013 Abstract Tutte polynomial, defined for matroids and graphs, has the important property that any multiplicative graph invariant with a deletion
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 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 informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
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 informationCONDITIONS THAT FORCE AN ORTHOMODULAR POSET TO BE A BOOLEAN ALGEBRA. 1. Basic notions
Tatra Mountains Math. Publ. 10 (1997), 55 62 CONDITIONS THAT FORCE AN ORTHOMODULAR POSET TO BE A BOOLEAN ALGEBRA Josef Tkadlec ABSTRACT. We introduce two new classes of orthomodular posets the class of
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationDifference Sets Corresponding to a Class of Symmetric Designs
Designs, Codes and Cryptography, 10, 223 236 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Difference Sets Corresponding to a Class of Symmetric Designs SIU LUN MA
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More informationPeriodic decomposition of measurable integer valued functions
Periodic decomposition of measurable integer valued functions Tamás Keleti April 4, 2007 Abstract We study those functions that can be written as a sum of (almost everywhere) integer valued periodic measurable
More informationEdge-pancyclicity of Möbius cubes
Information Processing Letters 96 (25) 136 14 www.elsevier.com/locate/ipl Edge-pancyclicity of Möbius cubes Min Xu a,b, Jun-Ming Xu b, a Institute of Applied Mathematics, Academy of Mathematics and Systems
More informationSome inequalities for sum and product of positive semide nite matrices
Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,
More informationConnectivity of addable graph classes
Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke July 6, 008 A non-empty class A of labelled graphs is weakly addable if for each graph G A and any two distinct components
More information#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary
#A45 INTEGERS 9 (2009, 591-603 BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS Gyula Károlyi 1 Institute of Mathematics, Eötvös University, Pázmány P. sétány 1/C, Budapest, H 1117, Hungary karolyi@cs.elte.hu
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 informationMULTIPLICITIES OF MONOMIAL IDEALS
MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationNOTE. On a Problem of Erdo s and Sa rko zy
Journal of Combinatorial Theory, Series A 94, 191195 (2001) doi10.1006jcta.2000.3142, available online at httpwww.idealibrary.com on NOTE On a Problem of Erdo s and Sa rko zy Tomasz Schoen Mathematisches
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationArithmetic Progressions with Constant Weight
Arithmetic Progressions with Constant Weight Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel e-mail: raphy@oranim.macam98.ac.il Abstract Let k n be two positive
More information