EuDML | Browse

The notion of convex set for subsets of lattices in one particular case was introduced in [1], where it was used to study Paretto's principle in the theory of group choice. This notion is based on a betweenness relation due to Glivenko [2]. Betweenness is used very widely in lattice theory as basis for lattice geometry (see [3], and, especially [4 part 1]).In the present paper the relative notions of convexity are considered for subsets of an arbitrary lattice.In section 1 certain relative notions...

Curvature and Flow in Digital Space

Atsushi Imiya (2013)

Actes des rencontres du CIRM

We first define the curvature indices of vertices of digital objects. Second, using these indices, we define the principal normal vectors of digital curves and surfaces. These definitions allow us to derive the Gauss-Bonnet theorem for digital objects. Third, we introduce curvature flow for isothetic polytopes defined in a digital space.

Discrete convexity.

Danilov, V.I., Koshevoj, G.A. (2004)

Zapiski Nauchnykh Seminarov POMI

Distribution of lattice points on hyperbolic surfaces

Vsevolod F. Lev (1996)

Acta Arithmetica

Let two lattices $Λ^{'}, Λ^{''} \subset ℝ^{s}$ have the same number of points on each hyperbolic surface $| x ₁ . . . x_{s} | = C$ . We investigate the case when Λ’, Λ” are sublattices of $ℤ^{s}$ of the same prime index and show that then Λ’ and Λ” must coincide up to renumbering the coordinate axes and changing their directions.

Economical Coverings of Sets of Lattice Points.

N. Alon (1991)

Geometric and functional analysis

Ein dreidimensionales Gitterpunktproblem.

Werner Georg Nowak (1980/1981)

Manuscripta mathematica

Formes quadratiques encapsulées

François Sigrist (1990)

Journal de théorie des nombres de Bordeaux

Gröbner bases of lattices, corner polyhedra, and integer programming.

Sturmfels, Bernd, Weismantel, Robert, Ziegler, Günter M. (1995)

Beiträge zur Algebra und Geometrie

Integer Points on Curves and Surfaces.

Wolfgang M. Schmidt (1985)

Monatshefte für Mathematik

Integral Self-Affine Tiles in ... Part II: Lattice Tilings.

Yang Wang, Jeffery C. Lagarias (1997)

The journal of Fourier analysis and applications [[Elektronische Ressource]]

Intrinsic Volumes and Lattice Points of Crosspolytopes.

Ulrich Betke, Martin Henk (1993)

Monatshefte für Mathematik

Klein polyhedra and lattices with positive norm minima

Oleg N. German (2007)

Journal de Théorie des Nombres de Bordeaux

A Klein polyhedron is defined as the convex hull of nonzero lattice points inside an orthant of $ℝ^{n}$ . It generalizes the concept of continued fraction. In this paper facets and edge stars of vertices of a Klein polyhedron are considered as multidimensional analogs of partial quotients and quantitative characteristics of these “partial quotients”, so called determinants, are defined. It is proved that the facets of all the $2^{n}$ Klein polyhedra generated by a lattice $Λ$ have uniformly bounded determinants...

Currently displaying 1 – 20 of 85

Page 1 Next