相关论文: 2013 Unit Vectors in the Plane

Let $L$ be a finite-dimensional real normed space, and let $B$ be the unit ball in $L$. The sign sequence constant of $L$ is the least $t>0$ such that, for each sequence $v_1, \ldots, v_n \in B$, there are signs $\varepsilon_1, \ldots,…

The main results here are two Helly type theorems for the sum of (at most) unit vectors in a normed plane. Also, we give a new characterization of centrally symmetric convex sets in the plane.

We discuss a multiplicative version of the Verschiebung map of Witt vectors that we call the norm.

We prove that there exists a norm in the plane under which no n-point set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric…

A plane configuration {v_1,...,v_m} of vectors in {\mathbb R}^2 is said to be balanced if for any index i, the set of the det(v_i,v_j) for j\neq i is symmetric around the origin. A plane configuration is said to be uniform if every pair of…

We construct a Parseval frame with $n+1$ vectors in $\R^n$ that contains a given vector. We also provide a characterization of unit-norm frames that can be scaled to a Parseval frame.

Fix a point in a finite-dimensional complex vector space and consider the sequence of iterates of this point under the composition of a unitary map with the orthogonal projection on the hyperplane orthogonal to the starting point. We prove…

Theorem A. Let $x_1,...,x_{2k+1}$ be unit vectors in a normed plane. Then there exist signs $\epsi_1,...,\epsi_{2k+1}\in\{\pm 1\}$ such that $\norm{\sum_{i=1}^{2k+1}\epsi_i x_i}\leq 1$. We use the method of proof of the above theorem to…

We prove that the multiple summing norm of multilinear operators defined on some $n$-dimensional real or complex vector spaces with the $p$-norm may be written as an integral with respect to stables measures. As an application we show…

Our main result states that whenever we have a non-Euclidean norm $\|\cdot\|$ on a two-dimensional vector space $X$, there exists some $x\neq 0$ such that for every $\lambda\neq 1, \lambda>0$, there exist $y, z\in X$ verifying that…

We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove…

We study the sizes of delta-additive sets of unit vectors in a d-dimensional normed space: the sum of any two vectors has norm at most delta. One-additive sets originate in finding upper bounds of vertex degrees of Steiner Minimum Trees in…

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…

Let $f$ be a symmetric norm on ${\mathbb R}^n$ and let ${\mathcal B}({\mathcal H})$ be the set of all bounded linear operators on a Hilbert space ${\mathcal H}$ of dimension at least $n$. Define a norm on ${\mathcal B}({\mathcal H})$ by…

A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\it 1-plane graph}. A graph is maximal 1-plane (or 1-planar) if no…

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

In this paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one…

A drawing of a graph in the plane is called 1-planar if each edge is crossed at most once. A graph together with a 1-planar drawing is a 1-plane graph. A 1-plane graph $G$ with exactly $4|V (G)|-8$ edges is called optimal. The crossing…

We prove the validity of the strong version of the union of uniform closed balls conjecture, formulated in 2011 as [4, Conjecture 2.5], in the plane.