We study the dispersion of digital (0, m, 2)-nets; i.e. the size of the largest axes-parallel box within such point sets. Digital nets are an important class of low-discrepancy point sets. We prove tight lower and upper bounds for certain subclasses of digital nets where the generating matrices are of triangular form and compute the dispersion of special nets such as the Hammersley point set exactly.

中文翻译：

---

数字（0，m，2）网的色散

我们研究数字（0，  m，2）网络的离散度；即在这些点集中最大的平行轴框的大小。数字网络是一类重要的低差异点集。我们证明了数字网络的某些子类的紧密上下限，其中生成矩阵是三角形的，并精确计算了诸如Hammersley点集之类的特殊网络的色散。