On the periodic solutions of the second-order wave equations. V

It is established that the linear problemu _u –a ² u _xx =g(x,t),u(0,t) =u(x, t + T) =u(x,t) is always solvable in the function spaceA = {g:g(x,t) =g(x,t+T) =g( –x,t) = –g(–x,t)} provided thataTq = (2p – 1) and (2p – 1,q) = 1, wherepandq are integer numbers. To prove this statement, an exact solution is constructed in the form of an integral operator, which is used to prove the existence of a solution of a periodic boundary-value problem for a nonlinear second-order wave equation. The results obtained can be used when studying the solutions to nonlinear boundary-value problems by asymptotic methods.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 8, pp. 1115–1121, August, 1993.     

An inverse polynomial method for the identification of the leading coefficient in the Sturm–Liouville operator from boundary measurements

An inverse polynomial method of determining the unknown leading coefficient k=k(x) of the linear Sturm–Liouville operator Au=−(k(x)u^′(x))^′+q(x)u(x), x(0,1), is presented. As an additional condition only two measured data at the boundary (x=0,x=1) are used. In absence of a singular point (u^′(x)≠0,u^″(x)≠0,x[0,1]) the inverse problem is classified as a well-conditioned . If there exists at least one singular point, then the inverse problem is classified as moderately ill-conditioned (u^′(x₀)=0,x₀(0,1);u^′(x)≠0,x≠x₀;u^″(x)≠0,x[0,1]) and severely ill-conditioned (u^′(x₀)=u^″(x₀)=0,x₀(0,1);u^′(x)≠0,u^″(x)≠0,x≠x₀). For each of the cases direct problem solution is approximated by corresponding polynomials and the inverse problem is reformulated as a Cauchy problem for to the first order differential equation with respect the unknown function k=k(x). An approximate analytical solution of the each Cauchy problems are derived in explicit form. Numerical simulations all the above cases are given for noise free and noisy data. An accuracy of the presented approach is demonstrated on numerical test solutions.     

Heat flow method for Lichnerowicz type equations on closed manifolds

In this paper, we establish existence results for positive solutions to the Lichnerowicz equations of the following type in closed manifolds

Distance-transitive graphs admit semiregular automorphisms

A distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v) and (u^′,v^′) such that the distance between u and v is equal to the distance between u^′ and v^′ there exists an automorphism of the graph mapping u to u^′ and v to v^′. A semiregular element of a permutation group is a non-identity element having all cycles of equal length in its cycle decomposition. It is shown that every distance-transitive graph admits a semiregular automorphism.     

Almost automorphic solutions of nonautonomous evolution equations

In this paper, we establish some new theorems about the existence of almost automorphic solutions to nonautonomous evolution equations u^′(t)=A(t)u(t)+f(t) and u^′(t)=A(t)u(t)+f(t,u(t)) in Banach spaces. As we will see, our results allow for a more general A(t) to some extent. An example is also given to illustrate our results. In addition, by means of an example, we show that one cannot ensure the existence of almost automorphic solutions to u^′(t)=A(t)u(t)+f(t) even if the evolution family U(t,s) generated by A(t) is exponentially stable and fAA(X).     

Hamilton cycles in digraphs of unitary matrices

A set S⊆V is called a q⁺-set (q^--set, respectively) if S has at least two vertices and, for every u∈S, there exists v∈S,v≠u such that N⁺(u)∩N⁺(v)≠∅ (N^-(u)∩N^-(v)≠∅, respectively). A digraph D is called s-quadrangular if, for every q⁺-set S, we have |∪{N⁺(u)∩N⁺(v):u≠v,u,v∈S}|?|S| and, for every q^--set S, we have |∪{N^-(u)∩N^-(v):u,v∈S)}?|S|. We conjecture that every strong s-quadrangular digraph has a Hamilton cycle and provide some support for this conjecture.     

The partition of a strong tournament

A digraph T is strong if for every pair of vertices u and v there exists a directed path from u to v and a directed path from v to u. Denote the in-degree and out-degree of a vertex v of T by d^-(v) and d⁺(v), respectively. We define δ^-(T)=min_vV(T){d^-(v)} and δ⁺(T)=min_vV(T){d⁺(v)}. Let T₀ be a 7-tournament which contains no transitive 4-subtournament. In this paper, we obtain some conditions on a strong tournament which cannot be partitioned into two cycles. We show that a strong tournament T with n6 vertices such that TT₀ and max{δ⁺(T),δ^-(T)}3 can be partitioned into two cycles. Finally, we give a sufficient condition for a tournament to be partitioned into k cycles.     

Fractional integrals, potential operators and two-weight, weak type norm inequalities on spaces of homogeneous type

We prove two-weight, weak type norm inequalities for potential operators and fractional integrals defined on spaces of homogeneous type. We show that the operators in question are bounded from L^p(v) to L^q,∞(u), 1<p?q<∞, provided the pair of weights (u,v) verifies a Muckenhoupt condition with a “power-bump” on the weight u.     

On the Lp–Lq maximal regularity for Stokes equations with Robin boundary condition in a bounded domain

We obtain the L_p–L_q maximal regularity of the Stokes equations with Robin boundary condition in a bounded domain in ?ⁿ (n?2). The Robin condition consists of two conditions: v ? u=0 and αu+β(T(u, p)v – 〈T(u, p)v, v〉v)=h on the boundary of the domain with α, β?0 and α+β=1, where u and p denote a velocity vector and a pressure, T(u, p) the stress tensor for the Stokes flow and v the unit outer normal to the boundary of the domain. It presents the slip condition when β=1 and non‐slip one when α=1, respectively. The slip condition is appropriate for problems that involve free boundaries. Copyright © 2006 John Wiley & Sons, Ltd.     

A characterization of spherical distributions

It is shown that when the random vector X in Rⁿ has a mean and when the conditional expectation E(u′X|v′X) = 0 for all vectors u, v Rⁿ which satisfy u′v = 0, then the distribution of X is orthogonally invariant. A version of this characterization is also established when X does not have a mean vector.     

Capture in linear functional differential games of pursuit

The problem of capture in a pursuit game which is described by a linear retarded functional differential equation is considered. The initial function belongs to the Sobolev space W₂⁽¹⁾. The target is either a subset of W₂⁽¹⁾ a point in W₂⁽¹⁾, a subset of the Euclidean space Eⁿ or a point of Eⁿ. There is capture if the initial function can be forced to the target by the pursuer no matter what the quarry does. The concept of capture therefore formalizes the concepts of controllability under unpredictable disturbances. This is proved to be equivalent to the controllability of an associated linear retarded functional differential equation. There is nothing in (2) (6) or (7) below which restricts the control sets to be of the same dimension as the phase space. Our results can be applied in (2) for example, if the constraint sets Q′, P′ are subsets of E^m and Eⁱ respectively with q(t) = C(t) q′(t), − p(t) = B(t) p′(t), q′(t) ε E^mp′(t) ε E^r and B(t) is an n × r′-matrices and C(t) an n × m-matrix.     

C-Cosine Functions and the Abstract Cauchy Problem, II

For a bounded linear injectionCon a Banach spaceXand a closed linear operatorA : D(A) X → Xwhich commutes withCwe prove that (1) the abstract Cauchy problem,u″(t) = Au(t),t R,u(0) = Cx,u′(0) = Cy, has a unique strong solution for everyx,y D(A) if and only if (2)A₁ = AD(A²) generates aC₁-cosine function onX₁(D(A) with the graph norm), if (and only if, in caseAhas nonempty resolvent set) (3)Agenerates aC-cosine function onX. HereC₁ = CX₁. Under the assumption thatAis densely defined andC⁻¹AC = A, statement (3) is also equivalent to each of the following statements: (4) the problemv″(t) = Av(t) + C(x + ty) + ∫^t₀ Cg(r) dr,t R,v(0) = v′(0) = 0, has a unique strong solution for everyg L¹_locandx, y X; (5) the problemw″(t) = Aw(t) + Cg(t),t R,w(0) = Cx,w′(0) = Cy, has a unique weak solution for everyg L¹_locandx, y X. Finally, as an application, it is shown that for any bounded operatorBwhich commutes withCand has range contained in the range ofC,A + Bis also a generator.     

Enumeration of matrices of given rank with submatrices of given rank

The authors determine the number of (n+m)×t matrices A¹ of rank r+v, over a finite field GF(q), whose last m rows are those of a given matrix A of rank r+v over GF(q) and whose first n rows have a given rank u.     

Weighted Inequalities for the Generalized Maximal Operator in Martingale Spaces

The generalized maximal operator M in martingale spaces is considered. For 1 < p ≤ q < ∞, the authors give a necessary and sufficient condition on the pair ([^(m)]\hat \mu , v) for M to be a bounded operator from martingale space L ^p (v) into L ^q ([^(m)]\hat \mu ) or weak-L ^q ([^(m)]\hat \mu ), where [^(m)]\hat \mu is a measure on Ω × ℕ and v a weight on Ω. Moreover, the similar inequalities for usual maximal operator are discussed.     

Gradient estimates for the elliptic and parabolic Lichnerowicz equations on compact manifolds

Let (M, g) be a smooth compact Riemannian manifold of dimension n ≥ 3. Denote D_g=-div_g?{\Delta_g=-{\rm div}_g\nabla} the Laplace–Beltrami operator. We establish some local gradient estimates for the positive solutions of the Lichnerowicz equation

On the evaluation of the Eigenvalues of a banded toeplitz block matrix

Let A = (a_ij) be an n × n Toeplitz matrix with bandwidth k + 1, K = r + s, that is, a_ij = a_j−i, i, J = 1,… ,n, a_i = 0 if i > s and if i < -r. We compute p(λ)= det(A - λI), as well as p(λ)/p′(λ), where p′(λ) is the first derivative of p(λ), by using O(k log k log n) arithmetic operations. Moreover, if a_i are m × m matrices, so that A is a banded Toeplitz block matrix, then we compute p(λ), as well as p(λ)/p′(λ), by using O(m³k(log² k + log n) + m²k log k log n) arithmetic operations. The algorithms can be extended to the computation of det(A − λB) and of its first derivative, where both A and B are banded Toeplitz matrices. The algorithms may be used as a basis for iterative solution of the eigenvalue problem for the matrix A and of the generalized eigenvalue problem for A and B.     

Weighted Hardy and Opial-type inequalities

An integral condition on weights u and v is given which is equivalent to the boundedness of the Hardy operator between the weighted Lebesgue spaces L_u^p and L_v^q with 0 < q < 1 < p < ∞. The Hardy inequalities are applied to give easily verified weight conditions which imply inequalities of Opial type.     

L∞-upper bound of L2-projections onto splines at a geometric mesh

For an integer k 1 and a geometric mesh (qⁱ)_−∞^∞ with q ε (0, ∞), let M_i,k(x): = k[q^{i + k}](· − x)₊^{k − 1}, N_i,k(x): = (q^{i + k} − qⁱM_i,k(x)/k, and let A_k(q) be the Gram matrix (∝M_i,kN_j,k)_i,jεz. It is known that A_k(q)⁻¹_∞ is bounded independently of q. In this paper it is shown that A_k(q)⁻¹_∞ is strictly decreasing for q in [1, ∞). In particular, the sharp upper bound and lower bound for A_k (q)⁻¹ are obtained: for all q ε (0, ∞).     

Lower bounds for the cardinality of minimal blocking sets in projective spaces

In this paper new lower bounds for the cardinality of minimal m-blocking sets are determined. Let r₂(q) be the number such that q+r₂(q)+1 is the cardinality of the smallest non-trivial line-blocking set in a plane of order q. If B is a minimal m-blocking set in PG(n,q) that contains at most q^m+q^m−1+…+q+1+r₂(q)·(∑_i=2m−n′^m−1qⁱ) points for an integer n′ satisfying mn′2m, then the dimension of B is at most n′. If the dimension of B is n′, then the following holds. The cardinality of B equals q^m+q^m−1+…+q+1+r₂(q)(∑_i=2m−n′^m−1qⁱ). For n′=m the set B is an m-dimensional subspace and for n′=m+1 the set B is a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. This result is due to Heim (Mitt. Math. Semin. Giessen 226 (1996), 4–82). For n′>m+1 and q not a prime the number q is a square and for q16 the set B is a Baer cone. If q is odd and |B|<q^m+q^m−1+…+q+1+r₂(q)(q^m−1+q^m−2), it follows from this result that the subspace generated by B has dimension at most m+1. Furthermore we prove that in this case, if , then B is an m-dimensional subspace or a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. For q=p^3h, p7 and q not a square we show this assertion for |B|q^m+q^m−1+…+q+1+q^2/3·(q^m−1+…+1).     

On the rank spread of graphs

For a simple graph G?=?(𝒱, ?) with vertex-set 𝒱?=?{1,?…?,?n}, let 𝒮(G) be the set of all real symmetric n-by-n matrices whose graph is G. We present terminology linking established as well as new results related to the minimum rank problem, with spectral properties in graph theory. The minimum rank mr(G) of G is the smallest possible rank over all matrices in 𝒮(G). The rank spread r _v (G) of G at a vertex v, defined as mr(G)???mr(G???v), can take values ??∈?{0,?1,?2}. In general, distinct vertices in a graph may assume any of the three values. For ??=?0 or 1, there exist graphs with uniform r _v (G) (equal to the same integer at each vertex v). We show that only for ??=?0, will a single matrix A in 𝒮(G) determine when a graph has uniform rank spread. Moreover, a graph G, with vertices of rank spread zero or one only, is a λ-core graph for a λ-optimal matrix A in 𝒮(G). We also develop sufficient conditions for a vertex of rank spread zero or two and a necessary condition for a vertex of rank spread two.