On the power of the zeros of Bessel functions

For ν≥0 let c_νk be the k-th positive zero of the cylinder functionC _v(t)=J _v(t)cosα-Y _v(t)sinα, 0≤α>π whereJ _ν(t) andY _ν(t) denote the Bessel functions of the first and the second kind, respectively. We prove thatC _v,k ^1+H(x) is convex as a function of ν, ifc _νk≥x>0 and ν≥0, whereH(x) is specified in Theorem 1.1.     

Properties of the set of positive solutions to Dirichlet boundary value problems with time singularities

The paper investigates the structure and properties of the set S of all positive solutions to the singular Dirichlet boundary value problem u″(t) + au′(t)/t ? au(t)/t ² = f(t, u(t),u′(t)), u(0) = 0, u(T) = 0. Here a ∈ (?∞,?1) and f satisfies the local Carathéodory conditions on [0,T]×D, where D = [0,∞)×?. It is shown that S _c = {u ∈ S: u′(T) = ?c} is nonempty and compact for each c ≥ 0 and S = ∪ _c≥0 S _c . The uniqueness of the problem is discussed. Having a special case of the problem, we introduce an ordering in S showing that the difference of any two solutions in S _c ,c≥ 0, keeps its sign on [0,T]. An application to the equation v″(t) + kv′(t)/t = ψ(t)+g(t, v(t)), k ∈ (1,∞), is given.     

A note on the evaluation of bounded L2-functionals at B-splines and its application to singular integral equations

An algorithm computing recursively the values of ∫g(t)v(t) dt, whereg is anL ₂-function andv is aB-spline, is presented. For the functionsg _s(t)=log∥s?t∥ the starting values of the recursion formula can be computed analytically. The problem is related to the numerical solution of integral equations with a logarithmic singularity.     

Partitioning the planes of AG2m(2) into 2-designs

A t-design S_λ(t, k, v) is an arrangement of v elements in blocks of k elements each such that every t element subset is contained in exactly λ blocks. A t-design S_λ(t, k, v) is called t′-resolvable if the blocks can be partitioned into families such that each family is the block system of a S_λ(t′, k, v). It is shown that the S₁(3, 4, 2^2m) design of planes on an even dimensional affine space over the field of two elements is 2-resolvable. Each S₁(2, 4, 2^2m) given by the resolution is itself 1-resolvable. As a corollary it is shown that every odd dimensional projective space over the field of two elements admits a 1-packing of 1-spreads, i.e. a partition of its lines into families of mutually disjoint lines whose union covers the space. This 1-packing may be generated from any one of its spreads by repeated application of a fixed collineation.     

The finite element method for a degenerate hyperbolic partial differential equation

Cahlon has recently considered finite difference methods for the degenerate Cauchy problem (tu _t)_t=Δu,u(x, 0)=u ₀(x) withu ₀ analytic. In this paper existence of a unique solution is shown for a more general class of initial data. A smoothing property of the solution operator is then exhibited. The usual semidiscrete finite element method is considered. The approximation is shown to be stable and superconvergent with orderO(h ^2μ?2) inl ₂ andl _∞, whereμ?1 is the degree of the polynomials used. OptimalL ² andL ^∞ estimates are also derived.     

Further results on the existence of nested orthogonal arrays

Nested orthogonal arrays provide an option for designing an experimental setup consisting of two experiments, the expensive one of higher accuracy being nested in a larger and relatively less expensive one of lower accuracy. We denote by OA_(λ, μ)(t, k, (v, w)) (or OA(t, k, (v, w)) if λ = μ = 1) a (symmetric) orthogonal array OA _λ (t, k, v) with a nested OA _μ (t, k, w) (as a subarray). It is proved in this article that an OA(t, t + 1,(v, w)) exists if and only if v ≥ 2w for any positive integers v, w and any strength t ≥ 2. Some constructions of OA_(λ, μ)(t, k, (v, w))′s with λ ≠ μ and k ? t > 1 are also presented.     

On three-designs of small order

For positive integers t?k?v and λ we define a t-design, denoted B_i[k,λ;v], to be a pair (X,B) where X is a set of points and B is a family, (B_i:i?I), of subsets of X, called blocks, which satisfy the following conditions: (i) |X|=v, the order of the design, (ii) |B_i|=k for each i?I, and (iii) every t-subset of X is contained in precisely λ blocks. The purpose of this paper is to investigate the existence of 3-designs with 3?k?v?32 and λ>0.Wilson has shown that there exists a constant N(t, k, v) such that designs B_t[k,λ;v] exist provided λ>N(t,k,v) and λ satisfies the trivial necessary conditions. We show that N(3,k,v)=0 for most of the cases under consideration and we give a numerical upper bound on N(3, k, v) for all 3?k?v?32. We give explicit constructions for all the designs needed.     

Dichotomies and moving singularities

We consider a linear differential system ε ^σ Φ (t,ε)Y′ =A(t, ε)Y, with ε a small parameter and Φ(t, ε) a function which may vanish in the domain of definition. Under some conditions imposed on the eigenvalues of the matrixA(t, ε), there exists an invertible matrixH(t, ε) which is continuous on ([0,a] × [0, ε₀]). The transformationY=H(t, ε)Z takes then dimensional linear system into two differential systems of orderk andn?k respectively, withk. Thus the investigaton ofn dimensional systems encountered in singular perturbation as well as in stability theory is considerably simplified.     

Spatial decay theorems for nonlinear parabolic equations in semi-infinite cylinders

Classes of nonlinear parabolic equations in a semi-infinite cylinder are considered. The equations are of the form $$u,_{jj} + g_{ij} \left( {x,u,p,\partial ^2 u} \right)u,_i u,_j = c\left( {x,u,p} \right)\frac{{\partial u}}{{\partial t}},$$ wherep=u, _k u, _k and? ² u represents a general space derivative of second order. Homogeneous Dirichlet data are prescribed on the lateral sides of the cylinder for all time, along with zero initial data. At any fixed timet, the solution is assumed to be bounded throughout the cylinder, as is the corresponding symmetric matrixg _ij . Under these assumptions, it is proved that each solution decays pointwise exponentially to zero with distance from the face of the cylinder and the exponential decay rate depends only upon the cross-section of the cylinder, but not upon time or the bounds foru andg _ij . In addition, if the boundary data on the face of the cylinder satisfy certain mild smoothness conditions, one obtains a decay rate equal to the best possible rate for the Laplace equation.     

A Note on Partial Parallel Classes in Steiner Systems

A partial parallel class of blocks of a Steiner system S(t,k,v) is a collection of pairwise disjoint blocks. The purpose of this note is to show that any S(k,k+1,v) Steiner system, with v?k⁴+3k³+k²+1, has a partial parallel class containing at least (v?k+1)/(k+2) blocks.     

t-designs on hypergraphs

A $\text{t-}\text{design}\text{T=(X,}\text{B}\text{)}$, denoted by (λ; t, k, v), is a system $\text{B}$ of subsets of size k from a v-set X, such that each t-subset of X is contained in exactly λ elements of $\text{B}$. A hypergraph $\text{H=(Y,}\text{E}\text{)}$ is a finite set Y where $\text{E}\text{=(E}{}_{\mathrm{i}}\text{: i?I)}$ is a family of subsets (which we assume here are distinct) of Y such that E_i≠Ø, i?l, and ?E_i=Y. Let G be an automorphism group of $\text{H=(Y,}\text{E}\text{)}$ where O^l_i is the ith orbit of l-subsets of $\text{E}$. Let A(G; H; t, k)= (a_ij) be an m by n matrix, where a_ij is the number of copies of O^t_i that occur in the system of all t-subsets of all elements of O^k_j. Then there is a t-design $\text{T=(X,}\text{B}\text{)}$ with $\text{X=}\text{E}$, with parameters (λ; t, k, v), and with G an automorphism groupof T iff there is an m by s submatrix M of A(G; H; t, k) where M has uniform row sums λ. The calculus for applying this theorem is illustrated and numerous t-designs for 10?v?16 are found and presented. Using a theorem of Alltop on our (12; 4, 6, 13) and (60; 4, 7, 15) we obtain a (12; 5, 7, 14) and a (60; 5, 8, 16).     

The partition dimension of circulant graphs

Let Π = {S₁, S₂, . . . , S_k} be an ordered partition of the vertex set V (G) of a graph G. The partition representation of a vertex v ∈ V (G) with respect to Π is the k-tuple r(v|Π) = (d(v, S₁), d(v, S₂), . . . , d(v, S_k)), where d(v, S) is the distance between v and a set S. If for every pair of distinct vertices u, v ∈ V (G), we have r(u|Π) ≠ r(v|Π), then Π is a resolving partition and the minimum cardinality of a resolving partition of V (G) is called the partition dimension of G. We study the partition dimension of circulant graphs, which are Cayley graphs of cyclic groups. Grigorious et al. [On the partition dimension of circulant graphs] proved that pd(C_n(1, 2, . . . , t)) ≥ t + 1 for n ≥ 3. We disprove this statement by showing that if t ≥ 4 is even, then there exists an infinite set of values of n, such that . We also present exact values of the partition dimension of circulant graphs with 3 generators.     

Convexity in oriented graphs

For vertices u and v in an oriented graph D, the closed interval I[u,v] consists of u and v together with all vertices lying in a u−v geodesic or v−u geodesic in D. For S⊆V(D), I[S] is the union of all closed intervals I[u,v] with u,v∈S. A set S is convex if I[S]=S. The convexity number con(D) is the maximum cardinality of a proper convex set of V(D). The nontrivial connected oriented graphs of order n with convexity number n−1 are characterized. It is shown that there is no connected oriented graph of order at least 4 with convexity number 2 and that every pair k, n of integers with 1⩽k⩽n−1 and k≠2 is realizable as the convexity number and order, respectively, of some connected oriented graph. For a nontrivial connected graph G, the lower orientable convexity number con⁻(G) is the minimum convexity number among all orientations of G and the upper orientable convexity number con⁺(G) is the maximum such convexity number. It is shown that con⁺(G)=n−1 for every graph G of order n⩾2. The lower orientable convexity numbers of some well-known graphs are determined, with special attention given to outerplanar graphs.     

The blow-up rate for a system of heat equations with neumann boundary conditions

This paper deals with the blow-up properties of solutions to a system of heat equations u _t=Δu, v _t=Δv in B _R×(0, T) with the Neumann boundary conditions εu/εη=e ^v, εv/εη=e ^u on S _R×[0, T). The exact blow-up rates are established. It is also proved that the blow-up will occur only on the boundary. This work is supported by the National Natural Science Foundation of China     

Edge-disjoint spanners in tori

A spanning subgraph S=(V,E^′) of a connected graph G=(V,E) is an (x+c)-spanner if for any pair of vertices u and v, d_S(u,v)≤d_G(u,v)+c where d_G and d_S are the usual distance functions in G and S, respectively. The parameter c is called the delay of the spanner. We study edge-disjoint spanners in graphs in multi-dimensional tori. We show that each two-dimensional torus has a set of two edge-disjoint spanners of delay approximately the size of the smaller dimension. Moreover, we show that this delay is close to the best possible. In three-dimensional tori, we find a set of three edge-disjoint spanners with delay approximately the sum of the sizes of the two smaller dimensions when all dimensions are of even size. Surprisingly, we also find a set of two edge-disjoint spanners in three-dimensional tori of constant delay. In d-dimensional tori, we show that for any k≤d/5, there is a set of k edge-disjoint spanners with delay depending only on k and the size of the smaller k dimensions.     

Amalgams of free inverse semigroups

We study inverse semigroup amalgams of the formS * _U T whereS andT are free inverse semigroups andU is an arbitrary finitely generated inverse subsemigroup ofS andT. We make use of recent work of Bennett to show that the word problem is decidable for any such amalgam. This is in contrast to the general situation for semigroup amalgams, where recent work of Birget, Margolis and Meakin shows that the word problem for a semigroup amalgamS * _U T is in general undecidable, even ifS andT have decidable word problem,U is a free semigroup, and the membership problem forU inS andT is decidable. We also obtain a number of results concerning the structure of such amalgams. We obtain conditions for theD-classes of such an amalgam to be finite and we show that the amalgam is combinatorial in such a case. For example every one-relator amalgam of this type has finiteD-classes and is combinatorial. We also obtain information concerning when such an amalgam isE-unitary: for example every one relator amalgam of the formInv<A ∪B :u =v > whereA andB are disjoint andu (resp.v) is a cyclically reduced word overA ∪A ⁻¹ (resp.B ∪B ⁻¹) isE-unitary. Research of all authors supported by a grant from the Italian CNR. The first and third authors’ research was partially supported by MURST. The second author’s research was also partially supported by NSF and the Center for Communication and Information Science of the University of Nebraska at Lincoln.     

Steiner intervals, geodesic intervals, and betweenness

The concept of the k-Steiner interval is a natural generalization of the geodesic (binary) interval. It is defined as a mapping S:V×?×V?2^V such that S(u₁,…,u_k) consists of all vertices in G that lie on some Steiner tree with respect to a multiset W={u₁,…,u_k} of vertices from G. In this paper we obtain, for each k, a characterization of the class of graphs in which every k-Steiner interval S has the so-called union property, which says that S(u₁,…,u_k) coincides with the union of geodesic intervals I(u_i,u_j) between all pairs from W. It turns out that, as soon as k>3, this class coincides with the class of graphs in which the k-Steiner interval enjoys the monotone axiom (m), respectively (b2) axiom, the conditions from betweenness theory. Notably, S satisfies (m), if x₁,…,x_k∈S(u₁,…,u_k) implies S(x₁,…,x_k)⊆S(u₁,…,u_k), and S satisfies (b2) if x∈S(u₁,u₂,…,u_k) implies S(x,u₂,…,u_k)⊆S(u₁,…,u_k). In the case k=3, these three classes are different, and we give structural characterizations of graphs for which their Steiner interval S satisfies the union property as well as the monotone axiom (m). We also prove several partial observations on the class of graphs in which the 3-Steiner interval satisfies (b2), which lead to the conjecture that these are precisely the graphs in which every block is a geodetic graph with diameter at most two.     

Applications of the Fourier—Wiener transform to differential equations on infinite dimensional spaces,II

In this paper, we investigate the existence and regularity of solutions for Cauchy problems associated with the following two equations: (1) u_t(x, t) = (?1)^{k + 1}Δ^ku(x, t), and (2) u_tt(x, t) = (?1)^{k + 1}Δ^ku on infinite dimensional spaces. The nonhomogeneous cases associated with (1) and (2) are also considered.     

Properties of non-simultaneous blow-up in heat equations coupled via different localized sources

This paper deals with u_t = Δu + u^m(x, t)e^pv(0,t), v_t = Δv + u^q(0, t)e^nv(x,t), subject to homogeneous Dirichlet boundary conditions. The complete classification on non-simultaneous and simultaneous blow-up is obtained by four sufficient and necessary conditions. It is interesting that, in some exponent region, large initial data u₀(v₀) leads to the blow-up of u(v), and in some betweenness, simultaneous blow-up occurs. For all of the nonnegative exponents, we find that u(v) blows up only at a single point if m > 1(n > 0), while u(v) blows up everywhere for 0 ? m ? 1 (n = 0). Moreover, blow-up rates are considered for both non-simultaneous and simultaneous blow-up solutions.