Article

# Equilateral Dimension of the Rectilinear Space.

Designs Codes and Cryptography (Impact Factor: 0.78). 01/2000; 21:149-164. DOI:10.1023/A:1008391712305
Source: DBLP

ABSTRACT It is conjectured that there exist at most 2k equidistant points in the k- dimensional rectilinear space. This conjecture has been verified for k 3; we show here its validity in dimension k = 4. We also discuss a number of related questions. For instance, what is the maximum number of equidistant points lying in the hyperplane: P k i=1 x i = 0 ? If this number would be equal to k, then the above conjecture would follow. We show, however, that this number is k + 1 for k 4. 1

0 0
·
0 Bookmarks
·
16 Views
• ##### Article: Exponential Lower Bound for the Translative Kissing Numbers of d -Dimensional Convex Bodies
[hide abstract]
ABSTRACT: The translative kissing number H(K) of a d -dimensional convex body K is the maximum number of mutually nonoverlapping translates of K which touch K . In this paper we show that there exists an absolute constant c > 0 such that H(K)≥ 2 cd for every positive integer d and every d -dimensional convex body K . We also prove a generalization of this result for pairs of centrally symmetric convex bodies. 26 June, 1998 Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; 19n3p447.pdf yes no no yes
Discrete and Computational Geometry 02/1998; 19(3):447-455. · 0.65 Impact Factor
• Source
##### Article: Covering a Symmetric Poset by Symmetric Chains.
[hide abstract]
ABSTRACT: We prove a min-max result on special partially ordered sets, a conjecture of András Frank. As corollaries we deduce Dilworth's theorem and the well-known min-max formula for the minimum size edge cover of a graph.
Combinatorica 01/1997; 17:339-344. · 0.56 Impact Factor
• Source
##### Article: Extremal Problems in Minkowski Space related to Minimal Networks
[hide abstract]
ABSTRACT: We solve the following problem of Z. F\"uredi, J. C. Lagarias and F. Morgan [FLM]: Is there an upper bound polynomial in $n$ for the largest cardinality of a set S of unit vectors in an n-dimensional Minkowski space (or Banach space) such that the sum of any subset has norm less than 1? We prove that |S|\leq 2n and that equality holds iff the space is linearly isometric to \ell^n_\infty, the space with an n-cube as unit ball. We also remark on similar questions raised in [FLM] that arose out of the study of singularities in length-minimizing networks in Minkowski spaces.
08/2007;