Pages that link to "Item:Q1167186"
From MaRDI portal
The following pages link to Every large set of equidistant (0,+1,-1)-vectors forms a sunflower (Q1167186):
Displayed 13 items.
- An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
- A note on equidistant subspace codes (Q897616) (← links)
- Equidistant subspace codes (Q898789) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- On large vector systems with equal scalar products (Q1161575) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Improved bounds for the sunflower lemma (Q2058613) (← links)
- Pseudo sunflowers (Q2143417) (← links)
- Equidistant codes in the Grassmannian (Q2345600) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Bounds on the Maximum Number of Vectors with given Scalar Products (Q3784099) (← links)
- On restricted intersections and the sunflower problem (Q6121916) (← links)