
arXiv: math/0408263
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.
partially ordered set, Exact enumeration problems, generating functions, Matrix equations and identities, Determinants, permanents, traces, other special matrix functions, determinant, permanent, algebraic, identities, Group actions on posets, etc., combinatorics, Redneffer matrix, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05A15, exact enumeration problems
partially ordered set, Exact enumeration problems, generating functions, Matrix equations and identities, Determinants, permanents, traces, other special matrix functions, determinant, permanent, algebraic, identities, Group actions on posets, etc., combinatorics, Redneffer matrix, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05A15, exact enumeration problems
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
