Some Theorems on Leibniz n-Algebras from the Category Un(Lb)

We study the Leibniz n-algebra Un(∑),whose multiplication is defined viathe bracket of a Leibniz algebra ∑ as[x1,...,xn]=[x1,[...,[xn-2,[xn-1,xn]]...]].Weshow that Un(∑) is simple if and only if ∑ is a simple Lie algebra.An analog of Levi'stheorem for Leibniz algebras in Un(Lb) is established and it is proven that the Leibnizn-kernel of Un(Σ) for any semisimple Leibniz algebra Σ is the n-algebra Un(Σ).     

Pure tetrahedral quadruple systems with index two

An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order $n$ with index $\lambda$, denoted by ${\text{TQS}}_{\lambda }\left(n\right)$, is a pair $\left(X,\mathrm{?}\right)$, where $X$ is an $n$‐set and $\mathrm{?}$ is a set of oriented tetrahedra (blocks) such that every cyclic triple on $X$ is contained in exactly $\lambda$ members of $\mathrm{?}$. A ${\text{TQS}}_{\lambda }\left(n\right)$ is pure if there do not exist two blocks with the same vertex set. When $\lambda =1$, the spectrum of a pure TQS $\left(n\right)$ has been completely determined by Ji. In this paper, we show that there exists a pure ${\text{TQS}}_2\left(n\right)$ if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$. A corollary is that a simple ${\text{QS}}_4\left(n\right)$ also exists if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$.     

论大学物理实验体系建设与教学改革

传统的物理实验是按普通物理、电子线路和近代物理等内容进行划分，这种体系突出了学科的系统性，但忽视了学科之间的兼容互补性，各学科相互独立，限制了学生跨学科思维能力和创新能力的培养，建立现代物理实验教学新体系是大学物理实验教学改革的必然趋势．新的物理实验体系应依照训练层次，划分为引导性实验、基本实验、综合性实验、设计性实验、研究性实验．并需要注重时代性和先进性，改革和更新大学物理实验教学内容，改革实验教学与管理模式，形成新的运行机制，从而达到学生素质和能力的提高．     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

On topological properties of the Hartman-Mycielski functor

We investigate some topological properties of a normal functorH introduced earlier by Radul which is some functorial compactification of the Hartman-Mycielski construction HM. We prove that the pair (H X, HMY) is homeomorphic to the pair (Q, σ) for each nondegenerated metrizable compactumX and each denseσ-compact subsetY.     

社会经济管理系统和谐性模型的构建与分析

本文从非线性自然观的视野。引用与分析了社会经济系统功能模型与效应模型。构建了系统和谐状态模型与和谐状态可信度模型，形象地说明了企业系统的和谐既是一个随机不确定状态。又是企业和谐力量与不和谐力量相互抗争干涉的过程。依据协同学原理提出了企业系统和谐演进的机制，表明企业系统的和谐发展是子系统和谐协同的过程。即子系统竞争合作的过程。文中所构建的模型，从理论上清晰地说明了企业系统和谐有序运行的机理，为如何构建和谐企业。提供了建设性的思考。     

Topological Simplicity of a Certain LF-Algebra

We show that the LF-algebra considered by Akkar and Nacir in [1] is topologically simple.     

An Analytic Zariski Structure Over a Field

Following the introduction and preliminary investigations of analytic Zariski structures in Peatfield and Zilber (Ann pure Appl Logic 132:125–180, 2005) an example of an analytic Zariski structure extending an algebraically closed field is provided. The example is constructed using Hrushovski’s method of free amalgamation, and a topology is introduced in which we can verify the analytic Zariski axioms.     

Phase Transition in Vertex-Reinforced Random Walks on {\mathbb{Z}} with Non-linear Reinforcement

Vertex-reinforced random walk is a random process which visits a site with probability proportional to the weight w _k of the number k of previous visits. We show that if w _k ∼ k ^α, then there is a large time T ₀ such that after T ₀ the walk visits 2, 5, or ∞ sites when α < 1, = 1, or > 1, respectively. More general results are also proven.