GCD matrices, posets, and nonintersecting paths

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
10 pages, see related papers at http://www.math.msu.edu/~sagan

Keywords

Combinatorics, 11C20 (Primary) 05E99, 11A25, 15A36 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/71487

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0406155
 http://arxiv.org/abs/math/0406155

Collections

arXiv