The proof on the conjecture of extremal graphs for the kth eigenvalues of trees

We consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λ_k.of trees with n vertices. In this paper, the conjecture for this problem in [Shao Jia-yu, On the largest kth eignevalues of trees, Linear Algebra Appl. 221 (1995) 131] is proved and (from this) the complete solution to this problem, the best upper bound and the extremal trees of λ_k, is given in general cases above.     

Spreads, arcs, and multiple wavelength codes

We present several new families of multiple wavelength (2-dimensional) optical orthogonal codes (2D-OOCs) with ideal auto-correlation λ_a=0 (codes with at most one pulse per wavelength). We also provide a construction which yields multiple weight codes. All of our constructions produce codes that are either optimal with respect to the Johnson bound (J-optimal), or are asymptotically optimal and maximal. The constructions are based on certain pointsets in finite projective spaces of dimension k over GF(q) denoted PG(k,q).     

Q5‐factorization of λKn

Q_k is the simple graph whose vertices are the k‐tuples with entries in {0, 1} and edges are the pairs of k‐tuples that differ in exactly one position. In this paper, we proved that there exists a Q₅‐factorization of λK_n if and only if (a) n ≡ 0(mod 32) if λ ≡ 0(mod 5) and (b) n ≡ 96(mod 160) if λ ? 0(mod 5).     

On the Perron-Frobenius eigenvector for nonnegative integral matrices whose largest eigenvalue is integral

We first derive the bound |det(λI − A)|⩽λ^k − λ^k₀ (λ₀⩽λ), where A is a k × k nonnegative real matrix and λ₀ is the spectral radius of A. If A is irreducible and integral, and its largest nonnegative eigenvalue is an integer n, then we use this inequality to derive the upper bound n^k−1 on the components of the smallest integer eigenvector corresponding to n. Finer information on the components is also derived.     

On a class of Besicovitch functions to have exact box dimension: A necessary and sufficient condition

Let 1 < s < 2, λ_k > 0 with λ_k → ∞ satisfy λ_k+1/λ_k ≥ λ > 1. For a class of Besicovich functions B(t) = sin λ_kt, the present paper investigates the intrinsic relationship between box dimension of their graphs and the asymptotic behavior of {λ_k}. We show that the upper box dimension does not exceed s in general, and equals to s while the increasing rate is sufficiently large. An estimate of the lower box dimension is also established. Then a necessary and sufficient condition is given for this type of Besicovitch functions to have exact box dimensions: for sufficiently large λ, dim _BΓ(B) = dim _BΓ(B) = s holds if and only if lim_n→∞ = 1. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Differentiable Eigenvalues of Perturbed Quadratic Matrix Functions

Let T(λ, ε ) = λ² + λC + λεD + K be a perturbed quadratic matrix polynomial, where C, D, and K are n × n hermitian matrices. Let λ₀ be an eigenvalue of the unperturbed matrix polynomial T(λ, 0). With the falling part of the Newton diagram of det T(λ, ε), we find the number of differentiable eigenvalues. Some results are extended to the general case L(λ, ε) = λ² + λD(ε) + K, where D(ε) is an analytic hermitian matrix function. We show that if K is negative definite on Ker L(λ₀, 0), then every eigenvalue λ(ε) of L(λ, ε) near λ₀ is analytic.     

Nonvanishing of Kronecker coefficients for rectangular shapes

We prove that for any partition (λ₁,…,λd²) of size ?d there exists k?1 such that the tensor square of the irreducible representation of the symmetric group Sk?d with respect to the rectangular partition (k?,…,k?) contains the irreducible representation corresponding to the stretched partition (kλ₁,…,kλd²). We also prove a related approximate version of this statement in which the stretching factor k is effectively bounded in terms of d. We further discuss the consequences for geometric complexity theory which provided the motivation for this work.     

ERRATA TO： ＂λ-Statistical Convergence of Order α＂ Acta Mathematica Scientia 2011, 31B（3）： 953–959

The sequences defined in Example 3 and Example 4 do not serve our purpose for any λ = (λn). Because this sequences are just the sequences x = (xk) = (k) and x = (xk) = (1) respectively and any term of these sequences can not be 0. In this short not we give Example 3* and Example 4* to show that the inclusions given in Theorem 2.4 and Theorem 2.9 are strict for some λ = (λn) , α and β such that 0 < α < β≤ 1.     

On the inverse and the dual index of a tree

The inverse of a graph with the spectrum λ ₁, λ ₁, …λ _n (λ ₁≠0) is a graph with the spectrum 1/λ₁,1/λ₂,…,1/λ _n ,.We present a purely graph-theoretic construction of the inverse ol a tree with a perfect matening. We apply this method for deriving results concerning the least nonnegative eigenvalue of a tree (called the dual index of a tree), including the best possible upper bound for the dual index of a tree in terms of a the number of its vertices.     

First order spectral perturbation theory of square singular matrix polynomials

We develop first order eigenvalue expansions of one-parametric perturbations of square singular matrix polynomials. Although the eigenvalues of a singular matrix polynomial P(λ) are not continuous functions of the entries of the coefficients of the polynomial, we show that for most perturbations they are indeed continuous. Given an eigenvalue λ₀ of P(λ) we prove that, for generic perturbations M(λ) of degree at most the degree of P(λ), the eigenvalues of P(λ)+?M(λ) admit covergent series expansions near λ₀ and we describe the first order term of these expansions in terms of M(λ₀) and certain particular bases of the left and right null spaces of P(λ₀). In the important case of λ₀ being a semisimple eigenvalue of P(λ) any bases of the left and right null spaces of P(λ₀) can be used, and the first order term of the eigenvalue expansions takes a simple form. In this situation we also obtain the limit vector of the associated eigenvector expansions.     

On the Generalization of the Courant Nodal Domain Theorem

In this paper we consider the analogue of the Courant nodal domain theorem for the nonlinear eigenvalue problem for the p-Laplacian. In particular we prove that if u_λn is an eigenfunction associated with the nth variational eigenvalue, λ_n, then u_λn has at most 2n−2 nodal domains. Also, if u_λn has n+k nodal domains, then there is another eigenfunction with at most n−k nodal domains.     

The smallest eigenvalue of large Hankel matrices generated by a deformed Laguerre weight

We study the asymptotic behavior of the smallest eigenvalue, λ_N, of the Hankel (or moments) matrix denoted by , with respect to the weight . An asymptotic expression of the polynomials orthogonal with w(x) is established. Using this, we obtain the specific asymptotic formulas of λ_N in this paper. Applying a parallel numerical algorithm, we get a variety of numerical results of λ_N corresponding to our theoretical calculations.     

Graphs for small multiprocessor interconnection networks

Let D be the diameter of a graph G and let λ₁ be the largest eigenvalue of its (0, 1)-adjacency matrix. We give a proof of the fact that there are exactly 69 non-trivial connected graphs with (D + 1)λ₁ ? 9. These 69 graphs all have up to 10 vertices and were recently found to be suitable models for small multiprocessor interconnection networks. We also examine the suitability of integral graphs to model multiprocessor interconnection networks, especially with respect to the load balancing problem. In addition, we classify integral graphs with small values of (D + 1)λ₁ in connection with the load balancing problem for multiprocessor systems.     

Spectral analysis of a perturbed multistratified isotropic elastic strip: new method

We study the self‐adjoint operator (𝒟(A), A) associated with an elastic isotropic and multistratified strip Ω = {(x₁, x₂) ∈ ℝ²; 0 < x₂ < L}, which means that there exists a constant a > 0 such that the density ρ and Lamé coefficients λ and μ are, for (−1)^kx₁ ⩾ a, k = 1, 2, respectively, equal to functions ρ _k, λ _k and μ _k, depending only on x₂. Thanks to [4] the properties of the free operators A^k, k = 1, 2, associated with ρ _k, λ _k and μ _k, are well‐known. We study A by considering it as a ‘compact perturbation’ of the pair (A¹, A²). The difficulty is: if ψ ∈ C(ℝ²) and u ∈ D(A) then ψ u does not necessarily belong to D(A). It has already been encountered in other studies concerning elasticity (cf. [10,18]). Adapting the techniques used there to overcome this difficulty imposes restrictive conditions on λ _k and μ _k. The purpose of this paper is to propose a new method, which removes definitively this difficulty and enables us without restrictive conditions on λ _k and μ _k to prove a limiting absorption principle for A. Copyright © 1999 John Wiley & Sons, Ltd.     

Regularity for Shape Optimizers: The Degenerate Case

We consider minimizers of (1) where F is a function nondecreasing in each parameter, and λ_k(Ω) is the k^th Dirichlet eigenvalue of ω. This includes, in particular, functions F that depend on just some of the first N eigenvalues, such as the often-studied F=λ_N. The existence of a minimizer, which is also a bounded set of finite perimeter, was shown recently. Here we show that the reduced boundary of the minimizers Ω is made up of smooth graphs and examine the difficulties in classifying the singular points. Our approach is based on an approximation (“vanishing viscosity”) argument, which—counterintuitively—allows us to recover an Euler-Lagrange equation for the minimizers that is not otherwise available. © 2019 Wiley Periodicals, Inc.     

Nonlinear resonant periodic problems with concave terms

We consider a nonlinear periodic problem, driven by the scalar p-Laplacian with a concave term and a Caratheodory perturbation. We assume that this perturbation f(t,x) is (p−1)-linear at ±∞, and resonance can occur with respect to an eigenvalue λm+1, m?2, of the negative periodic scalar p-Laplacian. Using a combination of variational techniques, based on the critical point theory, with Morse theory, we establish the existence of at least three nontrivial solutions. Useful in our considerations is an alternative minimax characterization of λ₁>0 (the first nonzero eigenvalue) that we prove in this work.     

Variational aspects of Laplace eigenvalues on Riemannian surfaces

We study the existence and properties of metrics maximising the first Laplace eigenvalue among conformal metrics of unit volume on Riemannian surfaces. We describe a general approach to this problem and its higher eigenvalue versions via the direct method of calculus of variations. The principal results include the general regularity properties of _λk${\lambda }_k$-extremal metrics and the existence of a partially regular _λ1${\lambda }_1$-maximiser.     

Hopf Bifurcations and Oscillatory Instabilities of Spike Solutions for the One-Dimensional Gierer-Meinhardt Model

Summary. In the limit of small activator diffusivity ɛ , the stability of symmetric k -spike equilibrium solutions to the Gierer-Meinhardt reaction-diffusion system in a one-dimensional spatial domain is studied for various ranges of the reaction-time constant τ≥ 0 and the diffusivity D>0 of the inhibitor field dynamics. A nonlocal eigenvalue problem is derived that determines the stability on an O(1) time-scale of these k -spike equilibrium patterns. The spectrum of this eigenvalue problem is studied in detail using a combination of rigorous, asymptotic, and numerical methods. For k=1 , and for various exponent sets of the nonlinear terms, we show that for each D>0 , a one-spike solution is stable only when 0≤ τ<τ ₀ (D) . As τ increases past τ ₀ (D) , a pair of complex conjugate eigenvalues enters the unstable right half-plane, triggering an oscillatory instability in the amplitudes of the spikes. A large-scale oscillatory motion for the amplitudes of the spikes that occurs when τ is well beyond τ ₀ (D) is computed numerically and explained qualitatively. For k≥ 2 , we show that a k -spike solution is unstable for any τ≥ 0 when D>D _k , where D _k >0 is the well-known stability threshold of a multispike solution when τ=0 . For D>D _k and τ≥ 0 , there are eigenvalues of the linearization that lie on the (unstable) positive real axis of the complex eigenvalue plane. The resulting instability is of competition type whereby spikes are annihilated in finite time. For 0<D<D _k , we show that a k -spike solution is stable with respect to the O(1) eigenvalues only when 0≤ τ<τ ₀ (D;k) . When τ increases past τ ₀ (D;k)>0 , a synchronous oscillatory instability in the amplitudes of the spikes is initiated. For certain exponent sets and for k≥ 2 , we show that τ ₀ (D;k) is a decreasing function of D with τ ₀ (D;k) → τ _0k >0 as D→ D _k ^- .     

The Geometry of the First Non-zero Stekloff Eigenvalue

Let (Mⁿ, g) be a compact Riemannian manifold with boundary and dimensionn2. In this paper we discuss the first non-zero eigenvalue problem \begin{align}\Delta\varphi & = & 0\qquad & on\quad M,\\ \frac{\partial\varphi}{\partial \eta} & = & \ u_1\varphi\qquad & on\quad\partial M.\end{align}\eqno (1) Problem (1) is known as the Stekloff problem because it was introduced by him in 1902, for bounded domains of the plane. We discuss estimates of the eigenvalueν₁in terms of the geometry of the manifold (Mⁿ, g). In the two-dimensional case we generalize Payne's Theorem [P] for bounded domains in the plane to non-negative curvature manifolds. In this case we show thatν₁k₀, wherek_gk₀andk_grepresents the geodesic curvature of the boundary. In higher dimensionsn3 for non-negative Ricci curvature manifolds we show thatν₁>k₀/2, wherek₀is a lower bound for any eigenvalue of the second fundamental form of the boundary. We introduce an isoperimetric constant and prove a Cheeger's type inequality for the Stekloff eigenvalue.     

The property of maximal eigenvectors of trees

Let T be a tree on n vertices and L(T) be its Laplacian matrix. The eigenvalues and eigenvectors of T are respectively referred to those of L(T). With respect to a given eigenvector Y of T, a vertex u of T is called a characteristic vertex if Y [u] = 0 and there is a vertex w adjacent to u with Y [w] ≠ 0; an edge e = (u, w) of G is called a characteristic edge if Y [u]Y [w] < 0. By 𝒞(T, Y) we denote the characteristic set of T with respect to the vector Y, which is defined as the collection of all characteristic vertices and characteristic edges of T corresponding to Y. Merris shows that 𝒞(T, Y) is fixed for all Fiedler vectors of the tree T. An eigenvector of T is called a k-vector (k ≥ 2) of T if this eigenvector corresponds to an eigenvalue λ _k with λ _k > λ _k?1, where λ₁, λ₂, …, λ _n are the eigenvalues of T arranged in non-decreasing order. A k-vector Y of T is called k-maximal if 𝒞(T, Y) has maximum cardinality among all k-vectors of T. We prove that (1) the characteristic set of T with respect to an arbitrary k-vector is contained in that with respect to any k-maximal vector; and consequently (2) the characteristic sets of T with respect to any two k-maximal vectors are same. Our result may be considered as a generalization of Merris' result as Fiedler vectors are 2-maximal.