arXiv subjects
Publications and source records attributed to Diana Davis.
We study the set of lengths of the horizontal chords of a continuous function. We give a new proof of Hopf's characterization of this set, and show that it implies that no matter which function we choose, at least half of the possible lengths occur. We prove several results about functions for which all the possible lengths occur.
The study of polygonal billiards, particularly those in the regular pentagon, has been the subject of two recent papers. One of these papers approaches the problem of discovering the periodic trajectories on the pentagon by identifying slopes of periodic directions with points in the Poincaré disk generated by hyperbolic isometric transformations. The other approach, coming from the other paper, transforms the double pentagon into a rectilinear translation surface called the 'golden L', where periodic directions are generated by a set of matrices associated with this surface in a special way. We connect and unify these two approaches, and use our unification of these results to generalize them to arbitrary $2g+1$-sided regular polygons.
We use voting precinct and election data to analyze the political geography of New Hampshire and Maine. We find that the location of dividing line between Congressional districts in both states are significantly different than what we would expect, which we argue is likely due to incumbent gerrymandering. We also discuss the limitations of classical fairness measures for plans with only two districts.
We establish basic geometric and topological properties of Thurston's Master Teapot and the Thurston set for superattracting unimodal self-maps of intervals. In particular, the Master Teapot is connected, contains the unit cylinder, and its intersection with a set $\mathbb{D} \times \{c\}$ grows monotonically with $c$. We show that the Thurston set described above is not equal to the Thurston set for postcritically finite tent maps, and we provide an arithmetic explanation for why certain gaps appear in plots of finite approximations of the Thurston set.
We show that the typical measure preserving transformation is not isomorphic to any interval exchange transformation.
We give a tree structure on the set of all periodic directions on the golden L, which gives an associated tree structure on the set of periodic directions for the pentagon billiard table and double pentagon surface. We use this to give the periods of periodic directions on the pentagon and double pentagon. We also show examples of many periodic billiard trajectories on the pentagon, which are strikingly beautiful, and we describe some of their properties. Finally, we give conjectures and future directions based on experimental computer evidence.
We consider the dynamics of light rays in triangle tilings where triangles are transparent and adjacent triangles have equal but opposite indices of refraction. We find that the behavior of a trajectory on a triangle tiling is described by an orientation-reversing three-interval exchange transformation on the circle, and that the behavior of all the trajectories on a given triangle tiling is described by a polygon exchange transformation. We show that, for a particular choice of triangle tiling, certain trajectories approach the Rauzy fractal, under rescaling.
We consider the dynamics of light rays in the trihexagonal tiling where triangles and hexagons are transparent and have equal but opposite indices of refraction. We find that almost every ray of light is dense in a region of a particular form: the regions have infinite area and consist of the plane with a periodic family of triangles removed. We also completely describe initial conditions for periodic and drift-periodic light rays.
The bounce spectrum of a polygonal billiard table is the collection of all bi-infinite sequences of edge labels corresponding to billiard trajectories on the table. We give methods for reconstructing from the bounce spectrum of a polygonal billiard table both the cyclic ordering of its edge labels and the sizes of its angles. We also show that it is impossible to reconstruct the exact shape of a polygonal billiard table from any finite collection of finite words from its bounce spectrum.
We consider a symbolic coding for geodesics on the family of Veech surfaces (translation surfaces rich with affine symmetries) recently discovered by Bouw and Moeller. These surfaces, as noticed by Hooper, can be realized by cutting and pasting a collection of semi-regular polygons. We characterize the set of symbolic sequences (cutting sequences) that arise by coding linear trajectories by the sequence of polygon sides crossed. We provide a full characterization for the closure of the set of cutting sequences, in the spirit of the classical characterization of Sturmian sequences and the recent characterization of Smillie-Ulcigrai of cutting sequences of linear trajectories on regular polygons. The characterization is in terms of a system of finitely many substitutions (also known as an S-adic presentation), governed by a one-dimensional continued fraction-like map. As in the Sturmian and regular polygon case, the characterization is based on renormalization and the definition of a suitable combinatorial derivation operator. One of the novelties is that derivation is done in two steps, without directly using Veech group elements, but by exploiting an affine diffeomorphism that maps a Bouw-Moeller surface to the dual Bouw-Möller surface in the same Teichmueller disk. As a technical tool, we crucially exploit the presentation of Bouw-Möller surfaces via Hooper diagrams.
We introduce a new dynamical system that we call "tiling billiards," where trajectories refract through planar tilings. This system is motivated by a recent discovery of physical substances with negative indices of refraction. We investigate several special cases where the planar tiling is created by dividing the plane by lines, and we describe the results of computer experiments.
We describe a case study of a problem-solving section, using the "Harkness" discussion method, of an honors multivariable calculus course. Students in the problem-solving section had equivalent outcomes on exams, reported higher ratings in self-assessments of skills, and took more math classes in the following year, compared to students in the lecture-based sections.
We describe the cutting sequences associated to geodesic flow on regular polygons, in terms of a combinatorial process called "derivation." This work is an extension of some of the ideas and results in Smillie and Ulcigrai's recent paper, where the analysis was made for the regular octagon. It turns out that the main structural properties of the octagon generalize in a natural way.
We are motivated by a problem about running: If a race was completed in an average pace of P minutes per mile, is there necessarily some mile of the race that was run in exactly P minutes? The answer is no. We explain why, and describe the history of this celebrated problem, known as the Universal Chord Theorem. We also clarify and streamline the proof of a more powerful result by Heinz Hopf from 1937.
Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern--Brocot tree to explore the recursive structure of geodesics between vertices on a cube, we prove, in some precise sense, that there are twice as many geodesics between certain pairs of vertices than other pairs. We also obtain the fact that there are no geodesics that start and end at the same vertex on the regular tetrahedron or the cube.
This text is aimed at undergraduates, or anyone else who enjoys thinking about shapes and numbers. The goal is to encourage the student to think deeply about seemingly simple things. The main objects of study are lines, squares, and the effects of simple geometric motions on them. Much of the beauty of this subject is explained through the text and the figures, and some of it is left for the student to discover in the exercises. We want readers to "get their hands dirty" by thinking about examples and working exercises, and to discover the elegance and richness of this area of mathematics.
We analyze the cutting sequences associated to geodesic flow on a large class of translation surfaces, including Bouw-Moller surfaces. We give a combinatorial rule that relates a cutting sequence corresponding to a given trajectory, to the cutting sequence corresponding to the image of that trajectory under the parabolic element of the Veech group. This extends previous work for regular polygon surfaces to a larger class of translation surfaces. We find that the combinatorial rule is the same as for regular polygon surfaces in about half of the cases, and different in the other half.
We study periodic linear trajectories in the double pentagon and periodic billiard trajectories in the regular pentagon.