The Relaxation Method for Linear Inequalities

1954 ◽  
Vol 6 ◽  
pp. 393-404 ◽  
Author(s):  
T. S. Motzkin ◽  
I. J. Schoenberg
Keyword(s):  
Euclidean Space ◽  
Relaxation Method ◽  
Linear Inequalities ◽  
Dimensional Euclidean Space ◽  
Closed Set ◽  
Image Position ◽  
Set Of Points

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.

scholarly journals On the Irreducibility of Convex Bodies

1959 ◽  
Vol 11 ◽  
pp. 256-261 ◽  
Author(s):  
A. C. Woods
Keyword(s):  
Euclidean Space ◽  
Convex Bodies ◽  
Dimensional Euclidean Space ◽  
Star Body ◽  
Closed Set ◽  
Absolute Value ◽  
Linearly Independent ◽  
The Absolute ◽  
Set Of Points ◽  
Rational Integral

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.

scholarly journals A Helly-type theorem on a sphere

1967 ◽  
Vol 7 (3) ◽  
pp. 323-326 ◽  
Author(s):  
M. J. C. Baker
Keyword(s):  
Euclidean Space ◽  
Convex Sets ◽  
Type Theorem ◽  
Dimensional Euclidean Space ◽  
Dimensional Sphere ◽  
Strongly Convex ◽  
Set Of Points

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.)

Properties of Harmonic Functions of Three Real Variables Given by Bergman-Whittaker Operators

1963 ◽  
Vol 15 ◽  
pp. 157-168 ◽  
Author(s):  
Josephine Mitchell
Keyword(s):  
Euclidean Space ◽  
Harmonic Functions ◽  
Three Dimensional ◽  
Dimensional Euclidean Space ◽  
Rectifiable Curve ◽  
Image Position

Let be a closed rectifiable curve, not going through the origin, which bounds a domain Ω in the complex ζ-plane. Let X = (x, y, z) be a point in three-dimensional euclidean space E3 and setThe Bergman-Whittaker operator defined by

ON THE STEINER RATIO IN $\mathcal{R}_{n}$

2011 ◽  
Vol 03 (04) ◽  
pp. 473-489
Author(s):  
HAI DU ◽  
WEILI WU ◽  
ZAIXIN LU ◽  
YINFENG XU
Keyword(s):  
Euclidean Space ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dimensional Euclidean Space ◽  
Minimum Length ◽  
Steiner Ratio ◽  
Line Segments ◽  
Finite Set ◽  
Steiner Minimum Tree ◽  
Set Of Points

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.

Multiple points for symmetric Lévy processes

1978 ◽  
Vol 83 (1) ◽  
pp. 83-90 ◽  
Author(s):  
John Hawkes
Keyword(s):  
Markov Process ◽  
Euclidean Space ◽  
Lévy Process ◽  
Lévy Processes ◽  
Transition Function ◽  
Levy Processes ◽  
Levy Process ◽  
Dimensional Euclidean Space ◽  
Multiple Points ◽  
Image Position

Let Xt be a Lévy process in Rd, d-dimensional euclidean space. That is X is a Markov process whose transition function satisfies

Minkowski spacetime

2018 ◽  
Author(s):  
Nathalie Deruelle ◽  
Jean-Philippe Uzan
Keyword(s):  
Euclidean Space ◽  
Special Relativity ◽  
Three Dimensional ◽  
Minkowski Spacetime ◽  
Dimensional Euclidean Space ◽  
Fourth Dimension ◽  
Relativistic Dynamics ◽  
Newtonian Theory ◽  
Space And Time ◽  
Set Of Points

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.

Symmetric Forms

1970 ◽  
Vol 13 (1) ◽  
pp. 83-87 ◽  
Author(s):  
K. V. Menon
Keyword(s):  
Euclidean Space ◽  
Dimensional Euclidean Space ◽  
Image Position ◽  
Class Of Functions

Let Rm denote a m dimensional Euclidean space. When x ∊ Rm will write x = (x1, x2,..., xm). Let R+m ={x: x ∊ Rm, xi < 0 for all i} and R-m ={x: x ∊ Rm, xi < 0 for all i}. In this paper we consider a class of functions which consists of mappings, Er(K) and Hr(K) of Rm into R which are indexed by K ∊ R+m and K ∊ R-m respectively, and defined at any point α ∊ Rm by1.1

scholarly journals Bounding the Size of an Almost-Equidistant Set in Euclidean Space

2018 ◽  
Vol 28 (2) ◽  
pp. 280-286 ◽  
Author(s):  
ANDREY KUPAVSKII ◽  
NABIL H. MUSTAFA ◽  
KONRAD J. SWANEPOEL
Keyword(s):  
Euclidean Space ◽  
Dimensional Euclidean Space ◽  
Set Of Points

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).

The number of polygons on a lattice

1961 ◽  
Vol 57 (3) ◽  
pp. 516-523 ◽  
Author(s):  
J. M. Hammersley
Keyword(s):  
Euclidean Space ◽  
Dimensional Euclidean Space ◽  
End Points ◽  
Unit Distance ◽  
Connective Constant ◽  
Image Position ◽  
Self Avoiding Walk ◽  
Self Avoiding Walks

In this paper an n-stepped self-avoiding walk is defined to be an ordered sequence of n + 1 mutually distinct points, each with (positive, negative, or zero) integer coordinates in d-dimensional Euclidean space (where d is fixed and d ≥ 2), such that any two successive points in the sequence are neighbours, i.e. are unit distance apart. If further the first and last points of such a sequence are neighbours, the sequence is called an (n + 1)-sided self-avoiding polygon. Clearly, under this definition a polygon must have an even number of sides. Let f(n) and g(n) denote the numbers of n-stepped self-avoiding walks and of n-sided self-avoiding polygons having a prescribed first point. In a previous paper (3), I proved that there exists a connective constant K such thatHere I shall prove the truth of the long-standing conjecture thatI shall also show that (2) is a particular case of an expression for the number of n-stepped self-avoiding walks with prescribed end-points, a distance o(n) apart, this being another old and popular conjecture.

Cell Complexes, Valuations, and the Euler Relation

1970 ◽  
Vol 22 (2) ◽  
pp. 235-241 ◽  
Author(s):  
M. A. Perles ◽  
G. T. Sallee
Keyword(s):  
Euclidean Space ◽  
Hausdorff Metric ◽  
Dimensional Euclidean Space ◽  
Cell Complexes ◽  
Finite Dimensional ◽  
Finite Set ◽  
Euler Relation ◽  
Set Of Points ◽  
The Relationship ◽  
Dimensional Face

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.

Sign in / Sign up

Export Citation Format

Share Document