Add to ORKGWe prove that there are at most exp{cA1^} different lattice polygons of area A. This improves a result of V. I. Arnol'd. 1
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
The lattice diameter, ‘(P), of a convex polygon P in R² measures the longest string of integer point...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
This thesis deals with three main extremal problems on convex lattice polygons in the plane. A conve...
A lattice point in the plane is a point with integer coordinates. A lattice polygon is a polygon who...
Abstract. Bárány and Tokushige solved the problem of characterizing the asymptotic behavior of the...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. ...
Abstract. We show by a direct construction that there are at least exp{cV (d−1)/(d+1)} convex lattic...
Darbā aplūkota problēma par izliektu režģa n-stūru minimālā laukuma atrašanu. Pierādīta teorēma par ...
. Lin and Chang gave a generating function for the number of convex polyominoes with an m+1byn+ 1 mi...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
Darbā aplūkota problēma par izliekta režģa n-stūra minimālā laukuma a(n) atrašanu. Pierādīta teorēma...
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
The lattice diameter, ‘(P), of a convex polygon P in R² measures the longest string of integer point...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
This thesis deals with three main extremal problems on convex lattice polygons in the plane. A conve...
A lattice point in the plane is a point with integer coordinates. A lattice polygon is a polygon who...
Abstract. Bárány and Tokushige solved the problem of characterizing the asymptotic behavior of the...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. ...
Abstract. We show by a direct construction that there are at least exp{cV (d−1)/(d+1)} convex lattic...
Darbā aplūkota problēma par izliektu režģa n-stūru minimālā laukuma atrašanu. Pierādīta teorēma par ...
. Lin and Chang gave a generating function for the number of convex polyominoes with an m+1byn+ 1 mi...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
Darbā aplūkota problēma par izliekta režģa n-stūra minimālā laukuma a(n) atrašanu. Pierādīta teorēma...
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
The lattice diameter, ‘(P), of a convex polygon P in R² measures the longest string of integer point...