scholarly journals The number of partitions of a set of N points in k dimensions induced by hyperplanes

1967 ◽  
Vol 15 (4) ◽  
pp. 285-289 ◽  
Author(s):  
E. F. Harding

1. An arbitrary (k– 1)-dimensional hyperplane disconnects K-dimensional Euclidean space Ek into two disjoint half-spaces. If a set of N points in general position in Ek is given [nok +1 in a (k–1)-plane, no k in a (k–2)-plane, and so on], then the set is partitione into two subsets by the hyperplane, a point belonging to one or the other subset according to which half-space it belongs to; for this purpose the half-spaces are considered as an unordered pair.

2015 ◽  
Vol 2015 (1) ◽  
Author(s):  
Yulian Zhang ◽  
Valery Piskarev

Abstract Motivated by (Xu et al. in Bound. Value Probl. 2013:262, 2013) and (Yang and Ren in Proc. Indian Acad. Sci. Math. Sci. 124(2):175-178, 2014), in this paper we aim to construct a modified Green function in the upper-half space of the n-dimensional Euclidean space, which generalizes the boundary property of general Green potential.


1975 ◽  
Vol 18 (3) ◽  
pp. 335-346 ◽  
Author(s):  
M. Essén ◽  
H. L. Jackson

Let Rp(p≥2) denote p-dimensional Euclidean space, D the half space defined by {P = (x1, x2, …, xp) ∊ Rp: xp > 0} and ∂D the frontier of D in Rp. The Martin boundary (see [2]) of D can be identified with ∂D∪{∞}.


2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Lei Qiao

We discuss the behavior at infinity of modified Poisson integral and Green potential on a half-space of then-dimensional Euclidean space, which generalizes the growth properties of analytic functions, harmonic functions and superharmonic functions.


1961 ◽  
Vol 12 (3) ◽  
pp. 123-131 ◽  
Author(s):  
C. ST.J. A. Nash-Williams

A graph G consists, for the purposes of this paper, of two disjoint sets V(G), E(G), whose elements are called vertices and edges respectively of G, together with a relationship whereby with each edge is associated an unordered pair of distinct vertices (called its end-vertices) which the edge is said to join, and whereby no two vertices are joined by more than one edge. An edge γ and vertex ξ are incident if ξ is an end-vertex of γ. A monomorphism [isomorphism] of a graph G into [onto] a graph H is a one-to-one function φ from V(G)∪E(G) into [onto] V(H)∪E(H) such that φ(V(G))⊂V(H), φ(E(G))⊂E(H) and an edge and vertex of G are incident in G if and only if their images under φ are incident in H. G and H are isomorphic (in symbols, G ≅ H) if there exists an isomorphism of G onto H. A subgraph of G is a graph H such that V(H) ⊂ V(G), E(H)⊂E(G) and an edge and vertex of H are incident in H if and only if they are incident in G; if V(H) = V(G), H is a spanning subgraph. A collection of graphs are edge-disjoint if no two of them have an edge in common. A decomposition of G is a set of edge-disjoint subgraphs of G which between them include all the edges and vertices of G. Ln is a graph whose vertices are the lattice points of n-dimensional Euclidean space, two vertices A and B being joined by an edge if and only if AB is of unit length (and therefore necessarily parallel to one of the co-ordinate axes). An endless Hamiltonian line of a graph G is a spanning subgraph of G which is isomorphic to L1. The object of this paper is to prove that Ln is decomposable into n endless Hamiltonian lines, a result previously established (1) for the case where n is a power of 2.


2019 ◽  
Vol 489 (4) ◽  
pp. 339-343
Author(s):  
A. V. Kel’manov ◽  
A. V. Pyatkin ◽  
V. I. Khandeev

In the paper, we consider a problem of clustering a finite set of N points in d-dimensional Euclidean space into two clusters minimizing the sum over all clusters of the intracluster sums of the distances between clusters elements and their centers. The center of one cluster is defined as centroid (geometric center). The center of the other one is a sought point in the input set. We analyze the variant of the problem with the given clusters sizes. We have proved the strong NP-hardness of this problem.


2012 ◽  
Vol 96 (537) ◽  
pp. 471-479
Author(s):  
Ester Dalvit ◽  
Domenico Luminati

In n-dimensional Euclidean space no reflection with respect to a hyperplane can be realised by a rigid motion. But this is possible if we allow rigid motions in (n + 1)-dimensional space. These notes show a way to visualise a rigid motion of a cube in 4-dimensional space that flips the cube ‘as the page of a book’.The two terms rigid motion and isometry are sometimes used as synonyms. Yet they do refer to different concepts. The first one has a purely kinematic connotation: the swing of a door or the movement of a piece of furniture pushed over the floor are described by rigid motions. On the other hand to ensure that two figures are isometric it is enough that there exists a correspondence between their points that maintains the relative distances.


1998 ◽  
Vol 08 (03) ◽  
pp. 365-379 ◽  
Author(s):  
Gerhard Albers ◽  
Leonidas J. Guibas ◽  
Joseph S. B. Mitchell ◽  
Thomas Roos

Consider a set of n points in d-dimensional Euclidean space, d ≥ 2, each of which is continuously moving along a given individual trajectory. As the points move, their Voronoi diagram changes continuously, but at certain critical instants in time, topological events occur that cause a change in the Voronoi diagram. In this paper, we present a method of maintaining the Voronoi diagram over time, at a cost of O( log n) per event, while showing that the number of topological events has an upper bound of O(ndλs(n)), where λs(n) is the (nearly linear) maximum length of a (n,s)-Davenport-Schinzel sequence, and s is a constant depending on the motions of the point sites. In addition, we show that if only k points are moving (while leaving the other n - k points fixed), there is an upper bound of O(knd-1λs(n)+(n-k)dλ s(k)) on the number of topological events.


Filomat ◽  
2013 ◽  
Vol 27 (4) ◽  
pp. 703-712 ◽  
Author(s):  
Lei Qiao ◽  
Guantie Deng

The aim of this paper is to discuss the behavior at infinity of modified ?-potentials represented by the modified kernels in the upper-half space of the n-dimensional Euclidean space, which generalizes the growth properties of analytic functions, harmonic functions and superharmonic functions.


1999 ◽  
Vol 6 (4) ◽  
pp. 323-334
Author(s):  
A. Kharazishvili

Abstract We give a characterization of all those groups of isometric transformations of a finite-dimensional Euclidean space, for which an analogue of the classical Vitali theorem [Sul problema della misura dei gruppi di punti di una retta, 1905] holds true. This characterization is formulated in purely geometrical terms.


Sign in / Sign up

Export Citation Format

Share Document