Related papers: Jacobi matrices on trees
We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…
We obtain bounds for the spectrum and for the total width of the spectral gaps for Jacobi matrices on $\ell^2(\Z)$ of the form $(H\psi)_n= a_{n-1}\psi_{n-1}+b_n\psi_n+a_n\psi_{n+1}$, where $a_n=a_{n+q}$ and $b_n=b_{n+q}$ are periodic…
Parabolic (resp. hyperbolic) self-embeddings of trees are those which do not fix a non-empty finite subtree and preserve precisely one (resp. two) end(s). We prove that a locally finite tree having a parabolic self-embedding is mutually…
An elliptic random matrix $X$ is a square matrix whose $(i,j)$-entry $X_{ij}$ is independent of the rest of the entries except possibly $X_{ji}$. Elliptic random matrices generalize Wigner matrices and non-Hermitian random matrices with…
We study spectrum inclusion regions for complex Jacobi matrices which are compact perturbations of real periodic Jacobi matrices. The condition sufficient for the lack of discrete spectrum for such matrices is given
The Jacobi ensemble is one of the classical ensembles of random matrix theory. Prominent in applications are properties of the eigenvalues at the spectrum edge, specifically the distribution of the largest (e.g. Roy's largest root test in…
We show that many existing divisibility sequences can be seen as sequences of determinants of matrix divisibility sequences, which arise naturally as Jacobian matrices associated to groups of maps on affine spaces.
We investigate Ambarzumian-type mixed inverse spectral problems for Jacobi matrices. Specifically, we examine whether the Jacobi matrix can be uniquely determined by knowing all but the first $m$ diagonal entries and a set of $m$ ordered…
Reciprocal matrices are tridiagonal matrices $(a_{ij})_{i,j=1}^n$ with constant main diagonal and such that $a_{i,i+1}a_{i+1,i}=1$ for $i=1,\ldots,n-1$. For these matrices, criteria are established under which their Kippenhahn curves…
Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…
We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…
We consider an evolution algebra which corresponds to a bisexual population with a set of females partitioned into finitely many different types and the males having only one type. We study basic properties of the algebra. This algebra is…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
We compute the asymptotics of eigenvalues of Jacobi matrices with the zero coefficients on the main diagonal and the off-diagonal coefficients which converge to zero.
A polynomial endomorphism $\sigma\in {\rm End}_K(P_n)$ is called a Jacobian map if its Jacobian is a nonzero scalar (the field has zero characteristic). Each Jacobian map $\sigma$ is extended to an endomorphism $\sigma$ of the Weyl algebra…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
Jacobi sigma models are two-dimensional topological non-linear field theories which are associated with Jacobi structures. The latter can be considered as a generalization of Poisson structures. After reviewing the main properties and…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
We give a version of the usual Jacobian characterization of the defining ideal of the singular locus in the equal characteristic case: the new theorem is valid for essentially affine algebras over a complete local algebra over a mixed…
The Jacobi curve of an extremal of optimal control problem is a curve in a Lagrangian Grassmannian defined up to a symplectic transformation and containing all information about the solutions of the Jacobi equations along this extremal. In…