Analogue of Aharonov-Bohm effect in spin gauge theory

We predict the possibility of observing analogue of the Aharonov-Bohm effect due to long range interaction between spins originating in the framework of spin gauge theory developed earlier. The effect is predicted for both electrons (fermions) and photons. Appropriate experimental set-ups are suggested.     

构造一种与置换群成反同构的群

通过对中国古代一种游戏的讨论,建立了数学模型,从而构造了一种与置换群成反同构的互换群,得到一些有趣的结果     

Bound on <Emphasis Type="Italic">m</Emphasis>-restricted Edge Connectivity

An m-restricted edge cut is an edge cut that separates a connected graph into a disconnected one with no components having order less than m. m-restrict edge connectivity λm is the cardinality of a minimum m-restricted edge cut. Let G be a connected k-regular graph of order at least 2m that contains m-restricted edge cuts and X be a subgraph of G. Let θ(X) denote the number of edges with one end in X and the other not in X and ξm=min{θ(X) ;X is a connected vertex-induced subgraph of order m}.It is proved in this paper that if G has girth at least m/2 2,then λm≤ξm.The upper bound of λm is sharp.     

Commutative Moufang Loops with Finite Conjugacy Classes of Subloops

It is proved that the following conditions are equivalent for an arbitrary commutative Moufang loop :1) the loop is finite over the center;2) every subloop of defines a finite conjugacy class of subloops;3) every associative subloop of defines a finite conjugacy class of subloops;4) every infinite associative subloop of defines a finite conjugacy class of subloops.     

The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

Non-Cayley Vertex-Transitive Graphs of Order Twice the Product of Two Odd Primes

For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a Cayley graph, or, equivalently, a graph Γ on n vertices such that Aut Γ is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, Marusic and Scapellato, and McKay and the second author) has produced answers to this question if n is prime, or divisible by the square of some prime, or if n is the product of two distinct primes. In this paper we consider the simplest unresolved case for even integers, namely for integers of the form n = 2pq, where 2 < q < p, and p and q are primes. We give a new construction of an infinite family of vertex-transitive graphs on 2pq vertices which are not Cayley graphs in the case where p ≡ 1 (mod q). Further, if p ? 1 (mod q), p ≡ q ≡ 3(mod 4), and if every vertex-transitive graph of order pq is a Cayley graph, then it is shown that, either 2pq = 66, or every vertex-transitive graph of order 2pq admitting a transitive imprimitive group of automorphisms is a Cayley graph.     

Faithful compact quantum group actions on connected compact metrizable spaces

We construct faithful actions of quantum permutation groups on connected compact metrizable spaces. This disproves a conjecture of Goswami.     

力梯度辛方法在圆型限制性三体问题中的应用

旋转坐标系下的圆型限制性三体问 题因含非惯性系所附加的影响部分使得动能不是动量的严格二次型, 可能导致力梯度辛积分算法的应用遇到困难. 从Lie算子运算出发, 严格论证了力梯度算子在这种情形下的物理意义 仍然像质心惯性坐标系下的圆型限制性三体问题那样是引力的梯度, 而不是引力与非惯性力所得合力的梯度, 表明了力梯度辛方法适合求解旋转坐标系下的圆型限制性三体问题. 通过应用四阶力梯度辛方法、最优化四阶力梯度辛方法和Forest-Ruth 辛方法分别求解该问题, 进行了数值对比研究, 结果显示最优化型力梯度算法能够取得最好精度. 还应用最优化型算法计算两邻近轨道的Lyapunov指数和快速Lyapunov指标, 确保高精度辛方法能够贯穿于这些混沌指标计算的全过程, 以便准确刻画此系统的动力学定性性质. 关键词： 辛积分器 圆型限制性三体问题 混沌 Lyapunov指数     

利用排列熵检测近40年华北地区气温突变的研究

运用一种新的动力学突变检测方法——排列熵(permutation entropy，PE)算法，计算并分析了中国华北地区52个站点1960年—2000年逐日平均气温资料的排列熵演化情况，发现中国华北地区气温在20世纪70年代中期、80年代初均发生了较大突变；进一步用经验模态分解(empirical mode decomposition，EMD)方法对排列熵序列进行逐级平稳化处理，结果发现这一地区的气温突变与准10年这一年代际时间尺度的周期变率密切相关，其原因与太阳黑子活动有着密切联系. 关键词： 华北 突变 排列熵算法 经验模态分解     

S_fS_(f-1)约化系数的解析表式

利用线性方程方法和解析延拓得到了导出置换群Sf Sf- 1约化系数解析表达式的一种简单的代数计算方法 .着重讨论了无重复度时Sf Sf- 1约化系数解析表达式的推导方法 .作为例子 ,给出了关于置换群内积 [f- 1,1]·[f- 1,1]和 [f - 1,1]·[f - 2 ,1,1]有关的所有Sf Sf- 1约化系数的解析表达式 .