L_p linear discrepancy of totally unimodular matrices
This note studies, for \(p\geq 1\), the \(L_p\) linear discrepancy of a totally unimodular matrix \(A\), \(\text{lindisc}_p (A)\). It is shown that for all natural numbers \(n\) there exists a totally unimodular matrix \(A\in\{0,1\}^{(n+1)\times n}\), satisfying \(\text{lindisc}_p(A)\geq c_p (1+o(1))\), where \[ c_p=\max_{a\in [0,1]} \left((1-a)a^p + a(1-a)^p\right)^{1/p} \] and where the \(o(1)\) term depends only on \(n\). Moreover, it is shown that \[ \frac{p}{p+1}\left(\frac{1}{p+1}\right)^{1/p} \leq c_p \leq \frac{p}{p+1}\left(\frac{1}{p+1}\right)^{1/p} \left(1+2^{-p+2}\right) \] for \(p\geq 3\) and that, if \(p\) is natural, there exist totally unimodular \((p+1)\times p\) matrices satisfying \[ \text{lindisc}_p > \frac{p}{p+1}\left(\frac{1}{p+1}\right)^{1/p}. \]
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- Lattice approximation and linear discrepancy of totally unimodular matrices. Extended abstract
- Linear discrepancy of totally unimodular matrices
- Linear versus hereditary discrepancy
- Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
This page was built for publication: \(L_{p}\) linear discrepancy of totally unimodular matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861031)
