English
Related papers

Related papers: Frame Potentials and Orthogonal Vectors

200 papers

For a collection of $N$ unit vectors $\mathbf{X}=\{x_i\}_{i=1}^N$, define the $p$-frame energy of $\mathbf{X}$ as the quantity $\sum_{i\neq j} |\langle x_i,x_j \rangle|^p$. In this paper, we connect the problem of minimizing this value to…

Metric Geometry · Mathematics 2021-07-21 Alexey Glazyrin , Josiah Park

For any positive real number $p$, the $p$-frame potential of $N$ unit vectors $X:=\{\mathbf x_1,\ldots,\mathbf x_N\}\subset \mathbb R^d$ is defined as ${\rm FP}_{p,N,d}(X)=\sum_{i\neq j}|\langle \mathbf x_i,\mathbf x_j\rangle |^p$. In this…

Functional Analysis · Mathematics 2020-07-29 Zhiqiang Xu , Zili Xu

In this article we define frame for a Krein space K with a J-orthonormal basis and extend the notion of frame sequence and frame potential analogous to Hilbert spaces.We show that every frame is a sum of three orthonormal bases of a Krein…

Functional Analysis · Mathematics 2014-06-25 Shibashis Karmakar , Sk Monowar Hossein

An orthogonal n-frame is an ordered set of n pairwise orthogonal vectors. The set of all orthogonal n-frames in a d-dimensional quadratic vector space is an algebraic variety V(d,n). In this paper, we investigate the variety V(d,n) as well…

Commutative Algebra · Mathematics 2026-01-01 Laura Casabella , Alessio Sammartano

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

Computational Geometry · Computer Science 2024-05-21 Dror Chawin , Ishay Haviv

Suppose that for some unit vectors $b_1,\ldots b_n$ in $\mathbb C^d$ we have that for any $j\neq k$ $b_j$ is either orthogonal to $b_k$ or $|\langle b_j,b_k\rangle|^2 = 1/d$ (i.e. $b_j$ and $b_k$ are unbiased). We prove that if $n=d(d+1)$,…

Quantum Physics · Physics 2022-06-01 Máté Matolcsi , Mihály Weiner

This paper concerns the geometric structure of optimizers for frame potentials. We consider finite, real or complex frames and rotation or unitarily invariant potentials, and mostly specialize to Parseval frames, meaning the frame potential…

Functional Analysis · Mathematics 2014-07-08 Bernhard G. Bodmann , John Haas

This paper proves the existence of potentials of the first and second kind of a Frobenius like structure in a frame which encompasses families of arrangements. Surprisingly the proof is based on the study of finite sets of vectors in a…

Algebraic Geometry · Mathematics 2016-08-31 Claus Hertling , Alexander Varchenko

The near orthgonality of certain $k$-vectors involving the Ramanujan sums were studied by E. Alkan in [J. Number Theory, 140:147--168 (2014)]. Here we undertake the study of similar vectors involving a generalization of the Ramanujan sums…

Number Theory · Mathematics 2023-12-13 Neha Elizabeth Thomas , K Vishnu Namboothiri

A uniform tight frame of N vectors for a d dimensional space is correlation minimizing if among all such frames it is as "nearly" orthogonal as possible, i.e., it minimizes the maximal inner product of unequal vectors. In this paper we…

Functional Analysis · Mathematics 2015-03-31 Grant Getzelman , Nicole L. Leonhard , Vern I. Paulsen

In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among $n$ Boolean vectors in $d$ dimensions. The OV Conjecture (OVC) posits that OV requires $n^{2-o(1)}$ time to solve, for all…

Computational Complexity · Computer Science 2017-09-18 Daniel Kane , Ryan Williams

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Information Theory · Computer Science 2017-11-10 Kasper Green Larsen , Jelani Nelson

The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound…

Optimization and Control · Mathematics 2021-01-01 Yuning Yang

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

How can $d+k$ vectors in $\mathbb{R}^d$ be arranged so that they are as close to orthogonal as possible? In particular, define $\theta(d,k):=\min_X\max_{x\neq y\in X}|\langle x,y\rangle|$ where the minimum is taken over all collections of…

Combinatorics · Mathematics 2019-08-30 Boris Bukh , Christopher Cox

Let $n$ be a positive integer. We show that a unit rational space vector whose multiple by $n$ is an integer vector can be extended to a rational orthonormal basis whose all members have the same property.

Number Theory · Mathematics 2014-09-18 Masanori Kobayashi , Chikara Nakayama

We consider extensions of the Rattray theorem and two Makeev's theorems, showing that they hold for several maps, measures, or functions simultaneously, when we consider orthonormal $k$-frames in $\R^n$ instead of orthonormal basis (full…

Algebraic Topology · Mathematics 2012-12-27 Pavle Blagojević , Roman Karasev

We show that if we have an orthogonal base ($u_1,\ldots,u_p$) in a $p$-dimensional vector space, and select $p+1$ vectors $v_1,\ldots, v_p$ and $w$ such that the vectors traverse the origin, then the probability of $w$ being to closer to…

Probability · Mathematics 2014-04-22 Daniel A. Diaz-Pachon , J. Sunil Rao , Jean-Eudes Dazard

The various ways to reduce number of vectors describing condition of particles for high energy physics problems are presented. In particular decomposition of any vector with respect to the basis, consisting of any four linearly independent…

High Energy Physics - Phenomenology · Physics 2007-05-23 Alexander L. Bondarev

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Computational Geometry · Computer Science 2023-02-21 Sujoy Bhore , Robert Ganian , Liana Khazaliya , Fabrizio Montecchiani , Martin Nöllenburg
‹ Prev 1 2 3 10 Next ›