Lattices from tight frames and vertex transitive graphs (Q2325750): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Maple / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1902.02862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the restricted isometry property for random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to: ``Lattices from equiangular tight frames'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices from equiangular tight frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5787302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical codes and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the faces of randomly-projected hypercubes and orthants, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Nonharmonic Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner equiangular tight frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROMP: a sparse recovery approach to lattice-valued signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic perspective on integer sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Regular Graphs Derived from Combinatorial Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive direct products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability of unique integer solution to a system of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases of minimal vectors in lattices. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial Compressive Sensing for MIMO Radar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Laplacian spectra of direct and strong product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on Mathematical Crystallography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to finite tight frames / rank
 
Normal rank

Latest revision as of 13:00, 20 July 2024

scientific article
Language Label Description Also known as
English
Lattices from tight frames and vertex transitive graphs
scientific article

    Statements

    Lattices from tight frames and vertex transitive graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 2019
    0 references
    The paper investigates relations between tight frames and vertex transitive graphs. A tight frame, also known as strongly eutactic configuration, is a set of vectors in Euclidean space such that the sum of the squares of the linear forms defined by these vectors is proportional to the Euclidean quadratic form. The paper starts by reproving two well known results: Theorem 1.1 saying that tight frames are rational (a more general result is for instance Proposition 1.8 in [\textit{J. Martinet} and \textit{B. Venkov}, in: Résaux euclidiens, designs sphériques et formes modulaires. Autour des travaux de Boris Venkov. Genève: L'Enseignement Mathé\-matique, 112--134 (2001; Zbl 1131.11344)]). The other result is Theorem 1.3 saying that orbits of irreducible groups are strongly eutactic, which can be found for instance as Theorem 3.6.6 in the textbook [\textit{J. Martinet}, Perfect lattices in Euclidean spaces. Berlin: Springer (2003; Zbl 1017.11031)]. Theorem 1.3 is applied to obtain strongly eutactic configurations from distance transitive graphs in Theorem 1.5. Examples are given of how to construct strongly eutactic configurations in root lattices and their duals from famous distance transitive graphs.
    0 references
    0 references
    tight frames
    0 references
    strongly eutactic configurations
    0 references
    irreducible matrix groups
    0 references
    vertex transitive graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references