Related papers: Jacobi matrices on trees
This paper explores unsupervised learning of parsing models along two directions. First, which models are identifiable from infinite data? We use a general technique for numerically checking identifiability based on the rank of a Jacobian…
The formulation of covariant brackets on the space of solutions to a variational problem is analyzed in the framework of contact geometry. It is argued that the Poisson algebra on the space of functionals on fields should be read as a…
The property that a Jacobi matrix is reflectionless is usually characterized either in terms of Weyl m-functions or the vanishing of the real part of the boundary values of the diagonal matrix elements of the resolvent. We introduce a…
In a recent paper a class of infinite Jacobi matrices with discrete character of spectra has been introduced. With each Jacobi matrix from this class an analytic function is associated, called the characteristic function, whose zero set…
We study the properties and asymptotics of the Jacobi matrices associated with equilibrium measures of the weakly equilibrium Cantor sets. These family of Cantor sets were defined and different aspects of orthogonal polynomials on them were…
The research on spectral inequalities for discrete Schrodinger Operators has proved fruitful in the last decade. Indeed, several authors analysed the operator's canonical relation to a tridiagonal Jacobi matrix operator. In this paper, we…
It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…
If a Jacobi matrix $J$ is reflectionless on $(-2,2)$ and has a single $a_{n_0}$ equal to 1, then $J$ is the free Jacobi matrix $a_n\equiv 1$, $b_n\equiv 0$. I'll discuss this result and its generalization to arbitrary sets and present…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
This paper presents a Jacobi-type iteration for computing a given specified eigenpair of a symmetric matrix. For a certain class of diagonally dominant matrices, the procedure is shown to converge at a linear rate depending on how the…
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…
Jacobi matrices probably are the most classical object in spectral theory, while CMV matrices are a comparably fresh one, although they are related to a very classical topic, namely to orhtogonal polynomials on the unit circle (in the same…
This article is about polynomial maps with a certain symmetry and/or antisymmetry in their Jacobians, and whether the Jacobian Conjecture is satisfied for such maps, or whether it is sufficient to prove the Jacobian Conjecture for such…
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the number of strong almost-perfect matchings, which are matchings…
The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…
We study stability of spectral types for semi-infinite self-adjoint tridiagonal matrices under random decaying perturbations. We show that absolutely continuous spectrum associated with bounded eigenfunctions is stable under Hilbert-Schmidt…
We consider polynomial maps, which we call degree $d$-linear maps, that satisfy the Jacobian condition. We prove that certain infinite families of elements, which appear in the coefficients of the formal inverse of such maps, are in the…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…