Related papers: Finite two-distance tight frames

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

We study the properties of a set of vectors called tight frames that obtained as the orthogonal projection of some orthonormal basis of $\R^n$ onto $\R^k.$ We show that a set of vectors is a tight frame if and only if the set of all cross…

Frames for $\R^n$ can be thought of as redundant or linearly dependent coordinate systems, and have important applications in such areas as signal processing, data compression, and sampling theory. The word "frame" has a different meaning…

We study several interesting examples of Biangular Tight Frames (BTFs) - basis-like sets of unit vectors admitting exactly two distinct frame angles (ie, pairwise absolute inner products) - and examine their relationships with Equiangular…

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…

A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…

A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…

For every set $S$ of finite measure in $\mathbb{R}$ we construct a discrete set of real frequencies $\Lambda$ such that the exponential system $\{\exp(i\lambda t),\lambda\in\Lambda\}$ is a frame in $L^2(S)$

A Coxeter system is called two-dimensional if its associated Davis complex is two-dimensional (equivalently, every spherical subgroup has rank less than or equal to 2). We prove that given a two-dimensional system (W,S) and any other system…

A finite set $X$ in the Euclidean unit sphere is called an $s$-distance set if the set of distances between any distinct two elements of $X$ has size $s$. We say that $t$ is the strength of $X$ if $X$ is a spherical $t$-design but not a…

In this paper, we study conditions under which a finite subset $Z$ of the unit sphere $S^{d-1}\subset \mathbb{R}^{d}$ becomes a spherical $t$-design, when $Z$ is constructed by the following procedure: starting from a finite set of…

Let $q\geq 2$ be an integer, and $\Bbb F_q^d$, $d\geq 1$, be the vector space over the cyclic space $\Bbb F_q$. The purpose of this paper is two-fold. First, we obtain sufficient conditions on $E \subset \Bbb F_q^d$ such that the inverse…

We classify all spherical 2-designs that arise as orbits of finite group actions on real inner product spaces. Although it is well known that such designs can occur in representations without trivial components, we give a complete…

An equiangular tight frame (ETF) is a type of optimal packing of lines in a real or complex Hilbert space. In the complex case, the existence of an ETF of a given size remains an open problem in many cases. In this paper, we observe that…

We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. In particular, we show that any finite tight frame can be written as a union of prime tight frames. We then characterize…

An equiangular tight frame (ETF) is a set of unit vectors whose coherence achieves the Welch bound, and so is as incoherent as possible. Though they arise in many applications, only a few methods for constructing them are known. Motivated…

Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…