三维Minkowski空间中的一类直线汇

研究了由三维Minkowski空间$E^3_1$中一个类空曲面$S_1$上一个单参数测地曲线族的切线所构成的直线汇$T$,它以$S_1$为一个焦曲面.证明了$T$的两个可展曲面族沿着第二个焦曲面$S_2$的正交曲线网相交的充要条件是$S_1$是可展曲面.对于$T$的两个焦曲面$S_1$和$S_2$之间沿着同一光线的对应,还证明了其保持渐近曲线网的充要条件.最后,研究了$T$的正交曲面$S$,并且证明了如果$S$是$E^3_1$中的一个极大曲面,那么,$T$的焦曲面$S_1$和$S_2$之间沿着同一光线的对     

Composite genus one Belyi maps

Motivated by a demand for explicit genus 1 Belyi maps from theoretical physics, we give an efficient method of explicitly computing genus one Belyi maps by (1) composing covering maps from elliptic curves to the Riemann sphere with simpler (univariate) genus zero Belyi maps, as well as by (2) composing further with isogenies between elliptic curves. The computed examples of genus 1 Belyi maps has doubly-periodic dessins d’enfant that are listed in the physics literature as so-called brane-tilings in the context of quiver gauge theories.     

限制性多源点偏心距增广问题

给定一个赋权图$G=（V,E;w,c）$以及图$G$的一个支撑子图$G_{1}=（V,E_{1}）$,这里源点集合$S=\{s_{1},s_{2},\cdots,s_{k}\}\subseteq V$,权重函数$w：E\rightarrow\mathbb{R}^{+}$,费用函数$c：E\setminus E_{1}\rightarrow\mathbb{Z}^{+}$和一个正整数$B$,本文考虑两类限制性多源点偏心距增广问题,具体叙述如下：（1）限制性多源点最小偏心距增广问题是要寻找一个边子集$E_{2}\subseteq E\setminus E_{1}$,满足约束条件$c（E_{2}）$$\leq$$B$,目标是使得子图$G_{1}\cup E_{2}$上源点集$S$中顶点偏心距的最小值达到最小;（2）限制性多源点最大偏心距增广问题是要寻找一个边子集$E_{2}\subseteq E\setminus E_{1}$,满足约束条件$c（E_{2}）$$\leq$$B$,目标是使得子图$G_{1}\cup E_{2}$上源点集$S$中顶点偏心距的最大值达到最小。本文设计了两个固定参数可解的常数近似算法来分别对上述两类问题进行求解。     

限制性多源点偏心距增广问题

给定一个赋权图$G=（V,E;w,c）$以及图$G$的一个支撑子图$G_{1}=（V,E_{1}）$,这里源点集合$S=\{s_{1},s_{2},\cdots,s_{k}\}\subseteq V$,权重函数$w：E\rightarrow\mathbb{R}^{+}$,费用函数$c：E\setminus E_{1}\rightarrow\mathbb{Z}^{+}$和一个正整数$B$,本文考虑两类限制性多源点偏心距增广问题,具体叙述如下：（1）限制性多源点最小偏心距增广问题是要寻找一个边子集$E_{2}\subseteq E\setminus E_{1}$,满足约束条件$c（E_{2}）$$\leq$$B$,目标是使得子图$G_{1}\cup E_{2}$上源点集$S$中顶点偏心距的最小值达到最小;（2）限制性多源点最大偏心距增广问题是要寻找一个边子集$E_{2}\subseteq E\setminus E_{1}$,满足约束条件$c（E_{2}）$$\leq$$B$,目标是使得子图$G_{1}\cup E_{2}$上源点集$S$中顶点偏心距的最大值达到最小。本文设计了两个固定参数可解的常数近似算法来分别对上述两类问题进行求解。     

Computing isogenies between elliptic curves over using Couveignes's algorithm

The heart of the improvements by Elkies to Schoof's algorithm for computing the cardinality of elliptic curves over a finite field is the ability to compute isogenies between curves. Elkies' approach is well suited for the case where the characteristic of the field is large. Couveignes showed how to compute isogenies in small characteristic. The aim of this paper is to describe the first successful implementation of Couveignes's algorithm. In particular, we describe the use of fast algorithms for performing incremental operations on series. We also insist on the particular case of the characteristic 2.

     

ISOGENOUS OF THE ELLIPTIC CURVES OVER THE RATIONALS

AbstractAn elliptic curve is a pair (E,O), where ?is a smooth projective curve of genus 1 and O is a point of E, called the point at infinity. Every elliptic curve can be given by a Weierstrass equationE:y2 a1xy a3y = x3 a2x2 a4x a6.Let Q be the set of rationals. E is said to be dinned over Q if the coefficients ai, i = 1,2,3,4,6 are rationals and O is defined over Q.Let E/Q be an elliptic curve and let E(Q)tors be the torsion group of points of E denned over Q. The theorem of Mazur asserts that E(Q)tors is one of the following 15 groupsE(Q)tors　Z/mZ, m = 1,2,..., 10,12,Z/2Z × Z/2mZ, m = 1,2,3,4.We say that an elliptic curve E'/Q is isogenous to the elliptic curve E if there is an isogeny, i.e. a morphism : E E' such that (O) = O, where O is the point at infinity.We give an explicit model of all elliptic curves for which E(Q)tors is in the form Z/mZ where m= 9,10,12 or Z/2Z × Z/2mZ where m = 4, according to Mazur's theorem. Morever, for every family of such elliptic curves, we give an explicit m     

任意长圈覆盖指定的独立的点

An invariant σ2（G） of a graph is defined as follows： σ2（G） ：= min{d（u） ＋ d（v）｜u, v ∈V（G）,uv ∈ E（G）,u ≠ v} is the minimum degree sum of nonadjacent vertices （when G is a complete graph, we define σ2（G） = ∞）. Let k, s be integers with k ≥ 2 and s ≥ 4, G be a graph of order n sufficiently large compared with s and k. We show that if σ2（G） ≥ n ＋ k- 1, then for any set of k independent vertices v1,..., vk, G has k vertex-disjoint cycles C1,..., Ck such that ｜Ci｜ ≤ s and vi ∈ V（Ci） for all 1 ≤ i ≤ k.
The condition of degree sum σs（G） ≥ n ＋ k - 1 is sharp.     

Elliptic periods and primality proving

We construct extension rings with fast arithmetic using isogenies between elliptic curves. As an application, we give an elliptic version of the AKS primality criterion.     

迷向表示分为6个不可约直和的旗流形上不变爱因斯坦度量

众所周知,计算广义旗流形G/K上不变爱因斯坦度量存在两个困难:(1)如何计算旗流形的非零结构常数;(2)如何计算旗流形爱因斯坦方程组的Grobner基.在这篇文章中用定理2.1来计算旗流形的非零结构常数,用Maple软件来计算旗流形爱因斯坦方程组的Gr?bnexr基.最后得到旗流形F_4/U~2(1)×SU(3),E_6/U~2(1)×SU(3)×SU(3),E_7/U~2(1)×SU(2)×SU(5),E_7/U~2(1)×SU(6),E_7/U~2(1)×SU(2)×SO(8)与E_8/U~2(1)×E_6上爱因斯坦度量.     

Simplified isogeny formulas on twisted Jacobi quartic curves

Isogenies between elliptic curves play a very important role in elliptic curve related cryptosystems and cryptanalysis. It is widely known that different models of elliptic curves would induce different computational costs of elliptic curve arithmetic, and several works have been devoted to accelerate the isogeny computation on various curve models. This paper studies the case of the Jacobi quartic model, which is a classic form of elliptic curves. A new w-coordinate system on extended Jacobi quartic curves is introduced for Montgomery-like group arithmetic. Explicit formulas for 2-isogenies and odd ℓ-isogenies on the specific curves are presented, and based on the w-coordinate system, the computation of such isogenies could be further simplified.     

Pairing-Based Cryptography on Elliptic Curves

We give a brief overview of a recent branch of Public Key Cryptography, the so called Pairing-based Cryptography or Identity-based Cryptography. We describe the Weil pairing and its applications to cryptosystems and cryptographic protocols based on pairings as well as the elliptic curves suitable for the implementation of this kind of cryptography, the so called pairing-friendly curves. Some recent results of the authors are included.     

Genus Two Curves with Many Elliptic Subcovers

We determine all genus 2 curves, defined over ?, which have simultaneously degree 2 and 3 elliptic subcovers. The locus of such curves has three irreducible 1-dimensional genus zero components in ?₂. For each component, we find a rational parametrization and construct the equation of the corresponding genus 2 curve and its elliptic subcovers in terms of the parameterization. Such families of genus 2 curves are determined for the first time. Furthermore, we prove that there are only finitely many genus 2 curves (up to ?-isomorphism) defined over ?, which have degree 2 and 3 elliptic subcovers also defined over ?.     

Fast algorithms for computing isogenies between elliptic curves

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree ( different from the characteristic) in time quasi-linear with respect to . This is based in particular on fast algorithms for power series expansion of the Weierstrass -function and related functions.

     

Computing Mordell-Weil ranks of cyclic covers of elliptic surfaces

We give explicit formulas for computing the Mordell-Weil ranks of the elliptic surfaces subject to some restrictions on the surface .

     

On the discrete logarithm in the divisor class group of curves

Let be a curve which is defined over a finite field of characteristic . We show that one can evaluate the discrete logarithm in by operations in . This generalizes a result of Semaev for elliptic curves to curves of arbitrary genus.

     

On the number of distinct elliptic curves in some families

We give explicit formulas for the number of distinct elliptic curves over a finite field (up to isomorphism over the algebraic closure of the ground field) in several families of curves of cryptographic interest such as Edwards curves and their generalization due to D. J. Bernstein and T. Lange as well as the curves introduced by C. Doche, T. Icart and D. R. Kohel.     

不含某些子图的k连通图中的k可收缩边

最近Ando等证明了在一个$k$($k\geq 5$ 是一个整数) 连通图 $G$ 中,如果 $\delta(G)\geq k+1$, 并且 $G$ 中既不含 $K^{-}_{5}$,也不含 $5K_{1}+P_{3}$, 则$G$ 中含有一条 $k$ 可收缩边.对此进行了推广,证明了在一个$k$连通图$G$中,如果 $\delta(G)\geq k+1$,并且 $G$ 中既不含$K_{2}+(\lfloor\frac{k-1}{2}\rfloor K_{1}\cup P_{3})$,也不含 $tK_{1}+P_{3}$ ($k,t$都是整数,且$t\geq 3$),则当 $k\geq 4t-7$ 时, $G$ 中含有一条 $k$ 可收缩边.     

Rank of <Emphasis Type="Italic">K</Emphasis><Subscript>2</Subscript> of elliptic curves

We prove that (i) rank(K2(E)) 1 for all elliptic curves E defined over Q with a rational torsion point of exact order N 4; (ii) rank(K2(E)) 1 for all but at most one R-isomorphism class of elliptic curves E defined over Q with a rational torsion point of exact order 3. We give some sufficient conditions for rank(K2(EZ)) 1.     

Finite Element Approximations of Symmetric Tensors on Simplicial Grids in $\mathbb{R}^n$: The Higher Order Case

The design of mixed finite element methods in linear elasticity with symmetric stress approximations has been a longstanding open problem until Arnold and Winther designed the first family of mixed finite elements where the discrete stress space is the space of $H(div, Ω\;\mathbb{S}) — P_{k+1}$ tensors whose divergence is a $P_{k-1}$ polynomial on each triangle for $k$ ≥ 2. Such a two dimensional family was extended, by Arnold, Awanou and Winther, to a three dimensional family of mixed elements where the discrete stress space is the space of $H(div, Ω\;\mathbb{S}) — P_{k+2}$ tensors, whose divergence is a $P_{k-1}$ polynomial on each tetrahedron for $k$ ≥ 2. In this paper, we are able to construct, in a unified fashion, mixed finite element methods with symmetric stress approximations on an arbitrary simplex in $\mathbb{R}^n$ for any space dimension. On the contrary, the discrete stress space here is the space of $H(div, Ω\;\mathbb{S}) — P_k$ tensors, and the discrete displacement space here is the space of $L²(Ω ; \mathbb{R}^n) — P_{k-1}$ vectors for $k ≥ n$+1. These finite element spaces are defined with respect to an arbitrary simplicial triangulation of the domain, and can be regarded as extensions to any dimension of those in two and three dimensions by Hu and Zhang.     

完全图的Cantesian积的L(2,1)-圆标定

For positive integers j and k with j ≥ k, an L（j, k）-labeling of a graph G is an assignment of nonnegative integers to V（G） such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L（j, k）-labeling of a graph G is the difference between the maximum and minimum integers it uses. The λj, k-number of G is the minimum span taken over all L（j, k）-labelings of G. An m-（j, k）-circular labeling of a graph G is a function f ： V（G） →{0, 1, 2,..., m - 1} such that ｜f（u） - f（v）｜m ≥ j if u and v are adjacent; and ｜f（u） - f（v）｜m 〉 k ifu and v are at distance two, where ｜x｜m = min{｜xl｜, m-｜x｜}. The minimum integer m such that there exists an m-（j, k）-circular labeling of G is called the σj,k-number of G and is denoted by σj,k（G）. This paper determines the σ2,1-number of the Cartesian product of any three complete graphs.