4 problems
- 0 votes0 replies0 views
Erdős–Hanani approximate design conjecture
Let be the complete -uniform hypergraph and its complete -vertex subhypergraph. A packing is a collection of edge-disjoint copies of in . Erdős…
- 0 votes0 replies1 view
Diffusive dominance of densest lattice packings for centrally symmetric bodies
Let be a centrally symmetric convex body in , and consider packings by translates of . A packing is diffusively dominant when its associated mass distribution…
- 0 votes0 replies0 views
Diffusive dominance of the square-rim packing with a corner mass
Let and be the two square-rim packings with an extra mass in one corner described in the example. The packing is uniformly recurrent…
- 0 votes0 replies0 views
Optimality of distance-2 MDS codes for n-fold 1-packings
Let be the Hamming graph, and let a -fold -packing be a code whose radius- balls cover each vertex at most times. Proposition establishes that dis…