The Anti-Ramsey Problem for the Sidon equation
|
|
- Leslie Gordon
- 5 years ago
- Views:
Transcription
1 The Anti-Ramsey Problem for the Sidon equation Vladislav Taranchuk Craig Timmons August 0, 018 arxiv: v1 [math.co] 9 Aug 018 Abstract For n k 4, let ARX+Y=Z+T k (n be the maximum number of rainbow solutions to the Sidon equation X + Y = Z + T over all k-colorings c : [n] [k]. It can be shown that the total number of solutions in [n] to the Sidon equation is n /1 + O(n and so, trivially, ARX+Y=Z+T k (n n /1 + O(n. We improve this upper bound to ( 1 ARX+Y=Z+T k (n 1 1 n +O k (n 4k for all n k 4. Furthermore, we give an explicit k-coloring of [n] with more rainbow solutions to the Sidon equation than a random k-coloring, and gives a lower bound of ( n O k (n AR k k X+Y=Z+T(n. When k = 4, we use a different approach based on additive energy to obtain an upper bound of n /96+O(n, whereas our lower bound is n /96 O(n in this case. 1 Introduction Most of the notation we use is standard. For a positive integer n, let [n] = {1,,...,n}. If X is a set and m 0 is an integer, then ( X m is the set of all subsets of X of size m. A k-coloring of a set X is a function c : X [k]. The function c need not be onto. A subset Y X is monochromatic under c if c(y = c(y for all y,y Y. The set Y is rainbow if no two elements of Y have been assigned the same color. The hypergraph Ramsey Theorem states that for any positive integers s, k, and m, there is an N = N(s,k,m such that for all n N the following holds: if c is any k-coloring of ( ( [n] m, then there is a set S [n] such that S m is monochromatic under c. This theorem is one of the most important theorems in combinatorics. Today, Ramsey Theory is a cornerstone in combinatorics and there is a vast amount of literature on Ramsey type problems. Here we will focus on a Ramsey problem in the integers and Department of Mathematics and Statistics, California State University Sacramento. Department of Mathematics and Statistics, California State University Sacramento. This work was supported by a grant from the Simons Foundation (#59419, Craig Timmons. 1
2 recommend Landman and Robertson [4] for a more comprehensive introduction to this area. The problem we consider is inspired by the investigations of two recent papers. In [6], Saad and Wolf introduced an arithmetic analog of some problems in graph Ramsey Theory. In particular, given a graph H, let RM k (H,n be the minimum number of monochromatic copies of H over all k-colorings c : E(K n [k]. The parameter RM k (H,n is the Ramsey multiplicity of H and has been studied for different graphs H. The arithmetic analog from[6] replaces graphs with linear equations, and sets up a general framework where these ideas from graph theory(sidorenko property, Ramsey multiplicty have natural counterparts. Fix an abelian group Γ. If L is a linear equation with integer coefficients, one can look at the minimum number of monochromatic solutions to L over all k-colorings c : Γ [k]. One of the first examples given in [6] (see Example 1.1 concerns the Sidon equation X +Y = Z+T. This famous equation has a rich history in combinatorics. A Sidon set in an abelian group Γ is a set having only trivial solutions to X + Y = Z + T. If A Γ is a Sidon set and Γ is finite, then a simple counting argument gives A Γ 1/ + 1. The constant can be improved in many cases, but what concerns us here is that when A is much larger, say A = α Γ for some α > 0, then A will certainly contain nontrivial solutions to the Sidon equation. Thus, a natural question is given a k-coloring c : Γ [k], at least how many solutions to the Sidon equation must be monochromatic. This question, and several others including results on X +Y = Z (Schur triples and X +Y = Z ( term a.p. s, is answered by the results of [6]. For more in this direction, we refer the reader to that paper. Recently, De Silva, Si, Tait, Tunçbilek, Yang, and Young [1] studied a rainbow version of Ramsey multiplicity. Instead of looking at the minimum number of monochromatic copies of H over all k-colorings c : E(K n [k], De Silva et. al look at the maximum number of rainbow copies of H. One must consider rainbow copies of H since giving every edge of K n the same color clearly maximizes the number of monochromatic copies. Define rb k (H;n to be the maximum number of rainbow copies of H over all k-colorings c : E(K n [k]. This parameter is called the anti-ramsey multiplicity of H, and [1] investigates the behavior of this function for different graphs H. In this paper, we consider an arithmetic analog of anti-ramsey multiplicity thereby combining the problems raised in [1] with the arithmetic setting of [6]. We will focus entirely on the Sidon equation X + Y = Z + T. The Sidon equation measures the additive energy of a set. The additive energy of a set A Γ is the number of four tuples (a,b,c,d A 4 such that a+b = c+d. Typically it is written as E(A = {(a,b,c,d A 4 : a+b = c+d}. This fundamental parameter measures the additive structure of A, and for more on additive energy, see Tao and Vu [7]. Additive energy is perhaps one of the reasons why the Sidon equation is used as a first example in [6]. We would also like to remark that rainbow solutions to the Sidon equation were studied by Fox, Mahdian, and Radoičić []. They proved that in every 4-coloring of [n] where the smallest color classes has size at least n+1, there is at least one rainbow solution to the Sidon equation. This result 6 is also discussed in [] which surveys several problems on conditions ensuring a rainbow solution to an equation.
3 SinceweareinterestedinthemaximumnumberofrainbowsolutionstoX+Y = Z+T, we must take a moment to carefully describe how solutions are counted. First, since we are only counting rainbow solutions, we only care about solutions to X + Y = Z + T in which all of the terms are distinct. Additionally, we want to count solutions that can be obtained by interchanging values on the same side of the equation as being the same. With this in mind, we define a set of four distinct integers {x 1,x,x,x 4 } ( [n] 4 a Sidon 4-set if these integers form a solution to the Sidon equation X + Y = Z + T. Given a Sidon 4-set {x 1,x,x,x 4 }, we can determine exactly which pairs appear on each side of X+Y = Z+T. Without loss of generality, we may assume that x 1 is the largest among the x i s and x 4 is the smallest. It follows that x 1 +x 4 = x +x and again without loss of generality, we may assume x > x so x 1 > x > x > x 4. In short, given a Sidon 4-set {x 1,x,x,x 4 }, the two extreme values appear on one side of X +Y = Z +T, and the two middle values appear on the other side. Now we are ready to define the Ramsey function that is the focus of this work. Let n k 4 be integers. We define AR k X+Y=Z+T (n to be the maximum number of rainbow Sidon 4-sets over all colorings c : [n] [k]. It can be shown that the total number of Sidon 4-sets in [n] is exactly n 1 n 8 + 5n 1 θ where θ = 0 if n is even, and θ = 1 if n is odd. This immediately implies the upper 8 bound ARX+Y k n =Z+T (n 1 n 8 + 5n 1 for n k 4. A First Moment Method argument gives a lower bound of ( ( 1 k +O n O k k (n ARX+Y=Z+T k (n. Our first theorem improves both of these bounds. Theorem 1.1 For integers n k 4, ( k + θ k n O k (n AR k X+Y =Z+T (n ( k n +O k (n where θ = 1 if k is even, and θ = 1 if k is odd. 4 When k = 4, we can improve the upper bound using a different argument. Theorem 1. For n 4, n 96 O(n ARX+Y=Z+T 4 n (n 96 +O(n. The lower bound in Theorem 1. is a consequence of Theorem 1.1. Finding an asymptotic formula for ARX+Y=Z+T k (n is an open problem. The rest of this paper is organized as follows. In Sections and, we prove the upper bounds of Theorem 1.1 and Theorem 1., respectively. The lower bound is proved in Section 4. Some concluding remarks and further discussion is given in Section 5.
4 An Upper bound for k colors Key to our upper bound for k > 4 is the following lemma. It gives a lower bound for the number of Sidon 4-sets that contain a fixed pair. It will be applied to pairs that are monochromatic under a given coloring c. Lemma.1 Let n be a positive integer and let {b < a} ( [n]. Define fn ({b < a} to be the number of Sidon 4-sets {x 1,x,x,x 4 } ( [n] 4 with {a,b} {x1,x,x,x 4 }. Then f n satisfies f n ({b < a} n 4. Proof. We will consider two possibilities depending on the positioning of a and b within the equation x 1 +x 4 = x +x. Claim 1: If a+b = x i +x j, then the number of x i, x j [n] with x i < x j that satisfy this equation is at least { a+b 1 1 if a+b n+1, n a+b 1 1 if a+b > n+1. Proof of Claim 1: First suppose a+b n+1. Let x i = m and x j = a+b m where 1 m a+b 1. Since a + b n + 1, the integers x i and x j are in [n] for all m in the specified range. Since we must exclude x i = b, x j = a (a, b, x i, and x j must all be distinct to be a Sidon 4-set, we obtain that the total amount of possible values for x i,x j is at least a+b 1 1. Now suppose a + b > n + 1. Let x i = a + b n + m and x j = n m where 0 m n a+b 1. Since a+b > n+1, we have n m x i < x j n for all m in the specified range. As before, the solution x i = b and x j = a must be excluded. Here we obtain that the total amount of possible values for x i and x j is at least a+b 1 a+b 1 n n 1. Claim : If a+x i = b+x j, then the number of x i,x j [n] with x i < x j that satisfy this equation is at least n (a b. Proof of Claim : Note that a+x i = b+x j implies a b = x j x i. Since b < a, we have that a b > 0. Let x i = m and x j = a b+m. The range of m for which we have a valid solution is 1 m n (a b. However, we also require that {a,b} {x i,x j } = and so the solutions (x i,x j = (b a,b, (x i,x j = (b,a, and (x i,x j = (a,a b must all be excluded. Thus, we obtain the number x i, x j that satisfy the equation a+x i = b+x j and all other constraints is at least n (a b. These two possibilities (a + b = x i + x j and a + x i = b + x j are disjoint and cover all possible positions for a and b. A lower bound on the number of Sidon 4- sets {x 1,x,x,x 4 } ( [n] 4 with {a,b} {x1,x,x,x 4 } is obtained by combining these 4
5 two cases. So we have that if a+b n+1, then the amount of Sidon 4-sets that contain a and b is at least a+b 1 1+n (a b n a + b 11 n 4. If a+b > n+1, then the amount of Sidon 4-sets that contain a and b is at least a+b 1 n 1+n (a b n a + b 9 n 4. Theorem. For integers n k 4, ( 1 ARX+Y=Z+T k (n 1 1 n +O k (n. 4k Proof. Let c : [n] [k] be a k-coloring of [n]. Let X i be the integers assigned color i by c. Let M ( [n] be the set of all pairs {b < a} which are monochromatic under c, i.e., c(a = c(b. Then M = k ( Xi = 1 i=1 k X i 1 i=1 k X i 1 k n k = n k n. (1 Let f n ({b < a} be the number of Sidon 4-sets in [n] that contain {b < a}. By Lemma.1, f n ({b < a} n 4. ( The sum {b<a} M f n({b < a} counts the number of Sidon 4-sets that contain at least one monochromatic pair. A given Sidon 4-set is counted at most six times by this sum since there are ( 4 ways to choose a pair from a Sidon 4-set. In fact, the only Sidon 4-sets that will be counted six times in this sum are those which are monochromatic under c. All others will be counted at most three times. Regardless, we have that the number of Sidon 4-sets that are not rainbow under c is at least 1 f n ({b < a} k n {b<a} M {b<a} M where we have used both (1 and (. An Upper Bound for four colors i=1 For k = 4, the upper bound of Theorem. gives AR 4 X+Y=Z+T (n ( n +O(n. (n 4 = n 4k O k(n 5
6 In the special case that k = 4, we can obtain a better upper bound with a different argument based on additive energy. Let A 1,A,...,A t be finite sets of integers and define E t (A 1,A,...,A t = {(a 1,a,...,a t A 1 A A t : a 1 +a + +a t = 0}. For integers n m, write [n,m] for the interval For a finite set J Z with j elements, let {n,n+1,n+,...,m}. I(J = [ j/, j/ ]. Note that I(J depends only on the cardinality of J. A key ingredient in the proof of our upper bound is the following result of Lev [5]. Theorem.1 (Lev [5] Let t be an integer. For any finite sets A 1,A,...,A t Z, E t (A 1,A,...,A t E t (I(A 1,I(A,...,I(A t. The main idea is to apply Theorem.1 with t = 4, where A 1,A,A,A 4 are color classes of a coloring c : [n] [4]. Before using Theorem.1, we need a few lemmas. For finite sets A,B Z and an integer m, let r A+B (m = {(a,b A B : a+b = m}. Lemma. Let 1 α β be integers. If A = [ α,α] and B = [ β,β], then α+1 if m β α, r A+B (m = β +α+1 m if β α m α+β, 0 otherwise. In particular, r A+B (m β +α+1 m whenever m α+β. Proof. For any m with m β α, we can write m = j +(m j where j [ α,α]. The term m j is in B since if m β α and j α, then m j m + j β α+α = β. This shows that r A+B (m = α+1 whenever m β α. Now suppose β α m α+β, say m = β α+l for some l {0,1,...,α}. Then m = β α+l = ( α+l +t+(β t ( for t {0,1,...,α l}. We now check that for each such t, we have α + l + t A and β t B. Since α β and 0 l α, β β α β α+l = β (α l β t β 6
7 so β t β hence β t B. Similarly, α α+l+t α+l+α l = α so α+l+t A. Therefore, in (, the term α+l+t belongs to A and β t belongs to B. Furthermore, this is all of the ways to write m as a sum of an integer in A and an integer in B. We conclude that for β α m α+β, r A+B (m = β +α+1 m. The proof is completed by noting that if m > α + β, then r A+B (m = 0, and A and B are symmetric about 0 so that r A+B (m = r A+B ( m. As for the assertion that r A+B (m β+α+1 m for m α+β, it is enough to check that β +α+1 m α+1 for m β α. An easy computation shows that these two inequalities are equivalent. Lemma. If α is a positive integer and J = [ α,α], then { α+1 m if m α, r J+J (m = 0 otherwise. Proof. Apply Lemma. with α = β. Lemma.4 Let α 1,α,α,α 4 be positive integers such that α := α 1 + α + α + α 4 is divisible by 4. If A i = [ α i,α i ] and J = [ α/4,α/4], then for any integer m with m α/, r A1 +A (m+r A +A 4 (m r J+J (m. Proof. Let m be an integer with m α. By Lemma., r A1 +A (m+r A +A 4 (m α 1 +α +1 m +α +α 4 +1 m = (α/+1 m = r J+J (m. For the last equality, we have used Lemma. with J = [ α/4,α/4]. Lemma.5 Let α 1,α,α,α 4 be positive integers such that α := α 1 + α + α + α 4 is divisible by 4. If A i = [ α i,α i ] and J = [ α/4,α/4], then r A1 +A (mr A +A 4 (m m Z α m= α Proof. First we show that if m > α, then the product r A1 +A (mr A +A 4 (m r J+J (m. must be 0. If r A1 +A (m 0 and r A +A 4 (m 0, then by Lemma., m α 1 +α and m α +α 4. 7
8 Adding the two inequalities together gives m α 1+α +α +α 4 and so m α. Thus, r A1 +A (mr A +A 4 (m = m Z α m= α r A1 +A (mr A +A 4 (m. By Lemma.4, for any m with m α, we have r A 1 +A (m +r A +A 4 (m r J+J (m. Thus, the product r A1 +A (mr A +A 4 (m is at most r J+J (m. Since this holds for all m with m α, r A1 +A (mr A +A 4 (m = m Z α m= α which completes the proof of the lemma. r A1 +A (mr A +A 4 (m Lemma.6 If α is a positive integer and J = [ α,α], then E 4 (J,J,J,J = 16α +8α + 14α +1. α m= α r J+J (m Proof. We must count the number of 4-tuples (x 1,x,x,x 4 with α x i α and x 1 +x +x +x 4 = 0. For an integer m with 0 m α, we have r J+J (m = α +1 m by Lemma.. The number of 4-tuples (x 1,x,x,x 4 with α x i α and x 1 +x +x +x 4 = 0 is α m= α r J+J (mr J+J ( m = r J+J (0 + = (α+1 + = 16α α m=1 α m=1 r J+J (m +8α + 14α +1. (α+1 m Theorem.7 The function ARX+Y=Z+T 4 (n satisfies ARX+Y=Z+T 4 n (n 96 +O(n. Proof. First we assume that n is divisible by 8. An easy monotonicity argument will complete the proof for all n. Suppose c : [n] {1,,,4} is a 4-coloring of [n]. Let X i be the integers assigned color i by c and X i = c i n. The number of rainbow solutions to X + Y = Z + T is exactly N(c := E 4 (X 1,X, X, X 4 +E 4 (X 1,X, X, X 4 +E 4 (X 1,X 4, X, X. 8
9 By Theorem.1, N(c E 4 (I(X 1,I(X,I( X,I( X 4 +E 4 (I(X 1,I(X,I( X,I( X 4 + E 4 (I(X 1,I(X 4,I( X,I( X. We will show that each of the terms on the right hand side is at most n 96 +O(n. For 1 i 4, I(±X i = [ c i n/, c i n/ ]. Wealsohavethatc 1 +c +c +c 4 1. Assumethateach c in isaninteger. LetA 1 = I(X 1, A = I(X, A = I( X, A 4 = I( X 4, and J = [ n/8,n/8]. By Lemmas.5 and.6 E 4 (A 1,A,A,A 4 = m Z r A1 +A (mr A +A 4 ( m = m Zr A1 +A (mr A +A 4 (m n/4 m= n/4 r J+J (m = E 4 (J,J,J,J = n 96 +O(n. We apply this same estimate to E 4 (X 1,X, X, X 4 and E 4 (X 1,X 4, X, X to obtain N(c n 96 +O(n. If the c in are not integers, we can still apply the above argument but now J must be replaced with J = [ n/8 1,n/8 + 1]. Nevertheless, we still have E 4 (J,J,J,J n + 96 O(n as E 4 (J,J,J,J increases by O(n when the interval J is increases from [ n/8,n/8] to [ n/8 1,n/8+1]. If n is not divisible by 8, then let l be the smallest integer for which n+l is divisible by 8 (so 1 l 7. By monotonicity, AR 4 X+Y=Z+T(n AR 4 X+Y=Z+T(n+l (n+l 96 +O((n+l = n 96 +O(n. 4 A Lower Bound for k colors In this section we prove a lower bound on ARX+Y=S+T k (n for k 4. We will need two lemmas before proving the lower bound. In this section, we continue to write r A+B (m = {(a,b A B : a+b = m}. Lemma 4.1 Let 1 i < j k be integers and let n be a positive integer that is divisible by k. If X i = {m [n] : m i(mod k} and X j = {m [n] : m j(mod k}, then { t+1 if 0 t n r Xi +X j (i+j +tk 1, k n 1 t if n t n. k k k If l i+j(mod k, then r Xi +X j (l = 0. 9
10 Proof. First note that since k divides n, X i = {i,i+k,i+k,...,i+n k} and X j = {j,j +k,j +k,...,j +n k}. If l = a+b for some a X i and b X j, then l i+j(mod k. Thus, r Xi +X j (l = 0 whenever l i+j(mod k. This proves the last assertion of the lemma. Let t be an integer with 0 t n 1. We claim that for each α {0,1,...,t}, we k get i+j +tk = (i+αk+(j +(t αk where i+αk X i and j +(t αk X j. The inequality i i+αk i+tk i+ k 1 k = i+n k shows that i+αk X i for each α {0,1,...,t}. Similarly, j j +(t αk j +tk j + k 1 k = j +n k shows that j +αk X j for each α {0,1,...,t}. Consequently, r Xi +X j (i+j +tk t+1 whenever t {0,1,..., n 1}. k Now let t be an integer with n t n. Write t = n β where β n. For k k k k each α {1,,...,β 1}, we can write i+j +tk = i+j + k β k = ( i+ ( k α k + j + k (β α k. We claim that i+ α k X k i and j + (β α k X k j. Now i+k = i+n k 1 k i+n (β 1k i+ k α k i+n k where we have used the inequalities β n, α β 1, and α 1. We conclude that for k each α {1,,...,β 1}, the term i+ α k is in X k i. Similarly, j +k = j + k k 1 k j + j + k 1 k = j +n k k (β 1 k j + k (β α k shows that j + k (β α k is in X j for each α {1,,...,β 1}. Therefore, Since t = n k β, we have β 1 = n k r Xi +X j (i+j +tk β 1. t 1 and this completes the proof of the lemma. For the next lemma we will count Sidon 4-sets in Z k. A Sidon 4-set in Z k is a set of four distinct elements α, β, γ, δ Z k such that α+β γ +δ(mod k. We will denote such a 4-set by {α+β γ +δ}. The reason we cannot simply write {α,β,γ,δ} is that in Z k, four distinct residues may lead to more than one solution to the Sidon equation. For example, in Z 4, 10
11 1+ +4(mod 4 and 1+4 +(mod 4. ThisdoesnotoccurinZbecauseoftheorderingoftheintegers. LetS(kbethecollection of all Sidon 4-sets in Z k. Finishing off the example of k = 4, it is easily seen that S(4 = {{1+ +4},{1+4 +}} (4 and so S(4 =. We are now ready to state and prove the next lemma. Lemma 4. Let k 4 be an integer. If S(k is the family of all Sidon 4-sets in Z k, then S(k = k 8 k +θk where θ = 1 if k is even, and θ = if k is odd. 8 Proof. For this lemma, we will write a b for a b(mod k. Let us first assume that k is even. Where this will come into play is that when k is even, the congruence X b will have exactly two solutions when b is even, and no solutions when b is odd. First we choose a pair {x 1,x } ( Z k (. This can be done in k ways and this pair will be one side of the equation X +Y Z +T. Our counting from this point forward depends on if x 1 +x is even or odd when viewed as an integer. Case 1: x 1 +x is even If x 1 +x is even, then the congruence X x 1 +x has exactly two solutions, say y 1 and y. Note that no y i can be the same as an x i for if, say y 1 x 1, then from y 1 +y 1 x 1 +x we get x y 1 x 1 contradicting the way x 1 and x have been chosen. Therefore, in the case that x 1 +x is even, there are k 4 choices for x for which the unique x 4 satisfying x 1 +x x +x 4 will have the property that all of x 1, x, x, and x 4 are distinct. We conclude that {x 1 +x x +x 4 } is indeed a Sidon 4-set. This Sidon 4-set is counted exactly four times in this way: we could have chosen x or x 4 after having chosen the pair {x 1,x }, and we could have also started by choosing the pair {x,x 4 } instead. When k is even, the number of pairs {x 1,x } for which x 1 +x is even is exactly k 1 k t=1 t = k (this can be seen by looking 4 at the diagonals in a Cayley table for Z k. Altogether, we have a count of ( k k (k Sidon 4-sets {x 1 +x x +x 4 } where x 1 +x is even. Case : x 1 +x is odd If x 1 +x is odd, then X x 1 +x has no solution since gcd(,k does not divide x 1 +x. Nowtherewill bek choicesforx andtheuniquex 4 satisfying x 1 +x x +x 4 11
12 will have the property that {x 1,x,x,x 4 } is a 4-set. There are k t=1 (t 1 = k 4 pairs {x 1,x } for which x 1 +x is odd. This gives a count of ( k (k 4 4 Sidon 4-sets {x 1 +x x +x 4 } where x 1 +x is odd. Combining the two cases, there are exactly ( k k (k (k + (k 4 = k 4 8 k + k Sidon 4-sets in Z k when k is even. When k is odd, a similar counting argument can be done. The key difference is that for any pair {x 1,x }, the congruence X x 1 + x has exactly one solution since gcd(k, = 1 always divides x 1 +x. This unique solutionmust beavoided when choosing x and so there will be k choices for x. The rest of the counting is similar to as before and we obtain Sidon 4-sets in Z k when k is odd. ( k (k 4 = k 8 k + k 8 Theorem 4. Let n k 4 be integers and assume that n is divisible by k. If S(k is the family of all Sidon 4-sets in Z k, then ( n ARX+Y=Z+T k (n S(k k O k(n. Proof. Let n k 4 be integers where k divides n. Define the coloring c : [n] [k] by c(i = i(mod k where we use residues in the set {1,,...,k}. The number of rainbow Sidon 4-sets under c is n l=1 1 i<j<s<t k ( rxi +X j (lr Xs+X t (l+r Xi +X s (lr Xj +X t (l+r Xi +X t (lr Xj +X s (l (5 where X i = {m [n] : m i(mod k}. To see this, observe that if x 1 +x = x +x 4 is a Sidon 4-set that is rainbow, then there are distinct colors 1 i < j < s < t k with {c(x 1,c(x,c(x,c(x 4 } = {i,j,s,t}. ThisrainbowSidon4-setiscountedexactlyoncebythesum(5preciselywhenl = x 1 +x, and by only one of the terms in the sum r Xi +X j (lr Xs+X t (l+r Xi +X s (lr Xj +X t (l+r Xi +X t (lr Xj +X s (l. (6 The unique nonzero term depends on which two colors appear on the same side of the equation x 1 +x = x +x 4. For instance, if colors i and j appear on the same side, then the first term in (6 is the one that counts {x 1,x,x,x 4 }. 1
13 Fix an l [n] and four distinct colors i,j,s,t. By Lemma 4.1, the product r Xi +X j (lr Xs+X t (l is not zero if and only if l i + j(mod k and l s + t(mod k. This clearly implies i+j s+t(mod k and so {i+j s+t} is Sidon 4-set in Z k. For u {0,1,...,k 1}, let S(k, u be the Sidon 4-sets {α+β γ +δ} S(k for which α+β u(mod k. The collection {S(k,u : 0 u k 1} forms a partition of S(k. Since r Xi +X j (l 0 if only if l i+j(mod k, (5 can be rewritten as S := n k 1 l=0 k u=1 {α+β γ+δ} S(k,u r Xα+X β (u+klr Xγ+X δ (u+kl. In order to use Lemma 4.1, we split this sum into two sums S 1 and S where S S 1 +S. Define n k 1 k S 1 := r Xα+X β (u+klr Xγ+X δ (u+kl and By Lemma 4.1, S 1 n k 1 l=0 k S := l=0 n k l= n k u=1 {α+β γ+δ} S(k,u k u=1 {α+β γ+δ} S(k,u u=1 {α+β γ+δ} S(k,u n k 1 (l+1 l=0 r Xα+X β (u+klr Xγ+X δ (u+kl. ( n S(k (l+1 = S(k k O k(n. (7 A similar application of Lemma 4.1 gives ( n S S(k k O k(n. (8 Combining (7 and (8, we have ( n S S 1 +S S(k k O k(n which tells us that the number of rainbow Sidon 4-sets under the coloring c is at least the right hand side of (9. Corollary 4.4 For integers n k 4, the function ARX+Y=Z+T k (n satisfies ( 1 ARX+Y=Z+T k (n 1 1 k + θ n O k k (n (9 where θ = 1 if k is even, and θ = 1 4 if k is odd. 1
14 Proof. First assume that n is divisible by k. By Theorem 4. and Lemma 4., ( ( k ARX+Y=Z+T k (n 8 k n +γk k O k(n. where γ = 1 if k is even and γ = if k is odd. 8 If n is not divisible by k, then choose r [k 1] so that n r is divisible by k. We then have by monotonicity, ( ( k ARX+Y=Z+T k (n ARk X+Y=Z+T (n r 8 k (n r +γk O k k (n. The lower order term can be absorbed into the O k (n error term so we get ( ( k ARX+Y=Z+T(n k 8 k n +γk k O k(n ( 1 = 1 1 k + θ n O k k (n in either case. Here θ = 1 if k is even, and θ = 1 4 if k is odd. 5 Concluding Remarks In this paper we studied the anti-ramsey function ARX+Y=Z+T k (n which concerns colorings of [n]. One could also consider colorings of Z n. Write ARX+Y Z+T k (Z n for the maximum number of rainbow solutions to X +Y Z +T(mod n over all k-colorings c : Z n [k]. As in the case of [n], we count solutions that only differ by ordering as the same. This is discussed in detail prior to Lemma 4.. Now by Lemma 4., AR k X+Y Z+T (Z n n 8 n +θn where θ = 1 if n is even, and θ = if n is odd. When k = 4, it is easy to improve this 8 upper bound as follows. Let c : Z n [4] be a coloring of Z n and let X i be the elements of Z n assigned color i by c. The number of rainbow solutions to the Sidon equation X +Y Z +T(mod n where colors 1 and appear on the same side is at most min{ X 1 X X, X 1 X X 4, X 1 X X 4, X X X 4 }. (10 Indeed, once we have chosen three values for the four variables X, Y, Z, and T, the last variable is uniquely determined. Since X 1 + X + X + X 4 = n, (10 is at most n. 64 There aretwo other possible ways toobtainarainbow solutiontox+y Z+T(modn. One is where colors 1 and appear on the same side, and the other is where colors 1 and 4 appear on the same side. This gives the upper bound AR 4 X+Y Z+T(Z n n
15 As for a lower bound, a natural idea is to try the same coloring that is used to prove Theorem 4.. It turns out that this is not more difficult if we consider arbitrary k 4, nevertheless we restrict to k = 4 for simplicity. Define the coloring c : Z n [4] by c(i = i(mod 4 where we use residues in {1,,,4} for the colors. If n is not divisible by 4, then this coloring may not be well defined! A simple example is when n = 5 where c(5 = 1, andc(10 =, however, 5and10arethesame element ofz 5. Anobvious wayto fix this is to fix equivalence class representatives, say Z n = {1,,...,n}. Unfortunately this does not solve the problem as we still require the arithmetic in Z n when finding solutions to X +Y Z + T(mod n. To proceed further, let us now assume that n is divisible by 4 and so the coloring c will be well defined and will not depend on how we represent the elements of Z n. It is now straightforward to adapt Lemma 4.1 to the Z n case. For 1 i < j 4, we would have r Xi +X j (i+j +4t = n 4 for all t {0,1,..., n 4 1}, and r X i +X j (l = 0 if l i + j(mod 4. The proof of this follows along the same lines as the proof of Lemma 4.1, except now i+j +4t (i+4α+(j +4(t α(mod n for all α {1,..., n }. One then obtains the lower bound 4 AR 4 X+Y Z+T (Z n = = n 4 1 l=0 n u=1 {α+β γ+δ} S(4,u r Xα+X β (u+4lr Xγ+X δ (u+4l r X1 +X (+4lr X +X 4 (+4l+r X1 +X 4 (1+4lr X +X (1+4l l=0 n 4 1 ( (n l= = n again, assuming n is divisible by 4. When k = 4, determining an asymptotic formula for the number of rainbow solutions to the Sidon equation in [n] or Z n would certainly be interesting. Additionally, improving the upper bound ( 1 ARX+Y=Z+T k (n 1 1 n +O k (n 4k seems possible. Using the methods of this paper, one might be able to improve the 1 to 1, but we believe the lower bound is closer to the truth and so any significant 4k 1k improvement may require some new ideas. 6 Acknowledgment The authors would like to thank Michael Tait for suggesting the problem that is the focus of this paper and for some insightful comments. 15
16 References [1] J. De Silva, X. Si, M. Tait, Y. Tunçbilek, R. Yang, M. Young, Anti-Ramsey multiplicities arxiv:1801:00474v Mar 018. [] J. Fox, M. Mahdian, R. Radoičić, Rainbow solutions to the Sidon equation, Discrete Math. 08 (008, no. 0, [] V. Jungić, J. Nešetřil, R. Radoičić, Rainbow Ramsey theory, Integers 5 (005, no., A9. [4] B. Landman, A. Robertson, Ramsey theory on the integers. Second Edition, American Mathematical Society, Providence, RI, 014. [5] V. Lev, On the number of solutions of a linear equation over finite sets, J. Combin. Theory Ser. A 8 (1998, no., [6] A. Saad, J. Wolf, Ramsey multiplicity of linear patterns in certain finite abelian groups, Q. J. Math. 68 (017, no. 1, [7] T. Tao, V. Vu, Additive Combinatorics, Cambridge University Press, Cambridge,
Sub-Ramsey numbers for arithmetic progressions
Sub-Ramsey numbers for arithmetic progressions Maria Axenovich and Ryan Martin Department of Mathematics, Iowa State University, Ames, IA, 50011. axenovic@math.iastate.edu, rymartin@iastate.edu Abstract.
More informationTHE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México
#A8 INTEGERS 15A (2015) THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p Mario Huicochea CINNMA, Querétaro, México dym@cimat.mx Amanda Montejano UNAM Facultad de Ciencias
More informationOn rainbow arithmetic progressions
On rainbow arithmetic progressions Maria Axenovich Department of Mathematics Iowa State University USA axenovic@math.iastate.edu Dmitri Fon-Der-Flaass Department of Mathematics University of Illinois at
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 informationRAINBOW 3-TERM ARITHMETIC PROGRESSIONS. Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada.
RAINBOW 3-TERM ARITHMETIC PROGRESSIONS Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada vjungic@sfu.ca Radoš Radoičić Department of Mathematics, MIT, Cambridge,
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 informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationMulticolour Ramsey Numbers of Odd Cycles
Multicolour Ramsey Numbers of Odd Cycles JOHNSON, JR; Day, A 2017 Elsevier Inc This is a pre-copyedited, author-produced PDF of an article accepted for publication in Journal of Combinatorial Theory, Series
More informationHomework #5 Solutions
Homework #5 Solutions p 83, #16. In order to find a chain a 1 a 2 a n of subgroups of Z 240 with n as large as possible, we start at the top with a n = 1 so that a n = Z 240. In general, given a i we will
More informationRainbow Arithmetic Progressions. Iowa State University
Rainbow Arithmetic Progressions Steve Butler Craig Erickson Leslie Hogben Kirsten Hogenson Lucas Kramer Richard L. Kramer Jephian C.-H. Lin Ryan R. Martin Derrick Stolee Nathan Warnberg Michael Young Iowa
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
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 informationarxiv: v1 [math.co] 13 Sep 2018
SIDON SETS AND 2-CAPS IN F n 3 YIXUAN HUANG, MICHAEL TAIT, AND ROBERT WON arxiv:1809.05117v1 [math.co] 13 Sep 2018 Abstract. For each natural number d, we introduce the concept of a d-cap in F n 3. A subset
More informationSome New Exact van der Waerden numbers
Some New Exact van der Waerden numbers Bruce Landman Department of Mathematics University of West Georgia, Carrollton, GA 30118 landman@westga.edu Aaron Robertson Department of Mathematics Colgate University,
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 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 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 informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationRamsey-type problem for an almost monochromatic K 4
Ramsey-type problem for an almost monochromatic K 4 Jacob Fox Benny Sudakov Abstract In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph K n with
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 informationZERO-SUM ANALOGUES OF VAN DER WAERDEN S THEOREM ON ARITHMETIC PROGRESSIONS
ZERO-SUM ANALOGUES OF VAN DER WAERDEN S THEOREM ON ARITHMETIC PROGRESSIONS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu Abstract Let r and k
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationResolving a conjecture on degree of regularity of linear homogeneous equations
Resolving a conjecture on degree of regularity of linear homogeneous equations Noah Golowich MIT-PRIMES, Department of Mathematics Massachusetts Institute of Technology Massachusetts, U.S.A. Submitted:
More informationarxiv: v1 [math.mg] 10 Feb 2017
Rainbow triangles arxiv:1702.03043v1 [math.mg] 10 Feb 2017 Steven Senger February 9, 2017 Abstract We seek conditions under which colorings of various vector spaces are guaranteed to have a copy of a unit
More informationAvoider-Enforcer games played on edge disjoint hypergraphs
Avoider-Enforcer games played on edge disjoint hypergraphs Asaf Ferber Michael Krivelevich Alon Naor July 8, 2013 Abstract We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing
More information1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.
New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of
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 informationDegree of Regularity of Linear Homogeneous Equations
Degree of Regularity of Linear Homogeneous Equations Kavish Gandhi, Noah Golowich and László Miklós Lovász October 4, 2018 arxiv:13097220v3 [mathco] 27 Jan 2014 Abstract We define a linear homogeneous
More informationEves Equihoop, The Card Game SET, and Abstract SET
Eves Equihoop, The Card Game SET, and Abstract SET Arthur Holshouser 3600 Bullard St Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 83,
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
More informationMatchings in hypergraphs of large minimum degree
Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationChromatic Ramsey number of acyclic hypergraphs
Chromatic Ramsey number of acyclic hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 127 Budapest, Hungary, H-1364 gyarfas@renyi.hu Alexander
More informationRAMSEY THEORY: VAN DER WAERDEN S THEOREM AND THE HALES-JEWETT THEOREM
RAMSEY THEORY: VAN DER WAERDEN S THEOREM AND THE HALES-JEWETT THEOREM MICHELLE LEE ABSTRACT. We look at the proofs of two fundamental theorems in Ramsey theory, Van der Waerden s Theorem and the Hales-Jewett
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationIS A CI-GROUP. RESULTS TOWARDS SHOWING Z n p
RESULTS TOWARDS SHOWING Z n p IS A CI-GROUP JOY MORRIS Abstract. It has been shown that Z i p is a CI-group for 1 i 4, and is not a CI-group for i 2p 1 + ( 2p 1 p ; all other values (except when p = 2
More informationarxiv: v1 [math.co] 21 Sep 2015
Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded
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 informationChapter VI. Relations. Assumptions are the termites of relationships. Henry Winkler
Chapter VI Relations Assumptions are the termites of relationships. Henry Winkler Studying relationships between objects can yield important information about the objects themselves. In the real numbers,
More informationarxiv: v2 [math.co] 29 Oct 2017
arxiv:1404.3385v2 [math.co] 29 Oct 2017 A proof for a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles G.R. Omidi Department of Mathematical Sciences, Isfahan University of Technology,
More informationA PROBABILISTIC THRESHOLD FOR MONOCHROMATIC ARITHMETIC PROGRESSIONS
A PROBABILISTIC THRESHOLD FOR MONOCHROMATIC ARITHMETIC PROGRESSIONS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu Abstract Let f r (k) = p k r
More informationRAMSEY THEORY. Contents 1. Introduction Arithmetic Ramsey s Theorem
RAMSEY THEORY CAN LIU Abstract. We give a proof to arithmetic Ramsey s Theorem. In addition, we show the proofs for Schur s Theorem, the Hales-Jewett Theorem, Van der Waerden s Theorem and Rado s Theorem,
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationVC-DENSITY FOR TREES
VC-DENSITY FOR TREES ANTON BOBKOV Abstract. We show that for the theory of infinite trees we have vc(n) = n for all n. VC density was introduced in [1] by Aschenbrenner, Dolich, Haskell, MacPherson, and
More informationSidon sets and C 4 -saturated graphs
Sidon sets and C 4 -saturated graphs arxiv:1810.056v1 [math.co] 11 Oct 018 David F. Daza Carlos A. Trujillo Universidad del Cauca, A.A. 755, Colombia. davidaza@unicauca.edu.co - trujillo@unicauca.edu.co
More informationOn some inequalities between prime numbers
On some inequalities between prime numbers Martin Maulhardt July 204 ABSTRACT. In 948 Erdős and Turán proved that in the set of prime numbers the inequality p n+2 p n+ < p n+ p n is satisfied infinitely
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More informationarxiv: v1 [math.co] 24 Aug 2017
arxiv:1708.07263v1 [math.co] 24 Aug 2017 An upper bound on tricolored ordered sum-free sets Taegyun Kim and Sang-il Oum Department of Mathematical Sciences, KAIST Daejeon, South Korea. August 25, 2017
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationMonochromatic simplices of any volume
Monochromatic simplices of any volume Adrian Dumitrescu Department of Computer Science University of Wisconsin Milwaukee WI 53201-0784, USA Email: ad@cs.uwm.edu Minghui Jiang Department of Computer Science
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationStrange Combinatorial Connections. Tom Trotter
Strange Combinatorial Connections Tom Trotter Georgia Institute of Technology trotter@math.gatech.edu February 13, 2003 Proper Graph Colorings Definition. A proper r- coloring of a graph G is a map φ from
More informationSchur s Theorem and Related Topics in Ramsey Theory
Schur s Theorem and Related Topics in Ramsey Theory Summer Lynne Kisner Advisor: Dr. Andrés E. Caicedo Boise State University March 4, 2013 Acknowledgments Advisor: Dr. Caicedo Committee: Dr. Scheepers
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 informationON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE December 1, 016 Abstract. Let C [r] m be a code such that any two words of C have Hamming
More informationA proof of Freiman s Theorem, continued. An analogue of Freiman s Theorem in a bounded torsion group
A proof of Freiman s Theorem, continued Brad Hannigan-Daley University of Waterloo Freiman s Theorem Recall that a d-dimensional generalized arithmetic progression (GAP) in an abelian group G is a subset
More informationarxiv: v1 [math.co] 28 Jan 2019
THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in
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 informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationarxiv: v1 [math.co] 18 Dec 2018
A Construction for Difference Sets with Local Properties Sara Fish Ben Lund Adam Sheffer arxiv:181.07651v1 [math.co] 18 Dec 018 Abstract We construct finite sets of real numbers that have a small difference
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 informationCraig Timmons 1 Department of Mathematics and Statistics, California State University Sacramento, Sacramento, California
#A83 INTEGERS 6 (06) UPPER BOUNDS FOR B H [G]-SETS WITH SMALL H Craig Timmons Department of Mathematics and Statistics, California State University Sacramento, Sacramento, California craig.timmons@csus.edu
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationMonochromatic Homothetic Copies of f1; 1 + s; 1 + s +tg
Monochromatic Homothetic Copies of f1; 1 + s; 1 + s +tg Tom C. Brown, Bruce M. Landman and Marni Mishna Citation data: T.C. Brown, Bruce M. Landman, and Marni Mishna, Monochromatic homothetic copies of
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 informationThe Two-Colour Rado Number for the Equation ax + by = (a + b)z
The Two-Colour Rado Number for the Equation ax + by = a + bz The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationFRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES
FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most
More informationIrredundant generating sets and dimension-like invariants of the finite group arxiv: v2 [math.gr] 13 Dec 2017
Irredundant generating sets and dimension-like invariants of the finite group arxiv:1712.03923v2 [math.gr] 13 Dec 2017 Minh Nguyen April 9, 2018 Abstract Whiston proved that the maximum size of an irredundant
More informationSolutions to Exercises Chapter 10: Ramsey s Theorem
Solutions to Exercises Chapter 10: Ramsey s Theorem 1 A platoon of soldiers (all of different heights) is in rectangular formation on a parade ground. The sergeant rearranges the soldiers in each row of
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 informationarxiv: v3 [math.co] 25 Feb 2019
Extremal Theta-free planar graphs arxiv:111.01614v3 [math.co] 25 Feb 2019 Yongxin Lan and Yongtang Shi Center for Combinatorics and LPMC Nankai University, Tianjin 30001, China and Zi-Xia Song Department
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationLocally maximal product-free sets of size 3
Locally maximal product-free sets of size 3 By Chimere S. Anabanti and Sarah B. Hart Birkbeck Pure Mathematics Preprint Series Preprint Number 10 www.bbk.ac.uk/ems/research/pure/preprints Locally maximal
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationHW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).
Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately
More informationarxiv: v1 [math.co] 7 Jul 2014
Sum-ratio estimates over arbitrary finite fields Oliver Roche-Newton arxiv:1407.1654v1 [math.co] 7 Jul 2014 July 11, 2018 Abstract The aim of this note is to record a proof that the estimate max{ A+A,
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 informationA LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES. 1. Introduction
A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES Y. O. HAMIDOUNE AND J. RUÉ Abstract. Let A be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained
More informationMatrix Arithmetic. j=1
An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationON MONOCHROMATIC ASCENDING WAVES. Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 13346
INTEGERS: Electronic Journal of Combinatorial Number Theory 7(), #A3 ON MONOCHROMATIC ASCENDING WAVES Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 1336
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem R. C. Daileda February 19, 2018 1 The Chinese Remainder Theorem We begin with an example. Example 1. Consider the system of simultaneous congruences x 3 (mod 5), x 2 (mod
More informationMONOCHROMATIC SCHUR TRIPLES IN RANDOMLY PERTURBED DENSE SETS OF INTEGERS
MONOCHROMATIC SCHUR TRIPLES IN RANDOMLY PERTURBED DENSE SETS OF INTEGERS ELAD AIGNER-HOREV AND YURY PERSON Abstract. Given a dense subset A of the first n positive integers, we provide a short proof showing
More informationHigher-Dimensional Analogues of the Combinatorial Nullstellensatz
Higher-Dimensional Analogues of the Combinatorial Nullstellensatz Jake Mundo July 21, 2016 Abstract The celebrated Combinatorial Nullstellensatz of Alon describes the form of a polynomial which vanishes
More information2 More on Congruences
2 More on Congruences 2.1 Fermat s Theorem and Euler s Theorem definition 2.1 Let m be a positive integer. A set S = {x 0,x 1,,x m 1 x i Z} is called a complete residue system if x i x j (mod m) whenever
More informationLaver Tables A Direct Approach
Laver Tables A Direct Approach Aurel Tell Adler June 6, 016 Contents 1 Introduction 3 Introduction to Laver Tables 4.1 Basic Definitions............................... 4. Simple Facts.................................
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationShort cycles in random regular graphs
Short cycles in random regular graphs Brendan D. McKay Department of Computer Science Australian National University Canberra ACT 0200, Australia bdm@cs.anu.ed.au Nicholas C. Wormald and Beata Wysocka
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
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 information