Pages that link to "Item:Q2567394"

The following pages link to An upper bound for the cardinality of an \(s\)-distance set in Euclidean space (Q2567394):

Displaying 11 items.

• A generalization of Larman-Rogers-Seidel's theorem (Q534036) (← links)
• Bounds on three- and higher-distance sets (Q648975) (← links)
• Cardinalities of \(k\)-distance sets in Minkowski spaces (Q1292877) (← links)
• An upper bound for the size of \(s\)-distance sets in real algebraic sets (Q2048560) (← links)
• Few distance sets in \(\ell_p\) spaces and \(\ell_p\) product spaces (Q2122671) (← links)
• A new upper bound for the size of \(s\)-distance sets in boxes (Q2300121) (← links)
• Tight Gaussian 4-designs (Q2388447) (← links)
• Inside s-inner product sets and Euclidean designs (Q2428639) (← links)
• On Euclidean tight 4-designs (Q2501660) (← links)
• Bounding the Size of an Almost-Equidistant Set in Euclidean Space (Q5219320) (← links)
• Bounds for sets with few distances distinct modulo a prime ideal (Q6042826) (← links)