单纯正交表OA$_\lambda(3, 5, v)$的存在性

An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.     

Optimum Super-simple Mixed Covering Arrays of Type a~1b~(k-1)

A mixed covering array(MCA) of type(v_1, v_2,..., v_k), denoted by MCA_λ(N; t, k,(v_1, v_2,..., v_k)), is an N × k array with entries in the i-th column from a set V_i of v_i symbols and has the property that each N × t sub-array covers all the t-tuples at least λ times, where 1 ≤ i ≤ k. An MCA_λ(N; t, k,(v_1, v_2,..., v_k)) is said to be super-simple, if each of its N ×(t + 1) sub-arrays contains each(t + 1)-tuple at most once. Recently, it was proved by Tang, Yin and the author that an optimum super-simple MCA of type(a, b, b,..., b) is equivalent to a mixed detecting array(DTA)of type(a, b, b,..., b) with optimum size. Such DTAs can be used to generate test suites to identify and determine the interaction faults between the factors in a component-based system. In this paper,some combinatorial constructions of optimum super-simple MCAs of type(a, b, b,..., b) are prov_ided.By employing these constructions, some optimum super-simple MCAs are then obtained. In particular, the spectrum across which optimum super-simple MCA_2(2b~2; 2, 4,(a, b, b, b))' s exist, is completely determined, where 2 ≤ a ≤ b.     

The spectrum for overlarge sets of hybrid triple systems

A hybrid triple system of order v and index λ,denoted by HTS(v,λ),is a pair(X,B) where X is a v-set and B is a collection of cyclic triples and transitive triples on X,such that every ordered pair of X belongs to λ triples of B. An overlarge set of disjoint HTS(v,λ),denoted by OLHTS(v,λ),is a collection {(Y \{y},Ai)}i,such that Y is a(v+1)-set,each(Y \{y},Ai) is an HTS(v,λ) and all Ais form a partition of all cyclic triples and transitive triples on Y.In this paper,we shall discuss the existence problem of OLHTS(v,λ) and give the following conclusion: there exists an OLHTS(v,λ) if and only if λ=1,2,4,v ≡ 0,1(mod 3) and v≥4.     

$\alpha$-可分解4-圈系统

An m-cycle system of order v and index λ, denoted by m-CS（v,λ）, is a collection of cycles of length m whose edges partition the edges of λKv. An m-CS（v,λ） is α-resolvable if its cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a design are m｜λv（v-1）/2,2｜λ（v -1）,m｜αv,α｜λ（v-1）/2. It is shown in this paper that these conditions are also sufficient when m = 4.     

The spectrum for overlarge sets of directed triple systems

A directed triple system of order v,denoted by DTS(v,λ),is a pair(X,B)where X is a v- set and B is a collection of transitive triples on X such that every ordered pair of X belongs toλtriples of B.An overlarge set of disjoint DTS(v,λ),denoted by OLDTS(v,λ),is a collection{(Y\{y},A_i)}_i, such that Y is a(v 1)-set,each(Y\{y},A_i)is a DTS(v,λ)and all A_i's form a partition of all transitive triples of Y.In this paper,we shall discuss the existence problem of OLDTS(v,λ)and give the following conclusion:there exists an OLDTS(v,λ)if and only if eitherλ=1 and v≡0,1(mod 3),orλ=3 and v≠2.     

Some Class 1 Graphs on g_c-colorings

An edge-coloring of a graph G is an assignment of colors to all the edges of G.A g_c-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v)times.The maximum integer k such that G has a g_c-coloring with k colors is called the g_c-chromatic index of G and denoted by χ'g_c(G).In this paper,we extend a result on edge-covering coloring of Zhang and Liu in 2011,and give a new sufficient condition for a simple graph G to satisfy χ'g_c(G)=δ_g(G),where δ_g(G)=min_(v∈V(G) {└d(v)/g(v)┘ }).     

2-(v,k,1)设计和PSL(3,q)(q是奇数)

§ 1　 IntroductionA2 -(v,k,1 ) design D=(S,B) consists ofa finite set Sof v points and a collection Bof some subsets of S,called blocks,such that any two points lie on exactly one blockand each block contains exactly k points.A flag of Dis a pair(α,B) such thatα∈S,B∈Bandα∈B,the set of all flags is denoted by F.We assume that2≤k≤v.An automorphism of Dis a permutation of the points which leaves the set Binvari-ant,all the automorphisms form a group Aut D.Let G be a subgroup of A…     

ON 3-CHOOSABILITY OF PLANE GRAPHS WITHOUT 6-,7- AND 9-CYCLES

The choice number of a graph G,denoted by X1(G),is the minimum number k such that if a list of k colors is given to each vertex of G,there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. In this paper,it is showed that X1 (G)≤3 for each plane graph of girth not less than 4 which contains no 6-, 7- and 9-cycles.     

中心对称本原矩阵的k点指数集

Let G = (V, E) be a primitive digraph. The vertex exponent of G at a vertex v ∈ V, denoted by expG(v), is the least integer p such that there is a v → u walk of length p for each u ∈ V. We choose to order the vertices of G in the k-point exponent of G and is denoted by expG(k), 1 ≤ k ≤ n. We define the k-point exponent set E(n, k) := {expG(k)| G = G(A) with A ∈ CSP(n)}, where CSP(n) is the set of all n × n central symmetric primitive matrices and G(A) is the associated graph of the matrix A. In this paper, we describe E(n,k) for all n, k with 1 ≤ k ≤ n except n ≡ 1(mod 2) and 1 ≤ k ≤ n - 4. We also characterize the extremal graphs when k = 1.     

Neighbor Sum Distinguishing Total Coloring of Triangle Free IC-planar Graphs

A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex.A proper total-k-coloring of G is called neighbor sum distinguishing if∑_c(u)≠∑_c(v)for each edge uv∈E(G),where∑_c(v)denote the sum of the color of a vertex v and the colors of edges incident with v.The least number k needed for such a total coloring of G,denoted byχ∑"is the neighbor sum distinguishing total chromatic number.Pilsniak and Wozniak conjecturedχ∑"(G)≤Δ(G)+3 for any simple graph with maximum degreeΔ(G).By using the famous Combinatorial Nullstellensatz,we prove that above conjecture holds for any triangle free IC-planar graph with△(G)≥7.Moreover,it holds for any triangle free planar graph withΔ(G)≥6.     

完全可分的三元系TS(v,4)的支撑集

§ 1　 IntroductionA triple system of order v and indexλ,denoted by TS(v,λ) ,is a collection of3- ele-mentsubsets Aof a v- set X,so thatevery 2 - subsetof X appears in preciselyλ subsets of A.L etλ≥ 2 and (X,A) be a TS(v,λ) .If Acan be partitioned into t(≥ 2 ) parts A1,A2 ,...,Atsuch that each (X,Ai) is a TS(v,λi) for 1≤ i≤ t,then (X,A) is called de-composable.Otherwise it is indecomposable.If t=λ,λi=1for 1≤ i≤ t,the TS(v,λ) (X,A) is called completely decomposable.It …     

ON A CLASS OF BESICOVITCHFUNCTIONS TO HAVE EXACT BOX DIMENSION： A NECESSARY AND SUFFICIENT CONDITION

This paper summarized recent achievements obtained by the authors about the box dimensions of the Besicovitch functions given byB(t) := ∞∑k=1 λs-2k sin(λkt),where 1 ＜ s ＜ 2, λk ＞ 0 tends to infinity as k →∞ and λk satisfies λk 1/λk ≥λ＞ 1. The results show thatlimk→∞ log λk 1/log λk = 1is a necessary and sufficient condition for Graph(B(t)) to have same upper and lower box dimensions.For the fractional Riemann-Liouville differential operator Du and the fractional integral operator D-v,the results show that if λ is sufficiently large, then a necessary and sufficient condition for box dimension of Graph(D-v(B)),0 ＜ v ＜ s - 1, to be s - v and box dimension of Graph(Du(B)),0 ＜ u ＜ 2 - s, to be s uis also lim k→∞logλk 1/log λk = 1.     

On maximal injective subalgebras in a wΓ factor

Let L(FQ) ×α Z be the crossed product von Neumann algebra of the free group factor L(FQ), associated with the left regular representation λ of the free group FQ with the set {ur : r ∈ Q} of generators, by an automorphism α defined by α(λ(ur)) = exp(2πri)λ(ur), where Q is the rational number set. We show that L(FQ) ×α Z is a wΓ factor, and for each r ∈ Q, the von Neumann subalgebra Ar generated in L(FQ) ×α Z by λ(ur) and v is maximal injective, where v is the unitary implementing the automorphism α. In parti...     

树的L(3,2,1)-标号问题

An L(3,2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all non-negative integers(labels) such that |f(u)-f(v)|≥3 if d(u,v)=1,|f(u)-f(v)≥2 if d(u,v)=2 and |f(u)-f(v)|≥1 if d(u,v)=3.For a non-negative integer k,a k-L(3,2,1)-labeling is an L(3,2,1)-labeling such that no label is greater than k.The L(3,2,1)-labeling number of G,denoted by λ_(3,2,1)(G), is the smallest number k such that G has a k-L(3,2,1)-labeling.In this article,we characterize the L(3,2,1)-labeling numbers of trees with diameter at most 6.     

Indecomposable large sets of Steiner triple systems with indices 5, 6

A family ( X, B1 ), (X, B2 ), . . . , (X, Bq ) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTS λ (v) if every 3-subset of X is contained in exactly λ STS(v)s of the collection. It is indecomposable and denoted by IDLSTS λ (v) if there does not exist an LSTS λ'(v) contained in the collection for any λ' λ. In this paper, we show that for λ = 5, 6, there is an IDLSTS λ (v) for v ≡ 1 or 3 (mod 6) with the exception IDLSTS6 (7).     

λ-fold indecomposable large sets of Steiner triple systems

A family (X, B1), (X, B2), . . . , (X, Bq) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTSλ(v) if every 3-subset of X is contained in exactly λ STS(v)s of the collection. It is indecomposable and denoted by IDLSTSλ(v) if there exists no LSTSλ (v) contained in the collection for any λ λ. In 1995, Griggs and Rosa posed a problem: For which values of λ 1 and orders v ≡ 1, 3 (mod 6) do there exist IDLSTSλ(v)? In this paper, we use partitionable candelabra systems (PCSs) and holey λ-fold large set of STS(v) (HLSTSλ(v)) as auxiliary designs to establish a recursive construction for IDLSTSλ(v) and show that there exists an IDLSTSλ(v) for λ = 2, 3, 4 and v ≡ 1, 3 (mod 6).     

On Indecomposable Triple Systems Without Repeated Blocks

A λ-fold triple system TS(ν,λ)is an ordered pair(V,B)where V is a setof v elements and B is a collection of 3-subsets(called blocks or triples)of Vsuch that each 2-subset of V is contained in exactly λ triples.A triple system iscalled simple if it contains no repeated triples.     

完全图的Cantesian积的L(2,1)-圆标定

For positive integers j and k with j ≥ k, an L（j, k）-labeling of a graph G is an assignment of nonnegative integers to V（G） such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L（j, k）-labeling of a graph G is the difference between the maximum and minimum integers it uses. The λj, k-number of G is the minimum span taken over all L（j, k）-labelings of G. An m-（j, k）-circular labeling of a graph G is a function f ： V（G） →{0, 1, 2,..., m - 1} such that ｜f（u） - f（v）｜m ≥ j if u and v are adjacent; and ｜f（u） - f（v）｜m 〉 k ifu and v are at distance two, where ｜x｜m = min{｜xl｜, m-｜x｜}. The minimum integer m such that there exists an m-（j, k）-circular labeling of G is called the σj,k-number of G and is denoted by σj,k（G）. This paper determines the σ2,1-number of the Cartesian product of any three complete graphs.     

Large sets of pure directed triple systems with index λ

A directed triple system of order v with index λ, briefly by DTS（v,λ）, is a pair （X, B） where X is a v-set and B is a collection of transitive triples （blocks） on X such that every ordered pair of X belongs to λ blocks of B. A simple DTS（v, λ） is a DTS（v, λ） without repeated blocks. A simple DTS（v, ）,） is called pure and denoted by PDTS（v, λ） if （x, y, z） ∈ B implies （z, y, x）, （z, x, y）, （y, x, z）, （y, z, x）, （x, z, y） B. A large set of disjoint PDTS（v, λ）, denoted by LPDTS（v, λ）, is a collection of 3（v - 2）/λ disjoint pure directed triple systems on X. In this paper, some results about the existence for LPDTS（v, λ） are presented. Especially, we determine the spectrum of LPDTS（v, 2）.     

The k-point Exponent Set of Primitive Digraphs with Girth 2

Let D =(V,E)be a primitive digraph.The vertex exponent of D at a vertex v∈V,denoted by exPD(V),is the least integer p such that there is a v→u walk of length p for each u∈V.Following Brualdi and Liu,we order the vertices of D so that exPD(v_1)≤exPD(v_2)≤…≤exPD(v_n).Then exPD(v_k)is called the k- point exponent of D and is denoted by exP_D(k),1≤k≤n.In this paper we define e(n,k):=max{exp_D(k)|D∈PD(n,2)} and E(n,k):= {expD(k)|D∈PD(n,2)},where PD(n,2)is the set of all primitive digraphs of order n with girth 2.We completely determine e(n,k)and E(n,k)for all n,k with n≥3 and 1≤k≤n.