The number of non-homogeneous lattice points in n-dimensional point sets

1953 ◽  
Vol 49 (1) ◽  
pp. 156-157 ◽  
Author(s):  
D. B. Sawyer

Let R be a set of points in n-dimensional Euclidean space, and let Δ′(R) denote the lower bound of the determinants of non-homogeneous lattices which have no point in R. For Δ′(R) to be non-zero it is necessary, as Macbeath has shown (2), that R should have infinite volume.

1969 ◽  
Vol 10 (1-2) ◽  
pp. 177-181 ◽  
Author(s):  
I. Danicic

Let K be an open convex domain in n-dimensional Euclidean space, symmetric about the origin O, and of finite Jordan content (volume) V. With K are associated n positive constants λ1, λ2,…,λn, the ‘successive minima of K’ and n linearly independent lattice points (points with integer coordinates) P1, P2, …, Pn (not necessarily unique) such that all lattice points in the body λ,K are linearly dependent on P1, P2, …, Pj-1. The points P1,…, Pj lie in λK provided that λ > λj. For j = 1 this means that λ1K contains no lattice point other than the origin. Obviously


1967 ◽  
Vol 7 (3) ◽  
pp. 323-326 ◽  
Author(s):  
M. J. C. Baker

The purpose of this paper is to prove that if n+3, or more, strongly convex sets on an n dimensional sphere are such that each intersection of n+2 of them is empty, then the intersection of some n+1 of them is empty. (The n dimensional sphere is understood to be the set of points in n+1 dimensional Euclidean space satisfying x21+x22+ …+x2n+1 = 1.)


2011 ◽  
Vol 03 (04) ◽  
pp. 473-489
Author(s):  
HAI DU ◽  
WEILI WU ◽  
ZAIXIN LU ◽  
YINFENG XU

The Steiner minimum tree and the minimum spanning tree are two important problems in combinatorial optimization. Let P denote a finite set of points, called terminals, in the Euclidean space. A Steiner minimum tree of P, denoted by SMT(P), is a network with minimum length to interconnect all terminals, and a minimum spanning tree of P, denoted by MST(P), is also a minimum network interconnecting all the points in P, however, subject to the constraint that all the line segments in it have to terminate at terminals. Therefore, SMT(P) may contain points not in P, but MST(P) cannot contain such kind of points. Let [Formula: see text] denote the n-dimensional Euclidean space. The Steiner ratio in [Formula: see text] is defined to be [Formula: see text], where Ls(P) and Lm(P), respectively, denote lengths of a Steiner minimum tree and a minimum spanning tree of P. The best previously known lower bound for [Formula: see text] in the literature is 0.615. In this paper, we show that [Formula: see text] for any n ≥ 2.


Author(s):  
Nathalie Deruelle ◽  
Jean-Philippe Uzan

This chapter presents the main features of the Minkowski spacetime, which is the geometrical framework in which the laws of relativistic dynamics are formulated. It is a very simple mathematical extension of three-dimensional Euclidean space. In special relativity, ‘relative, apparent, and common’ (in the words of Newton) space and time are represented by a mathematical set of points called events, which constitute the Minkowski spacetime. This chapter also stresses the interpretation of the fourth dimension, which in special relativity is time. Here, time now loses the ‘universal’ and ‘absolute’ nature that it had in the Newtonian theory.


2014 ◽  
Vol 57 (3) ◽  
pp. 640-647
Author(s):  
Konrad J. Swanepoel

AbstractA well-known theorem of Schütte (1963) gives a sharp lower bound for the ratio of the maximum and minimum distances between n + 2 points in n-dimensional Euclidean space. In this note we adapt Bárány’s elegant proof (1994) of this theorem to the space . This gives a new proof that the largest cardinality of an equilateral set in is n + 1 and gives a constructive bound for an interval (4–εn, 4 + εn) of values of p close to 4 for which it is known that the largest cardinality of an equilateral set in is n + 1.


2018 ◽  
Vol 28 (2) ◽  
pp. 280-286 ◽  
Author(s):  
ANDREY KUPAVSKII ◽  
NABIL H. MUSTAFA ◽  
KONRAD J. SWANEPOEL

A set of points in d-dimensional Euclidean space is almost equidistant if, among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in ℝd has cardinality O(d4/3).


1970 ◽  
Vol 22 (2) ◽  
pp. 235-241 ◽  
Author(s):  
M. A. Perles ◽  
G. T. Sallee

1. Recently a number of functions have been shown to satisfy relations on polytopes similar to the classic Euler relation. Much of this work has been done by Shephard, and an excellent summary of results of this type may be found in [11]. For such functions, only continuity (with respect to the Hausdorff metric) is required to assure that it is a valuation, and the relationship between these two concepts was explored in [8]. It is our aim in this paper to extend the results obtained there to illustrate the relationship between valuations and the Euler relation on cell complexes.To fix our notions, we will suppose that everything takes place in a given finite-dimensional Euclidean space X.A polytope is the convex hull of a finite set of points and will be referred to as a d-polytope if it has dimension d. Polytopes have faces of all dimensions from 0 to d – 1 and each of these is in turn a polytope. A k-dimensional face will be termed simply a k-face.


2014 ◽  
Vol 16 (06) ◽  
pp. 1450032
Author(s):  
Guoxin Wei ◽  
He-Jun Sun ◽  
Lingzhong Zeng

In this paper, we investigate eigenvalues of fractional Laplacian (–Δ)α/2|D, where α ∈ (0, 2], on a bounded domain in an n-dimensional Euclidean space and obtain a sharper lower bound for the sum of its eigenvalues, which improves some results due to Yildirim Yolcu and Yolcu in [Estimates for the sums of eigenvalues of the fractional Laplacian on a bounded domain, Commun. Contemp. Math. 15(3) (2013) 1250048]. In particular, for the case of Laplacian, we obtain a sharper eigenvalue inequality, which gives an improvement of the result due to Melas in [A lower bound for sums of eigenvalues of the Laplacian, Proc. Amer. Math. Soc. 131 (2003) 631–636].


1959 ◽  
Vol 11 ◽  
pp. 256-261 ◽  
Author(s):  
A. C. Woods

We select a Cartesian co-ordinate system in ndimensional Euclidean space Rn with origin 0 and employ the usual pointvector notation.By a lattice Λ in Rn we mean the set of all rational integral combinations of n linearly independent points X1, X2, … , Xn of Rn. The points X1 X2, … , Xn are said to form a basis of Λ. Let {X1, X2, … , Xn) denote the determinant formed when the co-ordinates of Xi are taken in order as the ith row of the determinant for i = 1,2, … , n. The absolute value of this determinant is called the determinant d(Λ) of Λ. It is well known that d(Λ) is independent of the particular basis one takes for Λ.A star body in Rn is a closed set of points K such that if X ∈ K then every point of the form tX where — 1 < t < 1 is an inner point of K.


1954 ◽  
Vol 6 ◽  
pp. 393-404 ◽  
Author(s):  
T. S. Motzkin ◽  
I. J. Schoenberg

Let A be a closed set of points in the n-dimensional euclidean space En. If p and p1 are points of En such that1.1then p1 is said to be point-wise closer than p to the set A. If p is such that there is no point p1 which is point-wise closer than p to A, then p is called a closest point to the set A.


Sign in / Sign up

Export Citation Format

Share Document