Related papers: An Explicit Formula for the Matrix Logarithm

It is known that average Siegel theta series lie in the space of Siegel Eisenstein series. Also, every lattice equipped with an even integral quadratic form lies in a maximal lattice. Here we consider average Siegel theta series of degree 2…

We classify all cyclotomic matrices over real quadratic integer rings and we show that this classification is the same as classifying cyclotomic matrices over the compositum all real quadratic integer rings. Moreover, we enumerate a related…

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…

Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…

Let $m,n>1$ be integers and $\mathbb{P}_{n,m}$ be the point set of the projective $(n-1)$-space (defined by [2]) over the ring $\mathbb{Z}_m$of integers modulo $m$. Let $A_{n,m}=(a_{uv})$ be the matrix with rows and columns being labeled by…

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…

In this paper, we present a novel method to compute an explicit formula for the inverse of the confluent Vandermonde matrices. Our proposed results may have many interesting perspectives in diverse areas of mathematics and natural sciences,…

Below, the explicit solution to a certain finite-difference equation is given and the required steps for derivation of these results are outlined. Everything is included as Mathematica formulae, so the notebook itself can be used for…

We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…

We give an explicit upper bound for non-principal Dirichlet $L$-functions on the line $s=1+it$. This result can be applied to improve the error in the zero-counting formulae for these functions.

We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…

We establish new explicit zero-free regions for the Dedekind zeta-function. Two key elements of our proof are a non-negative, even, trigonometric polynomial and explicit upper bounds for the explicit formula of the so-called differenced…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

We give an easy proof to show that every complex normal Toeplitz matrix is classified as either of type I or of type II. Instead of difference equations on elements in the matrix used in past studies, polynomial equations with coefficients…

We introduce the intuitive method to select an analytic Abel function of an analytic function f at a non-fixpoint. Due to the complexity of this method by involving matrix inversion of increasing size there is little known about its…

We consider the $n\times n$ Hankel matrix $H$ whose entries are defined by $H_{ij}=1/s_{i+j}$ where $s_k=(k-1)!$ and prove that $H$ is invertible for all $n\in\mathbb{N}$ by providing an explicit formula for its inverse matrix.

We establish, for the first time, a Bochner-type integral representation for the logarithmic Laplacian on weighted graphs. Assuming stochastic completeness of the underlying graph, we further derive an explicit pointwise formula for this…

We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…

We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…