Related papers: Matrices in the Hosoya triangle
The purpose of this paper is to prove that the spectrum of the non-self-adjoint one-particle Hamiltonian proposed by J. Feinberg and A. Zee (Phys. Rev. E 59 (1999), 6433--6443) has interior points. We do this by first recalling that the…
The hyperbolic Pascal triangle ${\cal HPT}_{4,q}$ $(q\ge5)$ is a new mathematical construction, which is a geometrical generalization of Pascal's arithmetical triangle. In the present study we show that a natural pattern of rows of ${\cal…
The main feature of color Hom-algebras is that the identities defining the structures are twisted by even linear maps. The purpose of this paper is to introduce and give some constructions of admissible Hom-Novikov-Poisson color…
We study the graded polynomial identities with a homogeneous involution on the algebra of upper triangular matrices endowed with a fine group grading. We compute their polynomial identities and a basis of the relatively free algebra,…
This paper is about analytic properties of single transfer matrices originating from general block-tridiagonal or banded matrices. Such matrices occur in various applications in physics and numerical analysis. The eigenvalues of the…
Householder orthogonalization plays an important role in numerical linear algebra. It attains perfect orthogonality regardless of the conditioning of the input. However, in the context of a non-standard inner product, it becomes difficult…
By replacing the internal energy with the free energy, as coordinates in a "space of observables", we slightly modify (the known three) non-holonomic geometrizations and show that the coefficients of the curvature tensor field, of the Ricci…
In this paper we study the complementarity spectrum of digraphs, with special attention to the problem of digraph characterization through this complementarity spectrum. That is, whether two non-isomorphic digraphs with the same number of…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
We show that the cohomology ring of a finite-dimensional complex pointed Hopf algebra with an abelian group of group-like elements is finitely generated. Our strategy has three major steps. We first reduce the problem to the finite…
This work concerns the study of properties of a group of Koszul algebras coming from the toric ideals of a chordal bipartite infinite family of graphs (alternately, these rings may be interpreted as coming from determinants of certain…
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…
A perfect structure is a triple $(M,P,S)$ of matrices $M, P$ and $S$ of consistent sizes such that $MP = PS$. Perfect structures comprise similar matrices, eigenvectors, perfect colorings (equitable partitions) and graph coverings. In this…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
Random matrices formed from i.i.d. standard real Gaussian entries have the feature that the expected number of real eigenvalues is non-zero. This property persists for products of such matrices, independently chosen, and moreover it is…
For a graph G, let f_{ij} be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the f_{ij}'s can be expressed as the products of Fibonacci numbers; for a cycle,…