The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
The maximum number of odd submatrices in -matrices.
The restricted Toda chain, exponential Riordan arrays, and Hankel transforms.
Transformations preserving the Hankel transform.
V-кольца и их связь с группами автоморфизмов бинарных отношений
Zero-one matrices with an application to abelian groups
Zero-term rank preservers of integer matrices
The zero-term rank of a matrix is the minimum number of lines (row or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices. That is, a linear operator T preserves the zero-term rank if and only if it has the form T(A)=P(A ∘ B)Q, where P, Q are permutation matrices and A ∘ B is the Schur product with B whose entries are all nonzero integers.
О поворотах целых матриц (замечание к одной теореме Ю.В. Линника)
Сложность аддитивных вычислений семейств целочисленных линейных форм
Теоремы изоляции для ДОТУ-матриц