Matrices and submatrices with constrained invariant factors
Matrix problems and stable homotopy types of polyhedra
This is a survey of the results on stable homotopy types of polyhedra of small dimensions, mainly obtained by H.-J. Baues and the author [3, 5, 6]. The proofs are based on the technique of matrix problems (bimodule categories).
Matrix representable so-rings.
Maximising the permanent of -matrices and the number of extensions of Latin rectangles.
Meixner-type results for Riordan arrays and associated integer sequences.
More on evaluating determinants
Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions
Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime...