Related papers: The spectral problem and algebras associated with …
In this study, we explore the interrelation between hypergraph symmetries represented by equivalence relations on the vertex set and the spectra of operators associated with the hypergraph. We introduce the idea of equivalence relation…
We consider the tensor product of modules over the polynomial algebra corresponding to the usual tensor product of linear operators. We present a general description of the representation ring in case the ground field k is perfect. It is…
This book treats: - spectral theory of Banach *-algebras, - basic representation theory of normed *-algebras, - spectral theory of representations of commutative *-algebras. A novel feature of the book is the construction of the enveloping…
We consider a class of C*-algebras C(X) associated with quantum spaces such as spheres, projective spaces, and lens spaces. We introduce a non-self-adjoint operator algebra A together with an explicit functor from the category of…
Given an infinite graph $G$ on countably many vertices, and a closed, infinite set $\Lambda$ of real numbers, we prove the existence of an unbounded self-adjoint operator whose graph is $G$ and whose spectrum is $\Lambda$.
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
We initiate a mathematically rigorous study of Klein-Gordon position operators in single-particle relativistic quantum mechanics. Although not self-adjoint, these operators have real spectrum and enjoy a limited form of spectral…
We present a mechanism for the creation of gaps in the spectra of self-adjoint operators defined over a Hilbert space of functions on a graph, which is based on the process of graph decoration. The resulting Hamiltonians can be viewed as…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
We apply the method of spectral sequences to study classical problems in analysis. We illustrate the method by finding polynomial vector fields that commute with a given polynomial vector field and finding integrals of polynomial…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
We consider Dynkin algebras, these are the hereditary artin algebras of finite representation type. The indecomposable modules for a Dynkin algebra correspond bijectively to the positive roots of a Dynkin diagram. Given a Dynkin algebra…
Operators are induced on fermion and zeon algebras by the action of adjacency matrices and combinatorial Laplacians on the vector spaces spanned by the graph's vertices. Properties of the algebras automatically give information about the…
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the…
Harary and Schwenk posed the problem forty years ago: Which graphs have distinct adjacency eigenvalues? In this paper, we obtain a necessary and sufficient condition for an Hermitian matrix with simple spectral radius and distinct…
A new approach to normal operators in real Hilbert spaces is discussed, and a spectral representation is obtained, derived directly from the complex case. The results are then applied to quaternionic normal operators, regarded as a special…
The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
This book treats: - spectral theory of Banach *-algebras, - basic representation theory of normed *-algebras, - spectral theory of representations of commutative *-algebras. A novel feature of the book is the construction of the enveloping…