On the kernel space for an L0‐linear function

A random normed module is a random generalization of an ordinary normed space, and it is the randomization that makes a random normed module possess rich stratification structures. On the basis of these stratification structures, this paper shows that either the kernel space N(f) for an L⁰‐linear function f from a random normed module S to the algebra is a closed submodule or N(f) on some specifical stratification is a dense proper submodule of S, which generalizes the classical case. In the meantime, a characterization for the kernel space N(f) to be closed is also given.     

Pseudo asymptotically periodic mild solutions of semilinear functional integro‐differential equations in Banach spaces

In this paper, we introduce and investigate the functions of (μ,ν)‐pseudo S‐asymptotically ω‐periodic of class r(class infinity). We systematically explore the properties of these functions in Banach space including composition theorems. As applications, we establish some sufficient criteria for (μ,ν)‐pseudo S‐asymptotic ω‐periodicity of (nonautonomous) semilinear integro‐differential equations with finite or infinite delay. Finally, some interesting examples are presented to illustrate the main findings.     

Fixed points of (α,ψ)‐contractions in Hausdorff partial metric spaces

The concept of (α,ψ)‐contractions was introduced by Samet et al. in this paper, we introduce (α,ψ)‐generalized contractions in a Hausdorff partial metric space. We discuss its significance and obtain some common fixed point theorems for a pair of self‐mappings. Some examples are given to support the theory.     

On large‐girth regular graphs and random processes on trees

We study various classes of random processes defined on the regular tree T_d that are invariant under the automorphism group of T_d. The most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov chains and a new class that we call typical processes. Using Glauber dynamics on processes we give a sufficient condition for a branching Markov chain to be factor of i.i.d.     

Continuous mappings on subspaces of products with the κ-box topology

Much of General Topology addresses this issue: Given a function fC(Y,Z) with YY^′ and ZZ^′, find , or at least , such that ; sometimes Z=Z^′ is demanded. In this spirit the authors prove several quite general theorems in the context Y^′=(X_I)_κ=∏_iIX_i in the κ-box topology (that is, with basic open sets of the form ∏_iIU_i with U_i open in X_i and with U_i≠X_i for <κ-many iI). A representative sample result, extending to the κ-box topology some results of Comfort and Negrepontis, of Noble and Ulmer, and of Hušek, is this. Theorem Let ωκα (that means: κ<α, and [β<α and λ<κ]β^λ<α) with α regular, be a set of non-empty spaces with each d(X_i)<α, π[Y]=X_J for each non-empty JI such that |J|<α, and the diagonal in Z be the intersection of <α-many regular-closed subsets of Z×Z. Then (a) Y is pseudo-(α,α)-compact, (b) for every fC(Y,Z) there is J[I]^<α such that f(x)=f(y) whenever x_J=y_J, and (c) every such f extends to .     

6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable

Alspach conjectured that any 2k-regular connected Cayley graph on a finite abelian group A has a hamiltonian decomposition. In this paper, the conjecture is shown true if k=3, and the order of A is odd.     

Minimum monopoly in regular and tree graphs

In this paper we consider a graph optimization problem called minimum monopoly problem, in which it is required to find a minimum cardinality set S⊆V, such that, for each u∈V, |N[u]∩S|?|N[u]|/2 in a given graph G=(V,E). We show that this optimization problem does not have a polynomial-time approximation scheme for k-regular graphs (k?5), unless P=NP. We show this by establishing two L-reductions (an approximation preserving reduction) from minimum dominating set problem for k-regular graphs to minimum monopoly problem for 2k-regular graphs and to minimum monopoly problem for (2k-1)-regular graphs, where k?3. We also show that, for tree graphs, a minimum monopoly set can be computed in linear time.     

Linear extensions of partial orders and reverse mathematics

We introduce the notion of τ‐like partial order, where τ is one of the linear order types ω, ω*, ω + ω*, and ζ. For example, being ω‐like means that every element has finitely many predecessors, while being ζ‐like means that every interval is finite. We consider statements of the form “any τ‐like partial order has a τ‐like linear extension” and “any τ‐like partial order is embeddable into τ” (when τ is ζ this result appears to be new). Working in the framework of reverse mathematics, we show that these statements are equivalent either to $\mathsf {B}{\Sigma }^{0}_{2}$ or to $\mathsf {ACA}_0$ over the usual base system $\mathsf {RCA}_0$.     

Best simultaneous approximations, asymptotically nonexpansive mappings and variational inequalities in Banach spaces

The existence of common fixed points is established for three mappings where T is either generalized (f,g)-nonexpansive or asymptotically (f,g)-nonexpansive on a nonempty subset of a Banach space. As applications, the invariant best simultaneous approximation results are proved and the existence of solution of variational inequalities is obtained. Our results unify and substantially improve several recent results existing in the current literature.     

A note on path kernels and partitions

The detour order of a graph G, denoted by τ(G), is the order of a longest path in G. A subset S of V(G) is called a P_n-kernel of G if τ(G[S])≤n−1 and every vertex v∈V(G)−S is adjacent to an end-vertex of a path of order n−1 in G[S]. A partition of the vertex set of G into two sets, A and B, such that τ(G[A])≤a and τ(G[B])≤b is called an (a,b)-partition of G. In this paper we show that any graph with girth g has a P_n+1-kernel for every . Furthermore, if τ(G)=a+b, 1≤a≤b, and G has girth greater than , then G has an (a,b)-partition.     

Cutsets and anti-chains in linear lattices

Consider the poset, ordered by inclusion, of subspaces of a four-dimensional vector space over a field with 2 elements. We prove that, for this poset, any cutset (i.e., a collection of elements that intersects every maximal chain) contains a maximal anti-chain of the poset. In analogy with the same result by Duffus, Sands, and Winkler [D. Duffus, B. Sands, P. Winkler, Maximal chains and anti-chains in Boolean lattices, SIAM J. Discrete Math. 3 (2) (1990) 197-205] for the subset lattice, we conjecture that the above statement holds in any dimension and for any finite base field, and we prove some special cases to support the conjecture.     

Parametric duality on minimax programming involving generalized convexity in complex space

In this paper we employ generalized convexity of complex functions to establish several sufficient optimality conditions for minimax programming in complex spaces. Using such criteria, we constitute a parametrical dual, and establish the weak, strong, and strict converse duality theorems in the framework.     

Multicyclicity of unbounded normal operators and polynomial approximation in C

A remarkable and much cited result of Bram [J. Bram, Subnormal operators, Duke Math. J. 22 (1955) 75-94] shows that a star-cyclic bounded normal operator in a separable Hilbert space has a cyclic vector. If, in addition, the operator is multiplication by the variable in a space L²(m) (not only unitarily equivalent to it), then it has a cyclic vector in L^∞(m). We extend Bram's result to the case of a general unbounded normal operator, implying by this that the (classical) multiplicity and the multicyclicity of the operator (cf. [N.K. Nikolski, Operators, Functions and Systems: An Easy Reading, vol. 2, Math. Surveys Monogr., vol. 93, Amer. Math. Soc., Providence, 2002]) coincide. It follows that if m is a sigma-finite Borel measure on C (possibly with noncompact support), then there is a nonnegative finite Borel measure τ equivalent to m and such that L²(C,τ) is the norm-closure of the polynomials in z.     

Riesz means associated with certain product type convex domain

In this paper we study the maximal operators and the convolution operators Tδ associated with multipliers of the form

     

Euler-Mahonian statistics on ordered set partitions (II)

[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introduced several hard statistics on ordered set partitions and conjectured that their generating functions are related to the q-Stirling numbers of the second kind. In a previous paper, half of these conjectures have been proved by Ishikawa, Kasraoui and Zeng using the transfer-matrix method. In this paper, we shall give bijective proofs of all the conjectures of Steingrímsson. Our basic idea is to encode ordered set partitions by a kind of path diagrams and explore the rich combinatorial properties of the latter structure. As a bonus of our approach, we derive two new σ-partition interpretations of the p,q-Stirling numbers of the second kind introduced by Wachs and White. We also discuss the connections with MacMahon's theorem on the equidistribution of the inversion number and major index on words and give a partition version of his result.     

Tensor products of Sobolev–Besov spaces and applications to approximation from the hyperbolic cross

Besov as well as Sobolev spaces of dominating mixed smoothness are shown to be tensor products of Besov and Sobolev spaces defined on R. Using this we derive several useful characterizations from the one-dimensional case to the d-dimensional situation. Finally, consequences for hyperbolic cross approximations, in particular for tensor product splines, are discussed.     

Invariant theory for singular α-determinants

From the irreducible decompositions' point of view, the structure of the cyclic GLn(C)-module generated by the α-determinant degenerates when (1?k?n−1) (see [S. Matsumoto, M. Wakayama, Alpha-determinant cyclic modules of gln(C), J. Lie Theory 16 (2006) 393-405]). In this paper, we show that -determinant shares similar properties which the ordinary determinant possesses. From this fact, one can define a new (relative) invariant called a wreath determinant. Using (GLm,GLn)-duality in the sense of Howe, we obtain an expression of a wreath determinant by a certain linear combination of the corresponding ordinary minor determinants labeled by suitable rectangular shape tableaux. Also we study a wreath determinant analogue of the Vandermonde determinant, and then, investigate symmetric functions such as Schur functions in the framework of wreath determinants. Moreover, we examine coefficients which we call (n,k)-sign appeared at the linear expression of the wreath determinant in relation with a zonal spherical function of a Young subgroup of the symmetric group Snk.