Smoothness of solutions of nonlinear ODE

Smoothness of a -function f is measured by (Carleman) sequence we say if with As an extension of our results in [2] we prove the following type statements: Let u be -function on [0,1] such that where is an entire function of order 1, finite type, on z and of a nonanalytic Carleman class on t. Then u is in the same Carleman class. Received: 16 January 2001 / Revised version: 10 August 2001 / Published online: 6 August 2002     

On the structure of the solution set of a third kind boundary value problem

We show that given any closed subset C of a real Banach space E, there is a continuous function f(t, x) which is Lipschitz continuous in its second variable such that the solution set of the corresponding third kind boundary value problem is homeomorphic to C (Theorem 1.1). In the special problem we give the infimum of Lipschitz constants L_f of such functions f(t, x) (Theorem 1.3).     

The structure and distances in Yule recursive trees

Based on uniform recursive trees, we introduce random trees with the factor of time, which are named Yule recursive trees. The structure and the distance between the vertices in Yule recursive trees are investigated in this paper. For arbitrary time t > 0, we first give the probability that a Yule recursive tree Y_t is isomorphic to a given rooted tree γ; and then prove that the asymptotic distribution of ζ_t,m, the number of the branches of size m, is the Poisson distribution with parameter λ = 1/m. Finally, two types of distance between vertices in Yule recursive trees are studied, and some limit theorems for them are established.© 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Markov Integrated Semigroups and their Applications to Continuous-Time Markov Chains

A Markov integrated semigroup G(t) is by definition a weaklystar differentiable and increasing contraction integrated semigroup on l _∞. We obtain a generation theorem for such semigroups and find that they are not integrated C ₀-semigroups unless the generators are bounded. To link up with the continuous-time Markov chains (CTMCs), we show that there exists a one-to-one relationship between Markov integrated semigroups and transition functions. This gives a clear probability explanation of G(t): it is just the mean transition time, and allows us to define and to investigate its q-matrix. For a given q-matrix Q, we give a criterion for the minimal Q-function to be a Feller-Reuter-Riley (FRR) transition function, this criterion gives an answer to a long-time question raised by Reuter and Riley (1972). This research was supported by the China Postdoctoral Science Foundation (No.2005038326).     

The period function of a delay differential equation and an application

We consider the delay differential equation [(x)\dot](t) = - mx(t) + f(x(t - t))\dot x(t) = - \mu x(t) + f(x(t - \tau )), where μ, τ are positive parameters and f is a strictly monotone, nonlinear C ¹-function satisfying f(0) = 0 and some convexity properties. It is well known that for prescribed oscillation frequencies (characterized by the values of a discrete Lyapunov functional) there exists τ* > 0 such that for every τ > τ* there is a unique periodic solution. The period function is the minimal period of the unique periodic solution as a function of τ > τ*. First we show that it is a monotone nondecreasing Lipschitz continuous function of τ with Lipschitz constant 2. As an application of our theorem we give a new proof of some recent results of Yi, Chen and Wu [14] about uniqueness and existence of periodic solutions of a system of delay differential equations.     

A recursive construction of t‐wise uniform permutations

We present a recursive construction of a (2t + 1)‐wise uniform set of permutations on 2n objects using a combinatorial design, a t‐wise uniform set of permutations on n objects and a (2t + 1)‐wise uniform set of permutations on n objects. Using the complete design in this procedure gives a t‐wise uniform set of permutations on n objects whose size is at most t²ⁿ, the first non‐trivial construction of an infinite family of t‐wise uniform sets for . If a non‐trivial design with suitable parameters is found, it will imply a corresponding improvement in the construction. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 531–540, 2015     

A generalization of a result of Tran Van Trung on t-designs

We prove that if there exists a t − (v, k, λ) design satisfying the inequality for some positive integer j (where m = min{j, v − k} and n = min {i, t}), then there exists a t − (v + j, k, λ ()) design. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 107–112, 1999     

Direct sums of balanced functions,perfect nonlinear functions,and orthogonal cocycles

Determining if a direct sum of functions inherits nonlinearity properties from its direct summands is a subtle problem. Here, we correct a statement by Nyberg on inheritance of balance and we use a connection between balanced derivatives and orthogonal cocycles to generalize Nyberg's result to orthogonal cocycles. We obtain a new search criterion for PN functions and orthogonal cocycles mapping to non‐cyclic abelian groups and use it to find all the orthogonal cocycles over Z ₂^t, 2 ≤ t ≤ 4. We conjecture that any orthogonal cocycle over Z ₂^t, t ≥ 2, must be multiplicative. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 173–181, 2008     

Two problems on independent sets in graphs

Let i_t(G) denote the number of independent sets of size t in a graph G. Levit and Mandrescu have conjectured that for all bipartite G the sequence (i_t(G))_t≥0 (the independent set sequence of G) is unimodal. We provide evidence for this conjecture by showing that this is true for almost all equibipartite graphs. Specifically, we consider the random equibipartite graph G(n,n,p), and show that for any fixed p∈(0,1] its independent set sequence is almost surely unimodal, and moreover almost surely log-concave except perhaps for a vanishingly small initial segment of the sequence. We obtain similar results for .We also consider the problem of estimating i(G)=∑_t≥0i_t(G) for G in various families. We give a sharp upper bound on the number of independent sets in an n-vertex graph with minimum degree δ, for all fixed δ and sufficiently large n. Specifically, we show that the maximum is achieved uniquely by K_δ,n−δ, the complete bipartite graph with δ vertices in one partition class and n−δ in the other.We also present a weighted generalization: for all fixed x>0 and δ>0, as long as n=n(x,δ) is large enough, if G is a graph on n vertices with minimum degree δ then ∑_t≥0i_t(G)x^t≤∑_t≥0i_t(K_δ,n−δ)x^t with equality if and only if G=K_δ,n−δ.     

On Hong’s conjecture for power LCM matrices

A set S={x ₁,...,x _n } of n distinct positive integers is said to be gcd-closed if (x _i , x _j ) ∈ S for all 1 ⩽ i, j ⩽ n. Shaofang Hong conjectured in 2002 that for a given positive integer t there is a positive integer k(t) depending only on t, such that if n ⩽ k(t), then the power LCM matrix ([x _i , x _j ] ^t ) defined on any gcd-closed set S={x ₁,...,x _n } is nonsingular, but for n ⩾ k(t) + 1, there exists a gcd-closed set S={x ₁,...,x _n } such that the power LCM matrix ([x _i , x _j ] ^t ) on S is singular. In 1996, Hong proved k(1) = 7 and noted k(t) ⩾ 7 for all t ⩾ 2. This paper develops Hong’s method and provides a new idea to calculate the determinant of the LCM matrix on a gcd-closed set and proves that k(t) ⩾ 8 for all t ⩾ 2. We further prove that k(t) ⩾ 9 iff a special Diophantine equation, which we call the LCM equation, has no t-th power solution and conjecture that k(t) = 8 for all t ⩾ 2, namely, the LCM equation has t-th power solution for all t ⩾ 2.     

A Study of Downward Sets with p-Functions

In this paper, we study downward sets and increasing functions in a topological vector space and their similarities to the convex sets and convex functions. It will be shown that a very special increasing function, namely, the p-function, can give a geometric interpretation for separating downward sets from outside points. Also, this function can be used to approximate topical functions in the framework of abstract convexity.     

Almost semirecursive sets

LetA be a subset of , and leta∉A. The setA is said to be almost semirecursive, if there is a two-place general recursive functionf such thatf(x, y)ε{x, y, a}∧({x, y}⊆A⇌f(x, y)εA) for all . Among other facts, it is proved that ifA and are almost semirecursive sets, thenA is a semirecursive set, and that there exists a wsr^*-set that is neither a wsr-nor an almost semirecursive set. Translated fromMatematicheskie Zametki, Vol. 66, No. 2, pp. 188–193, August, 1999.     

Further properties of the Sumudu transform and its applications

This note discusses the general properties of the Sumudu transform and the Sumudu transform of special functions. For any function f (t) with corresponding Sumudu transform F (u), the effect of shifting the parameter t in f (t) by τ on the Sumudu transform F (u) is found. Also obtained are the effect of the multiplication of any function f (t) by a power of t and the division of the function f (t) by t on the Sumudu transform F (u). For any periodic function f (t) with periodicity T > 0 the Sumudu transform is easily derived. Illustrations are provided with Abel's integral equation, an integro-differential equation, a dynamic system with delayed time signals and a differential dynamic system.     

Example of a function of two variables that cannot be an <Emphasis Type="Italic">R</Emphasis>-function

We note that the definition of R-functions depends on the choice of a certain surjection and pose the problem of the construction of a function of two variables that is not an R-function for any choice of a surjective mapping. It is shown that the function x ₁ x ₂ − 1 possesses this property. We prove a theorem according to which, in the case of finite sets, every mapping is an R-mapping for a proper choice of a surjection.     

Component structure of the vacant set induced by a random walk on a random graph

We consider random walks on several classes of graphs and explore the likely structure of the vacant set, i.e. the set of unvisited vertices. Let Γ(t) be the subgraph induced by the vacant set of the walk at step t. We show that for random graphs G_n,p (above the connectivity threshold) and for random regular graphs G_r,r ≥ 3, the graph Γ(t) undergoes a phase transition in the sense of the well‐known ErdJW‐RSAT1100590x.png ‐Renyi phase transition. Thus for t ≤ (1 ‐ ε)t^*, there is a unique giant component, plus components of size O(log n), and for t ≥ (1 + ε)t^* all components are of size O(log n). For G_n,p and G_r we give the value of t^*, and the size of Γ(t). For G_r, we also give the degree sequence of Γ(t), the size of the giant component (if any) of Γ(t) and the number of tree components of Γ(t) of a given size k = O(log n). We also show that for random digraphs D_n,p above the strong connectivity threshold, there is a similar directed phase transition. Thus for t ≤ (1 ‐ ε)t^*, there is a unique strongly connected giant component, plus strongly connected components of size O(log n), and for t ≥ (1 + ε)t^* all strongly connected components are of size O(log n). © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

Solutions of functional equations having bounded variation

Summary. We prove that a solution f of the functional equation¶¶f(t)=h(t,y,f(g₁(t,y)),...,f(g_n(t,y))) f(t)=h(t,y,f(g_1(t,y)),\dots,f(g_n(t,y))) ¶ having locally bounded variation is a C^￥ {\cal C}^\infty -function.     

On Fractional Part Sums: A Mean-Square Asymptotics over Short Intervals

 This article is concerned with sums 𝒮(t) = ∑ _n  ψ(tf(n/t)) where ψ denotes, essentially, the fractional part minus ?, f is a C ⁴-function with f″ ≠ 0 throughout, summation being extended over an interval of order t. We establish an asymptotic formula for ∫ _T−Λ ^T+Λ (𝒮(t))²dt for any Λ = Λ(T) growing faster than log T. Received April 30, 2001; in revised form February 15, 2002 RID="a" ID="a" Dedicated to Professor Edmund Hlawka on the occasion of his 85th birthday     

Multifunctions of faces for conditional expectations of selectors and Jensen's inequality

Let (T, , P) be a probability space, a P-complete sub-δ-algebra of and X a Banach space. Let multifunction t → Γ(t), t T, have a (X)-measurable graph and closed convex subsets of X for values. If x(t) ε Γ(t) P-a.e. and y(·) ε E_p x(·), then y(t) ε Γ(t) P-a.e. Conversely, x(t) ε F(Γ(t), y(t)) P-a.e., where F(Γ(t), y(t)) is the face of point y(t) in Γ(t). If X = , then the same holds true if Γ(t) is Borel and convex, only. These results imply, in particular, extensions of Jensen's inequality for conditional expectations of random convex functions and provide a complete characterization of the cases when the equality holds in the extended Jensen inequality.     

Operator-valued Chandrasekhar H-functions

Operator valued analogs of the Chandrasekhar H-function, that occur in the study of neutron transport in a slab with continuous energy dependence and anisotropic scattering, satisfy a system of nonlinear integral equations. An appropriate Banach space setting is found for the study of this system. We show that the system may be solved by iteration. We extend the domain of analyticity of H_r and H_t by means of bifurcation theory.     

Weyl fractional calculus and Laplace transform

The Weyl fractional calculus is developed to obtain Laplace transforms oft ^q ?(t) (for all real values ofq) where ?(t) is taken in the form off(a√(t ²?b ²)) and certain other forms. Also, a generating function involvingH-function of several variables is established with the help of generalized Taylor series.