Orthogonal Stability of Mixed Additive-Quadratic Jensen Type Functional Equation in Multi-Banach Spaces

In this paper, we prove the Hyers-Ulam stability of the following mixed additive-quadratic Jensen type functional equation:

A family of generalized strongly regular graphs of grade 2

A generalized strongly regular graphof grade p,as anew generalization of strongly regular graphs,is a regular graph such that the number of common neighbours of both any two adjacent vertices and any two non-adjacent vertices takes on p distinct values.For any vertex u of a generalized strongly regular graph of grade 2 with parameters(n,k;a_(1),a_(2);c_(1),c_(2)),if the number of the vertices that are adjacent to u and share ai(i=1,2)common neighbours with u,or are non-adjacent to u and share c,(i=1,2)common neighbours with is independent of the choice of the vertex u,then the generalized strongly regular graph of grade 2 is free.In this paper,we investigate the generalized strongly regular graph of grade 2 with parameters(n,k;k-1,a_(2);k-1,c_(2))and provide the sufficient and necessary conditions for the existence of a family of free generalized strongly regular graphs of grade 2.

A survey of the study of combinatorial batch code

A combinatorial batch code has strong practical motivation in the distributed storage and retrieval of data in a database.In this survey,we give a brief introduction to the combinatorial batch codes and some progress.

Diference Systems of Sets Based on Cosets Partitions

Difference systems of sets （DSS） are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of the cosets of Zv relative to subgroup of order k, where v = km is a composite number. As applications, we obtain some new optimal DSSs.

On Robustness of Orbit Spaces for Partially Hyperbolic Endomorphisms

In this paper, the robustness of the orbit structure is investigated for a partially hyperbolic endomorphism f on a compact manifold M. It is first proved that the dynamical structure of its orbit space(the inverse limit space) M^f of f is topologically quasi-stable under C^0-small perturbations in the following sense: For any covering endomorphism g C^0-close to f, there is a continuous map φ from M^g to Multiply form -∞ to ∞ M such that for any {y_i }_(i∈Z) ∈φ(M^g), y_(i+1) and f(y_i) differ only by a motion along the center direction. It is then proved that f has quasi-shadowing property in the following sense: For any pseudo-orbit {x_i }_(i∈Z),there is a sequence of points {y_i }_(i∈Z) tracing it, in which y_(i+1) is obtained from f(y_i) by a motion along the center direction.

On an Entropy of Zk＋-Actions

In this paper,a definition of entropy for Z＋k（k≥2）-actions due to Friedland is studied.Unlike the traditional definition,it may take a nonzero value for actions whose generators have finite（even zero） entropy as single transformations.Some basic properties are investigated and its value for the Z＋k-actions on circles generated by expanding endomorphisms is given.Moreover,an upper bound of this entropy for the Z＋k-actions on tori generated by expanding endomorphisms is obtained via the preimage entropies,which are entropy-like invariants depending on the ＂inverse orbits＂ structure of the system.

An Approximation Algorithm for P-prize-collecting Set Cover Problem

In this paper,we consider the P-prize-collecting set cover(P-PCSC)problem,which is a generalization of the set cover problem.In this problem,we are given a set system(U,S),where U is a ground set and S⊆2U is a collection of subsets satisfying∪S∈SS=U.Every subset in S has a nonnegative cost,and every element in U has a nonnegative penalty cost and a nonnegative profit.Our goal is to find a subcollection C⊆S such that the total cost,consisting of the cost of subsets in C and the penalty cost of the elements not covered by C,is minimized and at the same time the combined profit of the elements covered by C is at least P,a specified profit bound.Our main work is to obtain a 2f+ε-approximation algorithm for the P-PCSC problem by using the primal-dual and Lagrangian relaxation methods,where f is the maximum frequency of an element in the given set system(U,S)andεis a fixed positive number.

Generalized Rectangular Convexity

In this paper we investigate the tr-convexity and the rectangular biconvexity in Euclidean spaces.