Tilings of Parallelograms with Similar Right Triangles
|
|
- Sabrina McCormick
- 5 years ago
- Views:
Transcription
1 Discrete Comput Geom (2013) 50: DOI /s Tilings of Parallelograms with Similar Right Triangles Zhanjun Su Chan Yin Xiaobing Ma Ying Li Received: 1 October 2012 / Revised: 29 April 2013 / Accepted: 3 June 2013 / Published online: 18 June 2013 Springer Science+Business Media New York 2013 Abstract We say that a triangle T tiles the polygon A if A can be decomposed into finitely many non-overlapping triangles similar to T. A tiling is called regular if there are two angles of the triangles, say α and β, such that at each vertex V of the tiling the number of triangles having V as a vertex and having angle α at V is the same as the number of triangles having angle β at V. Otherwise the tiling is called irregular. Let P(δ) be a parallelogram with acute angle δ. In this paper we prove that if the parallelogram P(δ) is tiled with similar triangles of angles (α,β,π/2), then (α, β) = (δ, π/2 δ) or (α, β) = (δ/2,π/2 δ/2), and if the tiling is regular, then only the first case can occur. Keywords Parallelogram Regular and irregular tiling Right triangle We say that a triangle T tiles the polygon A if A can be decomposed into finitely many non-overlapping triangles similar to T. In fact, it is in general very difficult to determine the set of similar triangles which tile a given polygon. Previous papers [1 4,6] have looked at tiling polygons with similar triangles. In such case one starts with a collection of triangles and are allowed to scale the triangles when placing them. Recently, Laczkovich [5] has looked at tiling polygons, particularly regular triangles, squares, rectangles, and regular n-gons with n large enough, with congruent triangles. Clearly, the number of distinct non-similar triangles T such that parallelogram P can be dissected into finitely many triangles similar to T is infinite. In this paper we look at tiling parallelograms with similar right triangles. Let us recall some definitions from [4]. Let A be a polygon with vertices V 1,...,V N, and suppose that A is decomposed into non-overlapping similar triangles 1,..., t Z. Su (B) C. Yin X. Ma Y. Li College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang , People s Republic of China suzj888@163.com
2 470 Discrete Comput Geom (2013) 50: of angles α, β, γ.letv 1,...,V m (m N) be an enumeration of the vertices of the triangles 1,..., t. For each i = 1,...,m we denote by p i (resp. q i and r i )the number of those triangles j whose angle at the vertex V i is α (resp. β and γ ). If i N and the angle of A at the vertex V i is δ i, then If i > N then we have either or p i α + q i β + r i γ = δ i. (1) p i α + q i β + r i γ = 2π (2) p i α + q i β + r i γ = π. (3) Namely, (2) holds if V i is in the interior of A and whenever V i is on the boundary of a triangle j then necessarily V i is a vertex of j. In the other cases (3) holds. It is clear that the coefficients p i, q i, r i must satisfy p i = q i = r i = t. (4) The tiling will be called regular if one of the following statements is true: p i = q i for every i = 1,...,m; p i = r i for every i = 1,...,m; q i = r i for every i = 1,...,m. Otherwise the tiling is called irregular. Let P(δ) be a parallelogram with acute angle δ. We first consider the regular tilings of parallelograms with similar right triangles and get the following theorem. Theorem 1 If parallelogram P(δ) has a regular tiling with similar right triangles of angles (α,β,π/2), then (α, β) = (δ, π/2 δ). Proof Suppose that P(δ) can be regularly tiled with similar right triangles of angles (α,β,π/2). If at each vertex of the tiling the number of angles α is the same as that of β, then for the angle δ at a vertex of P(δ) we let δ = p(α + β) + r π/2, where p, r are integers. But 0 <δ<π/2, which is impossible. Therefore by symmetry we may assume that at each vertex of the tiling the number of angles β is the same as that of right angles π/2. In the following we shall consider Eqs. (1) (3). We first consider Eq. (1) and rewrite it as pα+r(β+π/2) = δ or π δ, where p andr are integers. If pα+r(β+π/2) = δ, then by 0 <δ<π/2 we get δ = pα. This implies that only the angle α occurs at the vertex with angle δ.ifpα + r(β + π/2) = π δ, then by π/2 <π δ<πwe have r = 0 or 1. When r = 1, we obtain p = 0, and thus π δ = β + π/2. So δ = α and (α, β) = (δ, π/2 δ), the result is true. When
3 Discrete Comput Geom (2013) 50: Fig. 1 Regular tiling r = 0, we have π δ = pα. Therefore only the angle α occurs at the vertex with angle π δ. Secondly, we consider Eq. (2) and rewrite it as pα + r(β + π/2) = 2π. Clearly, r 3. If r = 0, then only α occurs. If r = 1, then each of β and π/2 occurs once and α occurs p times with p > 1. If r = 2, then p = 2 and each of α, β, π/2 occurs twice. If r = 3, then p = 0 and β = π/6, and thus (α, β) = (π/3,π/6).byδ = pα, we get p = 1 and (α, β) = (δ, π/2 δ), the result is true. Thirdly, we consider Eq. (3) and denote it by pα +r(β +π/2) = π. Clearly, r 1. If r = 1, then p = 1, and thus each of the angles α, β, π/2 occurs once at the vertices with angle π.ifr = 0, then π = pα. From the discussions above we conclude that if (α, β) = (δ, π/2 δ) then at the vertices with angles π or 2π the number of angle α occurs is not less than that of β and at vertices with angles δ or π δ only angle α occurs, which contradicts Eq. (4), and the proof is complete. Figure 1 shows that the right triangle (δ, π/2 δ, π/2) can regularly tile the parallelogram P(δ). In order to consider the irregular tiling of parallelograms with similar right triangles, we introduce the following lemma. Lemma 2 The parallelogram P(3π/10) cannot be tiled with similar right triangles of angles (π/10, 2π/5,π/2). Proof Suppose that P(3π/10) can be tiled with similar right triangles of angles (π/10, 2π/5,π/2). Then by Theorem 2 of [2], we may assume that the coordinates of each vertex of P(3π/10) and of the triangles of the tiling belong to the field Q(cot(π/10)). Now, by Lemma 8 of[2], we have Q(cot(π/10)) Q(ζ ), where ζ = e (π/20)i. Also, since 3 is prime to 20, there is an automorphism φ of Q(ζ ) such that φ ( cot a 10 π) = cot 3a 10 π for every a not divisible by 10. Consider the map (x, y) = (φ(x), φ(y)) (x, y Q(ζ )). This map defines a collineation that maps every triangle of the tiling into a triangle of angles (3π/10,π/5,π/2).Also, does not change the orientation of these triangles (see pp of [2]). Now maps P(3π/10) into a parallelogram of angles 9π/10
4 472 Discrete Comput Geom (2013) 50: and π/10. Therefore, the conjugate tiling induced by gives a tiling of parallelogram of angles 9π/10 and π/10 with triangles of angles (3π/10,π/5,π/2). But this is clearly impossible, since the angles of the triangles are greater than π/10. This proves the lemma. Theorem 3 If the parallelogram P(δ) has an irregular tiling with similar right triangles of angles (α,β,π/2), then (α, β) = (δ, π/2 δ) or (α, β) = (δ/2,π/2 δ/2). Proof Suppose that P(δ) has an irregular tiling with similar right triangles of angles (α,β,π/2). Ifα = β, then (α,β,π/2) = (π/4,π/4,π/2) and this is the case of (δ, π/2 δ, π/2). Therefore, we may assume that α>β, and thus π/4 <α<π/2. Since the tiling is irregular, there is an equation pα +qβ +r π/2 = τ with p > q and τ {δ, π δ, π, 2π}, where p, q, r are integers. That is, (p q)α = τ (q +r) π/2. We need to consider the following cases. Case 1: τ = δ. In this case we have (p q)α = δ (q + r) π/2. Since p > q and δ<π/2, we get q + r = 0, and thus pα = δ. Since α>π/4, this implies p = 1, α = δ, and (α, β) = (δ, π/2 δ). Case 2: τ = π δ. Suppose (p q)α = π δ (q + r) π/2. This implies q + r 1. If q + r = 0, then pα = π δ. Since π/4 <α<π/2, we get p = 2or p = 3. If p = 2, then α = π/2 δ/2 and we have (α, β) = (π/2 δ/2,δ/2). If p = 3, then α = (π δ)/3 and β = π/6 + δ/3. Since α>β, this implies δ<π/4. Thus the angle δ cannot be tiled with angles α. Therefore, we have δ = nβ. Thus n = 1orn = 2, which give δ = π/4 orδ = π, both are impossible. If q + r = 1, then (p q)α = π/2 δ. Since α>π/4, this implies α = π/2 δ and (α, β) = (π/2 δ, δ). Case 3: τ = π. In this case we have (p q)α = π (q + r) π/2. This implies q +r 1. If q +r = 0, then pα = π. Since π/4 <α<π/2, we get p = 3, α = π/3, and (α, β) = (π/3,π/6). Ifδ = π/3, then δ = α, and thus (α, β) = (δ, π/2 δ). If δ = n π/6, then n = 1orn = 2. When n = 2, this is the above case. When n = 1, then δ = π/6, and thus (α, β) = (π/2 δ, δ). If q + r = 1, then (p q)α = π/2. From π/4 <α<π/2we know that this case is impossible. Case 4: τ = 2π. In this case we have (p q)α = 2π (q + r) π/2. Since p > q and π/4 <α<π/2, we have q + r 3. If q + r = 3, then (p q)α = π/2. From π/4 <α<π/2weknow this is impossible. If q + r = 2, then (p q)α = π. Since π/4 <α<π/2, we get α = π/3, which is the result in Case 3. If q + r = 1, then (p q)α = 3π/2. This implies α = 3π/8 orα = 3π/10. When α = 3π/8, then (α, β) = (3π/8,π/8).Ifδ = 3π/8orδ = π/8, our result is true. Otherwise, we have δ = m π/8. It is clear that m = 1, 3. If m = 2, then δ = π/4, and this is the case of (α, β) = (π/2 δ/2,δ/2).ifm 4, then δ = m π/8 π/2, a contradiction. When α = 3π/10, then (α, β) = (3π/10,π/5). Ifδ = 3π/10, or δ = π/5, our result is true. Otherwise, we have δ = n π/5. It is clear that n = 1. If n = 2, then δ = 2π/5, and this is the case of (π/2 δ/2,δ/2).ifn 3, then δ = n π/5 >π/2, a contradiction.
5 Discrete Comput Geom (2013) 50: Fig. 2 Irregular tiling If q + r = 0, then pα = 2π. Since π/4 <α<π/2, we have α = 2π/5, α = π/3, or α = 2π/7. When α = 2π/7, then (α, β) = (2π/7, 3π/14). Ifδ = 2π/7, or δ = 3π/14, then the result is true. If δ = 2π/7 and δ = 3π/14, then by 0 <δ<π/2we may assume that δ = m 3π/14. If m = 2, then δ = 3π/7, and this is the case of (π/2 δ/2,δ/2). If m 3, then δ = m 3π/14 >π/2, a contradiction. When α = π/3, this is a result of Case 3. When α = 2π/5, then (α, β) = (2π/5,π/10).Ifδ = 2π/5orδ = π/10, the result is true. Otherwise, we have δ = n π10.ifn = 2, this is the case of (π/2 δ/2,δ/2). If n = 3, then δ = 3π/10, and by Lemma 2 we conclude a contradiction. If n 5, then δ = n π/10 π/2, a contradiction. The proof is complete. Figure 2 shows that the right triangles (δ, π/2 δ, π/2) and (δ/2,π/2 δ/2,π/2) can irregularly tile the parallelogram P(δ), where the numbers 1, 2, 3 in the left figure denote the angles δ, π/2 δ, π/2, respectively; the numbers 1, 2, 3 in the right figure denote the angles δ/2,π/2 δ/2,π/2, respectively. Remark 4 Since the above proofs never used that P(δ) is a parallelogram, only that two of its angles equal δ and two equal π δ, for the trapezoid T (δ) with acute angle δ, we have the same results as that of parallelogram P(δ). Acknowledgments The authors wish to thank the anonymous referees for their careful reading and helpful suggestions which we accepted gratefully. Su s research was partially supported by National Natural Science Foundation of China ( ) and NSF of Hebei Province (A ). References 1. Butler, S., Chnug, F., Graham, R., Laczkovich, M.: Tilings of polygons with lattice triangles. Discrete Comput. Geom. 44, (2010) 2. Laczkovich, M.: Tilings of polygons with similar triangles. Combinatorica 10, (1990) 3. Laczkovich, M.: Tilings of triangles. Discrete Math. 140, (1995) 4. Laczkovich, M.: Tilings of polygons with similar triangles II. Discrete Comput. Geom. 19, (1998) 5. Laczkovich, M.: Tilings of convex polygons with congruent triangles. Discrete Comput. Geom. 48, (2012) 6. Szegedy, B.: Tilings of the square with similar right triangles. Combinatorica 21, (2001)
ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationDissections of polygons into convex polygons
Dissections of polygons into convex polygons Andrzej Żak Faculty of Applied Mathematics, AGH University of Science and Technology al. Mickiewicza 30, 30 059 Kraków, Poland e-mail: zakandrz@uci.agh.edu.pl
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 informationarxiv: v1 [math.co] 17 Dec 2018
arxiv:1812.07014v1 [math.co] 17 Dec 2018 Tiling an Equilateral Triangle Michael Beeson December 19, 2018 Abstract Let ABC be an equilateral triangle. For certain triangles T the tile ) and certain N, it
More informationUniform edge-c-colorings of the Archimedean Tilings
Discrete & Computational Geometry manuscript No. (will be inserted by the editor) Uniform edge-c-colorings of the Archimedean Tilings Laura Asaro John Hyde Melanie Jensen Casey Mann Tyler Schroeder Received:
More informationTwo Upper Bounds for the Erdős Szekeres Number with Conditions
Discrete Comput Geom (2013) 49:183 188 DOI 10.1007/s00454-012-9474-9 Two Upper Bounds for the Erdős Szekeres Number with Conditions Florian Strunk Received: 8 July 2011 / Revised: 2 July 2012 / Accepted:
More informationLattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder
Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis http://www.geometer.org/mathcircles/pick.pdf 1 Warm-Up to Ponder 1. Is it possible to draw an equilateral triangle on graph paper so
More informationAcute Triangulations of Polygons
Europ. J. Combinatorics (2002) 23, 45 55 doi:10.1006/eujc.2001.0531 Available online at http://www.idealibrary.com on Acute Triangulations of Polygons H. MAEHARA We prove that every n-gon can be triangulated
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More informationFrom acute sets to centrally symmetric 2-neighborly polytopes
From acute sets to centrally symmetric -neighborly polytopes Isabella Novik Department of Mathematics University of Washington Seattle, WA 98195-4350, USA novik@math.washington.edu May 1, 018 Abstract
More informationTriangle Graphs and Simple Trapezoid Graphs
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationPERFECT FOLDING OF THE PLANE
SOOCHOW JOURNAL OF MATHEMATICS Volume 32, No. 4, pp. 521-532, October 2006 PERFECT FOLDING OF THE PLANE BY E. EL-KHOLY, M. BASHER AND M. ZEEN EL-DEEN Abstract. In this paper we introduced the concept of
More informationpα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD
6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD of π 1 (M 2 )onπ 1 (M 4 ) by conjugation. π 1 (M 4 ) has a trivial center, so in other words the action of π 1 (M 4 ) on itself is effective.
More informationBasic Euclidean Geometry
hapter 1 asic Euclidean Geometry This chapter is not intended to be a complete survey of basic Euclidean Geometry, but rather a review for those who have previously taken a geometry course For a definitive
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationPick s Theorem and Lattice Point Geometry
Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct
More informationTopology Homework 3. Section Section 3.3. Samuel Otten
Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that
More informationEXTREME POINTS AND AFFINE EQUIVALENCE
EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard
More informationThe Farey Tessellation
The Farey Tessellation Seminar: Geometric Structures on manifolds Mareike Pfeil supervised by Dr. Gye-Seon Lee 15.12.2015 Introduction In this paper, we are going to introduce the Farey tessellation. Since
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More informationThe Graphs of Triangulations of Polygons
The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation
More informationSPERNER S LEMMA MOOR XU
SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements
More informationOn vertex-coloring edge-weighting of graphs
Front. Math. China DOI 10.1007/s11464-009-0014-8 On vertex-coloring edge-weighting of graphs Hongliang LU 1, Xu YANG 1, Qinglin YU 1,2 1 Center for Combinatorics, Key Laboratory of Pure Mathematics and
More information2 Geometry Solutions
2 Geometry Solutions jacques@ucsd.edu Here is give problems and solutions in increasing order of difficulty. 2.1 Easier problems Problem 1. What is the minimum number of hyperplanar slices to make a d-dimensional
More informationTILING RECTANGLES SIMON RUBINSTEIN-SALZEDO
TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO. A classic tiling problem Question.. Suppose we tile a (large) rectangle with small rectangles, so that each small rectangle has at least one pair of sides with
More informationTopology 550A Homework 3, Week 3 (Corrections: February 22, 2012)
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in
More informationMath 5320, 3/28/18 Worksheet 26: Ruler and compass constructions. 1. Use your ruler and compass to construct a line perpendicular to the line below:
Math 5320, 3/28/18 Worksheet 26: Ruler and compass constructions Name: 1. Use your ruler and compass to construct a line perpendicular to the line below: 2. Suppose the following two points are spaced
More informationThe crossing number of K 1,4,n
Discrete Mathematics 308 (2008) 1634 1638 www.elsevier.com/locate/disc The crossing number of K 1,4,n Yuanqiu Huang, Tinglei Zhao Department of Mathematics, Normal University of Hunan, Changsha 410081,
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More information6th Bay Area Mathematical Olympiad
6th Bay Area Mathematical Olympiad February 4, 004 Problems and Solutions 1 A tiling of the plane with polygons consists of placing the polygons in the plane so that interiors of polygons do not overlap,
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More information2017 SOLUTIONS (PRELIMINARY VERSION)
SIMON MARAIS MATHEMATICS COMPETITION 07 SOLUTIONS (PRELIMINARY VERSION) This document will be updated to include alternative solutions provided by contestants, after the competition has been mared. Problem
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationReverse Polish notation in constructing the algorithm for polygon triangulation
Reverse Polish notation in constructing the algorithm for polygon triangulation Predrag V. Krtolica, Predrag S. Stanimirović and Rade Stanojević Abstract The reverse Polish notation properties are used
More informationPantographs and cyclicity
35 antographs and cyclicity John Boris Miller Abstract Every parallelogram Λ generates a doubly-infinite family of quadrilaterals called its pantograph. The types of quadrilaterals so arising can be characterised
More informationHamiltonian cycles in bipartite quadrangulations on the torus
Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple
More information2. Draw a non-isosceles triangle. Now make a template of this triangle out of cardstock or cardboard.
Tessellations The figure at the left shows a tiled floor. Because the floor is entirely covered by the tiles we call this arrangement a tessellation of the plane. A regular tessellation occurs when: The
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 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 informationTriangle Tiling III: The Triquadratic Tilings
Triangle Tiling III: The Triquadratic Tilings Michael Beeson May 17, 2012 Abstract An N-tiling of triangle ABC by triangle T (the tile ) is a way of writing ABC as a union of N copies of T overlapping
More informationTilings with dense tile orientations
Technische Fakultät Universität Bielefeld University of the Philippines Manila 13. Jan. 2014 1. Substitution tilings with tiles in infinitely many orientations and dense tile orientations (DTO) 2. Tile
More informationCoxeter Decompositions of Hyperbolic Polygons
Europ. J. Combinatorics (1998) 19, 801 817 Article No. ej980238 Coxeter Decompositions of Hyperbolic Polygons A. A. FELIKSON Let P be a polygon on hyperbolic plane H 2. A Coxeter decomposition of a polygon
More informationSchemes and the IP-graph
J Algebr Comb (2008) 28: 271 279 DOI 10.1007/s10801-007-0102-3 Schemes and the IP-graph Rachel Camina Received: 22 September 2006 / Accepted: 24 September 2007 / Published online: 12 October 2007 Springer
More informationLecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationGenerating Functions for Hyperbolic Plane Tessellations
Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in
More informationUNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours
UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI February 7, 009 Second Round Three Hours (1) An equilateral triangle is inscribed in a circle which is circumscribed by a square. This square is inscribed in
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More information6.3 Poincare's Theorem
Figure 6.5: The second cut. for some g 0. 6.3 Poincare's Theorem Theorem 6.3.1 (Poincare). Let D be a polygon diagram drawn in the hyperbolic plane such that the lengths of its edges and the interior angles
More informationLesson 4.3 Ways of Proving that Quadrilaterals are Parallelograms
Lesson 4.3 Ways of Proving that Quadrilaterals are Parallelograms Getting Ready: How will you know whether or not a figure is a parallelogram? By definition, a quadrilateral is a parallelogram if it has
More informationPrime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
More informationAbstract We proved in this paper that 14 triangles are necessary to triangulate a square with every angle no more than 72, answering an unsolved probl
Acute Triangulation of Rectangles Yibin Zhang Hangzhou Foreign Languages School Xiaoyang Sun Hangzhou Foreign Languages School Zhiyuan Fan Hangzhou Xuejun High School 1 Advisor Dongbo Lu Hangzhou Foreign
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More information22. A parallelogram is a quadrilateral in which both pairs of opposite sides are parallel.
Chapter 4 Quadrilaterals 4.1 Properties of a Parallelogram Definitions 22. A parallelogram is a quadrilateral in which both pairs of opposite sides are parallel. 23. An altitude of a parallelogram is the
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 informationLecture : Topological Space
Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous
More informationGeometry/Trigonometry Unit 5: Polygon Notes Period:
Geometry/Trigonometry Unit 5: Polygon Notes Name: Date: Period: # (1) Page 270 271 #8 14 Even, #15 20, #27-32 (2) Page 276 1 10, #11 25 Odd (3) Page 276 277 #12 30 Even (4) Page 283 #1-14 All (5) Page
More informationMaths Assessment Framework Year 10 Foundation
Success Criteria for all assessments: Foundation Tier 80% 5 70% 4 60% 3 50% 2 40% 1 Please note the GCSE Mathematics is one of the first GCSEs which will be graded by number rather than A*, A, B, C etc.
More informationWhat is the sum of the measures of the angles of a quadrilateral?
251 Lesson 16: Various Types of Quadrilaterals ctivity 1. The class as a whole should consider the question: What is the sum of the measures of the angles of a quadrilateral? Make a conjecture 1 about
More informationNon-extendible finite polycycles
Izvestiya: Mathematics 70:3 1 18 Izvestiya RAN : Ser. Mat. 70:3 3 22 c 2006 RAS(DoM) and LMS DOI 10.1070/IM2006v170n01ABEH002301 Non-extendible finite polycycles M. Deza, S. V. Shpectorov, M. I. Shtogrin
More informationON THE STRONGLY REGULAR GRAPH OF PARAMETERS
ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we
More informationOn non-periodic 3-Archimedean tilings with 6-fold rotational symmetry
Hiroshima Math. J. 45 (2015), 137 146 On non-periodic 3-Archimedean tilings with 6-fold rotational symmetry Naoko Kinoshita and Kazushi Komatsu (Received June 14, 2013) (Revised July 15, 2014) Abstract.
More informationSpherical Tiling by Congruent Pentagons
Spherical Tiling by Congruent Pentagons Min Yan November 12, 2015 webpage for further reading: http://www.math.ust.hk/ mamyan/research/urop.shtml We consider tilings of the sphere by congruent pentagons.
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 informationInfinite locally random graphs
Infinite locally random graphs Pierre Charbit and Alex D. Scott Abstract Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph
More informationSome new results on circle graphs. Guillermo Durán 1
Some new results on circle graphs Guillermo Durán 1 Departamento de Ingeniería Industrial, Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile, Santiago, Chile gduran@dii.uchile.cl Departamento
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 informationCounting the Number of Isosceles Triangles in Rectangular Regular Grids
Forum Geometricorum Volume 17 (017) 31 39. FORUM GEOM ISSN 1534-1178 Counting the Number of Isosceles Triangles in Rectangular Regular Grids Chai Wah Wu Abstract. In general graph theory, the only relationship
More informationAn interstice relationship for flowers with four petals
An interstice relationship for flowers with four petals Steve Butler, Ron Graham, Gerhard Guettler and Colin Mallows Abstract. Given three mutually tangent circles with bends related to the reciprocal
More informationLecture 1. 1 Notation
Lecture 1 (The material on mathematical logic is covered in the textbook starting with Chapter 5; however, for the first few lectures, I will be providing some required background topics and will not be
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 informationThe orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.
Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version
More informationPolygons are named by the number of sides they have:
Unit 5 Lesson 1 Polygons and Angle Measures I. What is a polygon? (Page 322) A polygon is a figure that meets the following conditions: It is formed by or more segments called, such that no two sides with
More informationPolyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal Class D 2
Symmetry 2011, 3, 325-364; doi:10.3390/sym3020325 OPEN ACCESS symmetry ISSN 2073-8994 www.mdpi.com/journal/symmetry Article Polyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal
More informationOn Jeśmanowicz Conjecture Concerning Pythagorean Triples
Journal of Mathematical Research with Applications Mar., 2015, Vol. 35, No. 2, pp. 143 148 DOI:10.3770/j.issn:2095-2651.2015.02.004 Http://jmre.dlut.edu.cn On Jeśmanowicz Conjecture Concerning Pythagorean
More informationPolyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal Class D 2
Symmetry 2011, 3, 325-364; doi:10.3390/sym3020325 OPEN ACCESS symmetry ISSN 2073-8994 www.mdpi.com/journal/symmetry Article Polyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal
More informationMatching and Factor-Critical Property in 3-Dominating-Critical Graphs
Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Tao Wang a,, Qinglin Yu a,b a Center for Combinatorics, LPMC Nankai University, Tianjin, China b Department of Mathematics and Statistics
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationIntroduction to Complex Analysis
Introduction to Complex Analysis George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 413 George Voutsadakis (LSSU) Complex Analysis October 2014 1 / 50 Outline
More informationarxiv: v2 [math.co] 13 Aug 2013
Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed
More informationAN INNOVATIVE ANALYSIS TO DEVELOP NEW THEOREMS ON IRREGULAR POLYGON
International Journal of Physics and Mathematical Sciences ISSN: 77-111 (Online) 013 Vol. 3 (1) January-March, pp.73-81/kalaimaran AN INNOVATIVE ANALYSIS TO DEVELOP NEW THEOREMS ON IRREGULAR POLYGON *Kalaimaran
More informationarxiv:submit/ [cs.cg] 8 Jun 2011
Common Edge-Unzippings for Tetrahedra Joseph O Rourke arxiv:submit/68 [cs.cg] 8 Jun June 8, Abstract It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which
More informationAny questions about the material so far? About the exercises?
Any questions about the material so far? About the exercises? Here is a question for you. In the diagram on the board, DE is parallel to AC, DB = 4, AB = 9 and BE = 8. What is the length EC? Polygons Definitions:
More informationMath Polygons
Math 310 9.2 Polygons Curve & Connected Idea The idea of a curve is something you could draw on paper without lifting your pencil. The idea of connected is that a set can t be split into two disjoint sets.
More information6 Polygons and. Quadrilaterals CHAPTER. Chapter Outline.
www.ck12.org CHAPTER 6 Polygons and Quadrilaterals Chapter Outline 6.1 ANGLES IN POLYGONS 6.2 PROPERTIES OF PARALLELOGRAMS 6.3 PROVING QUADRILATERALS ARE PARALLELOGRAMS 6.4 RECTANGLES, RHOMBUSES AND SQUARES
More informationGeometry Review for Test 3 January 13, 2016
Homework #7 Due Thursday, 14 January Ch 7 Review, pp. 292 295 #1 53 Test #3 Thurs, 14 Jan Emphasis on Ch 7 except Midsegment Theorem, plus review Betweenness of Rays Theorem Whole is Greater than Part
More informationRay shooting from convex ranges
Discrete Applied Mathematics 108 (2001) 259 267 Ray shooting from convex ranges Evangelos Kranakis a, Danny Krizanc b, Anil Maheshwari a;, Jorg-Rudiger Sack a, Jorge Urrutia c a School of Computer Science,
More informationIndecomposable Coverings with Concave Polygons
Discrete Comput Geom (2010) 44: 577 588 DOI 10.1007/s00454-009-9194-y Indecomposable Coverings with Concave Polygons Dömötör Pálvölgyi Received: 26 February 2009 / Revised: 14 May 2009 / Accepted: 18 May
More informationReversible Nets of Polyhedra
Reversible Nets of Polyhedra Jin Akiyama 1, Stefan Langerman 2(B), and Kiyoko Matsunaga 1 1 Tokyo University of Science, 1-3 Kagurazaka, Shinjuku, Tokyo 162-8601, Japan ja@jin-akiyama.com, matsunaga@mathlab-jp.com
More information8 Colouring Planar Graphs
8 Colouring Planar Graphs The Four Colour Theorem Lemma 8.1 If G is a simple planar graph, then (i) 12 v V (G)(6 deg(v)) with equality for triangulations. (ii) G has a vertex of degree 5. Proof: For (i),
More informationA digital pretopology and one of its quotients
Volume 39, 2012 Pages 13 25 http://topology.auburn.edu/tp/ A digital pretopology and one of its quotients by Josef Šlapal Electronically published on March 18, 2011 Topology Proceedings Web: http://topology.auburn.edu/tp/
More informationThe Geometry of Carpentry and Joinery
The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose
More informationON LOCAL STRUCTURE OF 1-PLANAR GRAPHS OF MINIMUM DEGREE 5 AND GIRTH 4
Discussiones Mathematicae Graph Theory 9 (009 ) 385 00 ON LOCAL STRUCTURE OF -PLANAR GRAPHS OF MINIMUM DEGREE 5 AND GIRTH Dávid Hudák and Tomáš Madaras Institute of Mathematics, Faculty of Sciences University
More informationheptagon; not regular; hexagon; not regular; quadrilateral; convex concave regular; convex
10 1 Naming Polygons A polygon is a plane figure formed by a finite number of segments. In a convex polygon, all of the diagonals lie in the interior. A regular polygon is a convex polygon that is both
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 informationarxiv: v2 [math.co] 9 Feb 2017
OPTIML POINT STS TRMINING FW ISTINT TRINGLS LYSS PSTIN, M LOTT, STVN J. MILLR, N YVINUR. PLSSON arxiv:1609.00206v2 [math.o] 9 Feb 2017 STRT. We generalize work of rdős and Fishburn to study the structure
More informationPoints covered an odd number of times by translates
Points covered an odd number of times by translates Rom Pinchasi August 5, 0 Abstract Let T be a fixed triangle and consider an odd number of translated copies of T in the plane. We show that the set of
More information