Global bifurcation of a class of periodic boundary-value problems

We prove that λ=0 is a global bifurcation point of the second-order periodic boundary-value problem (p(t)x^′(t))^′−λx(t)−λ²x^′(t)−f(t,x(t),x^′(t),x^″(t));x(0)=x(1),x^′(0)=x^′(1). We study this equation under hypotheses for which it may be solved explicitly for x^″(t). However, it is shown that the explicitly solved equation does not satisfy the usual conditions that are sufficient to conclude global bifurcation. Thus, we need to study the implicit equation with regard to global bifurcation.     

On the rationalization of a sum of surds

A program to rationalize the equations ∑⁵_i = 1√y_i = 0 and ∑⁶_i = 1√y_i= 0 is described; here y_i are indeterminates. Complete answers are given for these two cases, and for the elementary cases where the sum consists of three or four terms. The rationalization utilizes a family of algorithms treating the algebra of symmetric functions. This is the first step in the construction of a comprehensive computer package—SYMPACK—designed to carry out all useful manipulations of the five basic symmetric functions. The contents of this package, as currently envisaged, is given in outline.     

Changing and unchanging of the domination number of a graph

Let G be a graph and γ(G) denote the domination number of G. A dominating set D of a graph G with |D|=γ(G) is called a γ-set of G. A vertex x of a graph G is called: (i) γ-fixed if x belongs to every γ-set, (ii) γ-free if x belongs to some γ-set but not to all γ-sets, (iii) γ-bad if x belongs to no γ-set, (iv) γ^--free if x is γ-free and γ(G-x)=γ(G)-1, (v) γ⁰-free if x is γ-free and γ(G-x)=γ(G), and (vi) γ^q-fixed if x is γ-fixed and γ(G-x)=γ(G)+q. In this paper we investigate for any vertex x of a graph G whether x is γ^q-fixed, γ⁰-free, γ^--free or γ-bad when G is modified by deleting a vertex or adding or deleting an edge.     

The vertex-cover polynomial of a graph

In this paper we define the vertex-cover polynomial Ψ(G,τ) for a graph G. The coefficient of τ^r in this polynomial is the number of vertex covers V′ of G with |V′|=r. We develop a method to calculate Ψ(G,τ). Motivated by a problem in biological systematics, we also consider the mappings f from {1, 2,…,m} into the vertex set V(G) of a graph G, subject to f⁻¹(x)f⁻¹(y)≠ for every edge xy in G. Let F(G,m) be the number of such mappings f. We show that F(G,m) can be determined from Ψ(G,τ).     

The Terwilliger Algebra Associated with a Set of Vertices in a Distance-Regular Graph

Let Γ be a distance-regular graph of diameter D. Let X denote the vertex set of Γ and let Y be a nonempty subset of X. We define an algebra τ = τ(Y). This algebra is finite dimensional and semisimple. If Y consists of a single vertex then τ is the corresponding subconstituent algebra defined by P. Terwilliger. We investigate the irreducible τ-modules. We define endpoints and thin condition on irreducible τ-modules as a generalization of the case when Y consists of a single vertex. We determine when an irreducible module is thin. When the module is generated by the characteristic vector of Y, it is thin if and only if Y is a completely regular code of Γ. By considering a suitable subset Y, every irreducible τ(x)-module of endpoint i can be regarded as an irreducible τ(Y)-module of endpoint 0.This research was partially supported by the Grant-in-Aid for Scientific Research (No. 12640039), Japan Society of the Promotion of Science. A part of the research was done when the author was visiting the Ohio State University.     

The representability number of a chain

For each pair of linear orderings (L,M), the representability number repr_M(L) of L in M is the least ordinal α such that L can be order-embedded into the lexicographic power . The case is relevant to utility theory. The main results in this paper are as follows. (i) If κ is a regular cardinal that is not order-embeddable in M, then repr_M(κ)=κ; as a consequence, for each κω₁. (ii) If M is an uncountable linear ordering with the property that A×_lex2 is not order-embeddable in M for each uncountable AM, then for any ordinal α; in particular, . (iii) If L is either an Aronszajn line or a Souslin line, then .     

Routing through a generalized switchbox

We present an algorithm for the routing problem for two-terminal nets in generalized switchboxes. A generalized switchbox is any subset R of the planar rectangular grid with no nontrivial holes, i.e., every finite face has exactly four incident vertices. A net is a pair of nodes of nonmaximal degree on the boundary of R. A solution is a set of edge-disjoint paths, one for each net. Our algorithm solves standard generalized switchbox routing problems in time O(n(log n)²) where n is the number of vertices of R, i.e., it either finds a solution or indicates that there is none. A problem is standard if deg(ν) + ter(ν) is even for all vertices ν where deg(ν) is the degree of ν and ter(ν) is the number of nets which have ν as a terminal. For nonstandard problems we can find a solution in time O(n(log n)² + |U|²) where U is the set of vertices ν with deg(ν) + ter(ν) is odd.     

Nonnegative solutions of a nonlinear recurrence

Orthonormal polynomials with weight ¦τ¦ exp(−τ⁴) have leading coefficients with recurrence properties which motivate the more general equations ξ_m(ξ_{m − 1} + ξ_m + ξ_{m + 1}) = γ_m², M = 1, 2,…, where ξ_o is a fixed nonnegative value and γ₁, γ₂,… are positive constants. For this broader problem, the existence of a nonnegative solution is proved and criteria are found for its uniqueness. Then, for the motivating problem, an asymptotic expansion of its unique nonnegative solution is obtained and a fast computational algorithm, with error estimates, is given.     

Second-Order Properties of a Two-Stage Fixed-Size Confidence Region for the Mean Vector of a Multivariate Normal Distribution

We consider the classical fixed-size confidence region estimation problem for the mean vectorμin theN_p(μ, Σ) population where Σ is unknown but positive definite. We writeλ₁for the largest characteristic root of Σ and assume thatλ₁is simple. Moreover, we suppose that, in many practical applications, we will often have available a numberλ*(>0) and that we can assumeλ₁>λ*. Given this addi- tional, and yet very minimal, knowledge regardingλ₁, the two-stage procedure of Chatterjee (Calcutta Statist. Assoc. Bull.8(1959a), 121–148;9(1959b), 20–28;11(1962), 144–159) is revised appropriately. The highlight in this paper involves the verification ofsecond-order propertiesassociated with such revised two-stage estimation techniques, along with the maintenance of the nominal confidence coefficient.     

Stability and other limit laws for exit times of random walks from a strip or a halfplane

We show that the passage time, T^*(r), of a random walk S_n above a horizontal boundary at r (r≥0) is stable (in probability) in the sense that as r→∞ for a deterministic function C(r)>0, if and only if the random walk is relatively stable in the sense that as n→∞ for a deterministic sequence B_n>0. The stability of a passage time is an important ingredient in some proofs in sequential analysis, where it arises during applications of Anscombe's Theorem. We also prove a counterpart for the almost sure stability of T^*(r), which we show is equivalent to E|X|<∞, EX>0. Similarly, counterparts for the exit of the random walk from the strip {|y|≤r} are proved. The conditions arefurther related to the relative stability of the maximal sum and the maximum modulus of the sums. Another result shows that the exit position of the random walk outside the boundaries at ±r drifts to ∞ as r→∞ if and only if the random walk drifts to ∞.     

On finding the core of a tree with a specified length

A core of a graph G is a path P in G that is central with respect to the property of minizining d(P) = Σ_υεV(G)d(υ, P), where d(υ, P) is the distance from vertex υ to path P. This paper explores some properties of a core of a specified length.     

Acyclic graphoidal covers and path partitions in a graph

An acyclic graphoidal cover of a graph G is a collection ψ of paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ. The minimum cardinality of an acyclic graphoidal cover of G is called the acyclic graphoidal covering number of G and is denoted by η_a. A path partition of a graph G is a collection P of paths in G such that every edge of G is in exactly one path in P. The minimum cardinality of a path partition of G is called thepath partition number of G and is denoted by π. In this paper we determine η_a and π for several classes of graphs and obtain a characterization of all graphs with Δ 4 and η_a = Δ − 1. We also obtain a characterization of all graphs for which η_a = π.     

Estimation of a Mean Vector in a Two-Sample Problem

We consider the problem of estimating a p-dimensional vector μ₁ based on independent variables X₁, X₂, and U, where X₁ is N_p(μ₁, σ²Σ₁), X₂ is N_p(μ₂, σ²Σ₂), and U is σ²χ²_n (Σ₁ and Σ₂ are known). A family of minimax estimators is proposed. Some of these estimators can be obtained via Bayesian arguments as well. Comparisons between our results and the one of Ghosh and Sinha (1988, J. Multivariate Anal.27 206-207) are presented.     

On confidence sequences for the mean vector of a multivariate normal distribution

Let X₁, X₂,… be idd random vectors with a multivariate normal distribution N(μ, Σ). A sequence of subsets {R_n(a₁, a₂,…, a_n), n ≥ m} of the space of μ is said to be a (1 − α)-level sequence of confidence sets for μ if P(μ R_n(X₁, X₂,…, X_n) for every n ≥ m) ≥ 1 − α. In this note we use the ideas of Robbins Ann. Math. Statist. 41 (1970) to construct confidence sequences for the mean vector μ when Σ is either known or unknown. The constructed sequence R_n(X₁, X₂, …, X_n) depends on Mahalanobis' or Hotelling's according as Σ is known or unknown. Confidence sequences for the vector-valued parameter in the general linear model are also given.     

Labeling planar graphs with a condition at distance two

An L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to neighboring vertices differ by at least 2 and the labels of vertices at distance two are different. The smallest K for which an L(2,1)-labeling of a graph G exists is denoted by λ_2,1(G). Griggs and Yeh [J.R. Griggs, R.K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992) 586–595] conjectured that λ_2,1(G)≤Δ² for every graph G with maximum degree Δ≥2. We prove the conjecture for planar graphs with maximum degree Δ≠3. All our results also generalize to the list-coloring setting.     

Sphericity test in a GMANOVA–MANOVA model with normal error

For the GMANOVA–MANOVA model with normal error: , , we study in this paper the sphericity hypothesis test problem with respect to covariance matrix: Σ=λI_q (λ is unknown). It is shown that, as a function of the likelihood ratio statistic Λ, the null distribution of Λ^2/n can be expressed by Meijer’s function, and the asymptotic null distribution of −2logΛ is (as n→∞). In addition, the Bartlett type correction −2ρlogΛ for logΛ is indicated to be asymptotically distributed as with order n⁻² for an appropriate Bartlett adjustment factor −2ρ under null hypothesis.     

A limit in probability in a W-algebra is unique

Let be the space of self-adjoint Segal measurable operators affiliated to a W^*-algebra (for x=∫λe_x(dλ), x e_x((−∞, −n)(n, ∞)) is a finite projection in for n large enough). The limit in probability is unique in . x_n → x in probability e_nProj ;e_n→1 strongly and (x_n − x) e_n → 0. The following proposition proves to be important in the investigation of . If 1 − ƒ is a finite projection in and 1 − e_n → 0 strongly, e_nProj , then strongly.     

An asymptotic minimax risk bound for estimation of a linear functional relationship

We consider estimation of the parameter B in a multivariate linear functional relationship X_i=ξ_i+ξ_1i, Y_i=Bξ_i+ξ_2i, i=1,…,n, where the errors (ζ_1i^′, ζ_2i^′) are independent standard normal and (ξ_i, i ) is a sequence of unknown nonrandom vectors (incidental parameters). If there are no substantial a priori restrictions on the infinite sequence of incidental parameters then asymptotically the model is nonparametric but does not fit into common settings presupposing a parameter from a metric function space. A special result of the local asymptotic minimax type for the m.1.e. of B is proved. The accuracy of the normal approximation for the m.l.e. of order n^−1/2 is also established.     

On the asymptotic behaviour of a semigroup of linear operators

Let T = {T(t)}_{t ≥ 0} be a C₀-semigroup on a Banach space X. In this paper, we study the relations between the abscissa ω_Lp(T) of weak p-integrability of T (1 ≤ p < ∞), the abscissa ω^p_R(A) of p-boundedness of the resolvent of the generator A of T (1 ≤ p ≤ ∞), and the growth bounds ω_β(T), β ≥ 0, of T. Our main results are as follows.

1. (i) Let T be a C₀-semigroup on a B-convex Banach space such that the resolvent of its generator is uniformly bounded in the right half plane. Then ω_{1 − ε}(T) < 0 for some ε > 0.

2. (ii) Let T be a C₀-semigroup on L^p such that the resolvent of the generator is uniformly bounded in the right half plane. Then ω_β(T) < 0 for all β>¦1/p − 1/p′¦, 1/p + 1/p′ = 1.

3. (iii) Let 1 ≤ p ≤ 2 and let T be a weakly L^p-stable C₀-semigroup on a Banach space X. Then for all β>1/p we have ω_β(T) ≤ 0.

Further, we give sufficient conditions in terms of ω^q_R(A) for the existence of L^p-solutions and W^1,p-solutions (1 ≤ p ≤ ∞) of the abstract Cauchy problem for a general class of operators A on X.     

Existence of periodic solutions for a fourth-order -Laplacian equation with a deviating argument

In this paper, we study the existence of periodic solutions for a fourth-order p-Laplacian differential equation with a deviating argument as follows:

[φ_p(u^″(t))]^″+f(u^″(t))+g(u(t−τ(t)))=e(t).