Related papers: A Dihedral Acute Triangulation of the Cube
We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.
Inclusion properties are studied for balls of the triangular ratio metric, the hyperbolic metric, the $j^*$-metric, and the distance ratio metric defined in the unit ball domain. Several sharp results are proven and a conjecture about the…
A new formula is obtained in algebraic topology, in terms of Betti numbers, and a new method, called the spinal method, is suggested and developed for generating quadrangulations of closed orientable surfaces. Those surfaces arise as the…
We give an intrinsic characterization of all subsets of a doubling metric space that can arise as a member of some system of dyadic cubes on the underlying space, as constructed by M. Christ.
After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…
The present paper gives two concrete formulas for the volume of an arbitrary spherical tetrahedron, which is in a 3-dimensional spherical space of constant curvature +1. One formula is given in terms of dihedral angles, and another one is…
We classify the dihedral edge-to-edge tilings of the sphere by squares and rhombi.
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…
A variational equation of the third order in three-dimensional space is proposed which describes autoparallel curves of some connection.
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we derive explicit formulas and generating functions for the number of magic squares and magic cubes.
A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…
We establish a hierarchy of quantum dilogarithm identities associated to a sequence of triangular shaped quivers. The tetrahedron equation plays a key role in our construction.
We study the curvature of a smooth algebraic surface $X\subset \mathbb R^3$ of degree $d$ from the point of view of algebraic geometry. More precisely, we consider umbilical points and points of critical curvature. We prove that the number…
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
A Circumconic passes through a triangle's vertices. We define the Circumbilliard, a circumellipse to a generic triangle for which the latter is a 3-periodic. We study its properties and associated loci.
Triangulations of the cube into a minimal number of simplices without additional vertices have been studied by several authors over the past decades. For $3\leq n\leq 7$ this so-called simplexity of the unit cube $I^n$ is now known to be…
On objects of a triangulated category with a stability condition, we construct a topology.
We compute the analytic torsion of a cone over a sphere of dimension 1, 2, and 3, and we conjecture a general formula for the cone over an odd dimensional sphere.
In this article we investigate the existence of (2,3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there exists a (2,3)-cordial oriented hypercube for any dimension divisible by 3. Next, we provide…