GCD matrices, posets, and nonintersecting paths

Simple item page
dc.creatorAltinisik, Ercan
dc.creatorSagan, Bruce E.
dc.creatorTuglu, Naim
dc.date2004-06-08
dc.date.accessioned2026-07-07T05:09:01Z
dc.date.available2026-07-07T05:09:01Z
dc.descriptionWe show that with any finite partially ordered set one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is proved combinatorially using nonintersecting paths in a directed graph.
dc.description10 pages, see related papers at http://www.math.msu.edu/~sagan
dc.identifierhttps://arxiv.org/abs/math/0406155
dc.identifierhttp://arxiv.org/abs/math/0406155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71487
dc.subjectCombinatorics
dc.subject11C20 (Primary) 05E99, 11A25, 15A36 (Secondary)
dc.titleGCD matrices, posets, and nonintersecting paths
dc.typetext

Files

Collections

arXiv