An Upper Bound on Stick Numbers for Links
|
|
- Rhoda Glenn
- 5 years ago
- Views:
Transcription
1 An Upper Bound on Stick Numbers for Links Erik Insko August 24, 2005 Abstract We employ a supercoiling tangle construction to economically construct any pieceweise linear integral tangle containing seven or more crossings. This method, which can be extended to construct links of large crossing numbers with minimal stick numbers, gives a new upper bound for the stick number of a minimal crossing algebraic link with crossing number greater than or equal to seven times the number of tangles and non-algebraic links with crossing number greater than four times the number of tangles. 1 Introduction We will introduce some background information on integral tangles, algebraic tangles, arborescent links, basic polyhedrons, and non-algebraic links. We will also introduce the technique of constructing algebraic knots from the PL standard form of trees created by McCabe [2], and explain how non-algebraic can be constructed from their graphs. A series of adjacent vertical or horizontal crossings between two strands with four arcs emerging in the four compass directions, NW, NE, SW, and SE, is called an integral tangle. Examples of integral tangles are depicted in part (a) of Diagram 1.1. Notice that each tangle has four strands leaving it. If we connect two arcs from one tangle to two arcs from another tangle, then the two tangles are said to be connected algebraically and create an algebraic tangle. The most basic type of algebraic tangle is an integral tangle. We can construct more complex algebraic tangles by connecting two integral or algebraic tangles together by two of their exiting strands. So an algebraic tangle is any combination of integral tangles connected by two strands with four strands exiting it. Examples of two algebraic tangles are depicted in part (b) Diagram
2 Integral Tangles and Algebraic Tangles According to Conway [3], any link projection can be viewed as a collection of algebraic tangles, and a link which possesses a projection consisting of only one algebraic tangle is called an algebraic link, as shown in Diagram 1.2. An Algebraic Link Arborescent links are simply links that can be constructed by connecting up the strands and tangles as specified by a tree. McCabe [2] states that all algebraic links are arborescent, and she goes on to give a standard form for the trees corresponding to algebraic links. In her standard form, McCabe defines stumps to be vertices of a tree that have only one edge connecting them to the rest of the tree. Twigs are defined to be vertices with two adjacent edges, one connecting it to the rest of the tree and one extending down to a stump. An example of a twig is circled in (c) of Diagram According to McCabe, if there is a vertex in a PL standard form tree that adjoins only stumps and twigs with the possible exception of one edge that extends upward, and if there are at least two stumps and/or twigs extending downward from that vertex, then that vertex together with the adjoining stumps and twigs below it is a defined to be a fan. Some examples of fans are represented in Diagram and their corresponding tangle projections are represented in
3 Link Construction from a Tree in PL Standard Form We will now run through two examples of construction from the trees (b) and (d) in Diagram Let s start with tree (b). We will say that every stump has degree 4 for simplicity, and we will start our construction from the lower right fan because it is the lowest part of the tree. Since the four stumps of the fan lie in the third row, we will construct an algebraic tangle with four horizontal integral tangles stacked on top of each other, each containing four crossings. Now if we look at the vertex adjacent to the fan we see that it has a twig connected to it, and that twig has a stump located lying in the third row just to the left of the fan. This means that we need to connect another horizontal tangle with four twists to the left side of the algebraic tangle we just made. Now we can complete the link by connecting the strands leaving the algebraic tangle, NW to NE and SW to SE. The resulting link is shown in Diagram Now we will construct the link for tree (d). Again we will say that each vertex is of degree 4, and we will start by constructing the lower right fan because it is in the lowest row. Its stumps are in the fourth row of vertices so they represent vertical tangles set side by side. The vertex above this fan has one stump in the third row extending off of it and to the left of the fan, so we will connect a horizontal integral tangle to the left side of the fan. Now the vertex above that has another fan extending down from it with stumps in the third row. So we will attach a fan with two horizontal tangles to the left side of the algebraic tangle we just constructed. Now to finish up the link, again we connect the strands exiting the algebraic tangle, NW to NE and SW to SE. The resuling link is shown below in Diagram
4 Now that we have seen a couple examples of fan construction from the PL standard form of a tree, we should note a few of the PL standard forms attributes. (1) Every PL standard form tree has at least one fan. (2) If there is more than one fan in a tree, then each fan will appear at the bottom of the branch it is connected to. (3) Starting at the bottom fan, the vertex above it will connect to one of the following (a) a stump, (b) a twig, (c) another fan, or (d) a more complex portion of the tree with at least one fan farther down, as shown in Diagram (4) The top vertex of the tree always has degree zero and represents a horizontal zero integral tangle, the second row of vertices represent vertical integral tangles, the third row of vertices represent horizontal integral tangles, and this alternating pattern continues all the way down the tree. So the odd rows represent horizontal tangles and the even rows represent vertical tangles. Basic Polyhedron and Non-Algebraic Links According to Conway [3], a basic polyhedron is an edge-connected 4-valent planar map containing no regions with two vertices. We can obtain knot diagrams from polyhedra by substituting algebraic tangles in for vertices. Note that since an algebraic link has only one algebraic tangle, its basic polyhedron will have only one vertex, and will look like a figure eight, as shown in Diagram
5 Any non-algebraic link can be constructed from a basic polyhedron with every vertex connecting to four other distinct vertices. Two basic examples of graphs that can be used to construct non-algebraic links are depicted in Diagram 1.6 as well as a non-algebraic link constructed by replacing each vertex with an algebraic tangle. Note that since a non-algebraic link comes from a polyhedron with regions surrounded by four vertices, every algebraic tangle in a non-algebraic link will be connected to four distinct algebraic tangles. 2 The Supercoiling Construction Method of an Integral Tangle Let s begin by examining how supercoiling works. If we look at the two integral tangles in Diagram 2.0, notice that there are two outside strands and inside of them is a dotted core. We will say that the number of times that the outer two strands cross each other is the crossing number, and that the number of times that the dotted core crosses over itself is the writhe. In the case of the integral tangle (a) in Diagram 2.0 the two outer strands cross eachother 4 times, yet the dotted core is planar and does not cross itself at all. Therefore the crossing number is 4 and the writhe is 0. Now if we look at integral tangle (b), it is evident that the writhe is 1, and it appears that the crossing number is only 2. In fact however, wherever the core crosses itself, the two strands cross each other twice, as shown in the circled regions. Therefore integral tangle (b) has four crossings. Now if we grab ahold of the ends of the core and the two strands in (b) and pull on their edges, straightening the core out so that it is planar, then the writhe becomes 0, but the crossing number is 4. Hence (a) and (b) 5
6 are projections of the same integral tangle. This means that we can add two crossings to a tangle by either adding a full twist to the two outside strands or adding a crossing to the inner core. When we choose to add a crossing to the inner core we increase the writhe by 1. This process of adding crossings to an integral tangle by writhing is known as supercoiling, and is found naturally in DNA strands [6]. Need to fix crossings! PUT IN PICTURE OF MCCABES TANGLE!!!!!!!!!!!!!!!!!!!!!!! McCabe [2] constructed tangles with stick number equal to the crossing number plus one. With the supercoiling method of constructing piecewise linear integral tangles we can match or improve on this upper bound for tangles where the crossing number of the tangle is greater than or equal to seven times the number of tangles. Below is the supercoiling construction method for integral tangles. Theorem 1. Let T be an integral tangle with crossing number c(t ) 7, then the upper bound on stick number is s(t ) 2c(T ) Proof We will start by drawing a horizontal dotted line and labeling its left endpoint 1 and its right endpoint 2. Then we will draw another dotted line extending down from vertex 2 at a 45 degree angle with the horizontal and label its endpoint 3. Now we can draw another dotted line from vertex 3 staight up at a 90 degree angle with the horizontal, labeling its vertex 4. If we think of the line (1, 2) as lying on a plane, we can lower point 3 so that it lies just below that plane. After lowering point 3 just slightly, the line (3, 4) ends up crossing under (1, 2). Our result is the core of our tangle and is pictured below in Diagram 2.1 below. Then at endpoint 1 of the line (1, 2), we can push off a small distance directly below the vertex, draw a point, and label it A 1. Then we can push off the same distance directly above vertex 1 and draw another point labeled B 1. At endpoint 2 we will repeat this process labeling the point below the vertex B 2 and the point above A 2.. We will draw a line connecting the upper left point B 1 to the upper right point A 2, and another line connecting the lower left point A 1 with the lower right point B 2. The resulting graph will look like Diagram
7 Now at vertex 3 we will push off to the right and draw a point A 3 and to the left draw a point B 3. Now we draw the lines (B 2, A 3 ) and (A 2, B 3 ), and the resulting graph should look like Diagram 2.3 below. We will now move to vertex 4, pushing off to the right to draw point B 4 and to the left to draw point A 4. Now we can draw the lines (A 3, B 4 ) and (B 3, A 4 ). The result is Diagram 2.4. Recall that we have drawn line (3, 4) so that it lies just below line (1, 2). If we think of lines (B 3, A 4 ) and (A 3, B 4 ) as running along at an arbitrarily small distance from (3, 4), then (B 3, A 4 ) and (A 3, B 4 ) will also cross just under (B 1, A 2 ) and (A 2, B 1 ). So we can trim (B 3, A 4 ) and (A 3, B 4 ) to show that they cross under (1, 2),(B 1, A 2 ), and (A 2, B 1 ). Diagram 2.5 is a close up view of how this crossing should look. Let s now consider the point labeled A 1 as being raised up an arbitrarily small distance above point 1, and B 1 as lowered below point 1. Continue this process, raising all points (A 2,, A 4 ) above their nearest vertex on the dashed core, and lowering all points (B 2,, B 4 ) below their nearest vertex on the dashed core. (Think of A as standing for above and B as standing for below.) Now that all (A 1,, A 4 ) are above (1,, 4) which are above (B 2,, B 4 ) we can determine whether a strand has over or under crossing by looking at its nearest vertex. If its vertex is labeled B then it will be an under-crossing. If it is labeled A then it will be an over-crossing. If it is on the dashed line (ie. it is labeled by a whole number) then it will be above the B but below the A. Hence we end up with Diagram
8 If we were to replace the two rigid outside strands of Diagram 2.6 with flexible strands then we would end up with the usual representation of an integral tangle, two strands twisted around each other. This transformation is shown in Diagram Note that the crossing number for this tangle is c(t ) = 4. Diagram We could add an additional 3 crossings for every two sticks by repeating the following process. Draw another dotted line segment from endpoint 4 down over the line segment (1, 2) creating an endpoint 5. A 5 should lie to the left of 5 and B 5 should lie to the right. Then draw the solid lines (B 4, A 5 ) and (A 4, B 5 ). The result should be Diagram 2.7. With the addition of two more sticks we now have a tangle with three more crossings. Thus it has s(t ) = 8 and c(t ) = 7. Notice that we can continue this process of adding two sticks and three crossings indefinitely. So we have a method for constructing supercoiled integral tangles with c(t ) 1 mod 3. Now if we take the tangle in Diagram 2.6 and erase lines (A 2, B 3 ) and (B 2, A 3 ) and draw lines (A 2, A 3 ) and (B 2, B 3 ), we end up with Diagram Notice that (A 2, A 3 ) will cross over (B 2, B 3 ) three different times. The tangle is not alternating, but if use a type II Reidemeister move and push the point A 3 up so that it lies on the other side of (B 2, B 3 ), as shown in Diagram 2.8.2, we have constructed an alternating tangle with s(t ) = 6 and c(t ) = 3. Now if we were to follow our general process of adding two more sticks 8
9 and three more crossings, as we did before, we will get a tangle with s(t ) = 8 and c(t ) = 6. This process can be repeated to obtain any tangle with crossing number c(t ) 0 mod 3. For tangles with crossing numbers c(t ) 2 mod 3 we use a slightly different process to modify the tangle in Diagram 2.6. Starting with that tangle we erase lines A 2, B 3 and B 2, A 3, and place an extra point E to the right of A 3, as shown in Diagram Then we draw line (A 2, A 3 ), and lines (B 2, E) and (E, B 3 ). Point E should be raised above both points A 2 and A 3. So line (B 3, E) will cross under (A 3, B 4 ) and over (A 2, A 3 ). The result is the tangle in Diagram Notice that this tangle has a stick number s(t ) = 7 and crossing number c(t ) = 5. If we added another two sticks and three crossings we would get s(t ) = 9 and c(t ) = 8. Indeed we can continue this process for all super-coiled integral tangles of crossing numbers c(t ) 2 mod 3. Using this construction, the stick number for a tangle s(t ) for a tangle with crossing number c(t ) is s(t ) 2c(T ) The 2 3 comes from adding two sticks and three crossings and the 10 3 comes from the fact that you do not get any crossings until the fourth stick, (Consult Diagram 2.3). It should be noted that, although McCabe s tangle construction is more efficient for tangles with crossing number 1 c(t ) 6, the supercoiling construction is as effective as McCabe s for 7 c(t ) 9, and is the better method for minimizing stick number of an integral tangle of any crossing number c(t ) Standard Form of Integral Tangle Lemma 1. We can construct any supercoiled integral tangle while keeping the endpoints of the strands exiting the tangle fixed in the same plane. Proof 9
10 We will first draw the core. Looking at Diagram 3.1, notice that points 1, 2, 3, and 4 are all fixed in the same plane and that the crossing between, (1, 4) and (2, 3) is simply a double point. If we lower point 4 so that it is just slightly below the plane of (1, 2, 3) then (1, 4) will cross under (2, 3), and points 1 and 2 remain fixed. Diagram 3.2 shows the resulting core. Looking at Diagram 3.3, notice that to construct this core we simply replaced line (3, 4) with the two line segments (3, 5) and (4, 5). Therefore points 1, 2, and 3 still lie in the same plane. We can lower point 5 just slightly below point 4 and we will again have an alternating core with points 1 and 2 still fixed in the same plane as shown in Diagram 3.4. The core in Diagram 3.5 can be constructed by simply replacing line segment (4, 5) with two segments (4, 6) and (5, 6), and raising point 6 slightly above point 4. We can repeat this process in order to construct a core for any crossing tangle we wish, while still keeping the strands exiting the tangle, (1, 4) and (2, 3), fixed throughout the process. Now that we know we can keep the points 1 and 2 fixed in the same plane while constructing an alternating core, we will add the two piecewise linear strands. We will keep the points A 1, B 1, A 2, and B 2 fixed in the same plane as 1 and 2, only raising the points A 3, A 4,, A 6 a small distance above the core and lowering points B 3, B 4,, B 6 below the core. As 10
11 shown in Diagram 3.6. Note that the strands (A 1, B 4 ), (A 4, B 1 ), (A 2, B 3 ), and (A 3, B 2 ) all intersect the plane (1, 2, 3) in the arbitrarily small neighborhoods of points 1 and 2. Note that while the tangle in Diagram 3.6 has ten crossings, we can extend this same process for any number of crossings and still keep the strands exiting the tangle fixed in the same place. One last note about Diagram 3.6 is that the neighborhoods of points 1 and 2 do not have to lie on the circle we can adjust the core so that the points 1 and 2 as far away from the tangle as we wish. We could extend these neighborhoods so far away from the tangle, that the tangle itself appears to be a vertex. This will become important in the construction of fans. Now let s examine the characteristics of vertical and horizontal piecewise linear supercoiled integral tangles. Diagram 3.7 shows supercoiled vertical and horizontal tangles that are constructed using sticks. With supercoiled tangles we can see that any vertical tangle will have four strands exiting out of each of the four quadrants NW, NE, SW, and SE. So our tangles are in agreement with Conway s definition of an integral tangle[3]. We should note that there is also a great deal of flexibility as to where those strands exit out of their respective quadrants. Looking at Diagram 3.8 we can see that we can rotate the inside strands of a tangle from lying parallel to the outside strands to any angle inside the outer strands as long as they remain crossing. If we spread the outer strands to 179 degrees apart from one another, then the two inside strands can essentially rotate anywhere in that 179 degree span provided they remain crossing each other. 11
12 Lemma 2. All supercoiled piecewise linear integral tangles can be constructed so that their two outside strands exit at an angle arbitrarily close to 180 degrees from each other. Proof If we look at the tangle in Diagram 3.9 and flatten its edges together like an accordion so that the vertices 3, 4, 5, 6, 7, 8 are arbitrarily close, then we could create a tangle with the two outside edges extending out just shy of 180 degrees, as depicted in Diagram Note that we could add as many vertices to this tangle as we like, and since the strands of a knot are of an infitesimal thickness, it follows that, no matter how many crossings a tangle has, its outside strands can still be made to exit at an angle slightly less than 180 degrees apart from one another. Furthermore, if we decide to construct all tangles so that their two outside strands extend outward at an angle of 179 degrees, then we can rotate the two inside strands to any angle inside that 179 degrees as long as they remain crossing, as shown shown in Diagram We will consider the form of the integral tangle where the outside strands are 179 degrees apart and the inside strands are free to rotate inside that 179 degrees to be our standard building blocks of piecewise linear algebraic links, and thus, we call this form our PL standard form of integral tangles. PL Standard Form of a Supercoiled Integral Tangle 12
13 4 Construction of Fans We now begin constructing fans using our supercoiled tangles made of sticks. Theorem 2. We can construct a vertical or horizontal fan with T 1, T 2,..., T n supercoiled tangles with crossing numbers c(t ) by attaching the cores of those n tangles at two set vertices 1 and 2, and connecting the supercoiled tangles so 2c(T ) that the fan s stick number is s(f ) Proof Recall that the neighborhoods of points 1 and 2 can lie anywhere on the strands that we choose. These neighborhoods simply denote where the four exiting strands intersect the plane (1, 2, 3). Now if we draw two cores with strands departing at slightly different angles, we can connect the tangles by adjoining the strands at the neighborhoods of points 1 and 2, as shown in Diagram 4.1. THERE IS STILL THE FAN WITH ONE TWIG, BUT THIS CAN BE CONNECTED WITHOUT ADDING ANY ADDITIONAL STICKS AS SHOWN IN DIAGRAM Diagram 4.2 is a horizontal fan, but a vertical fan can be constructed by rotating a horizontal fan 90 degrees. Note that we can continue adding tangles to our fan by attaching more integral tangle cores to points 1 and 2, thus constructing a fan with T 1, T 2,..., T n integral tangles as is depicted in Diagram 4.3. Since we can construct any fan of T n tangles by using only the sticks in the integral tangles our stick number for the fan is simply the sum of the stick 2c(Ti ) numbers of our n tangles s(f ). 13
14 Lemma 3. Since we construct our fans from PL standard form integral tangles, the strands will exit the fan in the same manner as the strands exiting our integral tangles. Proof Looking at Diagram 4.4 we can see that, like an integral tangle, we can rotate the exiting strands of a fan so that the outside strands exit the fan at an angle of 179 degrees from each other, and that the inside strands can rotate within that 179 degree span as long as they cross. Looking at Diagram 4.5, note that if we cover up the circle so all we see are the strands exiting it, we would not be able to tell a fan from our standard form of an integral tangle. Therefore, a fan of this form will be our PL standard form of a fan. 5 Constructing Algebraic Links by Connecting Tangles and Fans Now that we know how to construct supercoiled integral tangles out of sticks and fans out of supercoiled integral tangles, all that remains is to connect them up. Theorem 3. The stick number of any algebraic link with T 1, T 2,..., T n integral 2(c(Ti )) tangles is s(k) + 2. Proof From property 4 of a PL standard form tree in the introduction: Starting at the bottom fan and constructing it in our PL standard form for fans, we will 2(c(T )) have a stick number s(f ). Now there are four possible objects the fan will have to connect up to. Case 1: When a fan is connected to a stump. The stump corresponds to a tangle of a different orientation (ie. if the fan is vertical, then it will connect to a horizontal tangle). This can be done without adding any sticks, as shown in Diagram 5.1. So the algebraic tangle formed in case 1, containing a fan and an integral tangle, will have a stick number s(f ) + s(t ), which is the sum of the stick numbers of the integral tangles in the fan, plus the stick number of the one additional integral tangle. Therefore the stick number of the new algebraic tangle will simply be the sum of the stick numbers of all the integral tangles 14
15 contained in that algebraic tangle. If we say that there are n integral tangles 2c(T ) contained in this new algebraic tangle, then s(c 1 ). Note that since it is constructed from PL standard integral tangles, the algebraic tangle formed in case 1 has strands that exit in the same fashion as our PL standard integral tangle. Case 2: When a fan is connected to a twig. The twig corresponds to a tangle with the same orientation (ie. if the fan is vertical, the tangle will be vertical as well). This can be done without adding any additional sticks, as shown in Diagram 5.2. So the stick number of the new algebraic tangle constructed in case 2 is just the sum of the stick numbers for all of the integral tangles in this new algebraic tangle. Again if we say that this tangle has n integral tangles, 2c(T ) then s(c 2 ). Like the tangle formed in case 1, the algebraic tangle formed in case 2 also has strands that exit in the same fashion as our PL standard integral tangle. Case 3: When a fan is connected to another fan. The fan that we are connecting to will be of the same orientation as the fan we started with, and this can be done without adding any new sticks, as shown in Diagram 5.3. Thus the algebraic tangle containing two fans will have a stick number of s(f 1 )+s(f 2 ) Here again if there are n integral tangles in the algebraic tangle constructed in 2c(T ) case 3, then s(c 3 ), and the algebraic tangle has strands that exit in the PL standard form of an integral tangle. 15
16 Case 4: When a fan is connected to a more complex portion of a tree with a fan farther down. The complicated algebraic tangle will be a combination of the algebraic tangles in cases 1 through 3, and can be connected without adding anymore sticks, as shown in Diagram 5.4. The stick number of the more complicated portion of the tree s(cp ) will be the sum of the sticks used in all the integral tangles contained in that portion, so s(cp ) s(t 1 )+s(t 2 )+...+s(t n ). Thus the stick number of the algebraic tangle constructed in case 4 will be the sum of the stick numbers of the integral tangles in the fan plus the sum of the stick numbers of the integral tangles in the more complicated portion. Hence, if the algebraic tangle constructed in case 4 contains T 1, T 2,..., T n integral tangles, then the stick number is the sum of the stick number of all the integral tangles 2c(T ) contained in that algebraic tangle, s(c 4 ). Yet again, the algebraic tangle in case 4 has strands exiting in a similar fashion to the PL standard integral tangle. To conclude, we can construct any algebraic tangle we wish without adding anymore sticks than those contained in the integral tangles. To connect up the four open strands of any algebraic tangle we will need at most 2 additional 2(c(T )) sticks. Ergo, s(k) + 2. Since all of the cases form integral tangles with strands exiting in the fashion of an integral tangle, we will define algebraic tangles of this form our PL standard algebraic tangles. 16
17 6 A New Upper Bound for Stick Number of Non-Algebraic Links Negami proved that the stick number for any knot is s(k) 2c(K), which is the only known upper bound on the stick number of non-algebraic links. If the number of crossings in a non-algebraic link equals the number of tangles, then this bound is sharp. However if the crossing number is somewhat greater than the twist number, then a better bound can be determined. Theorem 4. If T c(k) 4T then s(k) 2c(T ), but if c(k) 4T then if there are T 1, T 2,..., T n integral tangles contained a non-algebraic link, then 2c(Ti ) s(k) 2T +. Proof Notice that the edge number of any graph representing a polyhedral link is two times the number of vertices, because each vertex has degree 4. If we let each edge correspond to a stick and each vertex correspond to either an algebraic or integral tangle, then the stick number of the graph is s(k) = 2T. Now let s take these vertices and blow them up into little circles, as shown in Diagram 6.1. Now if we can show that it is possible to take our supercoiled tangles and place them in each circle so that the strands exiting the tangle attach to the edges of the planar graph, then we can add the stick number of each tangle with the 2T sticks of the planar graph and we get a link with s(k) 2T + 2c(Ti ). Looking at any vertex of the graph in Diagram 6.1 it is easy to see that we can in fact connect up the 4 exiting strands of our tangle with the four edges of the graph. As long as we take the two outside edges of our tangle and connect them up with two adjacent edges of the graph. Then connecting the two inside strands to the two remaining edges of the graph is quite simple, as shown in Diagrams 6.2 and
18 If we look at Diagram 6.4 we can see that by connecting the two outside strands to two adjacent edges of the graph we leave the two inside strands open to connect to the other two edges of the graph, but the two inside strands are free to rotate within that 179 degree span. Ergo, no matter where the other two edges of the graph intersect the circle encompassing the tangle, we will be able to rotate the two inside strands so that they connect to these edges. Recall that the strands exiting any of our algebraic tangles behave just like the strands exiting our integral tangles; so the same construction process works for them as well. Thus, our stick number for any alternating non-algebraic knot is just the sum of the stick numbers of our integral tangles, plus the edges of the graph. If we have T 1, T 2,..., T n integral tangles contained in our non-algebraic link, then the stick number will be s(k) 2T + n 2c(Ti) Conclusions Now that we know that the stick number for any knot with c(k) 7n, where 2(c(Ti )) T n is the number of integral tangles, is s(k) +2 we could attempt to improve on this bound by saving additional sticks when connecting up separate algebraic tangles. If we are able to run one strand of an algebraic tangle straight into another algebraic tangle, then there is the possibility of a considerable reduction in stick number. Likewise, now that we know the stick number of any non-algebraic link is s(k) 2T + n 2c(Ti) , we can strive to improve this bound by allowing the edges of the graph to rotate out 18
19 of the plane. If feasible, this rotation would allow us to run a strand from one algebraic tangle into another, saving us atleast one stick per tangle. 8 Acknowledgements The author would like to thank Dr. Rolland Trapp and Dr. Joseph Chavez for their guidance. This research was conducted at the CSUSB Summer REU, jointly sponsored by California State University, San Bernadino and NSF-REU Grant DMS References [1] C. L. McCabe, An upper bound on edge numbers of 2-bridge knots and links, J. Knot Theory Ramif. 7 (1998) [2] C. L. McCabe, Constructing algebraic links for low edge numbers, [3] J. H. Conway, An enumeration of knots and links, and some of their algebraic properties, ed. Leech, Pergammon Press, New York (1970) [4] S. Negami, Ramsey theorems for knots, links, and spatial graphs, Trans. Amer. Math. Soc. 324 (1991) [5] E. Rawdon and R. G. Sharein, Upper bounds for equilateral stick numbers, in Physical Knots: Knotting, Linking, and Folding Geometric Objects in R 3, eds. J. Calvo et al, Amer. Math. Soc. (2002). [6] D.W. Sumners, Untangling DNA, The Mathematical Intelligencer 12 (1990)
Stick Numbers of Links with Two Trivial Components
Stick Numbers of Links with Two Trivial Components Alexa Mater August, 00 Introduction A knot is an embedding of S in S, and a link is an embedding of one or more copies of S in S. The number of copies
More informationGeneralized Cell Decompositions of Nested Lorenz Links
Generalized Cell Decompositions of Nested Lorenz Links illiam Coenen August 20, 2018 Abstract This paper focuses on generalizing the cell decompositions of various nested Lorenz links to determine types
More informationRopelength of braids and tangle decomposition of knots REU in Mathematics at CSUSB Summer 2007
Ropelength of braids and tangle decomposition of knots REU in Mathematics at CSUSB Summer 2007 Sarah Ruether Saint Mary s University of Minnesota August 24, 2007 Abstract This paper looked into the upperbounds
More informationLinear Ropelength Upper Bounds of Twist Knots. Michael Swearingin
Linear Ropelength Upper Bounds of Twist Knots Michael Swearingin August 2010 California State University, San Bernardino Research Experience for Undergraduates 1 Abstract This paper provides an upper bound
More informationNESTED AND FULLY AUGMENTED LINKS
NESTED AND FULLY AUGMENTED LINKS HAYLEY OLSON Abstract. This paper focuses on two subclasses of hyperbolic generalized fully augmented links: fully augmented links and nested links. The link complements
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationDecomposition of the figure-8 knot
CHAPTER 1 Decomposition of the figure-8 knot This book is an introduction to knots, links, and their geometry. Before we begin, we need to define carefully exactly what we mean by knots and links, and
More informationarxiv: v1 [math.gt] 11 May 2018
TRIPLE CROSSING NUMBER AND DOUBLE CROSSING BRAID INDEX DAISHIRO NISHIDA arxiv:1805.04428v1 [math.gt] 11 May 2018 Abstract. Traditionally, knot theorists have considered projections of knots where there
More informationTree Congestion for Complete n-partite Graphs
Tree Congestion for Complete n-partite Graphs Allen Cox August 24, 2007 Abstract The tree congestion and number of edge disjoint paths existing in n- partite graphs is explored, along with the spanning
More informationFigure 1: A positive crossing
Notes on Link Universality. Rich Schwartz: In his 1991 paper, Ramsey Theorems for Knots, Links, and Spatial Graphs, Seiya Negami proved a beautiful theorem about linearly embedded complete graphs. These
More informationGeometric Exploration of T-Links using Lorenz Link Correspondence
Geometric Exploration of T-Links using Lorenz Link Correspondence Ryan Rhoades August 17, 2018 Abstract Interested in studying T-links in hyperbolic space, we will explore other links and surfaces to obtain
More informationThe Tree Congestion of Graphs
The Tree Congestion of Graphs Diana Carr August 2, 2005 Abstract Edge congestion can be thought of as the cutwidth of a graph In this paper we embed complete tripartite graphs into trees and spanning trees
More informationElementary Planar Geometry
Elementary Planar Geometry What is a geometric solid? It is the part of space occupied by a physical object. A geometric solid is separated from the surrounding space by a surface. A part of the surface
More informationSpanning tree congestion critical graphs
Spanning tree congestion critical graphs Daniel Tanner August 24, 2007 Abstract The linear or cyclic cutwidth of a graph G is the minimum congestion when G is embedded into either a path or a cycle respectively.
More informationVOLUME AND GEOMETRY OF HOMOGENEOUSLY ADEQUATE KNOTS
VOLUME AND GEOMETRY OF HOMOGENEOUSLY ADEQUATE KNOTS PAIGE BARTHOLOMEW, SHANE MCQUARRIE, JESSICA S. PURCELL, AND KAI WESER arxiv:1406.0195v2 [math.gt] 17 Jun 2014 Abstract. We bound the hyperbolic volumes
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
More informationOn the number of distinct directions of planes determined by n points in R 3
On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines
More informationCrossing Numbers on the Disk with Multiple Holes
Crossing Numbers on the Disk with Multiple Holes Albert Soh Under the Direction of Mr. Gaku Liu Project Suggested by Professor Jacob Fox Massachusetts Institute of Technology Research Science Institute
More informationSection 1: Introduction to Geometry Points, Lines, and Planes
Section 1: Introduction to Geometry Points, Lines, and Planes Topic 1: Basics of Geometry - Part 1... 3 Topic 2: Basics of Geometry Part 2... 5 Topic 3: Midpoint and Distance in the Coordinate Plane Part
More informationTwo-bridge knots and links
CHAPTER 0 Two-bridge knots and links In this chapter we will study in detail a class of knots and links that has particularly nice geometry, namely the class of 2-bridge knots and links. The key property
More informationFrom planar graphs to embedded graphs - a new approach to Kauffman and Vogel s polynomial
arxiv:math/0005128v1 [math.gt] 12 May 2000 From planar graphs to embedded graphs - a new approach to Kauffman and Vogel s polynomial Rui Pedro Carpentier Departamento de Matemática and Centro de Matemática
More informationDefinition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.
Math 3181 Dr. Franz Rothe Name: All3181\3181_spr13t1.tex 1 Solution of Test I Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points. Definition
More informationUnit 2A: Angle Pairs and Transversal Notes
Unit 2A: Angle Pairs and Transversal Notes Day 1: Special angle pairs Day 2: Angle pairs formed by transversal through two nonparallel lines Day 3: Angle pairs formed by transversal through parallel lines
More informationSubstituting a 2 b 2 for c 2 and using a little algebra, we can then derive the standard equation for an ellipse centred at the origin,
Conics onic sections are the curves which result from the intersection of a plane with a cone. These curves were studied and revered by the ancient Greeks, and were written about extensively by both Euclid
More informationDrawing cubic graphs with at most five slopes
Drawing cubic graphs with at most five slopes B. Keszegh, J. Pach, D. Pálvölgyi, and G. Tóth Abstract We show that every graph G with maximum degree three has a straight-line drawing in the plane using
More informationBrief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions
Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationTHE BRAID INDEX OF ALTERNATING LINKS
THE BRAID INDEX OF ALTERNATING LINKS YUANAN DIAO, GÁBOR HETYEI AND PENGYU LIU Abstract. It is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced
More informationAnd Now From a New Angle Special Angles and Postulates LEARNING GOALS
And Now From a New Angle Special Angles and Postulates LEARNING GOALS KEY TERMS. In this lesson, you will: Calculate the complement and supplement of an angle. Classify adjacent angles, linear pairs, and
More informationApril 6, In collaboration with Rollie Trapp, California State University, San Bernadino. Ramsey Number and Other Knot Invariants
In collaboration with Rollie Trapp, California State University, San Bernadino April 6, 2013 Knots A knot is a closed curve embedded in three dimensions which is not self-intersecting. Of particular interest
More information3 and 4-Bandwidth Critical Graphs
and -Bandwidth Critical Graphs nn Kilzer ugust, 00 bstract This paper investigates and -bandwidth critical graphs. It concludes Holly Westerfield s proof that only six types of -bandwidth critical graphs
More informationThe statement implies that any three intersection points of two distinct planes lie on a line.
Math 3181 Dr. Franz Rothe February 23, 2015 All3181\3181_spr15ts1.tex 1 Solution of Test Name: Problem 1.1. The second part of Hilbert s Proposition 1 states: Any two different planes have either no point
More informationQuestion 2: How do you solve a linear programming problem with a graph?
Question : How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.
More informationProblem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009
Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.
More informationGeometric Entities for Pilot3D. Copyright 2001 by New Wave Systems, Inc. All Rights Reserved
Geometric Entities for Pilot3D Copyright 2001 by New Wave Systems, Inc. All Rights Reserved Introduction on Geometric Entities for Pilot3D The best way to develop a good understanding of any Computer-Aided
More informationK 4,4 e Has No Finite Planar Cover
K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005
More information1 Introduction To construct a branched covering of a 3-manifold M, we start with a tamely embedded knot or link L ρ M (the branch set) and a represent
Kirby diagrams from branched-covering presentations Frank J. Swenton Department of Mathematics Middlebury College Middlebury, VT 05753 Email: fswenton@alumni.princeton.edu Abstract We present an algorithm
More informationRubber bands. Chapter Rubber band representation
Chapter 1 Rubber bands In the previous chapter, we already used the idea of looking at the graph geometrically, by placing its nodes on the line and replacing the edges by rubber bands. Since, however,
More informationSummer 2009 REU:Knot Theory, Lower Bound for Rope Length of m-almost alternating knots
Summer 2009 REU:Knot Theory, Lower Bound for Rope Length of m-almost alternating knots Charley Mathes August 21, 2009 Abstract For any given link conformation L that admits an alternating, almost-alternating,
More informationCURVES OF CONSTANT WIDTH AND THEIR SHADOWS. Have you ever wondered why a manhole cover is in the shape of a circle? This
CURVES OF CONSTANT WIDTH AND THEIR SHADOWS LUCIE PACIOTTI Abstract. In this paper we will investigate curves of constant width and the shadows that they cast. We will compute shadow functions for the circle,
More informationarxiv: v1 [math.co] 17 Jan 2014
Regular matchstick graphs Sascha Kurz Fakultät für Mathematik, Physik und Informatik, Universität Bayreuth, Germany Rom Pinchasi Mathematics Dept., Technion Israel Institute of Technology, Haifa 2000,
More informationMatching and Planarity
Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of
More informationA NOTE ON BLOCKING VISIBILITY BETWEEN POINTS
A NOTE ON BLOCKING VISIBILITY BETWEEN POINTS Adrian Dumitrescu János Pach Géza Tóth Abstract Given a finite point set P in the plane, let b(p) be the smallest number of points q 1,q 2,... not belonging
More information7th Bay Area Mathematical Olympiad
7th Bay Area Mathematical Olympiad February 22, 2005 Problems and Solutions 1 An integer is called formidable if it can be written as a sum of distinct powers of 4, and successful if it can be written
More informationA note on Gaussian graphs. John W. Kennedy, Pace University, New York, NY 10038
A note on Gaussian graphs John W. Kennedy, Pace University, New York, NY 10038 Brigitte and Herman Servatius, Worcester Polytechnic Institute, Worcester, MA 01609-2280 Abstract A graph is Gaussian if it
More informationA new analysis technique for the Sprouts Game
A new analysis technique for the Sprouts Game RICCARDO FOCARDI Università Ca Foscari di Venezia, Italy FLAMINIA L. LUCCIO Università di Trieste, Italy Abstract Sprouts is a two players game that was first
More informationLines and Angles. Chapter INTRODUCTION
LINES AND ANGLES 9 3 Lines and Angles Chapter 5 5.1 INTRODUCTION You already know how to identify different lines, line segments and angles in a given shape. Can you identify the different line segments
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationSimple Graph. General Graph
Graph Theory A graph is a collection of points (also called vertices) and lines (also called edges), with each edge ending at a vertex In general, it is allowed for more than one edge to have the same
More informationarxiv: v1 [math.co] 7 Dec 2018
SEQUENTIALLY EMBEDDABLE GRAPHS JACKSON AUTRY AND CHRISTOPHER O NEILL arxiv:1812.02904v1 [math.co] 7 Dec 2018 Abstract. We call a (not necessarily planar) embedding of a graph G in the plane sequential
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationComputational Geometry
Casting a polyhedron CAD/CAM systems CAD/CAM systems allow you to design objects and test how they can be constructed Many objects are constructed used a mold Casting Casting A general question: Given
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
More informationUnit 1, Lesson 1: Moving in the Plane
Unit 1, Lesson 1: Moving in the Plane Let s describe ways figures can move in the plane. 1.1: Which One Doesn t Belong: Diagrams Which one doesn t belong? 1.2: Triangle Square Dance m.openup.org/1/8-1-1-2
More informationThe Linear Cutwidth of Complete Bipartite and Tripartite Graphs
The Linear Cutwidth of Complete Bipartite and Tripartite Graphs Stephanie Bowles August 0, 00 Abstract This paper looks at complete bipartite graphs, K m,n, and complete tripartite graphs, K r,s,t. The
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More information5. THE ISOPERIMETRIC PROBLEM
Math 501 - Differential Geometry Herman Gluck March 1, 2012 5. THE ISOPERIMETRIC PROBLEM Theorem. Let C be a simple closed curve in the plane with length L and bounding a region of area A. Then L 2 4 A,
More informationTHE DNA INEQUALITY POWER ROUND
THE DNA INEQUALITY POWER ROUND Instructions Write/draw all solutions neatly, with at most one question per page, clearly numbered. Turn in the solutions in numerical order, with your team name at the upper
More informationto hyperbolic 3-manifolds. Dehn Surgery Approach to The Figure-Eight Knot Complement
Hyperbolic 3-Manifolds Dehn Surgery Approach to The Figure-Eight Knot Complement Sarah Dubicki, 11 Math 490: Senior Independent Study Advisor Dr. Barbara Nimershiem May 5, 2011 Abstract This project provides
More informationGeometry Vocabulary Math Fundamentals Reference Sheet Page 1
Math Fundamentals Reference Sheet Page 1 Acute Angle An angle whose measure is between 0 and 90 Acute Triangle A that has all acute Adjacent Alternate Interior Angle Two coplanar with a common vertex and
More information7. The Gauss-Bonnet theorem
7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed
More informationDIHEDRAL GROUPS KEITH CONRAD
DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 taking a regular n-gon back to itself, with the operation being composition. These polygons
More informationTwist knots and augmented links
CHAPTER 7 Twist knots and augmented links In this chapter, we study a class of hyperbolic knots that have some of the simplest geometry, namely twist knots. This class includes the figure-8 knot, the 5
More information2nd GRADE-Math Year at a Glance
2nd Grade - Math Year at a Glance: 2017-2018 Chariton Community School District Operations and Algebraic Thinking Represent and solve problems Number and Operations in Base Ten Use place value understanding
More informationarxiv:math/ v1 [math.gt] 29 Aug 2006
arxiv:math/0608739v1 [math.gt] 29 Aug 2006 An Introduction to Virtual Spatial Graph Theory Thomas Fleming Department of Mathematics University of California, San Diego La Jolla, CA 92093-0112 tfleming@math.ucsd.edu
More informationOn the Minimum Number of Convex Quadrilaterals in Point Sets of Given Numbers of Points
On the Minimum Number of Convex Quadrilaterals in Point Sets of Given Numbers of Points Hu Yuzhong Chen Luping Zhu Hui Ling Xiaofeng (Supervisor) Abstract Consider the following problem. Given n, k N,
More informationThe Geodesic Integral on Medial Graphs
The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection
More informationDIHEDRAL GROUPS KEITH CONRAD
DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 of the plane preserving a regular n-gon, with the operation being composition. These polygons
More informationEuler's formula and Platonic solids
University of Washington Euler's formula and Platonic solids Name: David Clark, Kelsey Kyllo, Kurt Maugerle, Yue Yuan Zhang Course Number: Math 445 Professor: Julia Pevtsova Date: 2013/06/03 Table of Contents:
More informationGenus Ranges of 4-Regular Rigid Vertex Graphs
Genus Ranges of 4-Regular Rigid Vertex Graphs Dorothy Buck Department of Mathematics Imperial College London London, England, UK d.buck@imperial.ac.uk Nataša Jonoska Egor Dolzhenko Molecular and Computational
More informationVisit MathNation.com or search "Math Nation" in your phone or tablet's app store to watch the videos that go along with this workbook!
Topic 1: Introduction to Angles - Part 1... 47 Topic 2: Introduction to Angles Part 2... 50 Topic 3: Angle Pairs Part 1... 53 Topic 4: Angle Pairs Part 2... 56 Topic 5: Special Types of Angle Pairs Formed
More informationEdge Guards for Polyhedra in Three-Space
Edge Guards for Polyhedra in Three-Space Javier Cano Csaba D. Tóth Jorge Urrutia Abstract It is shown that every polyhedron in R with m edges can be guarded with at most 27 2m The bound improves to 5 6
More informationGraph Theory Mini-course
Graph Theory Mini-course Anthony Varilly PROMYS, Boston University, Boston, MA 02215 Abstract Intuitively speaking, a graph is a collection of dots and lines joining some of these dots. Many problems in
More informationBELTED SUM DECOMPOSITION OF FULLY AUGMENTED LINKS
BELTED SUM DECOMPOSITION OF FULLY AUGMENTED LINKS PORTER MORGAN, DEAN SPYROPOULOS, ROLLIE TRAPP, AND CAMERON ZIEGLER Abstract. Purcell and Adams have introduced notions of nerves and belted sums for fully
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationBasics of Geometry Unit 1 - Notes. Objective- the students will be able to use undefined terms and definitions to work with points, lines and planes.
asics of Geometry Unit 1 - Notes Objective- the students will be able to use undefined terms and definitions to work with points, lines and planes. Undefined Terms 1. Point has no dimension, geometrically
More informationKuratowski Notes , Fall 2005, Prof. Peter Shor Revised Fall 2007
Kuratowski Notes 8.30, Fall 005, Prof. Peter Shor Revised Fall 007 Unfortunately, the OCW notes on Kuratowski s theorem seem to have several things substantially wrong with the proof, and the notes from
More informationEuclid s Elements Workbook
Euclid s Elements Workbook August 7, 2013 Introduction This is a discovery based activity in which students use compass and straightedge constructions to connect geometry and algebra. At the same time
More informationModule 4. Stereographic projection: concept and application. Lecture 4. Stereographic projection: concept and application
Module 4 Stereographic projection: concept and application Lecture 4 Stereographic projection: concept and application 1 NPTEL Phase II : IIT Kharagpur : Prof. R. N. Ghosh, Dept of Metallurgical and Materials
More informationarxiv: v1 [math.gt] 24 May 2012
A CLASSIFICATION OF SPANNING SURFACES FOR ALTERNATING LINKS COLIN ADAMS AND THOMAS KINDRED arxiv:1205.5520v1 [math.gt] 24 May 2012 Abstract. A classification of spanning surfaces for alternating links
More informationLicom Systems Ltd., Training Course Notes. 3D Surface Creation
, Training Course Notes Work Volume and Work Planes...........................1 Overview..........................................1 Work Volume....................................1 Work Plane......................................1
More informationSolution of the Heawood Map-Coloring Problem--Case 8 GERHARD RINGEL AND J. W. T. YOUNGS*
JOURNAL OF COMBINATORIAL THEORY 7, 33-363 (1969) Solution of the Heawood Map-Coloring Problem--Case 8 GERHARD RINGEL AND J. W. T. YOUNGS* Free University of Berlin, Berlin, Germany, and University of California,
More informationLINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.
3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.1 Graphing Systems of Linear Inequalities in Two Variables Copyright Cengage Learning. All rights reserved.
More informationDrawing cubic graphs with at most five slopes
Drawing cubic graphs with at most five slopes Balázs Keszegh János Pach Dömötör Pálvölgyi Géza Tóth October 17, 2006 Abstract We show that every graph G with maximum degree three has a straight-line drawing
More informationMath 170, Section 002 Spring 2012 Practice Exam 2 with Solutions
Math 170, Section 002 Spring 2012 Practice Exam 2 with Solutions Contents 1 Problems 2 2 Solution key 10 3 Solutions 11 1 1 Problems Question 1: A right triangle has hypothenuse of length 25 in and an
More informationGlossary of dictionary terms in the AP geometry units
Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]
More informationPRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES
UNIT 12 PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES (A) Main Concepts and Results Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines,
More informationEXTERNAL VISIBILITY. 1. Definitions and notation. The boundary and interior of
PACIFIC JOURNAL OF MATHEMATICS Vol. 64, No. 2, 1976 EXTERNAL VISIBILITY EDWIN BUCHMAN AND F. A. VALENTINE It is possible to see any eleven vertices of an opaque solid regular icosahedron from some appropriate
More informationPACKING TRIANGLES ON A SPHERE
PACKING TRIANGLES ON A SPHERE ISAAC OTTONI WILHELM Abstract. The question of how many regular unit tetrahedra with a vertex at the origin can be packed into the unit sphere is a well-known and difficult
More informationMathematics Background
Finding Area and Distance Students work in this Unit develops a fundamentally important relationship connecting geometry and algebra: the Pythagorean Theorem. The presentation of ideas in the Unit reflects
More informationMath 6, Unit 8 Notes: Geometric Relationships
Math 6, Unit 8 Notes: Geometric Relationships Points, Lines and Planes; Line Segments and Rays As we begin any new topic, we have to familiarize ourselves with the language and notation to be successful.
More informationAn Investigation of Closed Geodesics on Regular Polyhedra
An Investigation of Closed Geodesics on Regular Polyhedra Tony Scoles Southern Illinois University Edwardsville May 13, 2008 1 Introduction This paper was undertaken to examine, in detail, results from
More informationIntroduction to Graph Theory
Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /
More informationGuts of surfaces and colored Jones knot polynomials
Guts of surfaces and colored Jones knot polynomials David Futer, Efstratia Kalfagianni, and Jessica S. Purcell Knots in Poland III: Conference on Knot Theory and its Ramifications, Stefan Banach International
More informationMth 97 Winter 2013 Sections 4.3 and 4.4
Section 4.3 Problem Solving Using Triangle Congruence Isosceles Triangles Theorem 4.5 In an isosceles triangle, the angles opposite the congruent sides are congruent. A Given: ABC with AB AC Prove: B C
More informationObjective- the students will be able to use undefined terms and definitions to work with points, lines and planes. Undefined Terms
Unit 1 asics of Geometry Objective- the students will be able to use undefined terms and definitions to work with points, lines and planes. Undefined Terms 1. Point has no dimension, geometrically looks
More informationWhich n-venn diagrams can be drawn with convex k-gons?
Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple
More informationRigid Tilings of Quadrants by L-Shaped n-ominoes and Notched Rectangles
Rigid Tilings of Quadrants by L-Shaped n-ominoes and Notched Rectangles Aaron Calderon a, Samantha Fairchild b, Michael Muir c, Viorel Nitica c, Samuel Simon d a Department of Mathematics, The University
More information2-1 Transformations and Rigid Motions. ENGAGE 1 ~ Introducing Transformations REFLECT
2-1 Transformations and Rigid Motions Essential question: How do you identify transformations that are rigid motions? ENGAGE 1 ~ Introducing Transformations A transformation is a function that changes
More information