Related papers: On the lattice point covering problem in dimension…
In this paper, we study a second order variational problem for locally convex hypersurfaces, which is the affine invariant analogue of the classical Plateau problem for minimal surfaces. We prove existence, regularity and uniqueness results…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…
Topological defects in crystalline lattices are considered. In relation to physical realizability of such defects, criteria for geometric compatibility of the lattice distortions are formulated. For 2D lattices it is shown that the answer…
We investigate the lattice L(V) of subspaces of an m-dimensional vector space V over a finite field GF(q) with q being the n-th power of a prime p. It is well-known that this lattice is modular and that orthogonality is an antitone…
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…
Some ball-quotient orbifolds are related by covering maps. We exploit these coverings to find infinite towers of orbifolds uniformized by the complex 2-ball and some orbifolds over K3 surfaces uniformized by the 2-ball. Corresponding…
We give an algorithmic proof of Pick's theorem which calculates the area of a lattice-polygon in terms of the lattice-points.
Beyond normal surfaces there are several open questions concerning 2- dimensional spaces. We present some results and conjectures along this line.
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially…
We investigate geometric properties of surfaces given by certain formulae. In particular, we calculate the singular curvature and the limiting normal curvature of such surfaces along the set of singular points consisting of singular points…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
In this paper, we mainly investigate distortion and covering theorems on some classes of pluriharmonic mappings.
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 present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…
We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…