Generalized functional equation and its applications in information theory

The functional equationf(x,y)+g(x)h(y)F(u/1?x,ν/1?y)=f(u,ν)+g(u)h(ν)F(x/1?u,y/1?ν) ... (1) forx, y, u, ν ∈ [0, 1) andx+u,y+ν ∈ [0,1) whereg andh satisfy the functional equationφ (x+y?xy)=φ(x)φ(y)... (2) has been solved for some non-constant solution of (2) in [0, 1] withφ (0)=1,φ(1)=0 and the solution is used in characterising some measures of information.     

On oscillation of solutions of higher order forced functional differential inequalities

Oscillation criteria for the class of forced functional differential inequalities x(t){L_nx(t) + f(t, x(t), x[g₁(t)],…, x[g_m(t)]) ? h(t)} ? 0, for n even, and x(t){L_nx(t) ? f(t, x(t), x[g₁(t)],…, x[g_m(t)]) ? h(t)} ? 0, for n odd, are established.     

Graph maps whose periodic points form a closed set

A continuous map f from a graph G to itself is called a graph map. Denote by P(f), R(f), ω(f), Ω(f) and CR(f) the sets of periodic points, recurrent points, ω-limit points, non-wandering points and chain recurrent points of f respectively. It is well known that P(f)⊂R(f)⊂ω(f)⊂Ω(f)⊂CR(f). Block and Franke (1983) [5] proved that if f:I→I is an interval map and P(f) is a closed set, then CR(f)=P(f). In this paper we show that if f:G→G is a graph map and P(f) is a closed set, then ω(f)=R(f). We also give an example to show that, for general graph maps f with P(f) being a closed set, the conclusion ω(f)=R(f) cannot be strengthened to Ω(f)=R(f) or ω(f)=P(f).     

Vertex pancyclicity and new sufficient conditions

For a graph G, ??(G) denotes the minimum degree of G. In 1971, Bondy proved that, if G is a 2-connected graph of order n and d(x)?+?d(y)????n for each pair of non-adjacent vertices x,y in G, then G is pancyclic or G?=?K _n/2,n/2. In 2001, Xu proved that, if G is a 2-connected graph of order n????6 and |N(x)????N(y)|?+???(G)????n for each pair of non-adjacent vertices x,y in G, then G is pancyclic or G?=?K _n/2,n/2. In this paper, we introduce a new sufficient condition of generalizing degree sum and neighborhood union and prove that, if G is a 2-connected graph of order n????6 and |N(x)????N(y)|?+?d(w)????n for any three vertices x,y,w of d(x,y)?=?2 and wx or $wy\not\in E(G)$ in G, then G is 4-vertex pancyclic or G belongs to two classes of well-structured exceptional graphs. This result also generalizes the above results.     

Bipartite regulation numbers

The bipartite regulation number br(G) of a bipartite graph G with maximum degree d is the minimum number of vertices required to add to G to construct a d-regular bipartite supergraph of G. It is shown that if G is a connected m-by-n bipartite graph with m ⩽ n and n − m ⩾ d − 1, then br(G) = n − m. If. however, n − m ⩽ d − 2, the br(G) = n ⇔ m + 2l for some l satisfying 0 ⩽ l ⩽ d − (n − m). Conversely, if l, k and d (>2) are integers such that 0 ⩽ l ⩽ k and 2 ⩽ k ⩽ d, then there is an connected m-by-n bipartite graph G of maximum degree d for which br(G) = n − m + 2l, for some m and n with k = d − (n −m).     

A type of bounded traveling wave solutions for the Fornberg-Whitham equation

In this paper, by using bifurcation method, we successfully find the Fornberg-Whitham equation

ut−uxxt+ux=uuxxx−uux+3uxuxx,     

On (s,t)-supereulerian graphs in locally highly connected graphs

Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y|≤t, there is a spanning eulerian subgraph H of G that contains X and avoids Y. We prove that if G is connected and locally k-edge-connected, then G is (s,t)-supereulerian, for any pair of nonnegative integers s and t with s+t≤k−1. We further show that if s+t≤k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y≤t, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if G−Y is not contractible to K₂ or to K_2,l with l odd.     

Cross-intersecting families of permutations

For positive integers r and n with r?n, let Pr,n be the family of all sets {(1,y₁),(2,y₂),…,(r,yr)} such that y₁,y₂,…,yr are distinct elements of [n]={1,2,…,n}. Pn,n describes permutations of [n]. For r<n, Pr,n describes permutations of r-element subsets of [n]. Families A₁,A₂,…,Ak of sets are said to be cross-intersecting if, for any distinct i and j in [k], any set in Ai intersects any set in Aj. For any r, n and k?2, we determine the cases in which the sum of sizes of cross-intersecting sub-families A₁,A₂,…,Ak of Pr,n is a maximum, hence solving a recent conjecture (suggested by the author).     

Some new spaces of double sequences

In this study, we define the double sequence spaces BS, BS(t), CSp, CSbp, CSr and BV, and also examine some properties of those sequence spaces. Furthermore, we show that these sequence spaces are complete paranormed or normed spaces under some certain conditions. We determine the α-duals of the spaces BS, BV, CSbp and the β(?)-duals of the spaces CSbp and CSr of double series. Finally, we give the conditions which characterize the class of four-dimensional matrix mappings defined on the spaces CSbp, CSr and CSp of double series.     

Norm equalities of analytic mappings into Hilbert spaces

LetD be a subset of a complex linear spaceL such that for everyu∈D,v∈L the setΩ(u, v) = {ζ∣u+ζv∈D} is an open connected set in the complex plane. Denote byA (D, X) the linear space of allG-analytic mappings fromD to a complex Hilbert spaceX.Theorem: LetZ be a complex linear space and letA, B be linear operators fromZ toA (D, X), A (D, Y), respectively, whereX, Y are complex Hilbert spaces. If ∥(A p)u∥ _X =∥(B p)u∥ _Y (p∈Z,u∈D) then a maximal partial isometryW:X→Y exists such that(Bp)u=W((Ap)u) (p∈Z, u∈D).     

Intersection problems and integral equivalence

Let A and B be matrices over a principal ideal domain, Π. Necessary conditions, involving the invariant factors of A and B, are given for B to be a submatrix of A or a principal submatrix of A.If a given nonnegative integral matrix, B, is the intersection matrix of a pair of families of subsets of an n-set, and n is the smallest integer for which this is true, we say that the content of B is n. In that event, B is a submatrix of K(n), the intersection matrix of all subsets of an n-set. More refined results are obtained in certain cases by considering S(n, k, l), the intersection matrix of the k-subsets of an n-set versus its l-subsets. The invariant factors of K(n) and S(n, k, l) are calculated and it is shown how this information may be used to get lower bounds for the content of B. In the more widely studied symmetric version of the content problem, B must be a principal submatrix of K(n) or, possibly, S(n, k) = S(n, k, k). In this case, the invariant factors of K(n) ? xI or S(n, k) ? xI also provide relevant information.     

Weak solution of (r, (x, u(x)) u′(x))′ = (Fu)′(x) with r(0, u(0))u′(0) = ku(0), r(L, u(L))u′ (L) = hu(L) and k, h are suitable elements of [0, ∞]

We consider weak solutions to the nonlinear boundary value problem (r, (x, u(x)) u′(x))′ = (Fu)′(x) with r(0, u(0)) u′(0) = ku(0), r(L, u(L)) u′(L) = hu(L) and k, h are suitable elements of [0, ∞]. In addition to studying some new boundary conditions, we also relax the constraints on r(x, u) and (Fu)(x). r(x, u) > 0 may have a countable set of jump discontinuities in u and r(x, u)^?1?L_q((0, L) × (0, p)). F is an operator from a suitable set of functions to a subset of L_p(0, L) which have nonnegative values. F includes, among others, examples of the form (Fu)(x) = (1 ? H(x ? x₀)) u(x₀), (Fu)(x) = ∫_x^Lf(y, u(y)) dy where f(y, u) may have a countable set of jump discontinuities in u or F may be chosen so that (Fu)′(x) = ? g(x, u(x)) u′(x) ? q(x) u(x) ? f(x, u(x)) where q is a distributional derivative of an L₂(0, L) function.     

One step semi-explicit methods based on the Cayley transform for solving isospectral flows

This note deals with the numerical solution of the matrix differential system Y′ = [B(t,Y), Y], Y(0) = Y₀, t ⩾ 0, where Y₀ is a real constant symmetric matrix, B maps symmetric into skew-symmetric matrices, and [B(t,Y),Y] is the Lie bracket commutator of B(t,Y) and Y, i.e. [B(t,Y),Y] = B(t,Y)Y − YB(t,Y). The unique solution of (1) is isospectral, that is the matrix Y(t) preserves the eigenvalues of Y₀ and is symmetric for all t (see [1, 5]). Isospectral methods exploit the Flaschka formulation of (1) in which Y(t) is written as Y(t) = U(t)Y₀U^T(t), for t ⩾ 0, where U(t) is the orthogonal solution of the differential system U′ = B(t, UY₀U^T)U, U(0) = I, t ⩾ 0, (see [5]). Here a numerical procedure based on the Cayley transform is proposed and compared with known isospectral methods.     

Large minimal sets which force long arithmetic progressions

A classic theorem of van der Waerden asserts that for any positive integer k, there is an integer W(k) with the property that if W⩾W(k) and the set {1, 2,…, W} is partitioned into r classes C₁, C₂,…, C_r, then some C_i will always contain a k-term arithmetic progression. Let us abbreviate this assertion by saying that {1, 2,…, W}arrows AP(k) (written {1, 2,…, W} → AP(k)). Further, we say that a set Xcritically arrows AP(k) if:(i) X arrows AP(k); (ii) for any proper subset X′ ⊂ X, X′ does not arrow AP(k). The main result of this note shows that for any given k there exist arbitrarily large sets X which critically arrow AP(k).     

Geodesic-pancyclic graphs

A shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v in a graph G, denoted by d_G(u,v), is the number of edges in a u-v geodesic. A graph G with n vertices is panconnected if, for each pair of vertices u,v∈V(G) and for each integer k with d_G(u,v)?k?n-1, there is a path of length k in G that connects u and v. A graph G with n vertices is geodesic-pancyclic if, for each pair of vertices u,v∈V(G), every u-v geodesic lies on every cycle of length k satisfying max{2d_G(u,v),3}?k?n. In this paper, we study sufficient conditions of geodesic-pancyclic graphs. In particular, we show that most of the known sufficient conditions of panconnected graphs can be applied to geodesic-pancyclic graphs.     

MAPS PRESERVING STRONG SKEW LIE PRODUCT ON FACTOR VON NEUMANN ALGEBRAS

Let A be a factor von Neumann algebra and Φ be a nonlinear surjective map from A onto itself.We prove that,if Φ satisfies that Φ(A)Φ(B) - Φ(B)Φ(A)* =AB - BA* for all A,B ∈ A,then there exist a linear b...     

On the regularity and stability of Pritchard-Salamon systems

Let Σ(S(⋅),B,−) be a Pritchard-Salamon system for (W,V), where W and V are Hilbert spaces. Suppose U is a Hilbert space and F∈L(W,U) is an admissible output operator, SBF(⋅) is the corresponding admissible perturbation C₀-semigroup. We show that the C₀-semigroup SBF(⋅) persists norm continuity, compactness and analyticity of C₀-semigroup S(⋅) on W and V, respectively. We also characterize the compactness and norm continuity of ΔBF(t)=SBF(t)−S(t) for t>0. In particular, we unexpectedly find that ΔBF(t) is norm continuous for t>0 on W and V if the embedding from W into V is compact. Moreover, from this we give some relations between the spectral bounds and growth bounds of SBF(⋅) and S(⋅), so we obtain some new stability results.     

Hereditarily polaroid operators, SVEP and Weyl's theorem

A Banach space operator T∈B(X) is hereditarily polaroid, T∈HP, if every part of T is polaroid. HP operators have SVEP. It is proved that if T∈B(X) has SVEP and R∈B(X) is a Riesz operator which commutes with T, then T+R satisfies generalized a-Browder's theorem. If, in particular, R is a quasi-nilpotent operator Q, then both T+Q and T^∗+Q^∗ satisfy generalized a-Browder's theorem; furthermore, if Q is injective, then also T+Q satisfies Weyl's theorem. If A∈B(X) is an algebraic operator which commutes with the polynomially HP operator T, then T+N is polaroid and has SVEP, f(T+N) satisfies generalized Weyl's theorem for every function f which is analytic on a neighbourhood of σ(T+N), and f^∗(T+N) satisfies generalized a-Weyl's theorem for every function f which is analytic on, and constant on no component of, a neighbourhood of σ(T+N).     

Nilpotency of unstable K-theory

In the preceding papers [H. Hamanaka, A. Kono, On [X,U(n)], when dimX is 2n, J. Math. Kyoto Univ. 43 (2) (2003) 333-348; H. Hamanaka, On [X,U(n)], when dimX is 2n+1, J. Math. Kyoto Univ. 44 (3) (2004) 655-667; H. Hamanaka, Adams e-invariant, Toda bracket and [X,U(n)], J. Math. Kyoto Univ. 43 (4) (2003) 815-828], the group structure of the homotopy set [X,U(n)] with the pointwise multiplication is studied, where X is a finite CW-complex and U(n) is the unitary group. It is seen that nil[X,U(n)]=2 for some X with its dimension 2n, and, when dimX=2n+1 and n is even, [X,U(n)] is expressed as the two stage central extension of an Abelian group, i.e., nil[X,U(n)]?3.In this paper, we consider the nilpotency class of [X,U(n)], especially, for given k, the maximum of the nil[X,U(n)] under the condition dimX?2n+k is estimated and determined for k=0,1,2.     

An asymptotic formula for the t-core partition function and a conjecture of Stanton

For a positive integer t, a partition is said to be a t-core if each of the hook numbers from its Ferrers-Young diagram is not a multiple of t. In 1996, Granville and Ono proved the t-core partition conjecture, that at(n), the number of t-core partitions of n, is positive for every nonnegative integer n as long as t?4. As part of their proof, they showed that if p?5 is prime, the generating function for ap(n) is essentially a multiple of an explicit Eisenstein Series together with a cusp form. This representation of the generating function leads to an asymptotic formula for ap(n) involving L-functions and divisor functions. In 1999, Stanton conjectured that for t?4 and n?t+1, at(n)?at+1(n). Here we prove a weaker form of this conjecture, that for t?4 and n sufficiently large, at(n)?at+1(n). Along the way, we obtain an asymptotic formula for at(n) which, in the cases where t is coprime to 6, is a generalization of the formula which follows from the work of Granville and Ono when t=p?5 is prime.