On some identities for the Fibonomial coefficients via generating function

Some new identities for the Fibonomial coefficients are derived. These identities are related to the generating function of the kth powers of the Fibonacci numbers. Proofs are based on manipulation with the generating function of the sequence of “signed Fibonomial triangle”.     

Eigenvalues and Pole Functions of Hamiltonian Systems with Eigenvalue Depending Boundary Conditions

This paper consists of two chapters. The first chapter concerns matrix functions belonging to the generalized Nevanlinna class N_k^{m × m}. We present results about the operator representation of such functions. These representations are then used to obtain information about the (generalized) poles of generalized Nevanlinna functions. The second chapter may be viewed as a continuation of our paper [DLS3] and treats Hamiltonian systems of differential equations with boundary conditions depending on the eigenvalue parameter. In particular we study the eigenvalues, both isolated and embedded eigenvalues.     

Quantum matrix algebras of the GL(m|n) type: The structure and spectral parameterization of the characteristic subalgebra

We continue the study of quantum matrix algebras of the GL(m|n) type. We find three alternative forms of the Cayley-Hamilton identity; most importantly, this identity can be represented in a factored form. The factorization allows naturally dividing the spectrum of a quantum supermatrix into subsets of “even” and “odd” eigenvalues. This division leads to a parameterization of the characteristic subalgebra (the subalgebra of spectral invariants) in terms of supersymmetric polynomials in the eigenvalues of the quantum matrix. Our construction is based on two auxiliary results, which are independently interesting. First, we derive the multiplication rule for Schur functions s _λ (M) that form a linear basis of the characteristic subalgebra of a Hecke-type quantum matrix algebra; the structure constants in this basis coincide with the Littlewood-Richardson coefficients. Second, we prove a number of bilinear relations in the graded ring Λ of symmetric functions of countably many variables. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 147, No. 1, pp. 14–46, April, 2006.     

On the number of eigenvalues of a matrix operator

We consider a matrix operator H in the Fock space. We prove the finiteness of the number of negative eigenvalues of H if the corresponding generalized Friedrichs model has the zero eigenvalue (0 = min σ _ess(H)). We also prove that H has infinitely many negative eigenvalues accumulating near zero (the Efimov effect) if the generalized Friedrichs model has zero energy resonance. We obtain asymptotics for the number of negative eigenvalues of H below z as z → −0.     

The principal eigenvalue of a space–time periodic parabolic operator

This paper deals with the generalized principal eigenvalue of the parabolic operator , where the coefficients are periodic in t and x. We give the definition of this eigenvalue and we prove that it can be approximated by a sequence of principal eigenvalues associated to the same operator in a bounded domain, with periodicity in time and Dirichlet boundary conditions in space. Next, we define a family of periodic principal eigenvalues associated with the operator and use it to give a characterization of the generalized principal eigenvalue. Finally, we study the dependence of all these eigenvalues with respect to the coefficients.      

On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method

In this paper we explore two sets of polynomials, the orthogonal polynomials and the residual polynomials, associated with a preconditioned conjugate gradient iteration for the solution of the linear system Ax = b. In the context of preconditioning by the matrix C, we show that the roots of the orthogonal polynomials, also known as generalized Ritz values, are the eigenvalues of an orthogonal section of the matrix C A while the roots of the residual polynomials, also known as pseudo-Ritz values (or roots of kernel polynomials), are the reciprocals of the eigenvalues of an orthogonal section of the matrix (C A)^?1. When C A is selfadjoint positive definite, this distinction is minimal, but for the indefinite or nonselfadjoint case this distinction becomes important. We use these two sets of roots to form possibly nonconvex regions in the complex plane that describe the spectrum of C A.     

On the Jacobi series

Summary The Jacobi series of a functionf is an expansion in a series of ascending powers of a prescribed polynomialP of degreen in which the coefficients are polynomials of lesser degree. These coefficients are usually expressed as contour integrals or are determined by their interpolatory properties. We show how they may be expressed as generalized derivatives off with respect toP. In so doing we also show how the Jacobi series may be expressed (in yet another way) as a generalized Taylor series. In addition, we obtain a number of interesting relations among the generalized derivatives.Dedicated to Professor Otto Haupt with best wishes on his 100th birthday.     

Algorithms for Computing Generalized U(<Emphasis Type="Italic">N</Emphasis>) Racah Coefficients

Algorithms are developed for computing generalized Racah coefficients for the U(N) groups. The irreducible representations (irreps) of the U(N) groups, as well as their tensor products, are realized as polynomials in complex variables. When tensor product irrep labels as well as a given irrep label are specified, maps are constructed from the irrep space to the tensor product space. The number of linearly independent maps gives the multiplicity. The main theorem of this paper shows that the eigenvalues of generalized Casimir operators are always sufficient to break the multiplicity. Using this theorem algorithms are given for computing the overlap between different sets of eigenvalues of commuting generalized Casimir operators, which are the generalized Racah coefficients. It is also shown that these coefficients are basis independent. Mathematics Subject Classifications (2000) 22E70, 81R05, 81R40.     

On the eigenvalues of specially low-rank perturbed matrices

We study the eigenvalues of a matrix A perturbed by a few special low-rank matrices. The perturbation is constructed from certain basis vectors of an invariant subspace of A, such as eigenvectors, Jordan vectors, or Schur vectors. We show that most of the eigenvalues of the low-rank perturbed matrix stayed unchanged from the eigenvalues of A; the perturbation can only change the eigenvalues of A that are related to the invariant subspace. Existing results mostly studied using eigenvectors with full column rank for perturbations, we generalize the results to more general settings. Applications of our results to a few interesting problems including the Google’s second eigenvalue problem are presented.     

Outlier Eigenvalues for Deformed I.I.D. Random Matrices

We consider a square random matrix of size N of the form A + Y where A is deterministic and Y has i.i.d. entries with variance 1/N. Under mild assumptions, as N grows the empirical distribution of the eigenvalues of A + Y converges weakly to a limit probability measure β on the complex plane. This work is devoted to the study of the outlier eigenvalues, i.e., eigenvalues in the complement of the support of β. Even in the simplest cases, a variety of interesting phenomena can occur. As in earlier works, we give a sufficient condition to guarantee that outliers are stable and provide examples where their fluctuations vary with the particular distribution of the entries of Y or the Jordan decomposition of A. We also exhibit concrete examples where the outlier eigenvalues converge in distribution to the zeros of a Gaussian analytic function. © 2016 Wiley Periodicals, Inc.     

Comparison of subdominant eigenvalues of some linear search schemes

The subdominant eigenvalue of the transition probability matrix of a Markov chain is a determining factor in the speed of transition of the chain to a stationary state. However, these eigenvalues can be difficult to estimate in a theoretical sense. In this paper we revisit the problem of dynamically organizing a linear list. Items in the list are selected with certain unknown probabilities and then returned to the list according to one of two schemes: the move-to-front scheme or the transposition scheme. The eigenvalues of the transition probability matrix Q of the former scheme are well-known but those of the latter T are not. Nevertheless the transposition scheme gives rise to a reversible Markov chain. This enables us to employ a generalized Rayleigh-Ritz theorem to show that the subdominant eigenvalue of T is at least as large as the subdominant eigenvalue of Q.     

Generalized Eigenfunctions for Waves in Inhomogeneous Media

Many wave propagation phenomena in classical physics are governed by equations that can be recast in Schrödinger form. In this approach the classical wave equation (e.g., Maxwell's equations, acoustic equation, elastic equation) is rewritten in Schrödinger form, leading to the study of the spectral theory of its classical wave operator, a self-adjoint, partial differential operator on a Hilbert space of vector-valued, square integrable functions. Physically interesting inhomogeneous media give rise to nonsmooth coefficients. We construct a generalized eigenfunction expansion for classical wave operators with nonsmooth coefficients. Our construction yields polynomially bounded generalized eigenfunctions, the set of generalized eigenvalues forming a subset of the operator's spectrum with full spectral measure.     

Generalized Hopf bifurcation emerged from a corner in general planar piecewise smooth systems

We investigate a generalized Hopf bifurcation emerged from a corner located at the origin which is the intersection of n$n$ discontinuity boundaries in planar piecewise smooth dynamical systems with the Jacobian matrix of each smooth subsystem having either two different nonzero real eigenvalues or a pair of complex conjugate eigenvalues. We obtain a novel result that the generalized Hopf bifurcation can occur even when the Jacobian matrix of each smooth subsystem has two different nonzero real eigenvalues. According to the eigenvalues of the Jacobian matrices and the number of smooth subsystems, we provide a general method and prove some generalized Hopf bifurcation theorems by studying the associated Poincaré map.     

Nonsingular systems of generalized Sylvester equations: An algorithmic approach

We consider the uniqueness of solution (i.e., nonsingularity) of systems of r generalized Sylvester and ?‐Sylvester equations with n×n coefficients. After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized ?‐Sylvester equation. We provide characterizations for the nonsingularity in terms of spectral properties of either matrix pencils or formal matrix products, both constructed from the coefficients of the system. The proposed approach uses the periodic Schur decomposition and leads to a backward stable O(n³r) algorithm for computing the (unique) solution.     

Singular Polynomials of Generalized Kasteleyn Matrices

Kasteleyn counted the number of domino tilings of a rectangle by considering a mutation of the adjacency matrix: a Kasteleyn matrix K. In this paper we present a generalization of Kasteleyn matrices and a combinatorial interpretation for the coefficients of the characteristic polynomial of KK* (which we call the singular polynomial), where K is a generalized Kasteleyn matrix for a planar bipartite graph. We also present a q-version of these ideas and a few results concerning tilings of special regions such as rectangles.     

Compound model of the generalized oscillator. I

We study the problem of realization of a given generalized oscillator by a system of N generalized oscillators of a different type. We consider a generalized oscillator related to a fixed system of orthogonal polynomials that are determined by three-term recurrent relations and the corresponding three-diagonal Jacobi matrix J. The case N =2 was considered in a previous paper. It was shown that in this case the orthogonality measure is symmetric with respect to rotation at angle π. In this paper, we consider the case N =3. We prove that such a problem has a solution only in two cases. In the first case, the Jacobi matrix related to the given “composite” generalized oscillator has block-diagonal form and consists of similar 3×3 blocks. In the second (more interesting) possible case, the Jacobi matrix is not block-diagonal. For this matrix, we construct the corresponding system of orthogonal polynomials. This system decomposes into three series which are related to Chebyshev polynomials of the second kind. The main result of the paper is a solution of the moment problem for the corresponding Jacobi matrix. In this case, the constructed measure is symmetric with respect to rotation at angle 2π/3. Bibliography: 6 titles.     

Properties of the promotion Markov chain on linear extensions

The Tsetlin library is a very well-studied model for the way an arrangement of books on a library shelf evolves over time. One of the most interesting properties of this Markov chain is that its spectrum can be computed exactly and that the eigenvalues are linear in the transition probabilities. This result has been generalized in different ways by various people. In this work, we investigate one of the generalizations given by the extended promotion Markov chain on linear extensions of a poset P introduced by Ayyer et al. (J Algebr Comb 39(4):853–881, 2014). They showed that if the poset P is a rooted forest, the transition matrix of this Markov chain has eigenvalues that are linear in the transition probabilities and described their multiplicities. We show that the same property holds for a larger class of posets for which we also derive convergence to stationarity results.     

On graphs whose Laplacian matrices have distinct integer eigenvalues

In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integer eigenvalues. We define the set S_i,n to be the set of all integers from 0 to n, excluding i. If there exists a graph whose Laplacian matrix has this set as its eigenvalues, we say that this set is Laplacian realizable. We investigate the sets S_i,n that are Laplacian realizable, and the structures of the graphs whose Laplacian matrix has such a set as its eigenvalues. We characterize those i < n such that S_i,n is Laplacian realizable, and show that for certain values of i, the set S_i,n is realized by a unique graph. Finally, we conjecture that S_n,n is not Laplacian realizable for n ≥ 2 and show that the conjecture holds for certain values of n. © 2005 Wiley Periodicals, Inc. J Graph Theory     

The preconditioned inverse iteration for hierarchical matrices

The preconditioned inverse iteration is an efficient method to compute the smallest eigenpair of a symmetric positive definite matrix M. Here we use this method to find the smallest eigenvalues of a hierarchical matrix. The storage complexity of the data‐sparse ‐matrices is almost linear. We use ‐arithmetic to precondition with an approximate inverse of M or an approximate Cholesky decomposition of M. In general, ‐arithmetic is of linear‐polylogarithmic complexity, so the computation of one eigenvalue is cheap. We extend the ideas to the computation of inner eigenvalues by computing an invariant subspace S of (M ? μI)² by subspace preconditioned inverse iteration. The eigenvalues of the generalized matrix Rayleigh quotient μ_M(S) are the desired inner eigenvalues of M. The idea of using (M ? μI)² instead of M is known as the folded spectrum method. As we rely on the positive definiteness of the shifted matrix, we cannot simply apply shifted inverse iteration therefor. Numerical results substantiate the convergence properties and show that the computation of the eigenvalues is superior to existing algorithms for non‐sparse matrices.Copyright © 2012 John Wiley & Sons, Ltd.