Related papers: The Redheffer matrix of a partially ordered set
It was conjectured at the end of the book "Representation theory of Artin algebras" by M. Auslander, I. Reiten and S. Smalo that an Artin algebra with the property that its finitely generated indecomposable modules are up to isomorphism…
In 1972 H. L. Montgomery announced a remarkable connection between the distribution of the zeros of the Riemann zeta-function and the distribution of eigenvalues of large random Hermitian matrices. Since then a number of startling…
Haagerup's proof of the non commutative little Grothendieck inequality raises some questions on the commutative little inequality, and it offers a new result on scalar matrices with non negative entries. The theory of completely bounded…
For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…
For any primitive matrix $M\in\mathbb{R}^{n\times n}$ with positive diagonal entries, we prove the existence and uniqueness of a positive vector $\mathbf{x}=(x_1,\dots,x_n)^t$ such that $M\mathbf{x}=(\frac{1}{x_1},\dots,\frac{1}{x_n})^t$.…
Many books on polarization give tables of Mueller matrices. Here we give a table of Mueller matrices M, coherency matrices C, and coherency matrix factors F for different polarization components. F is not given for some complicated cases.…
For {\theta} \in [0, 2{\pi}), consider the rotation matrix R? and h = ({\lambda}, 0; 0, 0), {\lambda} > 1. Let W_n({\theta}) denote the product of m R?'s and n h's with the condition m \leq [\epsilon\astn], (0 < \epsilon < 1). We analyze…
The centralizer algebra of a matrix consists of those matrices that commute with it. We investigate the basic representation-theoretic invariants of centralizer algebras, namely their radicals, projective indecomposable modules, injective…
Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…
Several determinants with gamma functions as elements are evaluated. This kind of determinants are encountered in the computation of the probability density of the determinant of random matrices. The s-shifted factorial is defined as a…
In this survey, we summarize some results in the literature involving the mesh category, which is a combinatorial representation of the category of modules over a finite-dimensional associative algebra. We discuss Riedtmann's well-behaved…
Let $Q$ be a set of primes with relative density $\delta$. We count integers in $[1,x]$ with prime factors all in $Q$ that also have a divisor in $(y,2y]$. We establish the order of magnitude for all $\delta \in (0,1]$. This generalizes the…
We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.
We give a Riemann-Hilbert approach to the theory of matrix orthogonal polynomials. We will focus on the algebraic aspects of the problem, obtaining difference and differential relations satisfied by the corresponding orthogonal polynomials.…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…
We define two notions of partial sums of a Riordan array, corresponding respectively to the partial sums of the rows and the partial sums of the columns of the Riordan array in question. We characterize the matrices that arise from these…
The algebraic relations between the principal minors of an $n\times n$ matrix are somewhat mysterious, see e.g. [lin-sturmfels]. We show, however, that by adding in certain \emph{almost} principal minors, the relations are generated by a…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
Hilbert's Nullstellensatz is one of the most fundamental correspondences between algebra and geometry, and has inspired a plethora of noncommutative analogs. In last two decades, there has been an increased interest in understanding…