This paper is inspired by recent results [15, 16] which have shown that a multiplicative generator of a strict triangular norm can be reconstructed from the first partial derivatives of the triangular norm on the segment {0} x [0,1]. The strict triangular norms to which this method is applicable have been called zero-reconstructible triangular norms. This paper shows that every continuous triangular norm can be approximated (with an arbitrary precision) by a zero-reconstructible one, and thus substantiates the significance of this subclass of strict triangular norms.
Zero-term rank of a matrix is the minimum number of lines (rows or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve zero-term rank of the
$m \times n$ real matrices. We also obtain combinatorial equivalent condition for the zero-term rank of a real matrix.