Related papers: The Eight Vertex Model.New results
The Ehrhart polynomial and the reciprocity theorems by Ehrhart \& Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with…
The first author with B. Sturmfels studied the variety of matrices with eigenvectors in a given linear subspace, called Kalman variety. We extend that study from matrices to symmetric tensors, proving in the tensor setting the…
We consider singularly perturbed second order elliptic system in the whole space with fast oscillating coefficients. We construct the complete asymptotic expansions for the eigenvalues converging to the isolated ones of the homogenized…
We study the solutions of the T-system for type A, also known as the octahedron equation, viewed as a 2+1-dimensional discrete evolution equation. These may be expressed entirely in terms of the stepped surface over which the initial data…
Motivated by a model in quantum computation we study orthogonal sets of integral vectors of the same norm that can be extended with new vectors keeping the norm and the orthogonality. Our approach involves some arithmetic properties of the…
A systematic analytic approach to the evaluation of the eigenvalues and eigenvectors of the 5D discrete number operator is formulated. This approach is essentially based on the use of the symmetricity of 5D discrete Fourier transform…
The family of complex PT-symmetric sextic potentials is studied to show that for various cases the system is essentially quasi-solvable and possesses real, discrete energy eigenvalues. For a particular choice of parameters, we find that…
We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…
A brief review of the eigenvalue matrix model integrability and superintegrability properties, focused on the simplest, still representative, Gaussian Hermitian case.
The numerical solution of eigenvalue problems is essential in various application areas of scientific and engineering domains. In many problem classes, the practical interest is only a small subset of eigenvalues so it is unnecessary to…
The problem of constructing an orthogonal set of eigenvectors for a DFT matrix is well studied. An elegant solution is mentioned by Matveev in his paper "Interwining relations between the Fourier transfom and discrete Fourier transform, the…
Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks in numerical linear algebra. It is a widely known fact that, in the case of well separated eigenvalues, the eigenvectors can be evaluated with…
Using a modified version of the tetrahedron equations we construct a new family of $N$-state three-dimensional integrable models with commuting two-layer transfer-matrices. We investigate a particular class of solutions to these equations…
In this paper a generalization of the Gram-Schmidt Algorithm is presented. Actually we provide an algorithm to construct a set of equiangular vectors with a given angle $\theta\in(0,\arccos(\frac{-1}{n-1}))$ using a set of input independent…
We examine some numerical iterative methods for computing the eigenvalues and eigenvectors of real matrices. The five methods examined here range from the simple power iteration method to the more complicated QR iteration method. The…
By using a real matrix translation, we propose a coupled eigenvalue problem for octonionic operators. In view of possible applications in quantum mechanics, we also discuss the hermiticity of such operators. Previous difficulties in…
The spectra of previously constructed auxiliary matrices for the six-vertex model at roots of unity are investigated for spin-chains of even and odd length. The two cases show remarkable differences. In particular, it is shown that for even…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…
A straightforward model for deposition and evaporation on discrete cells of a finite array of any dimension leads to a matrix equation involving a Sylvester-Kac type matrix. The eigenvalues and eigenvectors of the general matrix are…