On directional convexity

Motivated by problems from calculus of variations and partial differential equations, we investigate geometric properties of D-convexity. A function f: R ^d → R is called D-convex, where D is a set of vectors in R ^d, if its restriction to each line parallel to a nonzero v ∈ D is convex. The D-convex hull of a compact set A ⊂ R ^d, denoted by co^D(A), is the intersection of the zero sets of all nonnegative D-convex functions that are zero on A. It also equals the zero set of the D-convex envelope of the distance function of A. We give an example of an n-point set A ⊂ R ² where the D-convex envelope of the distance function is exponentially close to zero at points lying relatively far from co ^D(A), showing that the definition of the D-convex hull can be very nonrobust. For separate convexity in R ³ (where D is the orthonormal basis of R ³), we construct arbitrarily large finite sets A with co ^D(A) ≠ A whose proper subsets are all equal to their D-convex hull. This implies the existence of analogous sets for rank-one convexity and for quasiconvexity on 3 × 3 (or larger) matrices. This research was supported by Charles University Grants No. 158/99 and 159/99.     

Generalization of the perron effect whereby the characteristic exponents of all solutions of two differential systems change their sign from negative to positive

We obtain a generalization of the complete Perron effect whereby the characteristic exponents of all solutions change their sign from negative for the linear approximation system to positive for a nonlinear system with perturbations of higher-order smallness [Differ. Uravn., 2010, vol. 46, no. 10, pp. 1388–1402]. Namely, for arbitrary parameters λ ₁ ≤ λ ₂ < 0 and m > 1 and for arbitrary intervals [b _i , d _i ) ⊂ [λ _i ,+∞), i = 1, 2, with boundaries d ₁ ≤ b ₂, we prove the existence of (i) a two-dimensional linear differential system with bounded coefficient matrix A(t) infinitely differentiable on the half-line t ≥ 1 and with characteristic exponents λ ₁(A) = λ ₁ ≤ λ ₂(A) = λ ₂ < 0; (ii) a perturbation f(t, y) of smallness order m > 1 infinitely differentiable with respect to time t > 1 and continuously differentiable with respect to y ₁ and y ₂, y = (y ₁, y ₂) ∈ R ² such that all nontrivial solutions y(t, c), c ∈ R ², of the nonlinear system .y = A(t)y + f(t, y), y ∈ R ², t ≥ 1, are infinitely extendible to the right and have characteristic exponents λ[y] ∈ [b ₁, d ₁) for c ₂ = 0 and λ[y] ∈ [b ₂, d ₂) for c ₂ ≠ 0.     

On Maps Preserving Zero Jordan Products

Let R be a ring, A = M _n (R) and θ: A → A a surjective additive map preserving zero Jordan products, i.e. if x,y ∈ A are such that xy + yx = 0, then θ(x)θ(y) + θ(y)θ(x) = 0. In this paper, we show that if R contains \frac12\frac{1}{2} and n ≥ 4, then θ = λϕ, where λ = θ(1) is a central element of A and ϕ: A → A is a Jordan homomorphism.     

On the Derivations of Semiprime Rings and Noncommutative Banach Algebras

Abstract Let A be a noncommutative Banach algebra. Suppose there exists a continuous linear Jordan derivation D : A→A such that [D(x), x]D(x)[D(x),x] ∈ rad(A) for all x∈A. In this case, D(A) ⊆ rad (A). The author has been supported by Kangnung National University, Research Fund, 1998     

On Maps Preserving Zero Jordan Products

Let R be a ring, A = M _n (R) and θ: A → A a surjective additive map preserving zero Jordan products, i.e. if x,y ∈ A are such that xy + yx = 0, then θ(x)θ(y) + θ(y)θ(x) = 0. In this paper, we show that if R contains and n ≥ 4, then θ = λϕ, where λ = θ(1) is a central element of A and ϕ: A → A is a Jordan homomorphism. The third author is Corresponding author.     

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

 Let D be a semicomplete multipartite digraph, with partite sets V ₁, V ₂,…, V _c, such that |V ₁|≤|V ₂|≤…≤|V _c|. Define f(D)=|V(D)|−3|V _c|+1 and . We define the irregularity i(D) of D to be max|d ⁺(x)−d ⁻(y)| over all vertices x and y of D (possibly x=y). We define the local irregularity i _l(D) of D to be max|d ⁺(x)−d ⁻(x)| over all vertices x of D and we define the global irregularity of D to be i _g(D)=max{d ⁺(x),d ⁻(x) : x∈V(D)}−min{d ⁺(y),d ⁻(y) : y∈V(D)}. In this paper we show that if i _g(D)≤g(D) or if i _l(D)≤min{f(D), g(D)} then D is Hamiltonian. We furthermore show how this implies a theorem which generalizes two results by Volkmann and solves a stated problem and a conjecture from [6]. Our result also gives support to the conjecture from [6] that all diregular c-partite tournaments (c≥4) are pancyclic, and it is used in [9], which proves this conjecture for all c≥5. Finally we show that our result in some sense is best possible, by giving an infinite class of non-Hamiltonian semicomplete multipartite digraphs, D, with i _g(D)=i(D)=i _l(D)=g(D)+?≤f(D)+1. Revised: September 17, 1998     

Stability of <Emphasis Type="Italic">C</Emphasis>-regularized Semigroups

Let T = (T(t))t≥0 be a bounded C-regularized semigroup generated by A on a Banach space X and R(C) be dense in X. We show that if there is a dense subspace Y of X such that for every x ∈ Y, σu(A, Cx), the set of all points λ ∈ iR to which (λ - A)^-1 Cx can not be extended holomorphically, is at most countable and σr(A) N iR = Ф, then T is stable. A stability result for the case of R(C) being non-dense is also given. Our results generalize the work on the stability of strongly continuous senfigroups.     

Runge-Kutta Methods for the Numerical Solution of Stiff Semilinear Systems

This paper studies the stability and convergence properties of general Runge-Kutta methods when they are applied to stiff semilinear systems y(t) = J(t)y(t) + g(t, y(t)) with the stiffness contained in the variable coefficient linear part.We consider two assumptions on the relative variation of the matrix J(t) and show that for each of them there is a family of implicit Runge-Kutta methods that is suitable for the numerical integration of the corresponding stiff semilinear systems, i.e. the methods of the family are stable, convergent and the stage equations possess a unique solution. The conditions on the coefficients of a method to belong to these families turn out to be essentially weaker than the usual algebraic stability condition which appears in connection with the B-stability and convergence for stiff nonlinear systems. Thus there are important RK methods which are not algebraically stable but, according to our theory, they are suitable for the numerical integration of semilinear problems.This paper also extends previous results of Burrage, Hundsdorfer and Verwer on the optimal convergence of implicit Runge-Kutta methods for stiff semilinear systems with a constant coefficients linear part.     

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

For digraphs D and H, a mapping f : V(D) → V(H) is a homomorphism of D to H if uv ∈ A(D) implies f(u) f(v) ∈ A(H). If, moreover, each vertex u ∈ V(D) is associated with costs c _i (u), i ∈ V(H), then the cost of the homomorphism f is ∑ _{u ∈V(D)} c _f(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem for H (abbreviated MinHOM(H)). The problem is to decide, for an input graph D with costs c _i (u), u ∈ V(D), i ∈ V(H), whether there exists a homomorphism of D to H and, if one exists, to find one of minimum cost. We obtain a dichotomy classification for the time complexity of MinHOM(H) when H is an oriented cycle. We conjecture a dichotomy classification for all digraphs with possible loops.     

Weak-Geodetically Closed Subgraphs in Distance-Regular Graphs

 Let Γ=(X,R) denote a distance-regular graph with diameter D≥2 and distance function δ. A (vertex) subgraph Ω⊆X is said to be weak-geodetically closed whenever for all x,y∈Ω and all z∈X,

On derivations of algebras with involution

Summary Let X be a complex Hilbert space, let L(X) be the algebra of all bounded linear operators on X, and let A(X) ⊂ L(X) be a standard operator algebra, which is closed under the adjoint operation. Suppose there exists a linear mapping D: A(X) → L(X) satisfying the relation D(AA*A) = D(A) A*A + AD(A*)A + AA*D(A), for all A ∈ A(X). In this case D is of the form D(A) = AB-BA, for all A∈ A(X) and some B ∈ L(X), which means that D is a derivation. We apply this result to semisimple H*-algebras.     

On collocation methods for delay differential and Volterra integral equations with proportional delay

To compute long term integrations for the pantograph differential equation with proportional delay qt, 0 < q ⩽ 1: y′(t) = ay(t) + by(qt) + f(t), y(0) = y ₀, we offer two kinds of numerical methods using special mesh distributions, that is, a rational approximant with ‘quasi-uniform meshes’ (see E. Ishiwata and Y. Muroya [Appl. Math. Comput., 2007, 187: 741-747]) and a Gauss collocation method with ‘quasi-constrained meshes’. If we apply these meshes to rational approximant and Gauss collocation method, respectively, then we obtain useful numerical methods of order p ^* = 2m for computing long term integrations. Numerical investigations for these methods are also presented.      

On the restricted arc-connectivity of s-geodetic digraphs

For a strongly connected digraph D the minimum ,cardinality of an arc-cut over all arc-cuts restricted arc-connectivity λ′（D） is defined as the S satisfying that D - S has a non-trivial strong component D1 such that D - V（D1） contains an arc. Let S be a subset of vertices of D. We denote by w＋（S） the set of arcs uv with u ∈ S and v S, and by w-（S） the set of arcs uv with u S and v ∈ S. A digraph D = （V, A） is said to be λ′-optimal if λ′（D） =ξ′（D）, where ξ′（D） is the minimum arc-degree of D defined as ξ（D） = min {ξ′（xy） ： xy ∈ A}, and ξ′（xy） = min（｜ω＋（{x,y}）｜, ｜w-（{x,y}）｜, ｜w＋（x） ∪ w- （y） ｜, ｜w- （x） ∪ω＋ （y）｜}. In this paper a sufficient condition for a s-geodetic strongly connected digraph D to be λ′-optimal is given in terms of its diameter. Furthermore we see that the h-iterated line digraph Lh（D） of a s-geodetic digraph is λ′-optimal for certain iteration h.     

The total reducibility order of a polynomial in two variables

LetK be an algebraically closed field of characteristic zero. ForA ∈K[x, y] let σ(A) = {λ ∈K:A − λ is reducible}. For λ ∈ σ(A) letA − λ = ∏ _i=1 ^n(λ) A _iλ ^k _μ whereA _iλ are distinct primes. Let ϱ_λ(A) =n(λ) − 1 and let ρ(A) = Σ_λɛσ(A)ϱ_λ(A). The main result is the following: Theorem.If A ∈ K[x, y] is not a composite polynomial, then ρ(A) < degA.     

DNA labelled graphs with DNA computing

Let k≥2, 1≤i≤k andα≥1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost uucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be(k, i;α)-labelled if it is possible to assign a label(l_1(x),..., l_k(x))to each point x of D such that l_j(x)∈{0,...,a-1}for any j∈{1,...,k}and(x,y)∈E(D)if and only if(l_k-i 1(x),..., l_k(x))=(l_1(y),..., l_i(y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is(k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is(2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a(2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a(2i, i; 4)-labelled directed graph.     

Everywhere H?lder continuity of the spatial gradient of weak solutions to nonlinear parabolic systems

We consider weak solutions to the parabolic system ∂u ⁱ∂t−D _α A _i ^α (∇u)=B _i(∇u) in (i=1,...,) (Q=Ω×(0,T), R ⁿ a domain), where the functionsB _i may have a quadratic growth. Under the assumptionsn≤2 and ∇u ɛL _loc ^4+δ (Q; R ^nN ) (δ>0) we prove that ∇u is locally H?lder continuous inQ.     

General Study of Iterative Processes of <Emphasis Type="Italic">R</Emphasis>-Order at Least Three under Weak Convergence Conditions

We consider a family of Newton-type iterative processes solving nonlinear equations in Banach spaces, that generalizes the usually iterative methods of R-order at least three. The convergence of this family in Banach spaces is usually studied when the second derivative of the operator involved is Lipschitz continuous and bounded. In this paper, we relax the first condition, assuming that ‖F″(x)−F″(y)‖≤ω(‖x−y‖), where ω is a nondecreasing continuous real function. We prove that the different R-orders of convergence that we can obtain depend on the quasihomogeneity of the function ω. We end the paper by applying the study to some nonlinear integral equations. This work was supported by the Ministry of Science and Technology (BFM 2002-00222), the University of La Rioja (API-04/13) and the Government of La Rioja (ACPI 2003/2004).     

Three classes of smooth Banach submanifolds in B(E,F)

Let E, F be two Banach spaces, and B(E, F), Φ(E, F), SΦ(E, F) and R(E,F) be the bounded linear, Fredholm, semi-Frdholm and finite rank operators from E into F, respectively. In this paper, using the continuity characteristics of generalized inverses of operators under small perturbations, we prove the following result Let ∑ be any one of the following sets {T ∈ Φ(E, F) IndexT =const, and dim N(T) = const.}, {T ∈ SΦ(E, F) either dim N(T) = const. ＜ ∞ or codim R(T) = const.＜ ∞} and {T ∈ R(E, F) RankT =const.＜∞}. Then ∑ is a smooth submanifold of B(E, F) with the tangent space TA∑ = {B ∈ B(E,F) BN(A) (∪) R(A)} for any A ∈ ∑. The result is available for the further application to Thom's famous results on the transversility and the study of the infinite dimensional geometry.     

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.