Related papers: Equiangular subspaces in Euclidean spaces
This paper is a continuation of the papers [2,3,4,5,6]. In this paper the osculating spaces of arbitrary order of a manifold embedded in Euclidean space are considered. A better estimation of their dimensions as well as the description of…
The dimension of a linear space is the maximum positive integer $d$ such that any $d$ of its points generate a proper subspace. For a set $K$ of integers at least two, recall that a pairwise balanced design PBD$(v,K)$ is a linear space on…
The article reviews some of the (fairly scattered) information available in the mathematical literature on the subject of angles in complex vector spaces. The following angles and their relations are considered: Euclidean, complex, and…
There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…
We develop the notion of $g$-angle between two subspaces of a normed space. In particular, we discuss the $g$-angle between a $1$-dimensional subspace and a $t$-dimensional subspace for $t\geq 1$ and the $g$-angle between a $2$-dimensional…
We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d >= 4 and n sufficiently large, depending on d. As a…
A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. Einhorn and Schoenberg conjectured that the vertices of the regular icosahedron is the…
In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given $n$ diameters of a circle and a positive integer $k<n$, this paper addresses the problem of…
A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with $n=2^s$ vertices is not known when $s \ge 3$. This paper solves the first open case and finds the optimal equilateral small octagon. Its…
This chapter explores the notion of "dimension" of a set. Various power laws by which an Euclidean space can be characterized are used to define dimensions, which then explore different aspects of the set. Also discussed are the…
We construct spaces of 1-dimensional supersymmetric Euclidean field theories and show that they represent real or complex K-theory. A noteworthy feature of our bordism category is that the identity bordism of a point is connected to…
A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…
We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
Answering a question of Jiang and Polyanskii as well as Jiang, Tidor, Yao, Zhang, and Zhao, we show the existence of infinitely many angles $\theta$ for which the maximum number of lines in $\mathbb R^n$ meeting at the origin with pairwise…
Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
It is shown that a classical construction of D.S. Asche of 72 equiangular lines in the 19 dimensional Euclidean space contains a subset of 54 equiangular lines embedded in an 18 dimensional subspace.