The combinatorial game Nofil played on Steiner triple systems

We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions.     

Maps of manifolds into the plane which lift to standard embeddings in codimension two

Let be a smooth map of a closed n-dimensional manifold (n2) into the plane and let be an orthogonal projection. We say that f has the standard lifting property, if every embedding with is standard in a certain sense. In this paper we give some sufficient conditions for a generic smooth map f to have the standard lifting property when M is a closed surface or an n-dimensional homotopy sphere.     

An Asymptotic Ratio in the Complete Binary Tree

Let T _n be the complete binary tree of height n considered as the Hasse-diagram of a poset with its root 1 _n as the maximum element. For a rooted tree T, define two functions counting the embeddings of T into T _n as follows A(n;T)=|{S T _n  : 1 _n ∈S, S≅T}|, and B(n;T)=|{S T _n :1 _n ∉S, S≅T}|. In this paper we investigate the asymptotic behavior of the ratio A(n;T)/B(n;T), and we show that lim  _n→∞[A(n;T)/B(n;T)]=2^ℓ;−1−1, for any tree T with ℓ leaves. This revised version was published online in June 2006 with corrections to the Cover Date.     

New characterizations of Hajlasz-Sobolev spaces on metric spaces

This paper introduces the fractional Sobolev spaces on spaces of homogeneous type,includingmetric spaces and fractals. These Sobolev spaces include the well-known Hajfasz-Sobolev spaces as specialmodels.The author establishes varions chaaracterizations of(sharp)maximal functions for these spaces.Asapplications,the author identifies the fractional Sobolev spaces with some Lipscitz-type spaces.Moreover;some embedding theorems are also given.     

Consecutive-(r,f,k)out-of-n:F和Consecutive(f,g)-out-of-(r,n):F线性系统的可靠性

Consecutive-(r,f,k)-out-of-n:F系统由n个单元顺序连结而成,仅当在连续的r个单元中,至少有f个失效或者至少连续k个失效,整个系统才失效;而Consecutive-(f,g)-out-of-(r,n):F系统由n个单元顺序连结而成,仅当在整个系统中至少有f个失效或者在连续的r个单元中,至少有g个失效,整个系统才失效。本文运用马氏链嵌入方法,在单元之间相互独立以及单元之间马氏相关这两种情况下,给出线性系统的可靠性。     

Grünbaum colorings of even triangulations on surfaces

A Grünbaum coloring of a triangulation G is a map c : such that for each face f of G, the three edges of the boundary walk of f are colored by three distinct colors. By Four Color Theorem, it is known that every triangulation on the sphere has a Grünbaum coloring. So, in this article, we investigate the question whether each even (i.e., Eulerian) triangulation on a surface with representativity at least r has a Grünbaum coloring. We prove that, regardless of the representativity, every even triangulation on a surface has a Grünbaum coloring as long as is the projective plane, the torus, or the Klein bottle, and we observe that the same holds for any surface with sufficiently large representativity. On the other hand, we construct even triangulations with no Grünbaum coloring and representativity , and 3 for all but finitely many surfaces. In dual terms, our results imply that no snark admits an even map on the projective plane, the torus, or the Klein bottle, and that all but finitely many surfaces admit an even map of a snark with representativity at least 3.     

PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS

Let Qn,k(n≥3,1≤k≤n-1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges,fv and fe be the numbers of faulty vertices and faulty edges,respectively.In this paper,we give three main results.First,a fault-free path P [u,v] of length at least 2n-2fv-1(respectively,2n-2fv-2) can be embedded on Qn,k with fv+fe≤n-1 when d Qn,k(u,v) is odd(respectively,d Qn,k(u,v) is even).Secondly,an Qn,k is(n-2) edgefault-free hyper Hamiltonian-laceable when n(≥3) and k have the same parity.Lastly,a fault-free cycle of length at least 2n-2fv can be embedded on Qn,k with fe≤n-1 and fv+fe≤2n-4.     

On the pagenumber of trivalent Cayley graphs

Book embedding of graphs is one of the graph layout problem. It is useful for the multiprocessor network layout or the fault-tolerant processor arrays. We show that the trivalent Cayley graphs proposed by Vadapalli and Srimani can be embedded in five pages, and show some additional results on cube-connected cycles.     

一种新型极性脲丙基-C30固定相的制备和性能评价

以3-脲丙基三甲氧基硅烷为偶联剂，制备了一种新型极性脲丙基-C30（TPU-C30）反相色谱固定相。采用扫描电子显微镜、元素分析、红外光谱和热分析等对该固定相进行表征。结果表明，TPU-C30固定相已成功制备，连续制备3次固定相，其元素含量的相对偏差均小于5%，说明该合成工艺重复性良好。以不同极性、位置异构、碱性化合物为溶质探针，以传统的C18色谱柱与C30色谱柱为参比，对制备的固定相的色谱性能进行了研究。研究结果表明，TPU-C30固定相具有不同于传统C18柱、C30柱的选择性和更优的择形性，明显改善了碱性物质的峰形，其具有广阔的应用空间。