Related papers: Eigenbasis for a weighted adjacency matrix associa…
We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
The nonzero eigenvalues of $AB$ are equal to those of $BA$: an identity that holds as long as the products are square, even when $A,B$ are rectangular. This fact naturally suggests an efficient algorithm for computing eigenvalues and…
For a finite-dimensional Hopf algebra $A$, the McKay matrix $M_V$ of an $A$-module $V$ encodes the relations for tensoring the simple $A$-modules with $V$. We prove results about the eigenvalues and the right and left (generalized)…
The notion of the weighted degree of a polynomial is a basic tool in Affine Algebraic Geometry. In this paper, we study the properties of the weighted multidegrees of polynomial automorphisms by a new approach which focuses on stable…
A long standing question in the theory of orthogonal matrix polynomials is the matrix Bochner problem, the classification of $N \times N$ weight matrices $W(x)$ whose associated orthogonal polynomials are eigenfunctions of a second order…
Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…
Several kinds of q-orthogonal polynomials with |q|=1 are constructed as the main parts of the eigenfunctions of new solvable discrete quantum mechanical systems. Their orthogonality weight functions consist of quantum dilogarithm functions,…
Radial-basis-function networks are traditionally defined for sets of vector-based observations. In this short paper, we reformulate such networks so that they can be applied to adjacency-matrix representations of weighted, directed graphs…
Algebraic properties are explored for the curvature tensors of Riemannian manifolds, using the irreducible decomposition of curvature tensors. Our method provides a powerful tool to analyze the irreducible basis as well as an algorithm to…
We propose a new method to define theories of random geometries, using an explicit and simple map between metrics and large hermitian matrices. We outline some of the many possible applications of the formalism. For example, a…
For a family of polynomials in two continuous variables, orthogonal with respect to a weight function, we prove, under suitable conditions, the equivalence of the following properties: the matrix Pearson equation of the weight, the second…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…
The adjacency-diametrical matrix (AD matrix) of a connected graph $G$ with diameter $d$, denoted by $AD(G)$, is the matrix indexed by the vertices of $G$ in which the $(i,j)$-entry of $AD(G)$ is $1$ if $d_G(v_i,v_j)=1$, is $d$ if…
The story of positive geometry of massless scalar theories was pioneered in [1] in the context of bi-adjoint $\phi^3$ theories. Further study proposed that the positive geometry for a generic massless scalar theory with polynomial…
We study orthogonal polynomials for a weight function defined over a domain of revolution, where the domain is formed from rotating a two-dimensional region and goes beyond the quadratic domains. Explicit constructions of orthogonal bases…
Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix. Otherwise they are termed co-duplicates, when they contribute…
Finding a diagonal matrix congruent to $A - cI$ for constants $c$, where $A$ is the adjacency matrix of a graph $G$ allows us to quickly tell the number of eigenvalues in a given interval. If $G$ has clique-width $k$ and a corresponding…
This paper studies properties of q-Jacobi polynomials and their duals by means of operators of the discrete series representations for the quantum algebra U_q(su_{1,1}). Spectrum and eigenfunctions of these operators are found explicitly.…
We give an expression of the $q$-analogues of the multiplicities of weights in irreducible $\sl_{n+1}$-modules in terms of the geometry of the crystal graph attached to the corresponding $U_q(\sl_{n+1})$-modules. As an application, we…