Related papers: Elementary notions of lattice trigonometry

Let M be the interior of a compact 3-manifold with non-empty boundary, and T be an ideal (topological) triangulation of M. This paper describes necessary and sufficient conditions for the existence of angle structures, semi-angle structures…

A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.

In this work, we consider a number of problems defined on the triangular lattice with $n$ rows, which we will denote as $T_n$. Define a \textit{proper coloring} to be an assignment of colors to the points of $T_n$ such that no three points…

In this paper, we provide the necessary and sufficient conditions for the connected sum of knots in $S^3$ to be Legendrian simple.

I reconsider the approximation of Bessel functions with finite sums of trigonometric functions, in the light of recent evaluations of Neumann-Bessel series with trigonometric coefficients. A proper choice of the angle allows for an…

It is well known that the area $U$ of the triangle formed by three tangents to a parabola $X$ is half of the area $T$ of the triangle formed by joining their points of contact. In this article, we consider whether this property and similar…

The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…

We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian…

We initiate a systematic study of lattices of thick subcategories for arbitrary essentially small triangulated categories. To this end we give several examples illustrating the various properties these lattices may, or may not, have and…

The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…

We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…

A classical theorem of Ingham extended Parseval's formula of the trigonometrical system to arbitrary families of exponentials satisfying a uniform gap condition. Later his result was extended to several dimensions, but the optimal…

We present a criterion when six points chosen on the sides of a triangle belong to the same conic. Using this tool we show how the two geometrical gems - celebrated Poncelet's theorem of projective geometry and incredible Morley's theorem…

This article intends to characterize triangular norms on a finite lattice. We first give a method for generating a triangular norm on an atomistic lattice by the values of atoms. Then we prove that every triangular norm on a non-Boolean…

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

This paper treats triangles in the plane whose vertices lie on the integer lattice, i.e., the vertices have integer coordinates. It shows that apart from trivial examples, the circumcenter, centroid and orthocenter of such triangles never…

Lattices that can be represented in a kagome-like form are shown to satisfy a universal percolation criticality condition, expressed as a relation between P_3, the probability that all three vertices in the triangle connect, and P_0, the…

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…

We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.

We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…