Related papers: 2013 Unit Vectors in the Plane

Let $C$ and $K$ be centrally symmetric convex bodies of volume $1$ in ${\mathbb R}^n$. We provide upper bounds for the multi-integral expression \begin{equation*}\|{\bf…

A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n -…

Pairs of metrics in a three-dimensional linear vector space are considered, one of which is a Minkowski type metric with the signature (+,-,-). Such metric pairs are classified and canonical presentations for them in each class are…

The real projective plane has three well know isomorphic constructions: the extended euclidean plane, unit (hemi)sphere, and three dimensional vector space over the reals. In this paper we find the isomorphisms that map between these three…

In this study we performed a computer search for unitals in planes of order 16. Some new unitals were found and we show that some unitals can be embedded in two or more different planes.

The uninorms with continuous underlying t-norm and t-conorm are characterized via an extended ordinal sum construction. Using the results of [18], where each uninorm with continuous underlying operations was characterized by properties of…

Huang, McKinnon, and Satriano conjectured that if $v \in \mathbb{R}^n$ has distinct coordinates and $n \geq 3$, then a hyperplane through the origin other than $\sum_i x_i = 0$ contains at most $2\lfloor n/2 \rfloor (n-2)!$ of the vectors…

In many real-world planning applications, agents might be interested in finding plans whose actions have costs that are as uniform as possible. Such plans provide agents with a sense of stability and predictability, which are key features…

We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…

We prove a simple inequality for a sum of squares of norms of two vectors in an inner product space. Next, using this inequality we derive the so--called "reverse uncertainty relation" and analyze its properties.

Let $K$ be a centrally symmetric spherical and simplicial polytope, whose vertices form a $\frac{1}{4n}-$net in the unit sphere in $\mathbb{R}^n$. We prove a uniform lower bound on the norms of all hyperplane projections $P: X \to X$, where…

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…

A set $U$ of unit vectors is selectively balancing if one can find two disjoint subsets $U^+$ and $U^-$, not both empty, such that the Euclidean distance between the sum of $U^+$ and the sum of $U^-$ is smaller than $1$. We prove that the…

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

Explicit formulae are given for the nine possible induced matrix norms corresponding to the 1-, 2-, and $\infty$-norms for Euclidean space. The complexity of computing these norms is investigated.

We characterize the infimum of a matrix norm of a square matrix A induced by an absolute norm, over the fields of real and complex numbers. Usually this infimum is greater than the spectral radius of A. If A is sign equivalent to a…

We establish the optimal lower bound $\gtrsim N$ for counting the number of distinct inner products of pairs from any $N$ given vectors in $\R^2$. Essentially, we lift a related incidence structure defined by inner products in the plane to…

We characterize the sets of norm one vectors $\mathbf{x}_1,\ldots,\mathbf{x}_k$ in a Hilbert space $\mathcal H$ such that there exists a $k$-linear symmetric form attaining its norm at $(\textbf{x}_1,\ldots,\mathbf{x}_k)$. We prove that in…

A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…

Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…