Related papers: Efficient construction by ruler and compass of a P…
In this article, we found all simple closed geodesics on regular spherical octahedra and spherical cubes. In addition, we estimate the number of simple closed geodesics on regular spherical tetrahedra.
Constructing well-behaved Laplacian and mass matrices is essential for tetrahedral mesh processing. Unfortunately, the \emph{de facto} standard linear finite elements exhibit bias on tetrahedralized regular grids, motivating the development…
We describe how to construct a dodecahedron, tetrahedron, cube, and octahedron out of pvc pipes using standard fittings.
A projective rectangle is like a projective plane that has different lengths in two directions. We develop harmonic conjugation in projective rectangles. We construct projective rectangles in some harmonic matroids (matroids where harmonic…
We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…
We establish tight bounds for beacon-based coverage problems, and improve the bounds for beacon-based routing problems in simple rectilinear polygons. Specifically, we show that $\lfloor \frac{n}{6} \rfloor$ beacons are always sufficient…
We introduce a geometric construction which relates to the pentagram map much in the way that a logarithmic spiral relates to a circle. After introducing the construction, we establish some basic geometric facts about it, and speculate on…
The class of strictly sign regular (SSR) matrices has been extensively studied by many authors over the past century, notably by Schoenberg, Motzkin, Gantmacher, and Krein. A classical result of Gantmacher-Krein assures the existence of SSR…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…
Kepler's thinking is highly original and the inspiration for discovering his famous third law is based on his rather curious geometric approach in his Harmonices mundi for explaining consonances. In this article we try to use a modern…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
We provide a simple construction of the Anderson operator in dimensions two and three. This is done through its quadratic form. We rely on an exponential transform instead of the regularity structures or paracontrolled calculus which are…
A compound pendulum of simple geometry was built from a lightweight rod to which a pair of masses are clamped, one above and the other below the axis of rotation. By making the position of the upper mass variable, it was found that the…
In 2006 P. Coulton and Y. Movshovich established an unfamilar but note-worthy general property of simple, polygonal, open arcs in the plane. We give a new and quite different proof of this property, and we consider a few generalizations.
Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…
In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…
A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…
In this study, various rotationally symmetric tilings that can be formed using pentagons that are related to rhombus are discussed. The pentagons can be convex or concave and can be degenerated into a trapezoid. If the pentagons are convex,…