All good (bad) words consisting of 5 blocks

Generalized Fibonacci cube Q_d(f), introduced by Ilic, Klavzar and Rho, is the graph obtained from the hypercube Q_d by removing all vertices that contain f as factor. A word f is good if Q_d(f) is an isometric subgraph of Q_d for all d ≥ 1, and bad otherwise. A non-extendable sequence of contiguous equal digits in a word μ is called a block of μ. Ilic, Klavzar and Rho shown that all the words consisting of one block are good, and all the words consisting of three blocks are bad. So a natural problem is to study the words consisting of other odd number of blocks. In the present paper,a necessary condition for a word consisting of odd number of blocks being good is given, and all the good(bad) words consisting of 5 blocks is determined.     

Cyclicity of Degenerate Polycycles Through a Saddle-Node and Two Hyperbolic Saddles

This paper deals with the cyclicity of a kind of degenerate planar polycycles through a saddle-node and two hyperbolic saddles, where the hyperbolicity ratio of the saddle （which connects the saddle-node with hp-connection） is equal to 1 and that of the other saddle is irrational. It is obtained that the cyclicity of this kind of polycycle is no more than 5 if the hp-connection keeps unbroken under the C^∞ perturbations.     

BIFURCATION OF TWO-DIMENSIONAL KURAMOTO-SIVASHINSKY EQUATION

This paper deals with the steady state bifurcation of the K-S equation in two spatial dimensions with periodic boundary value condition and of zero mean. With the increase of parameter a, the steady state bifurcation behaviour can be very complicated. For convenience, only the cases a=2 and a=5 witl be discussed. The asymptotic expressions of the steady state solutions bifurcated from the trivial solution near a=2 and a=5 are given. And the stability of thenontriviat sotutions bifurcated from a=2 is studied. Of course, the cases a=n^2 m^2,n,m∈N(a≠2,5) can be similarly discussed by the same method which is used to discussing the cases a=2 and a= 5.     

A DIRECT METHOD FOR THE UNIT CIRCLE PROBLEM

The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper.     

Invariant G2V algorithm for computing SAGBI-Gröbner bases

Faugère and Rahmany have presented the invariant F5 algorithm to compute SAGBI-Grbner bases of ideals of invariant rings. This algorithm has an incremental structure, and it is based on the matrix version of F5 algorithm to use F5 criterion to remove a part of useless reductions. Although this algorithm is more efficient than the Buchberger-like algorithm, however it does not use all the existing criteria (for an incremental structure) to detect superfluous reductions. In this paper, we consider a new algorithm, namely, invariant G2V algorithm, to compute SAGBI-Grbner bases of ideals of invariant rings using more criteria. This algorithm has a new structure and it is based on the G2V algorithm; a variant of the F5 algorithm to compute Grbner bases. We have implemented our new algorithm in Maple , and we give experimental comparison, via some examples, of performance of this algorithm with the invariant F5 algorithm.     

Representation theory of the system quiver

Let A be a three-point algebra with Gabriel quiver the system quiver Q, Then, up to isomorphism and duality, A is tame if and only if A is or degenerates to a factor of a tame algebra in the tame Table T if and only if A/rad5 A is tame, and A is wild if and only if A has a wild algebra in the wild Table W as a factor if and only if A is controlled wild.     

A VIEWPOINT TO MEASURE OF NON-COMPACTNESS OF OPERATORS IN BANACH SPACES

This article is committed to deal with measure of non-compactness of operators in Banach spaces. Firstly, the collection C(X)(consisting of all nonempty closed bounded convex sets of a Banach space X endowed with the uaual set addition and scaler multiplication) is a normed semigroup, and the mapping J from C(X) onto F(?) is a fully order-preserving positively linear surjective isometry, where ? is the closed unit ball of X*and F(?) the collection of all continuous and w*-lower semicontinuous sublinear functions on X*but restricted to ?. Furthermore, both ■ and ■ are Banach lattices and EK is a lattice ideal of EC. The quotient space EC/EK is an abstract M space, hence,order isometric to a sublattice of C(K) for some compact Haudorspace K, and(FQJ)C which is a closed cone is contained in the positive cone of C(K), where Q : E_C → E_C/E_K is the quotient mapping and F : E_C/E_K → C(K) is a corresponding order isometry. Finally, the representation of the measure of non-compactness of operators is given: Let B_X be the closed unit ball of a Banach space X, then■     

ON ALMOST PRECOVERS AND ALMOST PREENVELOPES

Let C be a class of R-modules closed under isomorphisms and finite direct sums. It is first shown that the finite direct sum of almost C-precovers is an almost C-precover and the direct sum of an almost C-cover and a weak C-cover is a weak C-cover. Then the notion of almost C-preenvelopes is introduced and studied.     

The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures

In a linear multi-secret sharing scheme with non-threshold structures, several secret values are shared among n participants, and every secret value has a specified access structure. The efficiency of a multi- secret sharing scheme is measured by means of the complexity a and the randomness . Informally, the com- plexity a is the ratio between the maximum of information received by each participant and the minimum of information corresponding to every key. The randomness is the ratio between the amount of information distributed to the set of users U = {1, …, n} and the minimum of information corresponding to every key. In this paper, we discuss a and of any linear multi-secret sharing schemes realized by linear codes with non-threshold structures, and provide two algorithms to make a and to be the minimum, respectively. That is, they are optimal.     

Estimating hazard ratios in nested case-control studies by mantel-haenszel method

1. IntroductionConsider a follow-up study which is carried out to investigate the association betweenexposure variables and mortality rate in a cohort. In the case where the cohort is of 1argesise, the complete follow-up ndght be too expensive or difficult, and various nested samplingmethod8 have been suggested by Thomas[l], Prenti..[2] 5 Goldstein and Langholzl'] and otherauthors. Most of the authors employ Coxl4] regression mode1 for estimating the hazard ratio8of exposures.Now a well-reco…     

CONSERVATION OF THREE—POINT COMPACT SCHEMES ON SINGLE AND MULTIBLOCK PATCHED GRIDS FOR HYPERBOLIC PROBLEMS

For nonlinear hyperbloic problems,Conservation of the numerical scheme is important for convergence to the correct weak solutions.In this paper the the conservation of the well-known compact scheme up to fourth order of accuracy on a single and uniform grid is studied,and a conservative interface treatment is derived for compact schemes on patched grids .For a pure initial value problem,the compact scheme is shown to be equivalent to a scheme in the usual conservative form .For the case of a mixed initial boundary value problem,the compact scheme is conservative only if the rounding errors are small enough.For a pactched grid interface,a conservative interface condition useful for mesh fefiement and for parallel computation is derived and its order of local accuracy is analyzed.     

Vector subdivision schemes in (L_p(R~5))~r(1≤p≤∞) spaces

The purpose of this paper is to investigate the refinement equations of the formwhere the vector of functions = (1, … ,r)T is in (LP(R8))T,1 ≤ p ≤∞, α(α),α ∈ Z5, is a finitely supported sequence of r × r matrices called the refinement mask, and M is an s x a integer matrix such that limn→ ∞ M-n = 0. In order to solve the refinement equation mentioned above, we start with a vector of compactly supported functions (0 ∈ (LP(R8))r and use the iteration schemes fn := Qan0,n = 1,2,…, where Qa is the linear operator defined on (Lp(R8))r given byThis iteration scheme is called a subdivision scheme or cascade algorithm. In this paper, we characterize the Lp-convergence of subdivision schemes in terms of the p-norm joint spectral radius of a finite collection of some linear operators determined by the sequence a and the set B restricted to a certain invariant subspace, where the set B is a complete set of representatives of the distinct cosets of the quotient group Z8/MZ8 containing 0.     

滤波长度为5的双正交多尺度分析的构造

In this paper,a general construction of biorthonormal multiresolution analyses with length 5 is studied.Both the existence of unique symmetric biorthonormal MRAs and the inexistence of antisymmetric ones are also proved.The regularity of the scale functions is analyzed and some examples are given at last.     

关于严格蕴涵系统的布尔值模型（续）

The reference [4] proved the consistency of S1 and S2 among Lewis' five strict implication systems in the modal logic by using the method of the Boolean-valued model. But, in this method, the consistency of S3, S4 and S5 in Lewis five strict implication systems is not decided. This paper makes use of the properties: (1) the equivalence of the modal systems S3 and P3, S4 and P4; (2) the modal systems P3 and P4 all contained the modal axiom T(□p→p); (3) the modal axiom T is correspondence to the reflexive property in VB. Hence, the paper proves: (a) ‖As31‖=1; (b) ‖As41‖=1; (c) ‖As51‖=1 in the model (V^B,R,‖ ‖)(where B is a complete Boolean algebra, R is reflexive property in V^B).Therefore, the paper finally proves that the Boolean-valued model V^B of the ZFC axiom system in set theory is also a Boolean-valued model V^B of the ZFC axiom system in set theory is also a Boolean-valued model of Lewis the strict implication system S3, S4 and S5.     

Super cyclically edge-connected vertex-transitive graphs of girth at least 5

A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-connected, in short, super-λc, if the removal of any minimum cyclic edge-cut results in a component which is a shortest cycle. In [Zhang, Z., Wang, B.: Super cyclically edge-connected transitive graphs. J. Combin. Optim., 22, 549-562 (2011)], it is proved that a connected vertex-transitive graph is super-λc if G has minimum degree at least 4 and girth at least 6, and the authors also presented a class of nonsuper-λc graphs which have degree 4 and girth 5. In this paper, a characterization of k (k≥4)-regular vertex-transitive nonsuper-λc graphs of girth 5 is given. Using this, we classify all k (k≥4)-regular nonsuper-λc Cayley graphs of girth 5, and construct the first infinite family of nonsuper-λc vertex-transitive non-Cayley graphs.     

Contraction Integrated Semigroups and Their Application to Continuous-time Markov Chains

We introduce the notion of the contraction integrated semigroups and give the Lumer-Phillips characterization of the generator, and also the charaterazied generators of isometric integrated semigroups. For their application, a necessary and sufficient condition for q-matrices Q generating a contraction integrated semigroup is given, and a necessary and sufficient condition for a transition function to be a Feller-Reuter-Riley transition function is also given in terms of its q-matrix.     

Some results on resolvable incomplete block designs

This paper is concerned with the uniformity of a certain kind of resolvable incomplete block (RIB for simplicity) design which is called the PRIB design here. A sufficient and necessary condition is obtained, under which a PRIB design is the most uniform in the sense of a discrete discrepancy measure, and the uniform PRIB design is shown to be connected. A construction method for such designs via a kind of U-type designs is proposed, and an existence result of these designs is given. This method sets up an important bridge between PRIB designs and U-type designs.     

A New View on Fuzzy Hypermodules

We describe the relationship between the fuzzy sets and the algebraic hyperstructures. In fact, this paper is a continuation of the ideas presented by Davvaz in （Fuzzy Sets Syst., 117： 477- 484, 2001） and Bhakat and Das in （Fuzzy Sets Syst., 80： 359-368, 1996）. The concept of the quasicoincidence of a fuzzy interval value with an interval-valued fuzzy set is introduced and this is a natural generalization of the quasi-coincidence of a fuzzy point in fuzzy sets. By using this new idea, the concept of interval-valued （α,β）-fuzzy sub-hypermodules of a hypermodule is defined. This newly defined interval-valued （α,β）-fuzzy sub-hypermodule is a We shall study such fuzzy sub-hypermodules and sub-hypermodules of a hypermodule. generalization of the usual fuzzy sub-hypermodule. consider the implication-based interval-valued fuzzy     

On a Boolean-valued Model of the Strict Implication System(Continuous)

The reference [4] proved the consistency of S1 and S2 among Lewis' five strict implication systems in the modal logic by using the method of the Boolean-valued model. But, in this method, the consistency of S3, S4 and S5 in Lewis' five strict implication systems is not decided. This paper makes use of the properties: (1) the equivalence of the modal systems S3 and P3, S4 and P4; (2) the modal systems P3 and P4 all contained the modal axiom T(□p → p); (3) the modal axiom T is correspondence to the reflexive property in VB. Hence, the paper proves: (a) ‖As31‖ = 1; (b) ‖AS41‖ = 1; (c) ‖AS5l‖ = 1 in the model (where B is a complete Boolean algebra, R is reflexive property in VB). Therefore, the paper finally proves that the Boolean-valued model VB of the ZFC axiom system in set theory is also a Boolean-valued model of Lewis' the strict implication system S3, S4 and S5.     

ON THE PRODUCT OF GTEAUX DIFFERENTIABILITY LOCALLY CONVEX SPACES

A locally convex space is said to be a Gateaux differentiability space (GDS) provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in .D.This paper shows that the product of a GDS and a family of separable Prechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS.