The Redheffer matrix of a partially ordered set
The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2
R. Redheffer described an $n\times n$ matrix of 0's and 1's the size of whose determinant is connected to the Riemann Hypothesis. We describe the permutations that contribute to its determinant and its permanent in terms of integer factorizations. We generalize the Redheffer matrix to finite posets that have a 0 element and find the analogous results in the more general situation.
DOI :
10.37236/1867
Classification :
15A15, 05A15, 15A24
Mots-clés : exact enumeration problems, algebraic, combinatorics, determinant, permanent, identities, Redneffer matrix, partially ordered set
Mots-clés : exact enumeration problems, algebraic, combinatorics, determinant, permanent, identities, Redneffer matrix, partially ordered set
@article{10_37236_1867,
author = {Herbert S. Wilf},
title = {The {Redheffer} matrix of a partially ordered set},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {2},
doi = {10.37236/1867},
zbl = {1077.15009},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1867/}
}
Herbert S. Wilf. The Redheffer matrix of a partially ordered set. The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2. doi: 10.37236/1867
Cité par Sources :