Related papers: Elementary notions of lattice trigonometry

We discuss an experimental approach to open problems in toric geometry: are smooth projective toric varieties (i) projectively normal and (ii) defined by degree 2 equations? We discuss the creation of lattice polytopes defining smooth toric…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…

For a tensor triangulated category which is well generated in the sense of Neeman, it is shown that the collection of Bousfield classes forms a set. This set has a natural structure of a complete lattice which is then studied, using the…

We review, from a didactic point of view, the definition of a toric section and the different shapes it can take. We'll then discuss some properties of this curve, investigate its analogies and differences with the most renowned conic…

We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We…

We generalize an inequality for convex lattice polygons -- aka toric surfaces -- to general rational surfaces.

In one of the three 2010/2011 issues of the journal 'MathematicalSpectrum', this author gave a three-parameter description of the entire set of integral triangles(i.e. triangles with integer side lengths)and with a 120 degree angle.This…

This paper is a contribution to piecewise linear (PL) symplectic topology. We define the notion of PL symplectic manifold as being a combinatorial manifold endowed with a piecewise constant Whitney symplectic form and investigate possible…

This paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…

In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…

We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is…

The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice…

We provide a new formulation and proof of the triangle altitudes theorem in hyperbolic plane geometry, together with an easily computed discriminant to distinguish between different basic configurations of the altitudes of such a triangle.

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this…

A tetrahedron is called a path tetrahedron, if it has three mutually orthogonal edges that do not intersect at a single point. A tetrahedron is called a 4-ball tetrahedron, if there exists a sphere tangent to all its edges. We derive…

We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…

The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…

The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…