Related papers: Lattice Surfaces and smallest triangles
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…
A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…
It is well-known that any Lennard-Jones type potential energy must have a periodic ground state given by a triangular lattice in dimension 2. In this paper, we describe a computer-assisted method that rigorously shows such global minimality…
Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is at least (n+3)/2.
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…
In this paper, we study closed embedded minimal hypersurfaces in a Riemannian $(n+1)$-manifold ($2\le n\le 6$) that minimize area among such hypersurfaces. We show they exist and arise either by minimization techniques or by min-max…
A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of…
We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…
In any 5 dimensional closed Sasakian manifold we prove that any minmax operation on the area among Legendrian surfaces is achieved by a continuous conformal Legendrian map from a closed riemann surface $S$ into $N^5$ equipped with an…
We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…
Given a triangle, what is the equation of the line which bisects its area and has a given slope? The set of all lines bisecting the area of a triangle has been elegantly determined as a certain 'deltoid' envelope and this gives an indirect…
We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K\"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in…
Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…
We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice…
An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$…
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
In this paper, we show that the total area of two distinct surfaces with Gaussian curvature equal to 1, which are also conformal to the Euclidean unit disk with the same conformal factor on the boundary, must be at least 4{\pi}. In other…
The second and fourth authors have conjectured that a certain hollow tetrahedron $\Delta$ of width $2+\sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture:…
We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…
Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…