Related papers: Explicit diagonalization of an anti-triangular Ces…
We define a q-analog of the adjacency matrix of the n-cube, determine its eigenvalues and write down a canonical eigenbasis. We give a weighted count of the number of rooted spanning trees in the q-analog of the n-cube. Remarks on the…
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
This note provides formula for determinant and inverse of r-circulant matrices with general sequences of third order. In other words, the study combines many papers in the literature.
First, we give a new example of silting-discrete algebras. Second, one explores when the algebra of triangular matrices over a finite dimensional algebra is $\tau$-tilting finite. In particular, we classify algebras over which triangular…
I construct a Lanczos process on a large and sparse matrix and use the results of this iteration to compute the inverse square root of the same matrix. The algorithm is a stable version of an earlier proposal by the author. It can be used…
This paper offers a personal review of some things we've learned about rates of convergence of Markov chains to their stationary distributions. The main topic is ways of speeding up diffusive behavior. It also points to open problems and…
A one dimensional XX spin chain of finite length coupled to reservoirs at both ends is solved exactly in terms of a matrix product state ansatz. An explicit representation of matrices of fixed dimension 4 independent of the chain length is…
The exponential of the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the sum of the inverse of the divisors of $n$ is the triangular matrix whose entries in the diagonal at…
We consider a sequence of matrices that are associated to Markov dynamical systems and use determinant-free linear algebra techniques (as well as some algebra and complex analysis) to rigorously estimate the eigenvalues of every matrix…
We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue…
We construct an explicit matrix product ansatz for the steady state of a boundary driven $XY\!Z$ spin-$\tfrac{1}{2}$ chain for arbitrary local polarizing channels at the chain's ends. The ansatz, where the Lax operators are written…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…
The Markov chain approximation of a one-dimensional symmetric diffusion is investigated in this paper. Given an irreducible reflecting diffusion on a closed interval with scale function $s$ and speed measure $m$, the approximating Markov…
In this paper we prove that a finite triangulation of a connected closed surface is completely determined by its intersection matrix. The \emph{intersection matrix} of a finite triangulation, $K$, is defined as $M_{K}=(dim(s_{i}\cap…
We investigate Ambarzumian-type mixed inverse spectral problems for Jacobi matrices. Specifically, we examine whether the Jacobi matrix can be uniquely determined by knowing all but the first $m$ diagonal entries and a set of $m$ ordered…
We study the spectral properties of certain non-self-adjoint matrices associated with large directed graphs. Asymptotically the eigenvalues converge to certain curves, apart from a finite number that have limits not on these curves.
The motivation of this paper is to investigate the dual Drazin inverse of adjacency matrices arising from several classes of connected dual-number-weighted digraphs over the dual complex algebra. Explicit formulas for the dual Drazin…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…