Spherical tilings by congruent 4-gons on Archimedean dual skeletons
|
|
- Cassandra Davidson
- 5 years ago
- Views:
Transcription
1 Spherical tilings by congruent 4-gons on Archimedean dual skeletons Mathematical Institute, Tohoku University, Sendai Miyagi Japan, June 13, 2016
2 We classify all spherical tilings by congruent 4-gons such that the 4-gon has only 3 equal sides and the skeleton of the tiling is that of an Archimedean dual. Such a tiling induces a perfect face-matching of the skeleton. The classification is by checking the solvability of systems of integer-coefficient linear equations. Such a system is induced by an assignment of inner angles respecting a perfect face-matching to the skeleton. The number of such systems of integer-coefficient linear equations is huge, because the number of the tiles and the number of the perfect face-matchings of the skeleton of the tiling are large. We overcome this difficulty in not only convex 4-gonal tile cases [A.-van Cleemput15] but also concave 4-gonal tile cases, by linear algebraic approach for the 3-valent vertex types of the tilings. We scrutinize how [K. Coolsaet, Spherical quadrangles with three equal sides and rational angles, 2015] reduces the complexity for the convex 4-gonal tile cases.
3 This reverse problem of Grünbaum-Shephard s theorem compares Motivation. Theorem (Grünbaum-Shephard81) The skeleton of a spherical isohedral tiling (i.e., a tiling s.t. the symmetry group acts transitively on the tiles) is exactly the skeleton of a trapezohedron(i.e., the dual of an antiprism), a bipyramid, an Archimedean dual, or a Platonic solid. Proposition [A.13, Hiroshima Math. J.] There is a spherical non-isohedral tiling A by 12 congruent concave 4-gons on a trapezohedron skeleton. Problem[A.15, Japan Conf. on Discr. & Comput. Geom. & Graphs] Is A the only spherical monohedral, non-isohedral tiling with the skeleton listed in Grünbaum-Shephard s Theorem?
4 Symmetry group vs. automorphism group of the skeleton. Deformation. Mani s theorem ([Math. Ann. 1971], a refinement of Steinitz s theorem): For each polyhedral graph G, there exists a 3-dimensional convex polytope P such that the automorphism group of G is the symmetry group of P. Mani s theorem is for polyhedra, and is generalized on any sphere in [Deza et al., Geometric Structure of Chemistry- Relevant Graphs. Zigzags and Central Circuits, Springer, 15]. Other extensions of Steinitz s theorem is found in [Seok-Hee Hong and H. Nagamochi11]. Cauchy s rigidity theorem for convex polyhedra, For deformation of vertex-transitive polyhedra, see [Robertson-Carter-Morton1970]. Angle-assignments to the skeleton (I. Rivin s solution to Steinitz s problem [Ann. of Math1996]).
5 Every sph. tiling by congruent convex 4-gons on the trapezohedron skeleton is isohedral. Case-by-case analysis by finding forbidden substructures.
6 All spherical monohedral polygonal tilings with Platonic or bipyramidal skeleton are isohedral [A.-Yan16]. Their combinatorial types are: F 4 a b c G 8 D G 4n (n 3) C 6 I G 4n+2 (n 1) Figure: For each of them, the degree of freedom of the continuous deformation is the maximum # of change of the symmetry type.
7 Any spherical tiling by congruent 3-gons on the skeleton of an Archimedean dual and any spherical tiling by congr. kites (darts, rhombi) are isohedral [Sakano-A.15]. R 30 T 24 T 60 R 12 Figure: The 4 4-gon-faced ADs R 12, T 24, R 30, T 60 among the 13 ADs (left). The right upper (middle, bottom, resp.) is a spherical tiling by congruent kites (darts, rhombi, resp.) on the trapezohedron skel.
8 Any spherical tiling by congruent type-2 4-gons on an AD skeleton is isohedral. Definition A 4-gon is said to be type-2, if the edge-lengths are aaab (a b). Lemma (Ueno-Agaoka01) A tile of a sph. tiling by congr. 4-gons is a rhomb., a kite, a dart, a type-2, or has cyclic list of edge-lengths aabc (a, b, c distinct). We will prove: Theorem (Main) There is no sph. tiling by congr. type-2 4-gons on R 12 -, R 30 -, or T 60 -skel, but only one sp. ti. by congr. type-2 4-gons on T 24 -skel., It is obtained from the central projection of T 24, by twisting each Y -figure in common irrational multiple of π rad. We will prove this below.
9 A spherical tiling by congruent 4-gons of edge-lengths aaab (a b) induces a solvable angle-assignment of the skeleton S respecting a perfect face-matching of S. T 60 has perfect face-matchings, i.e., 1-regular spanning subgraphs of the dual graph. So T 60 has angle-assgnmnts to the skel. Figure: The left is the 8 perfect face matchings of the cube skel. The right are 4-gons of type 2. A type-2 4-gon has, by definition, 3 equilateral edges (blue) and 1 face-matching edge (red) of different length. α, β, γ, δ stands for inner angles. Each type-2 4-gon has 2 a.-assignments.
10 The ten 3-valent vertex types in spherical tilings by congr. type-2 4-gons. Definition A vertex consisting of i inner angles α, j inner angles β, k inner angles γ, and l inner angles δ (i, j, k, l 0) is said to have type iα + jβ + kγ + lδ. A spherical tiling by congruent 4-gons of type 2 has at most 10 3-valent vertex types: V 3 := {3β, 2β + γ, α + β + δ, 2α + γ, 2α + β, 3γ, 2γ + β, α + γ + δ, 2δ + β, 2δ + γ}. See [A.-van Cleemput, Ars Mathematica Contemporanea, 15].
11 Allowed vertex types Lemma n {12, 24, 30, 60}. a family C n of nonempty sets of vtx typs sph. tiling T by n congr. type-2 4-gons on AD skel. P C n. P T
12 Prf Count face-match edges on the AD bipartites. C 24 := AC(V 4,>0 ). 6-set C 12 := AC(V 3,0, V 3,1, V 4,>0 ). (# = 156) C 30 := AC(V 3,0, V 3,1, V 5,1, V 5,2 ). (# = 1200) C 60 := AC(V 3,1, V 4,>0, V 5,>0 ). (# = 660) AC(T 1, T 2,..., T n ) := {{t 1,..., t n } t i T i }. V d,i := {types of d-val. vertices incident to i face-match edges} V 3,0 := {3β, 2β + γ, β + 2γ, 3γ}. (4-set) V 3,1 := {2α + β, 2α + γ, α + β + δ, α + γ + δ, β + 2δ, γ + 2δ}. V 4,>0. 11-set V 5,i. (10-set) (i = 1, 2). (α, β, γ, δ) (δ, γ, β, α). (6-set)
13 Forbidden vertex types Lemma family F 12, F 24, F 30, F 60 [V 3 ] <4 s.t. sph. tiling T by n > 6 congr. type-2 4-gons. 1 F F 24. F T. 2 n = 12, 30, 60 = F F n. F T.
14 Prf F 24 := {{3β, α + γ + δ}, {α + β + δ, 3γ}} {{2α + γ, 3γ}, {2α + β, 2γ + β}, {3β, β + 2δ}, {2β + γ, 2δ + γ}}. 20-set F 12 := F 30 := F 24 R 62-setF 60 := F 24 {R {S} R R, S V 3,0 }. Here R := {{t 1, t 2 } V 3 t 1 = t 2 Proof. = α = δ or β = γ}. Prop.[A.13] s. ti. T by cngr. type-2 4gns, (1) α γ and β δ, (2) V 3,0 T = T V 3,1 = α δ and β γ. n = 12, 30: V 3,0 T = T V 3,1. n = 60: By T V 3,1, if T V 3,0, then Prop (2) implies α δ and β γ.
15 The characterization of the inner angles (α, β, γ, δ) (Qπ) 4 of convex type-2 sph. 4-gons (1/2). Theorem (Coolsaet15) If the inner angles (α, β, γ, δ) of a conv. type-2 sph. 4-gons are in (Qπ) 4, then (α, β, γ, δ) or (δ, γ, β, α) satisfy one of the following: 1 α = δ, β = γ. (isosceles trapezoid. Does not tile the unit sphere [A.-van Cleemput15]) 2 α = γ 2, δ = β 2, α + δ < π. 3 α = 3γ 2, β = π 3, δ = 2π 3 γ 2., π 2 < γ < 2π 3. 4 α = π 6 + γ 2, β = 2γ, δ = π 2 + γ 2, π 3 < γ < π 2. 5 α = π 6 + γ 2, β = 2γ, δ = π 2 + 3γ 2, 4π 15 < γ < π 3. 6 α = π 6 + γ 2, β = 2π 2γ, δ = 3π 2 3γ 2, π 2 < γ < 5π 6.
16 The characterization of the rational inn. angles of conv. type-2 sph. 4-gons (2/2) sporadic. (cnt d) (4π/n is the area of the 4-gon.) 1 π ( 5 6, 8 21, 5 7, 17 ) ( 42, π 11 15, 7 15, 3, 8 ) ( 15, π 17 π ( 23 30, 1 3, 14 15, 3 ) ( 10, π 31 60, 3 5, 5 6, π ( 19 60, 7 10, 14 15, 13 60). (n = 24). 3 π ( 53 60, 4 15, 7 10, 17 60). (n = 30). 4 π ( 7 10, 4 15, 13 15, , 8 15, 13 15, 11 30), ), π ( 49 60, 3 10, 14 15, 17 ), π ( 49 60, 4 15, 7 10, 17 60). (n = 60). 60). (n = 12). 5 1 tuple for n = 6, 2 tuples for n = 42, 1 tuple for n = 84, 1 tuple for n = 120, 12 tuples for fractional n. ( ) [G. Myerson. Rational products of sines of rational angles. Aequationes mathematicae, 1993].
17 For tiling T, set of vertex types of T induces solvable linear system n {12, 24, 30, 60}, sp. ti. T by n congr. x type-2 4-gons on AD skel., set T of 3-val. vtx typs of T, (ϕ x (n, C n, F n, T )): F F n. F T & P C n s.t. a system {α + β + γ + δ 2 = 4π n, t = c = 2π c P, t T } has indefinite solution, or definite sol. (α, β, γ, δ) in (0, 2π) 4 \ (0, π) 4 (x=cnc) and listed in Coolsaet s Theorerem (x=cnv). Φ(n, i) := { T [V 3 ] <i ϕ x (n, C n, F n, T ) }
18 The sphe. tiling by congr. type-2 4-gons on T 24 -skel.(1/4) Proof. A complete of representative of Φ cnv (24, 3) is {{2β + Y }, {2α + Y }, {α + β + δ} Y = β, γ}, by 2sec computation with MAPLE. There are 1088 perfect face-matchings of the T 24 -skel, and 8 assignments of α, β, γ, δ to the skel. such that the set of 3-val. vertex types is in Φ cnv (24, 3) and the angle-assignments respect perfect face-matchings. 4 assignments among the 8 induce systems of linear equations, which are unsolvable by the coefficient difference. There are only one solvable and canonical assignment (cnt d):
19 0: 1 (α) 2 (α) 3 (α) 4 (α) 16: 8 (β) 23 (δ) 22 (δ) 24 (β) 1: 0 (β) 5 (δ) 6 (δ) 7 (β) 17: 8 (δ) 24 (β) 10 (β) 9 (δ) 2: 0 (δ) 7 (β) 8 (β) 9 (δ) 18: 10 (δ) 24 (β) 22 (β) 25 (δ) 3: 0 (β) 9 (δ) 10 (δ) 11 (β) 19: 10 (β) 25 (δ) 12 (δ) 11 (β) 4: 0 (δ) 11 (β) 12 (β) 5 (δ) 20: 12 (β) 25 (δ) 22 (δ) 21 (β) 5: 1 (γ) 4 (γ) 13 (γ) 21: 13 (γ) 20 (γ) 14 (γ) 6: 1 (α) 13 (α) 14 (α) 15 (α) 22: 14 (α) 20 (α) 18 (α) 16 (α) 7: 1 (γ) 15 (γ) 2 (γ) 23: 14 (γ) 16 (γ) 15 (γ) 8: 2 (α) 15 (α) 16 (α) 17 (α) 24: 16 (γ) 18 (γ) 17 (γ) 9: 2 (γ) 17 (γ) 3 (γ) 25: 18 (γ) 20 (γ) 19 (γ) 10: 3 (α) 17 (α) 18 (α) 19 (α) 11: 3 (γ) 19 (γ) 4 (γ) 12: 4 (α) 19 (α) 20 (α) 13 (α) 13: 5 (δ) 12 (δ) 21 (β) 6 (β) 14: 6 (δ) 21 (β) 22 (β) 23 (δ) 15: 6 (β) 23 (δ) 8 (δ) 7 (β)
20 The sph. tiling by congr. type-2 4-gons on T 24 -skel. (3/4). From the angle-assignment A, the spherical tiling by 24 congruent type-2 quadrangles is constructed from the central projection of T 24 by rotating the central Y-figure of each octant (i.e., right-angled regular triangle), by a fixed radian θ in the direction of the parity of the octant. Here, the octant (+, +, ) has parity and the octant (+,, ) has parity +. The inner angles of the tiles are α = π/2, β = arcsin ( (5 2 3)/(12 6 3) ), γ = 2π/3, and δ = π β. The length( of the edge αδ is b = arccos (4 2 3)/(5 2 ) 3), while the length of the other three edges is a = π/2 b. Note that β is an irrational multiple of π, because no instance of (α, β, γ, δ) is listed in Coolsaet s thm.
21 The sph. tiling by congr. type-2 4-gons on T 24 -skel. (4/4) sph. tiling by congruent concave type-2 4-gons on T 24 -skel. Proof. By 1min computation with MAPLE, Φ cnc (24, 4) = Φ cnv (24, 3) { [{2 α + γ, 2 β + γ}], [{2 β + γ, α + γ + δ}], [{α + β + δ, α + γ + δ}] } assignments of α, β, γ, δ to the skel. such that the set of the 3-val. vtx types is in Φ cnc (24, 4) and the assgnmnts respect perfect face-matchings assgnmnts among the 9704 induce systems of linear equations, but they are unsolvable by the coefficient diff assgnmnts among the 9704 induce systems of linear equations, but they are unsolvable by the linear programming. The other 4 assignment are solvable and correspond to one common canonical solution A of the two previous slides.
22 No sph. tiling by cngr convex 4-gons on T 60 -skel. Lemma For any sp. ti. T by cngr type-2 4gns on T 60 -skel, (1) T V 3,0. (2) F F 12.F T. Proof. (1) Assume otherwise. All 20 3-val. vertices turn out to be incident to match edges. Because T 60 has bipartital skel., the remaining 10 match edges are incident to 5-val. vertices. As # of 5-val. vert is 12, some 5-val. vertex is incident to no matching edge. However, ϕ x (60, AC(V 3,1, V 4,>0, V 5,>0, V 5,0 ),, ). (x {cnv, cnc}). (The total time of computation with MAPLE/Corei7 is 1min.) This is a contradiction.
23 Proof continued (2) F 12 = F 24 {{t 1, t 2 } V 3 t 1 = t 2 = α = δ or β = γ}. We have the conclusion, by T V 3,1, (1), F 24, and Corollary V 3,0 T = T V 3,1 = α δ&β γ. There is no spherical tiling by congruent convex type-2 4-gons on T 60 -skeleton. Proof. 1min computation shows that ϕ cnv (60, AC(V 3,0, V 3,1, V 4,>0, V 5,>0 ),, ). By counting matching edges, we have the conclusion.
24 No sph. tiling by cngr. concave type-2 4-gons on T 60 -skel. Prf. Any 5-val. vertex is adjacent to a 4-val. one in T 60. So, Lemma In a sp. ti. by cng type-2 4gns on T 60 -skel., if every 5-val. vertex does δ (α, resp.) 4 times, then some 4-val. vertex contains α (δ, resp.) at least twice. ϕ cnc (60, AC(V 3,0, V 3,1, V 4,>0, V 5,>0 ),, ) is witnessed by 8 solutions (α, β, γ, δ) = (2π/15, 2π/15, 26π/15, π/15), or(π/30, 28π/15, π/15, π/10) with α δ and/or β γ. Note that AC(...) is symmetric w.r.t such exchange(s) since V s are defined so.
25 No sph. tiling by cngr. concave type-2 4-gons on T 60 -skel. (2/2) If (α, β, γ, δ) = (2π/15, 2π/15, 26π/15, π/15), then a 5-valent vertex type is γ + 4δ and a 4-valent vertex type is α + γ + 2δ or β + γ + 2δ. If (α, β, γ, δ) = (π/30, 28π/15, π/15, π/10), then a 5-valent vertex type is 4α + β and a 4-valent vertex type is 2α + β + γ. These contradict against previous Lemma on # of α and # of δ. The other six solution are obtained by α δ and/or β γ, and contradict similarly.
26 No sph. tiling by congr. type-2 4-gons on R 12 - or R 30 -skel. Proof. Φ cnv (12, 3) = {3 β, 2X + Y }, {3 β, α + β + δ} X = α, δ; Y = β, γ Φ cnc (12, 4) = {3 β, 2X + Y }, {β + 2Y, α + β + δ} X = α, δ; Y = β, Φ cnv (30, 2) =. Φ cnc (30, 4) = {3 β, α + β + δ}, {2 X + γ, 2 β + γ} X = α, δ. 1min, 2min, 10min, 50min computation by (MAPLE/Corei7).
27 No sph. tiling by congr. type-2 4-gons on R 12 - or R 30 -skel. Prf cnt d Proof (cnt d) No member of Φ cnc (n, 4) (n = 12, 30) is suitable, by: Lemma ( 3vs3 ) For a spherical tiling by congr. 4-gons on the R e -skeleton (e = 12, 30), if the set of 3-val. vertex types is {t 1, t 2 }, then a homogeneous system of linear equations it 1 + jt 2 = kα + lβ + lγ + kδ has a non-triv. solution (i, j, k, l) such that i 0, j 0. Proof. The opposite vertex of a 3-val. vertex is 3-val.
28 Summary. Theorem (Main) There is no sph. tiling by congr. type-2 4-gons on R 12 -, R 30 -, or T 60 -skel, but only one spherical tiling by congruent type-2 4-gons on T 24 -skel. It is obtained from the central projection of T 24 by twisting each Y -figure in common irrational multiple of π radian.
29 For R e - or T 60 -skel., 1 Plan a family C of compulsory sets of vertex types, by counting argument # of matching edges in view of the skeleton. 2 Do generate the family Φ of sets of 3-val. vertex types, conjuncting with C, avoiding F, and having indefinite solutions or Coolsaet-rational (concave, resp.) definite ones. 3 Check 3-val. vertex types s.t.: In R e, the opposite of a 3-val. vertex is 3-val. ( 3vs3 Lemma). In T 60, a 4-val. vertex and a 5-val. vertex have types so that they are adjacent (Lemma (T 60 2)). Conclude that no sph. tiling by congruent type-2 4-gons exists if Φ = { }. 4 Act (1-4) for each remaining subcase T Φ (Lemma(T 60 )). A smaller C may save the total computation time. For T 24 -skel., generate Φ from some C. Then construct canonical sph. tilings by cngr. 4-gons from all LP-solvable angle-assignments respecting perfect face-matchings of T 24 s.t. the set of 3-val. vertex types is in Φ. (cf. canonical construction path of McKay)
30 Feature of Coolsaet-rationality for convex type-2 4-gons. Sp. ti. by cng. type-2 s on T 24 -skel. has angle in (R \ Q)π. Efficient. Let A cnv (n) be Φ cnv (n, 3) with listed in Coolsaet s thm replaced by (0, π) 4, that is, {maximalt [V 3 ] 3 F F n. F T & P C n (α + β + γ + δ 2π = 4π n, t T c P. t = c = 2π) has indefinite sol., or definite sol. (α, β, γ, δ) (0, π) 4 }. Φ cnv (12, 3) 2min 8 singl. & 8 pairs A cnv (12) 2min 10 singl. & 18 pairs Φ cnv (24, 3) 20sec 6 singl. A cnv (24) 1min 10 singl. & 18 pairs Φ cnv (30, 2) 10min 0 A cnv (30) 10min 10 singl. & 10 pairs Φ cnv (60, 3) 3min 2 singl. A cnv (60) 15min 10 singl. & 18 pairs
31 The two 5-gon-faced Archi. duals. Amon the 13 ADs, there are two 5-gon-faced ones (figures below). The cyclic list of 5 edges of a tile is aaabb (a b). The #s of faces are 24 and 60. On each of the two 5-gon-faced AD skels., there is a spherical tiling T by congruent equilateral 5-gons [Akama&M. Yan]. The two tilings are a pentagonal subdivision of an octahedron and that of an icosahedron. Hence, any spherical tiling by congruent equilateral 5-gons on an AD skel. is isohedral. Figure: P 24 (left) and P 60 (right). Their skeletons are non-bipartital
32 Prf of Key Lem.(1/4) The 4 4-gonal Archi. duals have bipartital skel. Rhombic e-hedron (R e ), tetragonal 2e-hedron (T 2e ) (e = 12, 30). By the constructions [Conway et al., The Symmetries of Things, 08], the skel. of R e is (L({3, q})) & that of T 2e is (L(L({3, q}))). Here L(G) is the line graph (i.e., link the midpts of adjacent edges) of a graph G. {3, q} (q = 4, 5) is Platonic solid with e edges s.t. q 3-gons share a vtx. So, the skel. of R e is a bipartite btw the set V 1 of f 3-val. vert. & the set of v q-val. vert., where {3, q} has f faces. & v vert. The skel. of T 2e is a bipartite btw V 1 V 3 and a set V 2 of f 4-val. vert. Here V 3 is a set of v q-val. vert.
12-neighbour packings of unit balls in E 3
12-neighbour packings of unit balls in E 3 Károly Böröczky Department of Geometry Eötvös Loránd University Pázmány Péter sétány 1/c H-1117 Budapest Hungary László Szabó Institute of Informatics and Economics
More informationarxiv: v1 [math.at] 9 Sep 2016
September 13, 2016 Lecture Note Series, IMS, NUS Review Vol. 9in x 6in Lectures-F page 1 FULLERENES, POLYTOPES AND TORIC TOPOLOGY arxiv:1609.02949v1 [math.at] 9 Sep 2016 Victor M. Buchstaber Steklov Mathematical
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationVolume of convex hull of two bodies and related problems
Volume of convex hull of two bodies and related problems Ákos G.Horváth Department of Geometry, Mathematical Institute, Budapest University of Technology and Economics (BME) Geometry and Symmetry, Veszprém,
More informationSeul Lee, Dong-Soo Kim and Hyeon Park
Honam Mathematical J. 39 (2017), No. 2, pp. 247 258 https://doi.org/10.5831/hmj.2017.39.2.247 VARIOUS CENTROIDS OF QUADRILATERALS Seul Lee, Dong-Soo Kim and Hyeon Park Abstract. For a quadrilateral P,
More informationGeometry. A. Right Triangle. Legs of a right triangle : a, b. Hypotenuse : c. Altitude : h. Medians : m a, m b, m c. Angles :,
Geometry A. Right Triangle Legs of a right triangle : a, b Hypotenuse : c Altitude : h Medians : m a, m b, m c Angles :, Radius of circumscribed circle : R Radius of inscribed circle : r Area : S 1. +
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationRoot systems and optimal block designs
Root systems and optimal block designs Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk Abstract Motivated by a question
More informationRECAP: Extremal problems Examples
RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationPoint-sets in general position with many similar copies of a pattern
Point-sets in general position with many similar copies of a pattern Bernardo M. Ábrego and Silvia Fernández-Merchant Department of Mathematics California State University, Northridge, 18111 Nordhoff St,
More informationZipper Unfolding of Domes and Prismoids
CCCG 2013, Waterloo, Ontario, August 8 10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine Martin L. Demaine Ryuhei Uehara Abstract We study Hamiltonian unfolding cutting a convex polyhedron
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Multiple extensions of generalized hexagons related to the simple groups McL and Co3. Author(s) Cuypers,
More informationEtudes on convex polyhedra. 5. Topological entropies of all 2907 convex 4- to 9-vertex polyhedra
24 References 1. Grünbaum, B. (1967). Convex Polytopes. New York: Springer. 2. Voytekhovsky, Y. L. (2016). Acta Cryst, A72, 582-585. 3. Voytekhovsky, Y. L. (2017). Acta Cryst, A73, 271-273. Etudes on convex
More informationCubic Cayley graphs and snarks
Cubic Cayley graphs and snarks University of Primorska UP FAMNIT, Feb 2012 Outline I. Snarks II. Independent sets in cubic graphs III. Non-existence of (2, s, 3)-Cayley snarks IV. Snarks and (2, s, t)-cayley
More informationSymmetry Groups of a Class of Spherical Folding Tilings
Applied Mathematics & Information Sciences 3() (009), 3 34 An International Journal c 009 Dixie W Pulishing Corporation, U. S. A. Symmetry Groups of a Class of Spherical Folding Tilings A. M. d Azevedo
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More information. Here the flats of H(2d 1, q 2 ) consist of all nonzero totally isotropic
NEW BOUNDS FOR PARTIAL SPREADS OF H(d 1, ) AND PARTIAL OVOIDS OF THE REE-TITS OCTAGON FERDINAND IHRINGER, PETER SIN, QING XIANG ( ) Abstract Our first result is that the size of a partial spread of H(,
More informationMINIMAL VERTEX DEGREE SUM OF A 3-PATH IN PLANE MAPS
Discussiones Mathematicae Graph Theory 17 (1997 ) 279 284 MINIMAL VERTEX DEGREE SUM OF A 3-PATH IN PLANE MAPS O.V. Borodin Novosibirsk State University Novosibirsk, 630090, Russia Abstract Let w k be the
More informationOn Generalized Ramsey Numbers
On Generalized Ramsey Numbers Wai Chee Shiu, Peter Che Bor Lam and Yusheng Li Abstract Let f 1 and f 2 be graph parameters. The Ramsey number rf 1 m; f 2 n is defined as the minimum integer N such that
More informationThe Non-Existence of certain Regular Generalized Polygons
The Non-Existence of certain Regular Generalized Polygons H. Van Maldeghem October 9, 2002 Abstract We define the notion of d i -regularity and regularity in generalized polygons, thus generalizing the
More informationOn the Volume Formula for Hyperbolic Tetrahedra
Discrete Comput Geom :347 366 (999 Discrete & Computational Geometry 999 Springer-Verlag New York Inc. On the Volume Formula for Hyperbolic Tetrahedra Yunhi Cho and Hyuk Kim Department of Mathematics,
More informationOn certain Regular Maps with Automorphism group PSL(2, p) Martin Downs
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 53, 2007 (59 67) On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs Received 18/04/2007 Accepted 03/10/2007 Abstract Let p be any prime
More informationarxiv: v1 [math.dg] 9 Jun 2018
Construction of continuum from a discrete surface by its iterated subdivisions Motoko Kotani, Hisashi Naito and Chen Tao arxiv:1806.03531v1 [math.dg] 9 Jun 2018 Abstract. Given a trivalent graph in the
More informationGeometry. Relations in SO(3) Supported by Geodetic Angles. J. H. Conway, 1 C. Radin, 2 and L. Sadun Introduction and Results
Discrete Comput Geom 23:453 463 (2000) DOI: 10.1007/s004540010015 Discrete & Computational Geometry 2000 Springer-Verlag New York Inc. Relations in SO(3) Supported by Geodetic Angles J. H. Conway, 1 C.
More informationExamples of Groups
Examples of Groups 8-23-2016 In this section, I ll look at some additional examples of groups. Some of these will be discussed in more detail later on. In many of these examples, I ll assume familiar things
More informationLine graphs and geodesic transitivity
Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 6 (2013) 13 20 Line graphs and geodesic transitivity Alice Devillers,
More informationAnalogs of Steiner s porism and Soddy s hexlet in higher dimensions via spherical codes
Analogs of Steiner s porism and Soddy s hexlet in higher dimensions via spherical codes Oleg R. Musin arxiv:1801.08278v2 [math.mg] 2 Feb 2018 Abstract In this paper we consider generalizations to higher
More informationTypes of triangle and the impact on domination and k-walks
Types of triangle and the impact on domination and k-walks Gunnar Brinkmann Applied Mathematics, Computer Science and Statistics Krijgslaan 8 S9 Ghent University B9 Ghent gunnar.brinkmann@ugent.be Kenta
More informationSome results on the reduced power graph of a group
Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationTopological Graph Theory Lecture 4: Circle packing representations
Topological Graph Theory Lecture 4: Circle packing representations Notes taken by Andrej Vodopivec Burnaby, 2006 Summary: A circle packing of a plane graph G is a set of circles {C v v V (G)} in R 2 such
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationarxiv: v2 [math.gr] 17 Dec 2017
The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,
More informationarxiv: v2 [math.co] 24 Sep 2008
Sports scheduling for not all pairs of teams arxiv:0809.3682v2 [math.co] 24 Sep 2008 Kenji KASHIWABARA, Department of General Systems Studies, University of Tokyo, 3-8-1 Komaba, Meguroku, Tokyo, Japan
More informationOn Polygonal Domains with Trigonometric Eigenfunctions of the Laplacian under Dirichlet or Neumann Boundary Conditions
Applied Mathematical Sciences, Vol. 2, 2008, no. 58, 2891-2901 On Polygonal Domains with Trigonometric Eigenfunctions of the Laplacian under Dirichlet or Neumann Boundary Conditions Brian J. M c Cartin
More informationDETERMINING THE HURWITZ ORBIT OF THE STANDARD GENERATORS OF A BRAID GROUP
Yaguchi, Y. Osaka J. Math. 52 (2015), 59 70 DETERMINING THE HURWITZ ORBIT OF THE STANDARD GENERATORS OF A BRAID GROUP YOSHIRO YAGUCHI (Received January 16, 2012, revised June 18, 2013) Abstract The Hurwitz
More information9-12 Mathematics Vertical Alignment ( )
Algebra I Algebra II Geometry Pre- Calculus U1: translate between words and algebra -add and subtract real numbers -multiply and divide real numbers -evaluate containing exponents -evaluate containing
More informationOn non-bipartite distance-regular graphs with valency k and smallest eigenvalue not larger than k/2
On non-bipartite distance-regular graphs with valency k and smallest eigenvalue not larger than k/2 J. Koolen School of Mathematical Sciences USTC (Based on joint work with Zhi Qiao) CoCoA, July, 2015
More informationA characterisation of cubic parity graphs (with complete details)
A characterisation of cubic parity graphs (with complete details) 23rd July 2002; minor revisions 1st April 2003 Rommel Barbosa Instituto de Informatica, Universidade Federal de Goiás Caixa Postal 131,
More informationCubic Cayley Graphs and Snarks
Cubic Cayley Graphs and Snarks Klavdija Kutnar University of Primorska Nashville, 2012 Snarks A snark is a connected, bridgeless cubic graph with chromatic index equal to 4. non-snark = bridgeless cubic
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationA characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q)
A characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q) Joris De Kaey and Hendrik Van Maldeghem Ghent University, Department of Pure Mathematics and Computer
More informationMath 6 Extended Prince William County Schools Pacing Guide (Crosswalk)
Math 6 Extended Prince William County Schools Pacing Guide 2017-2018 (Crosswalk) Teacher focus groups have assigned a given number of days to each unit based on their experiences and knowledge of the curriculum.
More informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
More informationALGEBRA (SMR Domain 1) Algebraic Structures (SMR 1.1)...1
TABLE OF CONTENTS Page Numbers ALGEBRA (SMR Domain 1)...1 0001 Algebraic Structures (SMR 1.1)...1 Apply basic properties of real and complex numbers in constructing mathematical arguments (e.g., if a
More informationTABLE OF CONTENTS POLYNOMIAL EQUATIONS AND INEQUALITIES
COMPETENCY 1.0 ALGEBRA TABLE OF CONTENTS SKILL 1.1 1.1a. 1.1b. 1.1c. SKILL 1.2 1.2a. 1.2b. 1.2c. ALGEBRAIC STRUCTURES Know why the real and complex numbers are each a field, and that particular rings are
More informationSherali-Adams Relaxations of Graph Isomorphism Polytopes. Peter N. Malkin* and Mohammed Omar + UC Davis
Sherali-Adams Relaxations of Graph Isomorphism Polytopes Peter N. Malkin* and Mohammed Omar + UC Davis University of Washington May 18th 2010 *Partly funded by an IBM OCR grant and the NSF. + Partly funded
More informationUniform Star-factors of Graphs with Girth Three
Uniform Star-factors of Graphs with Girth Three Yunjian Wu 1 and Qinglin Yu 1,2 1 Center for Combinatorics, LPMC Nankai University, Tianjin, 300071, China 2 Department of Mathematics and Statistics Thompson
More informationUSAC Colloquium. Bending Polyhedra. Andrejs Treibergs. September 4, Figure 1: A Rigid Polyhedron. University of Utah
USAC Colloquium Bending Polyhedra Andrejs Treibergs University of Utah September 4, 2013 Figure 1: A Rigid Polyhedron. 2. USAC Lecture: Bending Polyhedra The URL for these Beamer Slides: BendingPolyhedra
More informationOn Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
On ome Polytopes Contained in the 0,1 Hypercube that Have a mall Chvátal Rank Gérard Cornuéjols Dabeen Lee April 2016, revised July 2017 Abstract In this paper, we consider polytopes P that are contained
More informationCyclic Central Configurations in the Four-Body Problem
Cyclic Central Configurations in the Four-Body Problem Gareth E. Roberts Department of Mathematics and Computer Science College of the Holy Cross Josep Cors (Universitat Politècnica de Catalunya) NSF DMS-0708741
More informationCompact hyperbolic Coxeter n-polytopes with n + 3 facets
Compact hyperbolic Coxeter n-polytopes with n + 3 facets Pavel Tumarkin Independent University of Moscow B. Vlassievskii 11, 11900 Moscow, Russia pasha@mccme.ru Submitted: Apr 3, 007; Accepted: Sep 30,
More informationCLASSIFICATION OF FIRST-ORDER FLEXIBLE REGULAR BICYCLE POLYGONS
CLASSIFICATION OF FIRST-ORDER FLEXIBLE REGULAR BICYCLE POLYGONS ROBERT CONNELLY AND BALÁZS CSIKÓS Abstract. A bicycle (n, k)-gon is an equilateral n-gon whose k-diagonals are equal. S. Tabachnikov proved
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationWhen is the Matching Polytope Box-totally Dual Integral?
When is the Matching Polytope Box-totally Dual Integral? Guoli Ding a Lei Tan b Wenan Zang b a Mathematics Department, Louisiana State University Baton Rouge, LA 70803, USA b Department of Mathematics,
More informationSymmetric spherical and planar patterns
Symmetric spherical and planar patterns Jan van de Craats version August 3, 2011 1 Spherical patterns 1.1 Introduction Many objects in daily life exhibit various forms of symmetry. Balls, bowls, cylinders
More informationCHARACTERIZATIONS OF CIRCLE PATTERNS AND CONVEX POLYHEDRA IN HYPERBOLIC 3-SPACE
CHARACTERIZATIONS OF CIRCLE PATTERNS AND CONVEX POLYHEDRA IN HYPERBOLIC 3-SPACE XIAOJUN HUANG AND JINSONG LIU ABSTRACT In this paper we consider the characterization problem of convex polyhedrons in the
More informationSymmetry and Billiards: An Application
Chapter 5 Symmetry and Billiards: An Application A billiard ball in motion on a frictionless triangular table bounces about along a path completely determined by its initial position, angle and speed.
More informationThinnest Covering of a Circle by Eight, Nine, or Ten Congruent Circles
Combinatorial Computational Geometry MSRI Publications Volume 5, 005 Thinnest Covering of a Circle by Eight, Nine, or Ten Congruent Circles Abstract. Let r n be the maximum radius of a circular disc that
More informationMoufang Polygons and Irreducible Spherical BN-pairs of Rank 2
Moufang Polygons and Irreducible Spherical BN-pairs of Rank 2 Katrin Tent Hendrik Van Maldeghem Abstract Let G be a group with an irreducible spherical BN-pair of rank 2 satisfying the additional condition
More informationCommon Core Edition Table of Contents
Common Core Edition Table of Contents ALGEBRA 1 Chapter 1 Foundations for Algebra 1-1 Variables and Expressions 1-2 Order of Operations and Evaluating Expressions 1-3 Real Numbers and the Number Line 1-4
More informationPacking and Minkowski Covering of Congruent Spherical Caps on a Sphere for N = 2,..., 9
Original Paper Forma, 1, 197 5, 006 Packing and Minkowski Covering of Congruent Spherical Caps on a Sphere for N =,..., 9 Teruhisa SUGIMOTO 1 * and Masaharu TANEMURA 1, 1 The Institute of Statistical Mathematics,
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationSYMMETRIES IN R 3 NAMITA GUPTA
SYMMETRIES IN R 3 NAMITA GUPTA Abstract. This paper will introduce the concept of symmetries being represented as permutations and will proceed to explain the group structure of such symmetries under composition.
More informationAn enumeration of equilateral triangle dissections
arxiv:090.599v [math.co] Apr 00 An enumeration of equilateral triangle dissections Aleš Drápal Department of Mathematics Charles University Sokolovská 83 86 75 Praha 8 Czech Republic Carlo Hämäläinen Department
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationBIRATIONAL TRANSFORMATIONS OF WEIGHTED GRAPHS
BIRATIONAL TRANSFORMATIONS OF WEIGHTED GRAPHS HUBERT FLENNER, SHULIM KALIMAN, AND MIKHAIL ZAIDENBERG Dedicated to Masayoshi Miyanishi Abstract. We introduce the notion of a standard weighted graph and
More informationBerge Trigraphs. Maria Chudnovsky 1 Princeton University, Princeton NJ March 15, 2004; revised December 2, Research Fellow.
Berge Trigraphs Maria Chudnovsky 1 Princeton University, Princeton NJ 08544 March 15, 2004; revised December 2, 2005 1 This research was partially conducted during the period the author served as a Clay
More informationTHE CAPORASO-HARRIS FORMULA AND PLANE RELATIVE GROMOV-WITTEN INVARIANTS IN TROPICAL GEOMETRY
THE CAPORASO-HARRIS FORMULA AND PLANE RELATIVE GROMOV-WITTEN INVARIANTS IN TROPICAL GEOMETRY ANDREAS GATHMANN AND HANNAH MARKWIG Abstract. Some years ago Caporaso and Harris have found a nice way to compute
More informationFRACTIONAL PACKING OF T-JOINS. 1. Introduction
FRACTIONAL PACKING OF T-JOINS FRANCISCO BARAHONA Abstract Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More information2 Definitions We begin by reviewing the construction and some basic properties of squeezed balls and spheres [5, 7]. For an integer n 1, let [n] denot
Squeezed 2-Spheres and 3-Spheres are Hamiltonian Robert L. Hebble Carl W. Lee December 4, 2000 1 Introduction A (convex) d-polytope is said to be Hamiltonian if its edge-graph is. It is well-known that
More informationFrom the Zonotope Construction to the Minkowski Addition of Convex Polytopes
From the Zonotope Construction to the Minkowski Addition of Convex Polytopes Komei Fukuda School of Computer Science, McGill University, Montreal, Canada Abstract A zonotope is the Minkowski addition of
More informationRational Numbers and Exponents
Rational and Exponents Math 7 Topic 4 Math 7 Topic 5 Math 8 - Topic 1 4-2: Adding Integers 4-3: Adding Rational 4-4: Subtracting Integers 4-5: Subtracting Rational 4-6: Distance on a Number Line 5-1: Multiplying
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationRestricted b-matchings in degree-bounded graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-009-1. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,
More informationDefinitions and Properties of R N
Definitions and Properties of R N R N as a set As a set R n is simply the set of all ordered n-tuples (x 1,, x N ), called vectors. We usually denote the vector (x 1,, x N ), (y 1,, y N ), by x, y, or
More informationNew Bounds for Partial Spreads of H(2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon
New Bounds for Partial Spreads of H2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon Ferdinand Ihringer Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Givat Ram, Jerusalem,
More informationThe Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More informationPolygons as sections of higher-dimensional polytopes
Polygons as sections of higher-dimensional polytopes Arnau Padrol 1 Institut für Mathematik Freie Universität Berlin Berlin, Germany arnau.padrol@fu-berlin.de Julian Pfeifle 2 Dept. Matemàtica Aplicada
More informationDense near octagons with four points on each line, III
Dense near octagons with four points on each line, III Bart De Bruyn Ghent University, Department of Pure Mathematics and Computer Algebra, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More information1-factor and cycle covers of cubic graphs
1-factor and cycle covers of cubic graphs arxiv:1209.4510v [math.co] 29 Jan 2015 Eckhard Steffen Abstract Let G be a bridgeless cubic graph. Consider a list of k 1-factors of G. Let E i be the set of edges
More informationSHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES
SHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES MOHAMMAD GHOMI Abstract. We show that the length of any periodic billiard trajectory in any convex body K R n is always at least 4 times the inradius
More informationarxiv: v2 [math.mg] 10 Feb 2015
Polygons as sections of higher-dimensional polytopes arxiv:1404.2443v2 [math.mg] 10 Feb 2015 Arnau Padrol 1 Institut für Mathematik Freie Universität Berlin Berlin, Germany arnau.padrol@fu-berlin.de Julian
More informationInterval minors of complete bipartite graphs
Interval minors of complete bipartite graphs Bojan Mohar Department of Mathematics Simon Fraser University Burnaby, BC, Canada mohar@sfu.ca Arash Rafiey Department of Mathematics Simon Fraser University
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationarxiv: v3 [math.co] 1 Oct 2018
NON-SPANNING LATTICE 3-POLYTOPES arxiv:7.07603v3 [math.co] Oct 208 Abstract. We completely classify non-spanning 3-polytopes, by which we mean lattice 3-polytopes whose lattice points do not affinely span
More informationFamilies of point-touching squares k-touching
Geombinatorics 12(2003), 167 174 Families of point-touching squares Branko Grünbaum Department of Mathematics, Box 354350 University of Washington Seattle, WA 98195-4350 e-mail: grunbaum@math.washington.edu
More informationInteger Programming, Part 1
Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas
More informationarxiv:math/ v1 [math.co] 3 Sep 2000
arxiv:math/0009026v1 [math.co] 3 Sep 2000 Max Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department San Francisco State University San Francisco, CA 94132 sergei@sfsu.edu
More informationCorrelation of 2012 Texas Essential Knowledge and Skills (TEKS) for Algebra I and Geometry to Moving with Math SUMS Moving with Math SUMS Algebra 1
Correlation of 2012 Texas Essential Knowledge and Skills (TEKS) for Algebra I and Geometry to Moving with Math SUMS Moving with Math SUMS Algebra 1 ALGEBRA I A.1 Mathematical process standards. The student
More informationSpherical Venn Diagrams with Involutory Isometries
Spherical Venn Diagrams with Involutory Isometries Frank Ruskey Mark Weston Department of Computer Science University of Victoria PO BOX 3055, Victoria, BC Canada V8W 3P6 {ruskey,mweston}@cs.uvic.ca Submitted:
More informationHamiltonian Tournaments and Gorenstein Rings
Europ. J. Combinatorics (2002) 23, 463 470 doi:10.1006/eujc.2002.0572 Available online at http://www.idealibrary.com on Hamiltonian Tournaments and Gorenstein Rings HIDEFUMI OHSUGI AND TAKAYUKI HIBI Let
More informationFinite Generalized Quadrangles
Finite Generalized Quadrangles S.E. Payne J.A. Thas ii Contents 1 Combinatorics of finite generalized quadrangles 1 1.1 Axioms and definitions.................................... 1 1.2 Restrictions on
More informationA short course on matching theory, ECNU Shanghai, July 2011.
A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.
More informationHecke Groups, Dessins d Enfants and the Archimedean Solids
arxiv:1309.2326v1 [math.ag] 9 Sep 2013 Hecke Groups Dessins d Enfants and the Archimedean Solids Yang-Hui He 1 and James Read 2 1 Department of Mathematics City University London Northampton Square London
More informationBALL-POLYHEDRA. 1. Introduction
BALL-POLYHEDRA BY KÁROLY BEZDEK, ZSOLT LÁNGI, MÁRTON NASZÓDI AND PETER PAPEZ Abstract. We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex
More information