Related papers: Minimal polygons with fixed lattice width
We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
We give a bound on the probability that a randomly chosen affine unimodular lattice has large holes, and a similar bound on the probability of large holes in the spectrum of a random flat torus. We discuss various motivations and…
A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…
We introduce some compact orbifolds on which there is a certain finite group action having a simple convex polytope as the orbit space. We compute the orbifold fundamental group and homology groups of these orbifolds. We calculate the…
We give a topological bound on the number of minimal models of a class of three dimensional log smooth pairs of general type.
We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…
In this short note we construct unbounded families of minimal surfaces of general type with canonical map of degree 4 such that the limits of the slopes assume countably many different values among 6+2/3 and 8.
This paper establishes some equivalent conditions of a uninorm, extending an arbitrary triangular norm on [0, e] or an arbitrary triangular conorm on [e, 1] to the whole lattice.
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…
We answer a question of Vorobets by showing that the lattice property for flat surfaces is equivalent to the existence of a positive lower bound for the areas of affine triangles. We show that the set of affine equivalence classes of…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…
The simulations of the light scalar mesons on the lattice are presented at the introductory level. The methods for determining the scalar meson masses are described. The problems related to some of these methods are presented and their…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
Since J. L. Lagrange initiated in 1760 the study of minimal surfaces of Euclidean 3-space, minimal surfaces in real space forms have been studied extensively by many mathematicians during the last two and half centuries. In contrast, so far…
This paper is a continuation of our paper about boundary rigidity and filling minimality of metrics close to flat ones. We show that compact regions close to a hyperbolic one are boundary distance rigid and strict minimal fillings. We also…
The ground spaces of a vector space of hermitian matrices, partially ordered by inclusion, form a lattice constructible from top to bottom in terms of intersections of maximal ground spaces. In this paper we characterize the lattice…
The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of the…
The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…