ERDŐS SZEKERES THEOREM WITH FORBIDDEN ORDER TYPES. II
|
|
- Donald Welch
- 8 years ago
- Views:
Transcription
1 ERDŐS SEKERES THEOREM WITH FORBIDDEN ORDER TYPES. II GYULA KÁROLYI Institute of Mathematics, Eötvös University, Pázmány P. sétány /C, Budaest, H 7 Hungary GÉA TÓTH Alfréd Rényi Institute of Mathematics, Reáltanoda u. 5, Budaest, H 053 Hungary Abstract. According to the Erdős-Szekeres theorem, every set of n oints in the lane contains roughly log n in convex osition. We investigate how this bound changes if our oint set does not contain a subset that belongs to a fixed order tye.. Introduction Throughout this aer we will always assume that every oint set is in general osition in the lane, that is, no three oints of the configuration are collinear. Two such configurations are said to be of the same order tye, if there is a one-toone corresondence between them which reserves the orientation of each trile. Thus, order tyes are equivalence classes of configurations. For examle, given an integer n 3, the vertex set of any convex n-gon belongs to the same order tye we denote by C n. It is clear that the order tye of a configuration stays invariant Visiting the CWI in Amsterdam and the EPFL Lausanne. Suorted by Bolyai Research Fellowshi and OTKA Grant NK Suorted by OTKA Grant K6047.
2 GY. KÁROLYI, G. TÓTH under orientation reserving non-singular affine transformations and also under a wide class of rojective transformations. The cardinality T of an order tye T is the common cardinality of all configurations contained in it. We will say that the order tye T contains the order tye S if some (hence any) configuration in T contains a subset which belongs to S. We denote this relation by S T and will use this notation on the level of configurations as well. All configurations belonging to the same order tye ossess the same searation roerties. Thus, several notions of discrete geometry carry over to order tyes in a natural way. For examle, if the convex hull of some element of T is a convex n-gon, then it is true for every element of T, in which case it makes sense to say that convt = C n. An order tye is convex, if it equals its convex hull. Ramsey theoretic asects of order tyes have been studied by Nešetřil and Valtr in [7]. Order tyes lay an imortant role in canonical versions of the Erdős Szekeres theorem [8]. A connection was first established via the so called same tye lemma by Bárány and Valtr [4], see also [3] for a survey. According to the Erdős Szekeres theorem, there is an integer N 0 such that every order tye T with T N 0 contains C n. Denoting the smallest such number by F(n), it is known [9, 8] that n + F(n) ( ) n 5 +, n the lower bound conjectured to be tight. This is a truly Ramsey-tye result whose relation to Ramsey s theorem is widely exlored e.g. in [6]. Motivated by a conjecture of Erdős and Hajnal [7] in grah Ramsey theory, Gil Kalai [3] suggested the following roblem. For a fixed non-convex order tye T, define F T (n) as the smallest integer N 0 such that any order tye of size at least N 0 that does not contain T necessarily contains C n. Note that F T is an increasing function. Is it always true that F T (n) is bounded above by a olynomial function of n? Somewhat surrisingly, the analogue with grah Ramsey theory breaks here. In [4] we have shown the existence of an order tye T with F T (n) > n, in contrast with the original Erdős Hajnal roblem where a sub-exonential uer bound is known [7]. For more on this roblem, see [, 5, 0, ]. Our roof however was based on a general result of Nešetřil and Valtr [7] from which it is not easy to extract a concrete order tye T with the above roerty. One novelty in the resent aer is the exhibition of exlicit order tyes T for
3 FORBIDDEN ORDER TYPES 3 which F T (n) is exonentially large (Theorem ). Such an order tye of size 6 can be obtained, for examle, by utting an extra oint at the centre of a regular entagon. Large order tyes containing neither this, nor C n can be constructed by a doubling rocess we call twin construction, similar to the one found in [5]. We discuss these constructions in Section. On the other hand, several families of order tyes satisfy the analogue of the Erdős Hajnal conjecture, see [4]. In Section 3 we exhibit new families of order tyes T for which the function F T has olynomial growth (Theorems 4 and 5). Our final result (Theorem 8) in Section 4 concerns a comlete characterization of order tyes whose convex hull is a triangle according to the behavior of the function F T (n). They each fall in one of the following three categories: (i) F T (n) is bounded by a linear function in n; (ii) F T (n) is at least quadratic in n but bounded by a olynomial in n; (iii) F T (n) is exonentially large in n. Part of this result originates in [4]. Besides that and the methods involved therein the most crucial element is a new construction that we obtain via modification of Horton s well-known examle []. Somewhat surrisingly these neo- Horton sets can be also obtained by the twin construction.. Exlicite Constructions There exist three different non-convex order tyes T of size less than 6. It was shown in [4], that for any of them F T (n) is bounded from above by a olynomial function in n. In contrast, we have the following result. Theorem. The 6-element order tyes T = A and T = P deicted below satisfy F T (n) > n/. Figure. Order tyes A and P.
4 4 GY. KÁROLYI, G. TÓTH A common feature of these order tyes is that they have the following searation roerty: any two of their oints can be searated by a line determined by two other oints of theirs. To rove the theorem we first introduce the twin construction. Define sets T k, k 0 recursively. T 0 consists of one oint. Suose we already have defined T k. Take a line l which is not arallel to any line determined by the oints of T k. Relace each oint T k by two oints,,, both very close to, such that the line is arallel to l. The oints and are called the twins of each other and is the arent of them. For a more formal and somewhat more restricted definition, choose k different unit vectors v,...,v k such that no two of them add u to zero, and a small ositive number ε. Given T i, define T i+ as T i (T i + ε i v i+ ). For all sufficiently small values of ε the k -element set T k thus constructed will belong to the same order tye, which by a slight abuse of notation we denote by T k = T (v,...,v k ). Note that different choice of unit vectors may yield the same order tye. On the other hand, reordering of a given sequence of unit vectors usually results in a different order tye. Observe that T k does not have the searation roerty, since two twins cannot be searated by any line determined by other oints. Lemma. For k, no order tye T k contains C k+. Proof. We need to rove that T k does not contain more than k oints in convex osition, which clearly holds for k =. Suose it holds for k and let,,..., m T k be a sequence of m oints in convex osition, in clockwise order. If i and j are twins of each other, then they are consecutive oints. Therefore there can be at most two airs of twins among,,..., m. Relacing each oint by its arent in T k we find at least m oints of T k in convex osition. By the induction hyothesis, m k. It follows that m k. Since both A and P have the searation roerty, Theorem is an immediate consequence of the following claim. Lemma 3. Suose that the order tye S has the searation roerty. Then F S (n + ) > n. Proof. Since T k = k, in view of the revious lemma it will be sufficient to show that T k does not contain a subset whose order tye is S. We rove it by induction on k. It is obviously true for k =. Suose that the statement holds for k.
5 FORBIDDEN ORDER TYPES 5 Assume that {,,... m } T k belongs to S. Consider any two oints i and j. Since they are searated by some line u v, they cannot be twins, so their arents i and j are different. The set of arents,,... m thus form an m-element subset in T k whose order tye is again S, which contradicts the induction hyothesis. This concludes the roof. In Section 4 we will make use of the following secial case of the twin construction. For any sequence of vectors v,...,v k whose tangents form a decreasing sequence of ositive numbers, the order tye T (v,...,v k ) will be the same. We denote this order tye by RN H k and its mirror image by LN H k. The order tye RN H k resemble very much the order tye H k of Horton s famous construction H k (see []). The difference lies therein, that RN H k is obtained as the order tye of T k = T(v,..., v k ) using very small values of ε, whereas H k can be obtained using vectors v i of sloe α i = π/4 i, and using ( i cosα i ) (/) i instead of ε i for very small ε. This order tye is indeed different from RN H k, which can be easily seen from the following exlicit construction. For any nonnegative integer m let m = i=0 a i i (a i {0, }) be its unique binary reresentation. Given that, define m = i=0 a i i. Identifying the lane with R, ut m = (m, m). The set RNH k = { m 0 m < k } gives a concrete configuration whose order tye is RN H k. Reflecting it in the second axis we obtain a configuration LNH k LN H k. One can readily check that these neohorton sets have the following remarkable roerties: (i) each set RNH k is centrally symmetric; (ii) for any k < n, RNH n is the disjoint union of n k translated coies RNH k (),..., RNH k ( n k ) of RNH k = RNH k () such that for every i < j, the whole set RNH k (j) lies above and to the right of RNH k (i); (iii) for i < j and x, y RNH k (i), the whole set RNH k (j) lies above the line xy, thus every oint of RNH k (j) sees the oints of RNH k (i) so that if m < m, then m recedes m in counterclockwise order; (iv) for j < i < i, every oint of RNH k (i) sees the oints of RNH k (j) later than the oints of RNH k (i ). These roerties will be used for the roof of Lemma 9 in Section 4 without any artial reference.
6 6 GY. KÁROLYI, G. TÓTH 3. Order Tyes with the Erdős Hajnal Proerty We say that the order tye T has the Erdős Hajnal roerty, if F T is bounded from above by a olynomial function. Here we exhibit three families of order tyes with this roerty. The notations we aly here slightly deviate from those used in [4]. First, for any k, consider a configuration E = {a, b, c,,..., k } such that the oints,..., k lie inside the triangle abc and the oints b,,..., k, c are in convex osition. E belongs to a unique order tye we denote by E k. Thus, F E (n) = n. In general F Ek is bounded form above by a linear funcion, see [4]. Next, for any k 3, consider a configuration F = {a, b, c,,..., k } such that the oints,..., k lie inside the triangle abc, the oints,..., k lie inside the convex quadrilateral b k c, the oints,..., k are in convex osition, and no line defined by two of them intersects the segment bc. The order tye of F we denote by F k. Finally, let k 4, l, m 0 be arbitrary integers. Two configurations X and Y are said to be mutually avoiding if any line determined by two oints of X has all oints of Y on the same side, and vice versa. Consider a configuration G = {,..., k, q,..., q l, r,...,r m } with the following roerties. The oints,..., k are in convex osition, the oints q,..., q l, r,...,r m lie inside the convex olygon... k, the oints, q,...q l, are in convex osition such that Q = {, q,...q l, } and G \ Q are mutually avoiding, and similarly, 3, r,...r m, 4 are in convex osition such that R = { 3, r,... r m, 4 } and G \ R are mutually avoiding. Deending on the orientation of the convex olygon... k, G belongs one of (at most) two different order tyes, which we denote by G k;l,m. a a b c b c 3 4 q q q 3 r r 3 4 Figure. Order tyes E 3, F 4, and G 6;3,.
7 FORBIDDEN ORDER TYPES 7 We will rove that all these order tyes have the Erdős Hajnal roerty. With a small modification of an idea in [4] we have the following result. Theorem 4. Every order tye F k with k 3 has the Erdős Hajnal roerty. Theorem 4 in [4] asserts that the order tyes G k;l,0 also have this roerty. Here we claim the following more general result. Theorem 5. Every order tye G k;l,m, where k 4, l, m 0 and not both l and m are zero, has the Erdős Hajnal roerty. Both roofs utilize a result of Erdős and Szekeres concerning cas and cus. The oints (x, y ),..., (x n, y n ) R with x <... < x n form an n-ca if y y > y 3 y >... > y n y n. x x x 3 x x n x n Similarly, they form an n-cu if y y < y 3 y <... < y n y n. x x x 3 x x n x n Lemma 6. [8] Let f(a,b) denote the smallest integer such that any set of f(a, b) oints in general osition in the lane, no two on a vertical line, contains either an a-ca or a b-cu. Then ( ) a + b 4 f(a, b) = +. a Proof of Theorem 4. We rove that for T = F k, the function F T is bounded from above by a olynomial of degree 3k 5. Let X be any order tye of cardinality X > n ( ) n+k 4 3. k Assuming that Cn X, we rove that F k X. Let X X, then convx has less than n vertices. Triangulating it we find a, b, c X such that more than ( ) n+k 4 3 k oints of X lie inside triangle abc. Denote by P the set of these oints. Define a artial ordering ab on P as follows: For, q P, let ab q if and only if the ray q intersects side bc and the ray q intersects side ac of the triangle. One can readily check that the relation ab is indeed transitive. Partial orders ac and bc can be introduced in a similar manner. Note that any two oints of P are related by exactly one of these three relations. Thus, a reeated alication of Dilworth s theorem [6] gives that there is a subset P of P of size P > ( ) n+k 4 k, which is linearly ordered with resect to one of the three artial orders, say bc.
8 8 GY. KÁROLYI, G. TÓTH Consider a Cartesian system whose horizontal axis meets the rays ab and ac at equal angles and the oints of P lie in the uer half lane. The first coordinates of the elements of P follow each other according to the linear order bc. Since X, and hence P too, does not contain an n-ca, according to Lemma 6 it must contain a k-cu,..., k. It is clear that {a, b, c,,..., k } F k. Thus, F k X as claimed. Given a family of sets Y, Y,..., Y m, a transversal of this family is an m- element set {y, y,..., y m } such that y i Y i for i =,,...,m. One key to the roof of Theorem 5 is the following same tye lemma due to Bárány and Valtr. Lemma 7. [4] For every integer t there is a ositive c t with the following roerty. Assume that X, X,..., X t are lanar oint sets such that X X X t in general osition. Then there are subsets Y i X i with Y i c t X i, such that all transversals of Y, Y,..., Y t belong to the same order tye. Proof of Theorem 5. Let X be an order tye of cardinality X > c 0 n α, which does not contain C n. We rove that if c 0 = c 0 (k, l, m) and α = α(k, l, m) are sufficiently large, then G k;l,m X. Let X X, and assume that no two oints of X lie on a vertical line. Choose a large enough integer t = t(k, l, m) whose value will be secified later. According to a result of Aronov et al. [], every configuration of N oints contains two mutually avoiding subsets of size at least N/0. By a reeated alication, we can obtain airwise mutually avoiding subsets X, X,...X t, such that X i > c n β holds for every i t with β > α/t. Using Lemma 7, we can find subsets X i X i, X i > c n β such that any transversal of X, X,...X t is of the same order tye. In view of the Erdős Szekeres theorem (Lemma 6), there is a sequence i, i,... i s such that s log 4 t, and any transversal of X i, X i,...x i s is in convex osition. For simlicity, we denote X i j by Y j. Consider now any ordered air (Y i, Y j ), i, j s. Define a binary relation on the oints of Y i. For, q Y i, let q if and only if has smaller x- coordinate than q, and all oints of Y j lie above the line q. It is not hard to see that is a artial ordering. According to Dilworth s theorem, there is either a chain or an antichain of size Y i > c 3 n β/. Suose that C Y i is such a chain (res. antichain). Then all oints of Y j are above (res. below) every line determined by C. Delete all oints of Y i which are not in that chain (res. antichain).
9 FORBIDDEN ORDER TYPES 9 Proceed analogously for each ordered air (Y i, Y j ). Denote the resulting sets by i Y i, i =,...s. Now we have the family,,... s, such that any transversal of,,... s is in convex osition, in this counterclockwise order, for any air ( i, j ), j is either above, or below every line determined by i, and i > c 4 n γ holds for every i s with γ = β/ t. Define now a four-coloured comlete grah on the vertex set {,...,s} as follows. For any i < j, we know that j is either above, or below every line determined by i, and i is either above, or below every line determined by j. So we have four ossibilities for the air ( i, j ), that determines the color of the edge ij. Call the correonding colours aa, ab, ba, and bb, resectively. By Ramsey s theorem, there is a comlete monochromatic subgrah of size r log 56 s. Suose without loss of generality that its vertices are,...,r. Now we should distinguish four cases. Since reflection in the x-axis interchanges the above and below relations, is will be enough to consider two cases. Case : All edges are coloured with colour aa. Case : All edges are coloured with colour ab. r 3 r r Figure 3. Cases and. Now we assume that t is big enough so that r k. We choose the value of c 0 and α so that {( ) n + l c 4 n γ > max, l ( n + m m )}.
10 0 GY. KÁROLYI, G. TÓTH X does not contain n oints in convex osition, therefore does not contain an n-cu. It follows from Lemma 6 that in either case contains an (m + )-ca C = { 3, r,..., r m, 4 }. For i =,...k 3, choose a oint i+3 i. In Case, we use the fact that k does not contain an n-cu, therefore it must contain an (l+)-ca C k = {, q,...,q l, }. In Case, we use the fact that k does not contain an n-ca, therefore it must contain an (l + )-cu C k = {, q l,...,q, }. k 5 k Figure 4. Finding G k;l,m. In either case, the set C k C { 5,..., k } is a configuration whose order tye is G k;l,m. It is roved that G k;l,m X. 4. Order Tyes with Triangular Convex Hull The following result describes the growth of the function F T (n) for order tyes T whose convex hull has three vertices. Theorem 8. Let T C 3 be an order tye whose convex hull is C 3. (i) If T = E k for some integer k, then F T (n) is bounded by a linear function in n. (ii) If T = F k for some integer k 3, then F T (n) is at least quadratic in n but bounded by a olynomial in n. (iii) If T E k, F k, then F T (n) is exonentially large in n. Proof. Part (i) and the lower bound in (ii) is contained in Theorems 3 and 6, resectively, of the earlier aer [4]. The uer bound in (ii) can be obtained
11 FORBIDDEN ORDER TYPES with a slight modification of Theorem 4 therein, which we described in the revious section. The key to the third satatement is the following lemma, whose roof we ostone until the end of this section. Lemma 9. Let n be a ositive integer and let T be an order tye of a configuration of 3 oints contained in the convex hull of other 3 oints. If T is contained in both LN H n and RN H n, then T = E 3, or T = F 3. Let T be a configuration of at least 4 oints such that its convex hull is a triangle abc, and the relations T LNH n, T RNH n hold for some ositive integer n. If T 5, then T E = F, or T E = F. If 6 T = k + 3, then Lemma 9 imlies that S E 3 F 3 holds for every 6-element configuration S T. It follows that line q intersects the same two sides, say ac and bc, of triangle abc for each air of two different oints, q T \ {a, b, c}. That is, the elements of T \ {a, b, c} can be ordered as,..., k so that the rays i j and j i intersect sides bc and ac, resectively, for every i < j k. Assume that T i = {a, b, c, i, i+, i+ } F 3 and T i+ = {a, b, c, i+, i+, i+3 } E 3 for some i k 3. Then oints i+, i+, i+3 lie inside triangle i bc so that line i+ i+ intersects sides i b and bc, whereas line i+ i+3 intersects sides i c and bc of the triangle (Fig. ), a contradiction. By symmetry, it is not ossible that T i E 3 and T i+ F 3. Therefore T i must belong to the same order tye, either E 3 or F 3, for every i k 3. Accordingly, T E k or T F k. c a i+ i i+ i+3 b Figure 5. S = {b, c, i, i+, i+, i+3 } E 3 F 3.
12 GY. KÁROLYI, G. TÓTH Thus we roved that if T E k, F k, then either LN H n or RN H n does not contain T for every integer n. From Lemma it follows that f T (n+) > n and f T has exonential growth as claimed. It remains to rove Lemma 9. If T E 3, F 3, then T is either one of the four order tyes deicted on Fig. 6, or one of the mirror images C, D. c c c c z z z z a x y b a x y b a x y b a x y b A B C D Figure 6. Order tyes of six oints. We must rove that neither of these six order tyes is contained in both LN H n and RN H n. Since A has the searation roerty, it is not conteined in any twin construction. Therefore neither LN H n nor RN H n does contain A. Next we rove that B is not contained in RN H n. Assume that on the contrary, a configuration {a, b, c, x, y, z} B is contained in RNH n. Condider the smallest k such that {x, y, z} is contained in RNH k (i) for some i n k. Both RNH k (i ) and RNH k (i) must contain at least one of x, y, z. Because of the threefold symmetry of B and the central symmetry of RNH n, without any loss of generality we may suose that x, y RNH k (i ) and z RNH k (i). Note that z is inside triangle xyc. Now c RNH k (j) for some j n k+. Here j i, for otherwise any vertical line that searates RNH k (i ) and RNH k (i) would searate {x, y, c} from z. It is equally imossible that j = i, since in that case both x and y would lie below the line cz, so cz would not searate x and y. Finally, were j > i, both x and y would lie left to the line cz, again a contradiction. To see that C is not contained in LN H n, we assume that a configuration {a, b, c, x, y, z} C is contained in LNH n and that k is the smallest integer such that {x, y, z} LNH k (i) for some i n k. Having lost the threefold symmetry, we must distinguish three subcases.
13 FORBIDDEN ORDER TYPES 3 Case : z LNH k (i ) and x, y LNH k (i). For z is inside triangle xyc, mirroring the revious argument we find that c cannot be in any subset LNH k (j). Case : y LNH k (i ) and x, z LNH k (i). Now we use the fact that y is inside triangle zxb. We arrive at a contradiction as before: there is no lace for the oint b. Case 3: x LNH k (i ) and y, z LNH k (i). Because of the orientation of triangle xyz, the oints x, y, z follow each other from left to right in this order. Since the orientation of both triangles yzb and yzc is clockwise, both b and c must lie under any horizontal line l that searates LNH k (i ) and LNH k (i). Point x sees y, z and c in this order, therefore c must lie in LNH k (i). For triangle abc to contain z, oint a must lie above l. But then line ax cannot searate z and c, a contradiction. Thus we have roved that C is indeed not contained in LN H n. By symmetry, C is not contained in RN H n. A similar argument demonstrating that RN H n does not contain D comletes the roof. We omit the technical details. Acknowledgment This aer was comleted during the secial semester on Discrete and Comutational Geometry held at the EPFL Lausanne, sonsored by the Centre Interfacultaire Bernoulli and the Swiss National Science Foundation. References [] N. Alon, J. Pach, and J. Solymosi, Ramsey-tye theorems with forbidden subgrahs, Combinatorica (00) [] B. Aronov, P. Erdős, W. Goddard, D.J. Kleitman, M. Klugerman, J. Pach, and L.J. Schulman, Crossing families, Combinatorica 4 (994) 7-34 [3] I. Bárány and Gy. Károlyi, Problems and results around the Erdős Szekeres convex olygon theorem, in: Discrete and Comutational Geometry, (J. Akiyama et al., eds.), Lecture Notes in Comuter Science 098, Sringer (00) 9 05 [4] I. Bárány and P. Valtr, A ositive fraction Erdős-Szekeres theorem, Discrete Comut. Geom. 9 (998) [5] M. Chudnovsky and S. Safra, The Erdős-Hajnal conjecture for bull-free grahs, J. Combin. Theory B 98 (008) [6] R.P. Dilworth, A decomosition theorem for artially ordered sets, Annals Math. 5 (950) 6 66 [7] P. Erdős and A. Hajnal, Ramsey-tye theorems, Discrete Al. Math. 5 (989) 37 5
14 4 GY. KÁROLYI, G. TÓTH [8] P. Erdős and G. Szekeres, A combinatorial roblem in geometry, Comositio Math. (935) [9] P. Erdős and G. Szekeres, On some extremum roblems in elementary geometry, Ann. Univ. Sci. Budaest. Eötvös, Sect. Math. 3/4 (960 6) 53 6 [0] J. Fox and B. Sudakov, Induced Ramsey-tye theorems, Adv. Math. 9 (008) [] A. Gyárfás, Reflections on a roblem of Erdős and Hajnal, in: The Mathematics of Paul Erdős (R.L. Graham and J. Nešetřil, eds.) Algorithms and Combinatorics 4 Volume II, Sringer (997) [] J.D. Horton, Sets with no emty convex 7-gons, Canadian Math. Bull. 6 (983) [3] G. Kalai, Private communication, IAS Princeton (000) [4] Gy. Károlyi and J. Solymosi, Erdős Szekeres theorem with forbidden order tyes, J. Combin. Theory A 3 (006) [5] Gy. Károlyi and P. Valtr, Point configurations in d-sace without large subsets in convex osition, Discrete Comut. Geom. 30 (003) [6] W. Morris and V. Soltan, The Erdős-Szekeres roblem on oints in convex osition a survey, Bull. Amer. Math. Soc. 37 (000) [7] J. Nešetřil and P. Valtr, A Ramsey roerty of order tyes, J. Combin. Theory A 8 (998) [8] G. Tóth and P. Valtr, The Erdős-Szekeres theorem: uer bounds and related results, in: Combinatorial and Comutational Geometry (J.E. Goodman et al., eds.), Publ. M.S.R.I. 5 (005) address: address: karolyi@cs.elte.hu Gyula Károlyi geza@renyi.hu Géza Tóth
Point Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)
Point Location Prerocess a lanar, olygonal subdivision for oint location ueries. = (18, 11) Inut is a subdivision S of comlexity n, say, number of edges. uild a data structure on S so that for a uery oint
More informationAssignment 9; Due Friday, March 17
Assignment 9; Due Friday, March 17 24.4b: A icture of this set is shown below. Note that the set only contains oints on the lines; internal oints are missing. Below are choices for U and V. Notice that
More informationResearch Statement. Andrew Suk
Research Statement Andrew Suk 1 Introduction My research interests are combinatorial methods in discrete geometry. In particular, I am interested in extremal problems on geometric objects. My research
More information6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks
6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In
More informationThe Online Freeze-tag Problem
The Online Freeze-tag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE-3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,
More informationStudia Scientiarum Mathematicarum Hungarica 41 (2), 243 266 (2004)
Studia Scientiarum Mathematicarum Hungarica 4 (), 43 66 (004) PLANAR POINT SETS WITH A SMALL NUMBER OF EMPTY CONVEX POLYGONS I. BÁRÁNY and P. VALTR Communicated by G. Fejes Tóth Abstract A subset A of
More informationOn an anti-ramsey type result
On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element
More informationMean Ramsey-Turán numbers
Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average
More informationSQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID
International Journal of Comuter Science & Information Technology (IJCSIT) Vol 6, No 4, August 014 SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS
ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS Liviu Grigore Comuter Science Deartment University of Illinois at Chicago Chicago, IL, 60607 lgrigore@cs.uic.edu Ugo Buy Comuter Science
More informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
More informationRamsey numbers for bipartite graphs with small bandwidth
Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São
More informationUnited Arab Emirates University College of Sciences Department of Mathematical Sciences HOMEWORK 1 SOLUTION. Section 10.1 Vectors in the Plane
United Arab Emirates University College of Sciences Deartment of Mathematical Sciences HOMEWORK 1 SOLUTION Section 10.1 Vectors in the Plane Calculus II for Engineering MATH 110 SECTION 0 CRN 510 :00 :00
More informationSECTION 6: FIBER BUNDLES
SECTION 6: FIBER BUNDLES In this section we will introduce the interesting class o ibrations given by iber bundles. Fiber bundles lay an imortant role in many geometric contexts. For examle, the Grassmaniann
More informationThe number of generalized balanced lines
The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l
More informationIntroduction to NP-Completeness Written and copyright c by Jie Wang 1
91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of
More informationThe Magnus-Derek Game
The Magnus-Derek Game Z. Nedev S. Muthukrishnan Abstract We introduce a new combinatorial game between two layers: Magnus and Derek. Initially, a token is laced at osition 0 on a round table with n ositions.
More informationABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).
Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical Sciences
More informationCollinear Points in Permutations
Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationA Modified Measure of Covert Network Performance
A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy
More informationERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS*
BOLYAI SOCIETY MATHEMATICAL STUDIES, 11 Paul Erdos and his Mathematics. II, Budapest, 2002, pp. 367-373. ERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS* Problems and results
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationNON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1
NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 R. Thangadurai Stat-Math Division, Indian Statistical Institute, 203, B. T. Road, Kolkata 700035, INDIA thanga v@isical.ac.in Received: 11/28/01,
More informationBaltic Way 1995. Västerås (Sweden), November 12, 1995. Problems and solutions
Baltic Way 995 Västerås (Sweden), November, 995 Problems and solutions. Find all triples (x, y, z) of positive integers satisfying the system of equations { x = (y + z) x 6 = y 6 + z 6 + 3(y + z ). Solution.
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationPOISSON PROCESSES. Chapter 2. 2.1 Introduction. 2.1.1 Arrival processes
Chater 2 POISSON PROCESSES 2.1 Introduction A Poisson rocess is a simle and widely used stochastic rocess for modeling the times at which arrivals enter a system. It is in many ways the continuous-time
More informationMore Properties of Limits: Order of Operations
math 30 day 5: calculating its 6 More Proerties of Limits: Order of Oerations THEOREM 45 (Order of Oerations, Continued) Assume that!a f () L and that m and n are ositive integers Then 5 (Power)!a [ f
More informationPRIME NUMBERS AND THE RIEMANN HYPOTHESIS
PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationInduced subgraphs of Ramsey graphs with many distinct degrees
Journal of Combinatorial Theory, Series B 97 (2007) 62 69 www.elsevier.com/locate/jctb Induced subgraphs of Ramsey graphs with many distinct degrees Boris Bukh a, Benny Sudakov a,b a Department of Mathematics,
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationPrecalculus Prerequisites a.k.a. Chapter 0. August 16, 2013
Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, Ph.D. Lakeland Community College Jeff Zeager, Ph.D. Lorain County Community College August 6, 0 Table of Contents 0 Prerequisites 0. Basic Set
More informationTree-representation of set families and applications to combinatorial decompositions
Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationA Class of Three-Weight Cyclic Codes
A Class of Three-Weight Cyclic Codes Zhengchun Zhou Cunsheng Ding Abstract arxiv:30.0569v [cs.it] 4 Feb 03 Cyclic codes are a subclass of linear codes have alications in consumer electronics, data storage
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationCMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma
CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are
More informationCoordinate Transformation
Coordinate Transformation Coordinate Transformations In this chater, we exlore maings where a maing is a function that "mas" one set to another, usually in a way that reserves at least some of the underlyign
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationHigh degree graphs contain large-star factors
High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationON MONOCHROMATIC SUBSETS OF A RECTANGULAR GRID. 1. Introduction
ON MONOCHROMATIC SUBSETS OF A RECTANGULAR GRID MARIA AXENOVICH AND JACOB MANSKE Abstract. For n N, let [n] denote the integer set {0,,..., n }. For any subset V Z, let Hom(V ) = {cv + b : c N,b Z }. For
More informationThe positive minimum degree game on sparse graphs
The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University
More informationTilings of the sphere with right triangles III: the asymptotically obtuse families
Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada
More informationAnalysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs
Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationarxiv:1203.1525v1 [math.co] 7 Mar 2012
Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined
More informationDiffuse Reflection Radius in a Simple Polygon
Diffuse Reflection Radius in a Simple olygon Eli Fox-Epstein Csaba D. Tóth Andrew Winslow arxiv:1402.5303v3 [cs.cg] 17 May 2015 Abstract It is shown that every simple polygon in general position with n
More informationSelected practice exam solutions (part 5, item 2) (MAT 360)
Selected practice exam solutions (part 5, item ) (MAT 360) Harder 8,91,9,94(smaller should be replaced by greater )95,103,109,140,160,(178,179,180,181 this is really one problem),188,193,194,195 8. On
More informationGeneralized Induced Factor Problems
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationOdd induced subgraphs in graphs of maximum degree three
Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationElements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
More informationOn three zero-sum Ramsey-type problems
On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics
More informationVector Notation: AB represents the vector from point A to point B on a graph. The vector can be computed by B A.
1 Linear Transformations Prepared by: Robin Michelle King A transformation of an object is a change in position or dimension (or both) of the object. The resulting object after the transformation is called
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationComputational Finance The Martingale Measure and Pricing of Derivatives
1 The Martingale Measure 1 Comutational Finance The Martingale Measure and Pricing of Derivatives 1 The Martingale Measure The Martingale measure or the Risk Neutral robabilities are a fundamental concet
More informationLecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS
1 Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS This lecture, just as the previous one, deals with a classification of objects, the original interest in which was perhaps
More informationX How to Schedule a Cascade in an Arbitrary Graph
X How to Schedule a Cascade in an Arbitrary Grah Flavio Chierichetti, Cornell University Jon Kleinberg, Cornell University Alessandro Panconesi, Saienza University When individuals in a social network
More informationPh.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor
Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationMA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More information1 Gambler s Ruin Problem
Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.
ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional
More informationSOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q. 1. Quadratic Extensions
SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q TREVOR ARNOLD Abstract This aer demonstrates a few characteristics of finite extensions of small degree over the rational numbers Q It comrises attemts
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationRemoving Even Crossings
EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,
More informationOn-line Ramsey numbers
On-line Ramsey numbers David Conlon Abstract Consider the following game between two players, Builder and Painter Builder draws edges one at a time and Painter colours them, in either red or blue, as each
More informationCOUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
More informationMathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC. Lee Mosher
Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC Lee Mosher Let S be a compact surface, possibly with the extra structure of an orientation or a finite set of distinguished
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationTenacity and rupture degree of permutation graphs of complete bipartite graphs
Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China
More informationx 2 f 2 e 1 e 4 e 3 e 2 q f 4 x 4 f 3 x 3
Karl-Franzens-Universitat Graz & Technische Universitat Graz SPEZIALFORSCHUNGSBEREICH F 003 OPTIMIERUNG und KONTROLLE Projektbereich DISKRETE OPTIMIERUNG O. Aichholzer F. Aurenhammer R. Hainz New Results
More informationFALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem
Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of fault-tolerant
More informationPythagorean Triples and Rational Points on the Unit Circle
Pythagorean Triles and Rational Points on the Unit Circle Solutions Below are samle solutions to the roblems osed. You may find that your solutions are different in form and you may have found atterns
More informationComplex Conjugation and Polynomial Factorization
Comlex Conjugation and Polynomial Factorization Dave L. Renfro Summer 2004 Central Michigan University I. The Remainder Theorem Let P (x) be a olynomial with comlex coe cients 1 and r be a comlex number.
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationCoin ToGa: A Coin-Tossing Game
Coin ToGa: A Coin-Tossing Game Osvaldo Marrero and Paul C Pasles Osvaldo Marrero OsvaldoMarrero@villanovaedu studied mathematics at the University of Miami, and biometry and statistics at Yale University
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationSHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE
SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless
More informationAN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC
AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.
More informationMaximum Hitting Time for Random Walks on Graphs. Graham Brightwell, Cambridge University Peter Winkler*, Emory University
Maximum Hitting Time for Random Walks on Graphs Graham Brightwell, Cambridge University Peter Winkler*, Emory University Abstract. For x and y vertices of a connected graph G, let T G (x, y denote the
More informationGeometry of Vectors. 1 Cartesian Coordinates. Carlo Tomasi
Geometry of Vectors Carlo Tomasi This note explores the geometric meaning of norm, inner product, orthogonality, and projection for vectors. For vectors in three-dimensional space, we also examine the
More informationHOLES 5.1. INTRODUCTION
HOLES 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More information