Related papers: The complete characterization of tangram pentagons
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
In their 2002 article, Ghirardi, Marinatto and Weber have proposed a formal analysis of the entanglement properties for a system consisting of N distinguishable particles. Their analysis leads to the differentiation of three possible…
The obstruction set for graphs with knotless embeddings is not known, but a recent paper of Goldberg, Mattman, and Naimi indicates that it is quite large. Almost all known obstructions fall into four Triangle-Y families and they ask if…
Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…
The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence…
The family $\Sigma_r$ consists of all $r$-graphs with three edges $D_1,D_2,D_3$ such that $|D_1\cap D_2|=r-1$ and $D_1 \triangle D_2 \subseteq D_3$. A generalized triangle, $\mathcal{T}_r \in \Sigma_r$ is an $r$-graph on…
Every normal periodic tiling is a strongly balanced tiling. The properties of periodic tilings by convex polygons are rearranged from the knowledge of strongly balanced tilings. From the results, we show the properties of representative…
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…
Every three-connected planar graph with n vertices has a drawing on an O(n^2) x O(n^2) grid in which all faces are strictly convex polygons. These drawings are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids. More…
We prove that there are at most 13 real quadratic fields that admit a ternary universal quadratic lattice, thus establishing a strong version of Kitaoka's Conjecture for quadratic fields. More generally, we obtain explicit upper bounds on…
We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…
The diagonals of a quadrilateral form four component triangles (in two ways). For each of various shaped quadrilaterals, we examine 1000 triangle centers located in these four component triangles. Using a computer, we determine when the…
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…
We study the geometry of the space of Mermin pentagrams, objects that are used to rule out the existence of noncontextual hidden variable theories as alternatives to quantum theory. It is shown that this space of 12096 possible pentagrams…
We prove that every unit area convex pentagon is contained in a convex quadrilateral of area no greater than $3/\sqrt{5}$, and that every unit area convex hexagon is contained in a convex pentagon of area no greater than $7/6$. Both results…
We define a computable topological invariant $\mu(\gamma)$ for generic closed planar regular curves $\gamma$, which gives an effective lower bound for the number of inflection points on a given generic closed planar curve. Using it, we…
Cubical rectangles are being defined and explored here over the $n-$dimensional geometric cube $Q_n.$ They form a new class of geometric objects that includes all the edges and all the squares of the $n-$cube. We enumerate and characterize…
The group classification of exotic pentaquarks involving four standard quarks and a single antiquark to produce pentaquarks of strangeness +1 is outlined.
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
In this article, we study the representability of integers as sums of pentagonal numbers, where a pentagonal number is an integer of the form $P_5(x)=\frac{3x^2-x}{2}$ for some non-negative integer $x$. In particular, we prove the…