Related papers: In Limbo: Three Triangle Centers
Within the framework of Berwald-Moor Geometry in H_3, the paper studies the construction of additive poly-angles (bingles and tringles). It is shown that, considering additiveness in the large, there exist an infinity of such poly-angles.
We introduce an elementary transformation called flips on tilings by squares and triangles and conjecture that it connects any two tilings of the same region of the Euclidean plane.
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic…
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…
Circumcenters play an important role in the design and analysis of accelerating various iterative methods in optimization. In this work, we propose Bregman (pseudo-)circumcenters associated with finite sets. We show the existence and give…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
In this paper we survey Eckardt points on a smooth complex cubic threefold with an approach aimed at computing all Eckardt points of a cubic threefold. In addition, we construct cubic threefolds with no Eckardt points but containing triple…
The main goal of this paper is to introduce a set of conjectures on the relations in the tautological rings. In particular, the framework gives an efficient algorithm to calculate all tautological equations using only finite dimensional…
A research for a general expression of the triplets of integer sided triangles with a $120^{\circ}$ angle, in parallel with the case of a $60^{\circ}$ angle.
Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This last one classifies the case of $a^3b$-quadrilaterals with some irrational angle: there are a sequence of…
Work in progress concerning alternative formalizations of arithmetic.
We first introduce a configuration of arbitrary isogonal conjugates related to a known property concerning the spiral center of two pairs of isogonal conjugates. We then consider a special case where two conics are tangent at exactly two…
The triple point numbers and the triple point spectrum of a closed 3-manifold were defined in (R. Vigara, Representaci\'on de 3-variedades por esferas de Dehn rellenantes, PhD Thesis, UNED 2006). They are topological invariants that give a…
A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.
We show that the the image of the regular projection of a vertex of a cone over a triangle that minimizes the ratio of the cube of the area of the boundary of the cone and the square of the volume of the cone coincides with the incenter.
We define the "source" and the "spring" of a log canonical center and use them to solve several problems in higher-codimension adjunction. The main application is to the construction of semi log canonical pairs. Version 2: References…
We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve.
Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of…