A LATTICE-THEORETIC GENERALIZATION OF THE LEHMER MATRIX
Abstract
In this paper, we present a lattice-theoretic generalization of the Lehmer matrix. We obtain some certain formulae for the determinant and the entries of the inverse of this new generalization by using lattice-theoretic tools. These formulae are generalization of formulae for the determinant and the inverse of the classical Lehmer matrix and most of its generalizations presented in the literature.
Keywords
References
- M. Aigner, Combinatorial Theory, Springer-Verlag, 1979.
- I. Akkuş, The Lehmer matrix with recursive factorial entries, Kuwait J. Sci, 42 (2015), no. 2, 34–41.
- B.V.R. Bhat, On greatest common divisor matrices and their applications, Linear Algebra Appl. 158 (1991) 77-97.
- R. Bhatia, Min matrices and Mean matrices, Math. Intelligencer 33, no.2 (2011) 22-28.
- E. Kılıç, P. Stanica, The Lehmer matrix and its recursive analogue, J. Combinat. Math and Combinat. Computing 74 (2010) 193-207.
- I. Korkee, P. Haukkanen, On meet and join matrices associated with incidence functions, Linear Algebra Appl. 372 (2003) 127-153.
- D. H. Lehmer, Problem E710, Amer. Math. Monthly, 53 (1946) p.97.
- M. Marcus, Basic Theorems in Matrix Theory, Nat. Bur. Standarts Appl. Math. Ser 57 (1960) 21-24.
Details
Primary Language
English
Subjects
Engineering
Journal Section
Research Article
Publication Date
September 30, 2016
Submission Date
June 27, 2016
Acceptance Date
-
Published in Issue
Year 2016 Volume: 29 Number: 3