Designs in Grassmannian Spaces and Lattices
By C. Bachoc, R. Coulangeon, Gabriele Nebe. 2002
53 citations recorded by the source corpus.
Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/0a02c02cab28637357512b7aaf3e3ea86b6c6ecb
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Electrical and Electronic Engineering
In Numerical Analysis
- Henry Cohn
- Abhinav Kumar
- Gregory T. Minton
- Claude Pache
- Pierre de la Harpe
- Salvatore Torquato
- Frank H. Stillinger
- Maryna S. Viazovska
Citations in the corpus
- Cubature Formulas, Geometrical Designs, Reproducing Kernels, and Markov Operators (2005, methodology): “For designs in G/H a Grassmannian, see [ 8 ] and [6].”
- Optimal simplices and codes in projective spaces (2013, background): “Analogously to simplices in projective space, a Grassmannian simplex is tight if and only if it is a 1–design (a 2–design in the terminology of [7]), which holds if and only if the linear programming bound is sharp [5].”