The Redheffer Matrix of a Partially Ordered Set

  title={The Redheffer Matrix of a Partially Ordered Set},
  author={Herbert S. Wilf},
  journal={Electron. J. Comb.},
  • H. Wilf
  • Published 2004
  • Mathematics, Computer Science
  • Electron. J. Comb.
R. Redheer described an nn 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 Redheer matrix to nite posets that have a 0 element and nd the analogous results in the more general situation. 

Topics from this paper

Symmetric matrices related to the Mertens function
Abstract In this paper, we explore a family of congruences over N ∗ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments,Expand
The Generalized Dedekind Determinant
The aim of this note is to calculate the determinants of certain matrices which arise in three different settings, namely from characters on finite abelian groups, zeta functions on lattices andExpand
A sparser matrix representation of the Mertens function
  • J. Kline
  • Mathematics
  • Linear Algebra and its Applications
  • 2019
Abstract Redheffer introduced a sparse ( 0 , 1 ) matrix whose determinant provides an unorthodox representation of the Mertens function. The growth of the Mertens function is intimately tied to theExpand
Delange's Tauberian theorem and asymptotic normality of random ordered factorizations of integers
By a suitable shifting-the-mean parametrization at the Dirichlet series level and Delange's Tauberian theorems, we show that the number of factors in random ordered factorizations of integers isExpand
Matrices related to Dirichlet series
We attach a certain n×n matrix An to the Dirichlet series L(s)=∑k=1∞akk−s. We study the determinant, characteristic polynomial, eigenvalues, and eigenvectors of these matrices. The determinant of AnExpand
A Central Limit Theorem for Random Ordered Factorizations of Integers
Write an integer as finite products of ordered factors belonging to a given subset $\mathcal{P}$ of integers larger than one. A very general central limit theorem is derived for the number of orderedExpand
Dirichlet matrices: Determinants, permanents and the Factorisatio Numerorum problem
Abstract Dirichlet matrices are strongly connected to some important problems in Number Theory, such as the Prime Number Theorem, the Riemann Hypothesis and Kalmar's Factorisatio Numerorum problem.Expand
The Redheffer numbers and their applications
In this paper, we define the Redheffer numbers and then we obtain their miscellaneous properties. Also, we study the Redheffer numbers modulo m. Furthermore, we define the Redheffer orbits and theExpand
Bordered Hermitian matrices and sums of the Möbius function
Abstract Matrices in R n × n with determinant equal to ∑ i ≤ n μ ( i ) , where μ represents the Mobius function, have been studied for decades. The motivation to study such matrices is the closeExpand
Equivalence classes of permutations avoiding a pattern
Given a permutation pattern p and an equivalence relation on permutations, we study the corresponding equivalence classes all of whose members avoid p. Four relations are studied: Conjugacy, orderExpand


On the eigenvalues of Redheffer's matrix, II
The Redheffer matrix A n = ( a ij ) n×n defined by a ij = 1 when i | j or j = 1 and a ij = 0 otherwise has many interesting number theoretic properties. In this paper we give fairly precise estimatesExpand
Cogrowth of groups and a matrix of redheffer
Abstract We describe a relationship between the cogrowth function (and other similarly defined functions) of a presentation of a torsion-free group and the Riemann hypothesis. This relationship isExpand
On the spectral radius of a (0,1) matrix related to Merten's function
Abstract Define n× n matrices Dn = (dij) and Cn = (cij) by dij = 1 if i∣j, 0 otherwise and Cn = (0, 1, 1,…, 1)T(1, 0, 0,…, 0). Let An = Dn + Cn. We use the directed graph of An −In to obtain theExpand
Spectral Properties of a Matrix of Redheffer
Abstract Define n × n matrices D n = ( d ij ) and C n = ( c ij ) by d ij = 1 if i | j , 0 otherwise, and C n = (0, 1, 1,…,1) T (1, 0, 0,…,0). Let A n = D n + C n . The matrix is of number-theoreticExpand
Distribution of the Number of Factors in Random Ordered Factorizations of Integers
Abstract We study in detail the asymptotic behavior of the number of ordered factorizations with a given number of factors. Asymptotic formulae are derived for almost all possible values of interest.Expand
A Dominant Negative Eigenvalue of a Matrix of Redheffer
Abstract Define the matrix An as the sum of Dn = (dij) and Cn, where dij = 1 when i|j and zero when i ∤ j, and where Cn = (0, 1, 1, …, 1)T(1, 0, 0, …, 0). We use the Gersgorin disc theorem andExpand
A Matrix for Counting Paths in Acyclic Digraphs
  • R. Stanley
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 1996
We define a matrixAassociated with an acyclic digraph?, such that the coefficient ofzjin det(I+zA) is the number ofj-vertex paths in 1. This result is actually a special case of a more generalExpand
The Theory of the Riemann Zeta-Function
The Riemann zeta-function embodies both additive and multiplicative structures in a single function, making it our most important tool in the study of prime numbers. This volume studies all aspectsExpand
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1994
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used. Expand
Eine explizit lösbare Optimierungsaufgabe
Man bilde auf die folgende Weise eine n × n — Matrix A(n): In der ersten Spalte ist jedes Element 1, in der zweiten Spalte ist jedes zweite Element 1, in der dritten Spalte ist jedes dritte ElementExpand