SearcharxivSearch

arXiv subjects

Mikhail Tyaglov

Publications and source records attributed to Mikhail Tyaglov.

At least 19 recordsLinked to original sources

Hawaii conjecture through the lens of Cauchy indices

Given a real polynomial $p$, we study some properties of real critical points of its logarithmic derivative $Q[p]=(p'/p)'$ using the theory of Cauchy indices. As a by-product we improve the lower bound for the number these points.

math.NT

$a$-potent Schwarz matrices and Bessel-like Jacobi polynomials

We consider the problem of the reconstruction of a Schwarz matrix from exactly one given eigenvalue. This inverse eigenvalue problem leads to the Jacobi orthogonal polynomials~$\{P_k^{(-n,n)}\}_{k=0}^{n-1}$ that can be treated as a discrete finite analogue of Bessel polynomials.

math.CA

On the number of real zeroes of a homogeneous differential polynomial and a generalization of the Hawaii conjecture

For a given real polynomial $p$ we study the possible number of real roots of a differential polynomial $H_{\varkappa}[p](x) = \varkappa\left(p'(x)\right)^2-p(x)p''(x), \varkappa \in \mathbb{R}.$ In the special case when all real zeros of the polynomial $p$ are simple, and all roots of its derivative $p'$ are real and simple, the distribution of zeros of $H_{\varkappa}[p]$ is completely described for each real $\varkappa.$ We also provide counterexamples to two Boris Shapiro's conjectures about the number of zeros of the function $H_{\frac{n-1}{n}}[p].$

math.CV

Integral Laplacian graphs with a unique double Laplacian eigenvalue, II

The set $S_{\{i,j\}_{n}^{m}}=\{0,1,2,\ldots,m-1,m,m,m+1,\ldots,n-1,n\}\setminus\{i,j\},\quad 0<i<j\leqslant n$, is called Laplacian realizable if there exists a simple connected graph $G$ whose Laplacian spectrum is $S_{\{i,j\}_{n}^{m}}$. In this case, the graph $G$ is said to realize $S_{\{i,j\}_{n}^{m}}$. In this paper, we completely describe graphs realizing the sets $S_{\{i,j\}_{n}^{m}}$ with $m=1,2$ and determine the structure of these graphs.

math.CO

A generalized Hermite-Biehler theorem

The classical Hermite-Biehler theorem describes possible zero sets of complex linear combinations of two real polynomials whose zeros strictly interlace. We provide the full characterization of zero sets for the case when this interlacing is broken at exactly one location. Using this we solve the direct and inverse spectral problem for rank-one multiplicative perturbations of finite Hermitian matrices. We also treat certain rank two additive perturbations of finite Jacobi matrices.

math.CA

On the spectrum of the tridiagonal matrices with two-periodic main diagonal

We find the spectrum and eigenvectors of an arbitrary irreducible complex tridiagonal matrix with two-periodic main diagonal provided that the spectrum and eigenvectors of the matrix with the same sub- and superdiagonals and zero main diagonal is known. Our result substantially generalises some recent results on the Sylvester-Kac matrix and its certain main principal submatrices.

math.SP

Integral Laplacian graphs with a unique double Laplacian eigenvalue, I

The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established by S. Fallat et al. in 2005. In this paper, we investigate graphs whose Laplacian spectra have the form $$ S_{\{i,j\}_{n}^{m}}=\{0,1,2,\ldots,m-1,m,m,m+1,\ldots,n-1,n\}\setminus\{i,j\},\qquad 0<i<j\leqslant n, $$ and completely describe those ones with $m=n-1$ and $m=n$. We also show close relations between graphs realizing $S_{i,n}$ and $S_{\{i,j\}_{n}^{m}}$, and discuss the so-called $S_{n,n}$-conjecture and the correspondent conjecture for $S_{\{i,n\}_{n}^{m}}$.

math.CO

Linear differential operators with polynomial coefficients generating generalised Sylvester-Kac matrices

A method of generating differential operators is used to solve the spectral problem for a generalisation of the Sylvester-Kac matrix. As a by-product, we find a linear differential operator with polynomial coefficients of the first order that has a finite sequence of polynomial eigenfunctions generalising the operator considered by M. Kac. In addition, we explain spectral properties of two related tridiagonal matrices whose shape differ from our generalisation.

math.CA

On the number of non-real zeroes of a homogeneous differential polynomial and a generalization of the Laguerre inequalities

Given a real polynomial $p$ with only real zeroes, we find upper and lower bounds for the number of non-real zeroes of the differential polynomial $$ F_{\varkappa}[p](z):= p(z)p''(z)-\varkappa[p'(z)]^2,$$ where $\varkappa$ is a real number. We also construct a counterexample to a conjecture by B. Shapiro on the number of real zeroes of the polynomial $F_{\tfrac{n-1}{n}}[p](z)$ in the case when the real polynomial $p$ of degree $n$ has non-real zeroes. We formulate some new conjectures generalising the Hawaii conjecture.

math.CA

Hermite-Poulain theorems for linear finite difference operators

We establish analogues of the Hermite-Poulain theorem for linear finite difference operators with constant coefficients defined on sets of polynomials with roots on a straight line, in a strip, or in a half-plane. We also consider the central finite difference operator of the form $$ \Delta_{\theta, h}(f)(z)=e^{i\theta}f(z+ih)-e^{-i\theta}f(z-ih), \quad\theta\in[0,\pi),\ \ h\in\mathbb{C}\setminus\{0\}, $$ where $f$ is a polynomial or an entire function of a certain kind, and prove that the roots of $\Delta_{\theta, h}(f)$ are simple under some conditions. Moreover, we prove that the operator $\Delta_{\theta, h}$ does not decrease the mesh on the set of polynomials with roots on a line and find the minimal mesh. The asymptotics of the roots of $\Delta_{\theta, h}(p)$ as $|h|\to\infty$ is found for any complex polynomial $p$. Some other interesting roots preserving properties of the operator $\Delta_{\theta, h}$ are also studied, and a few examples are presented.

math.CA

Total nonnegativity of finite Hurwitz matrices and root location of polynomials

In 1970, B.A. Asner, Jr., proved that for a real quasi-stable polynomial, i.e., a polynomial whose zeros lie in the \emph{closed} left half-plane of the complex plane, its finite Hurwitz matrix is totally nonnegative, i.e., all its minors are nonnegative, and that the converse statement is not true. In this work, we explain this phenomenon in detail, and provide necessary and sufficient conditions for a real polynomial to have a totally nonnegative finite Hurwitz matrix.

math.CA

Self-interlacing polynomials II: Matrices with self-interlacing spectrum

An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign definite matrices with self-interlacing spectra from totally nonnegative ones is presented. We apply this method to bidiagonal and tridiagonal matrices. In particular, we generalize a result by O. Holtz on the spectrum of real symmetric anti-bidiagonal matrices with positive nonzero entries.

math.CA

Self-interlacing polynomials

We describe a new subclass of the class of real polynomials with real simple roots called self-interlacing polynomials. This subclass is isomorphic to the class of real Hurwitz stable polynomials (all roots in the open left half-plane). In the work, we present basic properties of self-interlacing polynomials and their relations with Hurwitz and Hankel matrices as well as with Stiltjes type of continued fractions. We also establish "self-interlacing" analogues of the well-known Hurwitz and Li\'enard-Chipart criterions for stable polynomials. A criterion of Hurwitz stability of polynomials in terms of minors of certain Hankel matrices is established.

math.CA

Circulants and critical points of polynomials

We prove that for any circulant matrix $C$ of size $n\times n$ with the monic characteristic polynomial $p(z)$, the spectrum of its $(n-1)\times(n-1)$ submatrix $C_{n-1}$ constructed with first $n-1$ rows and columns of $C$ consists of all critical points of $p(z)$. Using this fact we provide a simple proof for the Schoenberg conjecture recently proved by R. Pereira and S. Malamud. We also prove full generalization of a higher order Schoenberg-type conjecture proposed by M. de Bruin and A. Sharma and recently proved by W.S. Cheung and T.W. Ng. in its original form, i.e. for polynomials whose mass centre of roots equals zero. In this particular case, our inequality is stronger than it was conjectured by de Bruin and Sharma. Some Schmeisser's-like results on majorization of critical point of polynomials are also obtained.

math.CA

Direct and inverse spectral problems for a class of non-selfadjoint band matrices

The spectral properties of a class of band matrices are investigated. The reconstruction of matrices of this special class from given spectral data is also studied. Necessary and sufficient conditions for that reconstruction are found. The obtained results extend some results on the direct and inverse spectral problems for periodic Jacobi matrices and for some non-self-adjoint tridiagonal matrices.

math.SP

On the spectra of Schwarz matrices with certain sign patterns

The direct and inverse spectral problems are solved for a wide subclass of the class of Schwarz matrices. A connection between the Schwarz matrices and the so-called generalized Hurwitz polynomials is found. The known results due to H. Wall and O. Holtz are briefly reviewed and obtained as particular cases.

math.SP

Szegő's theorem for matrix orthogonal polynomials

We extend some classical theorems in the theory of orthogonal polynomials on the unit circle to the matrix case. In particular, we prove a matrix analogue of Szegő's theorem. As a by-product, we also obtain an elementary proof of the distance formula by Helson and Lowdenslager.

math.CA