Inequalities for the median of the gamma distribution

We provide several new inequalities involving λ_n, the median of the gamma distribution of order n+1 with parameter 1. Among others, we present sharp upper and lower bounds for the arithmetic mean of λ₁,λ₂,…,λ_n. For all integers n?1 we have

     

New upper bounds for Estrada index of bipartite graphs

Suppose G is a graph and λ₁,λ₂,…,λ_n are the eigenvalues of G. The Estrada index EE(G) of G is defined as the sum of e^λ_i, 1≤i≤n. In this paper some new upper bounds for the Estrada index of bipartite graphs are presented. We apply our result on a (4,6)-fullerene to improve our bound given in an earlier paper.     

Estimating the Estrada index

Let G be a graph on n vertices, and let λ₁,λ₂,…,λ_n be its eigenvalues. The Estrada index of G is a recently introduced graph invariant, defined as . We establish lower and upper bounds for EE in terms of the number of vertices and number of edges. Also some inequalities between EE and the energy of G are obtained.     

The Andrews-Stanley partition function and Al-Salam-Chihara polynomials

For any partition λ let ω(λ) denote the four parameter weight

ω(λ)=a^{∑_i≥1⌈λ_2i−1/2⌉}b^{∑_i≥1⌊λ_2i−1/2⌋}c^{∑_i≥1⌈λ_2i/2⌉}d^{∑_i≥1⌊λ_2i/2⌋},     

On the determination of a tridiagonal matrix from its spectrum and a submatrix

Given a set of 2n real numbers λ₁<λ₂<?<λ_2n, the authors describe the set {S} of n × n tridiagonal matrices with the property that each S can be completed to a 2n×2n tridiagonal matrix L with spec(L)={λ₁, λ₂,…,λ_2n}.     

Some lower bounds for the spectral radius of matrices using traces

Let A be an n×n matrix with eigenvalues λ₁,λ₂,…,λ_n, and let m be an integer satisfying rank(A)?m?n. If A is real, the best possible lower bound for its spectral radius in terms of m, trA and trA² is obtained. If A is any complex matrix, two lower bounds for are compared, and furthermore a new lower bound for the spectral radius is given only in terms of trA,trA²,‖A‖,‖A^∗A-AA^∗‖,n and m.     

Bounding the gap between extremal Laplacian eigenvalues of graphs

Let G be a graph whose Laplacian eigenvalues are 0 = λ₁ ? λ₂ ? ? ? λ_n. We investigate the gap (expressed either as a difference or as a ratio) between the extremal non-trivial Laplacian eigenvalues of a connected graph (that is λ_n and λ₂). This gap is closely related to the average density of cuts in a graph. We focus here on the problem of bounding the gap from below.     

Some exact distributions of the number of one-sided deviations and the time of the last such deviation in the simple random walk

For every positive integer n, let S_n be the n-th partial sum of a sequence of independent and identically distributed random variables, each assuming the values +1 and −1 with respective probabilities p (0<p<1)) and q (= 1 −p) and having mean μ = p − q. For a fixed positive real number λ, let N⁺[N1] be the total number of values of n for which S_n > (μ + λ)n [S_n⩾(μ + λ)n] and let L⁺[L1] be the supremum of the values of n for which S_n > (μ + λ)n [S_n⩾(μ + λ)n], where sup Oslash; = 0. Explicit expressions for the exact distributions of N⁺, N1, L⁺ and L1 are given when μ + λ = ±k/(k + 2) for any nonnegative integer k.     

Markov-Nikolskii type inequalities for exponential sums on finite intervals

Let Λn:={λ₀<λ₁<?<λn} be a set of real numbers. The collection of all linear combinations of eλ₀t,eλ₁t,…,eλnt over R will be denoted by

E(Λn):=span{eλ₀t,eλ₁t,…,eλnt}.     

Eigenvalue gaps for the Cauchy process and a Poincaré inequality

A connection between the semigroup of the Cauchy process killed upon exiting a domain D and a mixed boundary value problem for the Laplacian in one dimension higher known as the mixed Steklov problem, was established in [R. Bañuelos, T. Kulczycki, The Cauchy process and the Steklov problem, J. Funct. Anal. 211 (2004) 355-423]. From this, a variational characterization for the eigenvalues λn, n?1, of the Cauchy process in D was obtained. In this paper we obtain a variational characterization of the difference between λn and λ₁. We study bounded convex domains which are symmetric with respect to one of the coordinate axis and obtain lower bound estimates for λ_∗−λ₁ where λ_∗ is the eigenvalue corresponding to the “first” antisymmetric eigenfunction for D. The proof is based on a variational characterization of λ_∗−λ₁ and on a weighted Poincaré-type inequality. The Poincaré inequality is valid for all α symmetric stable processes, 0<α?2, and any other process obtained from Brownian motion by subordination. We also prove upper bound estimates for the spectral gap λ₂−λ₁ in bounded convex domains.     

Likelihood ratio orderings of spacings of heterogeneous exponential random variables

Let X₁,X₂,…,X_n be independent exponential random variables such that X_i has failure rate λ for i=1,…,p and X_j has failure rate λ^* for j=p+1,…,n, where p≥1 and q=n-p≥1. Denote by D_i:n(p,q)=X_i:n-X_i-1:n the ith spacing of the order statistics , where X_0:n≡0. It is shown that D_i:n(p,q)?_lrD_i+1:n(p,q) for i=1,…,n-1, and that if λ?λ^* then , and for i=1,…,n, where ?_lr denotes the likelihood ratio order. The main results are used to establish the dispersive orderings between spacings.     

Resolvable group divisible designs with block size four and general index

In this paper, we investigate the existence of resolvable group divisible designs (RGDDs) with block size four, group-type hⁿ and general index λ. The necessary conditions for the existence of such a design are n≥4, and . These necessary conditions are shown to be sufficient for all λ≥2, with the definite exceptions of (λ,h,n)∈{(3,2,6)}∪{(2j+1,2,4):j≥1}. The known existence result for λ=1 is also improved.     

Only the first term of some series counts

Let X,X₁,X₂,… be i.i.d. random variables, and set S_n=X₁+?+X_n. We prove that for three important distributions of X, namely normal, exponential and geometric, series of the type ∑_n≥1a_nP(|S_n|≥xb_n) or ∑_n≥1a_nP(S_n≥xb_n) behave like their first term as x→∞.     

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.     

Bounds for ratios of eigenvalues using traces

Let A be an n × n matrix with real eigenvalues λ₁ ? … ? λ_n, and let 1 ? k < l ? n. Bounds involving trA and trA² are introduced for λ_k/λ_l, (λ_k ? λ_l)/(λ_k + λ_l), and {kλ_k + (n ? l + 1)λ_l}²/{kλ²_k + (n ? l + 1)λ²_l}. Also included are conditions for λ_l >; 0 and for λ_k + λ_l > 0.     

Group divisible designs with three unequal groups and larger first index

We show the necessary conditions are sufficient for the existence of group divisible designs (or PBIBDs) with block size k=3 with three groups of size (n,2,1) for any n≥2 and any two indices with λ₁>λ₂.     

On the skew energy of orientations of hypercubes

Let D be a digraph of order n and λ₁,λ₂,…,λ_n denote all the eigenvalues of the skew-adjacency matrix of D. The skew energy E_S(D) of D is defined as . In this paper, it is proved that for any positive integer k≥3, there exists a k-regular graph of order n having an orientation D with . This work positively answers a problem proposed by Adiga et al. [C. Adiga, R. Balakrishnan, Wasin So, The skew energy of a digraph, Linear Algebra Appl. 432 (2010) 1825-1835]. In addition, a digraph is also constructed such that its skew energy is the same as the energy of its underlying graph.     

Deflating quadratic matrix polynomials with structure preserving transformations

Given a pair of distinct eigenvalues (λ₁,λ₂) of an n×n quadratic matrix polynomial Q(λ) with nonsingular leading coefficient and their corresponding eigenvectors, we show how to transform Q(λ) into a quadratic of the form having the same eigenvalue s as Q(λ), with Q_d(λ) an (n-1)×(n-1) quadratic matrix polynomial and q(λ) a scalar quadratic polynomial with roots λ₁ and λ₂. This block diagonalization cannot be achieved by a similarity transformation applied directly to Q(λ) unless the eigenvectors corresponding to λ₁ and λ₂ are parallel. We identify conditions under which we can construct a family of 2n×2n elementary similarity transformations that (a) are rank-two modifications of the identity matrix, (b) act on linearizations of Q(λ), (c) preserve the block structure of a large class of block symmetric linearizations of Q(λ), thereby defining new quadratic matrix polynomials Q₁(λ) that have the same eigenvalue s as Q(λ), (d) yield quadratics Q₁(λ) with the property that their eigenvectors associated with λ₁ and λ₂ are parallel and hence can subsequently be deflated by a similarity applied directly to Q₁(λ). This is the first attempt at building elementary transformations that preserve the block structure of widely used linearizations and which have a specific action.     

Decomposition of complete multigraphs into crown graphs

Let λ K _v be the complete multigraph, G a finite simple graph. A G-design of λ K _v is denoted by GD(v,G,λ). The crown graph Q _n is obtained by joining single pendant edge to each vertex of an n-cycle. We give new constructions for Q _n -designs. Let v and λ be two positive integers. For n=4, 6, 8 and λ≥1, there exists a GD(v,Q _n ,λ) if and only if either (1) v>2n and λ v(v?1)≡0 (mod 4n), or (2) v=2n and λ≡0 (mod 4). Let n≥4 be even. Then (1) there exists a GD(2n,Q _n ,λ) if and only if λ≡0 (mod 4). (2) There exists a GD(2n+1,Q _n ,λ) when λ≡0 (mod 4).     

Spectra of principal submatrices of nonnegative matrices

Let A be an n×n nonnegative matrix with the spectrum (λ₁,λ₂,…,λ_n) and let A₁ be an m×m principal submatrix of A with the spectrum (μ₁,μ₂,…,μ_m). In this paper we present some cases where the realizability of (μ₁,μ₂,…,μ_m,ν₁,ν₂,…,ν_s) implies the realizability of (λ₁,λ₂,…,λ_n,ν₁,ν₂,…,ν_s) and consider the question whether this holds in general. In particular, we show that the list

(λ₁,λ₂,…,λ_n,-μ₁,-μ₂,…,-μ_m)