Related papers: A Logarithmic Spiral Formed by a Sequence of Regul…
For every $n$, we construct two curves in the plane that intersect at least $n$ times and do not form spirals. The construction is in three stages: we first exhibit closed curves on the torus that do not form double spirals, then arcs on…
Let $R=C[[t]]$ be the ring of power series over an algebraically closed field $C$ of characteristic zero. We show that each connection on a finite flat $R((x))$-module is the sum of a regular singular connection and a diagonalizable…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
The logarithmic multiplicative group is a proper group object in logarithmic schemes, which morally compactifies the usual multiplicative group. We study the structure of the stacks of logarithmic maps from rational curves to this…
The present paper reports a novel behavior involving regular polygons with n sides and filled to varying degrees with granular materials. These are comprised of a set of hollow polygons produced on a 3D printer, and a single larger hollow…
A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…
Let $C: y^2=ax^4+bx^2+c$, be an elliptic curve defined over $\mathbb Q$. A set of rational points $(x_i,y_i) \in C(\mathbb Q)$, $i=1,2,\cdots,$ is said to be a sequence of consecutive squares if $x_i= (u + i)^2$, $i=1,2,\cdots$, for some…
We classify edge-to-edge tilings of the sphere by congruent almost equilateral pentagons, in which four edges have the same length. Together with our earlier classifications of edge-to-edge tilings of the sphere by congruent equilateral…
Inspired by Coxeter's notion of Petrie polygon for $d$-polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigzag structure for several interesting families of…
A method to construct transition curves using a family of the quartic Bezier spiral is described. The transition curves discussed are S-shape and C-shape of contact, between two separated circles. A spiral is a curve of monotone increasing…
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on…
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
Spiral patterns in some disc galaxies have two arms in the centre, and three or more arms on the periphery. The same result is also obtained in numerical simulations of stellar and gaseous discs. We argue that such patterns may occur due to…
Given a smooth, closed, oriented 4-manifold X and alpha in H_2(X,Z) such that alpha.alpha > 0, a closed 2-form w is constructed, Poincare dual to alpha, which is symplectic on the complement of a finite set of unknotted circles. The number…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
The satisfactory development of Quaternionic Analysis has indicated new solutions for physical and mathematical problems. It is worth mentioning the fact that quaternions possess four dimensions, and in this way they may be considered as…
We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…