Related papers: Characteristics polynomial of normalized Laplacian…

The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices. The transmission of a vertex $v_i$ in $G$ is the sum of the distances from $v_i$ to all other vertices and $T(G)$ is the…

For a harmonic function on a tree with random walk whose transition probabilities are bounded between two constants in (0,1/2), it is known that the radial and stochastic properties of convergence, boundedness and finiteness of energy are…

Networks having the geometry and the connectivity of trees are considered as the spatial support of spatiotemporal dynamical processes. A tree is characterized by two parameters: its ramification and its depth. The local dynamics at the…

Let $m(G,\lambda)$ be the multiplicity of an eigenvalue $\lambda$ of a connected graph $G$. Wang et al. [Linear Algebra Appl. 584(2020), 257-266] proved that for any connected graph $G\neq C_n$, $m(G, \lambda) \leq 2c(G) + p(G) -1$, where…

To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces of…

We study correlation functions of the characteristic polynomials in coupled matrix models based on the Schur polynomial expansion, which manifests their determinantal structure.

In this paper, we establish more properties of generalized poly-Euler polynomials with three parameters and we investigate a kind of symmetrized generalization of poly- Euler polynomials. Moreover, we introduce a more general form of multi…

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

In this paper, we describe a congruence property of solvable polynomials with coefficients in the Gaussian field Q(i).

We evaluate averages involving characteristic polynomials, inverse characteristic polynomials and ratios of characteristic polynomials for a $N\times N$ random matrix taken from a $L$-deformed Chiral Gaussian Unitary Ensemble with an…

We discuss the symmetric homogeneous polynomial solutions of the generalized Laplace's equation which arises in the context of the Calogero-Sutherland model on a line. The solutions are expressed as linear combinations of Jack polynomials…

We study Jacobi matrices on trees whose coefficients are generated by multiple orthogonal polynomials. Hilbert space decomposition into an orthogonal sum of cyclic subspaces is obtained. For each subspace, we find generators and the…

We extend the results of Zhang et al. to show that $\lambda$ is an eigenvalue of a $k$-uniform hypertree $(k \geq 3)$ if and only if it is a root of a particular matching polynomial for a connected induced subtree. We then use this to…

Sparse trees are trees with sparse branchings. The Laplacian on some of these trees can be shown to have singular spectral measures. We focus on a simple family of sparse trees for which the dimensions can be naturally defined and shown to…

Let $M=G/H$ be a compact connected isotropy irreducible Riemannian homogeneous manifold, where $G$ is a compact Lie group (may be, disconnected) acting on $M$ by isometries. This class includes all compact irreducible Riemannian symmetric…

This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…

We characterize characteristic polynomials of elements in a central simple algebra. We also give an account for the theory of rational canonical forms for separable linear transformations over a central division algebra, and a description…

A polynomial lemniscate is a curve in the complex plane defined by $\{z \in \mathbb{C}:|p(z)|=t\}$. Erd\"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate $\Lambda=\{ z \in…

Let $\Sigma$ be an $n$-vertex controllable or almost controllable signed bipartite graph, and let $\Delta_\Sigma$ denote the discriminant of its characteristic polynomial $\chi(\Sigma; x)$. We prove that if (\rmnum{1}) the integer $2^{…

We express the averages of products of characteristic polynomials for random matrix ensembles associated with compact symmetric spaces in terms of Jack polynomials or Heckman and Opdam's Jacobi polynomials depending on the root system of…