English
Related papers

Related papers: Finite two-distance tight frames

200 papers

In the $m$-dimensional affine space $AG(m,q)$ over the finite field $\mathbb{F}_q$ of odd order $q$, the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,q}$ where vertices are the points of $AG(m,q)$ and two…

Combinatorics · Mathematics 2021-02-08 Gábor Korchmáros , Federico Romaniello , Tamás Szőnyi

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

Group Theory · Mathematics 2023-09-12 Karmele Garatea-Zaballa , Andrea Lucchini

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

Combinatorics · Mathematics 2023-07-28 Nadav Meir , Aris Papadopoulos

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…

Combinatorics · Mathematics 2025-01-24 Maria Chudnovsky , Daniel Cizma , Nati Linial

This paper concerns frames and equiangular lines over finite fields. We find a necessary and sufficient condition for systems of equiangular lines over finite fields to be equiangular tight frames (ETFs). As is the case over subfields of…

Combinatorics · Mathematics 2025-05-20 Ian Jorquera , Emily J. King

In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…

Metric Geometry · Mathematics 2019-03-12 Panu Lahti

In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…

Combinatorics · Mathematics 2018-07-06 Dragan Mašulović , Bojana Pantić

A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…

Functional Analysis · Mathematics 2022-07-19 Mikhail Ganzhinov

An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. A regular simplex is a special type of ETF in which the number of vectors is one more than the dimension of the space they span. In this paper, we…

Functional Analysis · Mathematics 2017-11-21 Matthew Fickus , John Jasper , Emily J. King , Dustin G. Mixon

It is well known that two finite sequences of vectors in inner product spaces are unitarily equivalent if and only if their respective inner products (Gram matrices) are equal. Here we present a corresponding result for the projective…

Functional Analysis · Mathematics 2013-12-20 Tuan-Yow Chien , Shayne Waldron

A {\em faithful (unit) distance graph} in $\mathbb{R}^d$ is a graph whose set of vertices is a finite subset of the $d$-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is…

Combinatorics · Mathematics 2017-12-01 Noga Alon , Andrey Kupavskii

Equiangular tight frames provide optimal packings of lines through the origin. We combine Steiner triple systems with Hadamard matrices to produce a new infinite family of equiangular tight frames. This in turn leads to new constructions of…

Functional Analysis · Mathematics 2017-06-29 Matthew Fickus , John Jasper , Dustin G. Mixon , Jesse Peterson

The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…

Combinatorics · Mathematics 2022-02-14 Remie Janssen , Leonie van Steijn

Finite tight frames for polynomial subspaces are constructed using monic Hahn polynomials and Krawtchouk polynomials of several variables. Based on these polynomial frames, two methods for constructing tight frames for the Euclidean spaces…

Classical Analysis and ODEs · Mathematics 2014-03-04 Yuan Xu

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Combinatorics · Mathematics 2022-05-06 Stefan Steinerberger

A {\em resolving set} for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\em metric dimension} of $\Gamma$ is the…

Combinatorics · Mathematics 2013-12-19 Robert F. Bailey

We construct an open set of structurally unstable three parameter families whose weak and so called moderate topological classification defined below has a numerical invariant that may take an arbitrary positive value. Here and below…

Dynamical Systems · Mathematics 2018-08-23 Yulij Ilyashenko , Yury Kudryashov , Ilya Schurov

A discrete frame for $L^2({\mathbb R}^d)$ is a countable sequence $\{e_j\}_{j\in J}$ in $L^2({\mathbb R}^d)$ together with real constants $0<A\leq B< \infty$ such that $$ A\|f\|_2^2 \leq \sum_{j\in J}|\langle f,e_j \rangle |^2 \leq…

Classical Analysis and ODEs · Mathematics 2021-02-05 Mahya Ghandehari , Kris Hollingsworth

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

Differential Geometry · Mathematics 2016-03-22 Roberto Frigerio , Jean-Francois Lafont , Alessandro Sisto
‹ Prev 1 4 5 6 7 8 10 Next ›