Pure quantitative characterization of finite simple groups

Let G be a finite group, and let π _e (G) be the set of all element orders of G. In this short paper we prove that π _e (B _n (q)) ≠ π _e (C _n (q)) for all odd q.      

极值图论与度序列

本文简要概述极值图论与度序列的最新研究进展，同时提出了一些有待进一步解决的问题和猜想．     

单循环赛赛程安排的一个图论方法

利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案     

用参考圆法演示简谐振动

对受迫振动仪进行了改进，通过参考圆法，演示了作镁速圆周运动的质点在直径方向上的投影所作的运动为简谐振动。     

An unknotting theorem for delta and sharp edge‐homotopy

Two spatial embeddings of a graph are said to be delta (resp. sharp) edge‐homotopic if they are transformed into each other by self delta (resp. sharp) moves and ambient isotopies. We show that any two spatial embeddings of a graph are delta (resp. sharp) edge‐homotopic if and only if the graph does not contain a subgraph which is homeomorphic to the theta graph or the disjoint union of two 1‐spheres, or equivalently G is homeomorphic to a bouquet. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

用线性插值法求单摆运动周期的近似解

利用线性插值的方法,提出了一个任意摆角条件下的单摆运动周期的近似公式.并利用Mathematica软件将该公式与精确解进行了比较,还与其他近似公式进行了对比.结果表明,该公式的近似程度相当好.     

超立方体的Laplace矩阵的谱

本文解决了超立方体的Laplace矩阵的谱问题．n维超立方体Q。的Laplace矩阵L（Q）的谱specL（Qn）。[0 2 4…2n Cn^0 Cn^1 Cn^2 … Cn^n],．其中2t（t=0，1，2，…，n）为L（Qn）的n＋1个不同的特征值，二项式系数Cn为特征值2t的重数．     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006