Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

一类9n2次组合混合水平正交表的构造

本文利用正交表和投影矩阵的正交分解之间的关系,给出了一类9n2次组合混合水平正交表的构造方法,作为这种方法的应用,我们构造了一些新的具有较大非素数幂水平的144次混合水平正交表,并且这些正交表具有较高的饱和率.     

Hamiltonian circle actions on symplectic manifolds and the signature

Let M be a symplectic manifold with a Hamiltonian circle action with isolated fixed points. We prove that σ (M) = b₀(M) − b₂(M) + b₄(M) − b₆(M) + … where σ (M) is the signature of M and b_i(M) is the ith Betti number of M.     

Orbifold fibrations of Eschenburg spaces

Most of the few known examples of compact Riemannian manifolds with positive sectional curvature are the total space of a Riemannian submersion. In this article we show that this is true for all known examples, if we enlarge the category to orbifold fibrations. For this purpose we study all almost free isometric circle actions on positively curved Eschenburg spaces, which give rise to principle orbifold bundle structures, and we examine in detail their geometric properties. In particular, we obtain a new family of 6-dimensional orbifolds with positive sectional curvature whose singular locus consists of just two points.      

When is a Riemannian submersion homogeneous?

We study the structure of the most common type of Riemannian submersions, namely those whose fibers are given by the orbits of an isometric group action on a Riemannian manifold. Special emphasis is given to the case where the ambient space has nonnegative curvature. The first author was supported by research grant MTM2004-04794-MEC. Most of this work was done during a visit of the second author to Madrid, financed in part by funds of the aforementioned grant.     

逆序数的应用

本文通过“1 4-1 5”智力玩具和最优戴断切割问题两个实例 ,讨论了逆序数在解决实际问题中的应用     

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

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

Tiled Orders and Frobenius Rings

Mathematical Notes -     

Graphs with Special Arcs and Cryptography

A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques.