Interlacing of Hurwitz series

In this paper, we introduce the notion of interlacing of Hurwitz series. We begin by reviewing some important properties of the ring of Hurwitz series over a commutative ring A of arbitrary characteristic, and we introduce and investigate properties of the maps exp and log. We show that solutions of linear homogeneous differential equations with constant coefficients from the ring A can be described simply as interlacings of solutions of a first order system of differential equations. We give several examples to illustrate this result, and we conclude by defining and investigating properties of trigonometric functions using interlacings of Hurwitz series.     

Stability of Conjugated Carbon Nanocones

We use interlacing techniques to prove that carbon nanocones who have a Fries Kekulé structure have closed Hückel shells, and that this result can be extended to all conjugated cones where each edge belongs to a hexagonal face and the configuration of the non-hexagonal faces are consistent with a Fries Kekulé structure. Cones with Fries Kekulé structure or substructure are topical—not only from a valence bond theoretical point of view—since a previous ab initioanalysis favored cones where the pentagons at the tip are configured as in a Fries Kekulé structure. The question of interdependence will therefore be addressed.     

On the Eigenvalues of Half‐Linear Boundary Value Problems

We consider the half‐linear boundary value problem where and the weight function q is assumed to change sign. We prove the existence of two sequences , of eigenvalues and derive asymptotic estimates for as .     

交织型层级复杂网

为研究两个异质关联网络复合后的结构特征与节点中心性特征,本文提出了交织型层级复杂网络的概念,可描述由两个具有部分相同节点,连接边属性近似的子网所构成的层级复杂网络,并定义了节点交织系数、路径交织系数和网络交织系数3种测度用于衡量两个子网之间的密切程度.针对该类网络,研究并改进了节点度中心性和介数中心性的计算方法,同时提出一种新的中心性指标—助联性,用于衡量子网的某一节点对另一子网联通性和流通性的助益.通过实验分析,验证了本文各类指标的有效性.     

Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

The $k^{\text{th}}$ power of a graph $G=(V,E)$, $G^k$, is the graph whose vertex set is V and in which two distinct vertices are adjacent if and only if their distance in G is at most k. This article proves various eigenvalue bounds for the independence number and chromatic number of $G^k$ which purely depend on the spectrum of G, together with a method to optimize them. Our bounds for the k-independence number also work for its quantum counterpart, which is not known to be a computable parameter in general, thus justifying the use of integer programming to optimize them. Some of the bounds previously known in the literature follow as a corollary of our main results. Infinite families of graphs where the bounds are sharp are presented as well.     

图的特征值交错方法的几个应用

本文利用特征值交错方法研究了图的谱半径下界等问题,得到了图谱半径的两个新的紧下界,以及图的Laplace谱与四边形个数的一个关系式.     

Eigenvalue interlacing and weight parameters of graphs

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian) spectrum of a graph and some of its properties. For instance, some characterizations of regular partitions, and bounds for some parameters, such as the independence and chromatic numbers, the diameter, the bandwidth, etc., have been obtained. For each parameter of a graph involving the cardinality of some vertex sets, we can define its corresponding weight parameter by giving some “weights” (that is, the entries of the positive eigenvector) to the vertices and replacing cardinalities by square norms. The key point is that such weights “regularize” the graph, and hence allow us to define a kind of regular partition, called “pseudo-regular,” intended for general graphs. Here we show how to use interlacing for proving results about some weight parameters and pseudo-regular partitions of a graph. For instance, generalizing a well-known result of Lovász, it is shown that the weight Shannon capacity Θ^* of a connected graph Γ, with n vertices and (adjacency matrix) eigenvalues λ₁ > λ₂ … λ_n, satisfies

where Θ is the (standard) Shannon capacity and v is the positive eigenvector normalized to have smallest entry 1. In the special case of regular graphs, the results obtained have some interesting corollaries, such as an upper bound for some of the multiplicities of the eigenvalues of a distance-regular graph. Finally, some results involving the Laplacian spectrum are derived.     

Graphs and Hermitian matrices: Exact interlacing

We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest eigenvalue of a graph.     

Inverse spectral problem for the operators with non‐local potential

The main object under consideration in the paper is the second derivative operator on a finite interval with zero boundary conditions perturbed by a self‐adjoint integral operator with the degenerate kernel (non‐local potential). The inverse problem, i.e., the reconstruction of the perturbation from the spectral data, is solved by means of the step‐by‐step procedure based on the n‐interlacing property of the spectrum.