关于Goppa 几何码最小距离的一个新方法

引进一个关于Goppa几何码(代数几何码)最小距离界的一个新方法.应用Maharaj的思想(即用显示基来近似表达Riemann-Roch空间)到Goppa几何码的最小距离的界上去.通过厄米特曲线上的代数几何码的一类例子,来证明标准的几何码的下界在某些情形下可以被显著地改进.进一步地,我们给出了这些码的最小距离上界,并说明了我们的下界非常接近这个上界.     

代数函数域上的局部恢复码

假设C是有限域Fq上的[n,k]线性码,如果码字的每个坐标是其它至多r个坐标的函数,称C是(n,k,r)线性码,这里r是较小的数.本文在代数函数域上构造出了局部恢复码,它的码长不受字符集大小的限制,实际上,它的码长可以远远大于字符集的大小;并将此方法应用于广义Hermite函数域,得到了一类广义Hermite函数域上的局部恢复码.进一步地,通过构造子码的方式改进了广义Hermite函数域上的局部恢复码的最小距离的下界.     

一类代数几何码的构造

利用有限域Fq^8(s≥1为正整数，q为素数幂)上代数曲线构造了一类q元线性码，这类线性码是q^8元几何Goppa码的子域子码的子码，同时也是Chaoping Xing，SanLing构造的代数几何码[1]的推广。     

一类具有双恢复集的局部恢复码的构造

假设C是有限域Fq上的[n,k]线性码,如果码字的每个坐标是其它至多r个坐标的函数,称C是(n,k,r)局部恢复码,这里r是较小的数.在分布式存储系统中,具有多个恢复集的局部恢复码使得数据在系统中更具实际意义,因为它可以避免热数据的频繁访问.引入代数函数域、特别是Hermite函数域去构造局部恢复码,这类局部恢复码具有双恢复集,并且码长可以突破字符集的大小的限制.结果表明,此构造方法得出的最小距离下界明显地改进了Alexander Barg的最小距离的下界.     

具有多恢复集的局部恢复码的构造

局部恢复码(LRC)是指码字的任意一个坐标位置的值都可以通过较少的r个其它位置的值来恢复.构造具有多恢复集的LRC码是为了解决通信中节点访问的拥堵问题.基于代数函数域上的自同构群,利用其子群的内直积构造多恢复集,进而构造出具有多恢复集的局部恢复码.此外,在恢复码的构造中,赋值空间的生成集是显式表达的,这使得码的维数、最小距离等参数计算非常方便.     

一类超W-代数上的Poisson超结构

源于Poisson几何的Poisson代数同时具有代数结构和李代数结构,其乘法与李代数乘法满足Leibniz法则.超W-代数是复数域C上的无限维李超代数.主要研究一类超W-代数上的Poisson超结构.     

代数函数域及模型的Kodaira维数

Iitaka 对特征零情形引进了代数簇的 Kodaira 维数的概念,由此发展的一套理论对代数几何中的双有理分类问题起到重要的作用(参见(3)和(7)).由罗昭华定义的(参见(6))任意特征代数函数域的 Kodaira 维数的概念是观察双有理问题的一个新的途径.在本文中,我们首先证明了罗意义下的 Kodaira维数当代数函数域进行某种特殊的扩张(即称为正则扩张)时是不变的.另外,我们定义了代数函数域之模型的 Kodaira 维数,并就此证明了关于代数簇的一个母纤维定理.     

关于代数体函数的一个定理

1965年何育赞在[1],[2]中系统论述了代数体函数的基本值分布性质,并结合导数对第二基本不等式作了若干推广。给出了代数体函数及其导数的一些亏量关系。本文给出了一个定理,应用此定理可以改善[1],[2],[3]中的若干定理。关于 T(r,u)的上界,我们有定理 设 u(z)是代数体函数,a_i(i=1,…,p)是相互判别的有穷复数,b_j(j=1,…,q)是相互判别的有穷非零复数,k≥1为整数。则     

(n-1)-半单的n-李代数的几何描述

证明了实数域上(n-1)-半单的(n+1)维n-李代数A是n维欧氏空间的Lorentz群O(p,n-p)与n维Abel正规子群的半直积的n-李代数.且当p=0时,A是n维欧氏空间的等距变换群的n-李代数.并提出了关于(n-1)-半单的(n+1)维n-李代数的外导子的物理应用与几何应用问题.     

具有优良渐近参数的代数几何码

本文讨论了一类具有好的渐近参数的代数几何码.通过对除子类数、高次有理除子数以及代数几何码的参数分析,得到一类码其渐近界优于Gilbert-Varshamov界和Xing界.在这两个界的交点处,渐近界有所改进.     

Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences

This paper is concerned with two applications of bases of Riemann-Roch spaces. In the first application, we define the floor of a divisor and obtain improved bounds on the parameters of algebraic geometry codes. These bounds apply to a larger class of codes than that of Homma and Kim (J. Pure Appl. Algebra 162 (2001) 273). Then we determine explicit bases for large classes of Riemann-Roch spaces of the Hermitian function field. These bases give better estimates on the parameters of a large class of m-point Hermitian codes. In the second application, these bases are used for fast implementation of Xing and Niederreiter's method (Acta. Arith. 72 (1995) 281) for the construction of low-discrepancy sequences.     

BANACH空间有界线性算子A~((2))_(T,S)的表示

In this paper we extends the results in [1],[2],[3] and [4] to bounded linear operators in Banach spaces using matrix expression of a partitioned operator. For existence of the limit lim λ→0 (λI + GA)~(-1) G and lim λ→0 G(λI + AG)~(-1) it is necessary and sufficient condition that bounded linear operators A~((2))_(T,S) exist in Banach spaces. We get the integral representation: A(2)_(T,S)=∫∞0 exp(-GAt)Gdt.     

The Hilbert function of curves on certain smooth quartic surfaces

The Riemann-Roch problem for divisors on a smooth surface in ³ is studied. This problem is solved for some smooth quartic surfaces which are called Mori quartics; as a consequence the Hilbert function of any integral curve on a Mori quartic is determined.     

An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem

Regarding quasi-cyclic codes as certain polynomial matrices, we show that all reversible quasi-cyclic codes are decomposed into reversible linear codes of shorter lengths corresponding to the coprime divisors of the polynomials with the form of one minus x to the power of m. This decomposition brings us an efficient method to construct reversible quasi-cyclic codes. We also investigate the reversibility and the self-duality of the linear codes corresponding to the coprime divisors of the polynomials. Specializing to the cases where the number of cyclic sections is not more than two, we give necessary and sufficient conditions for the divisors of the polynomials for which the self-dual codes are reversible and the reversible codes of half-length-dimension are self-dual. Our theorems are utilized to search reversible self-dual quasi-cyclic codes with two cyclic sections over binary and quaternary fields of lengths up to seventy and thirty-six, respectively, together with the maximums of their minimum weights.     

FIXED POINT INDEX THEORY FOR WEAKLY INWARD MAPPINGS

1IntroductionLetEbeaBanachspace,PcEaclosedconvexsetandletA:finP~Ebecompletelycontinuous,wherefiCEisanopenboundedset.ItiswelLknownthataAsedpointindexi(A,nnP,P)callbedefinedwheneverA(flnP)cpalldAx/xonoffnP,whichresultsinmanyfixedpointtheoremstodealwithvariousproblems.AsimpleanalysisofthemethodofdefiningtheindexrevealsthattherestrictionthatAmapsfinPtoPitselfisessential.FOrdetailswereferto[1,pp.286--291]andtheintroductionsectionof[2].Hereafter,wewillsaythatsllchmappingsareconemappings.On…     

Spectral analysis of matrix polynomials— II. The resolvent form and spectral divisors

This is a continuation of paper I, “Canonical forms and divisors’. Here, resolvent forms of monic operator polynomials on finite dimensional spaces are studied, with applications to products and divisors of such polynomials. The special case of spectral divisors is developed and applications are made to systems theory.     

Bredon-style homology, cohomology and Riemann-Roch for algebraic stacks

One of the main obstacles for proving Riemann-Roch for algebraic stacks is the lack of cohomology and homology theories that are closer to the K-theory and G-theory of algebraic stacks than the traditional cohomology and homology theories for algebraic stacks. In this paper we study in detail a family of cohomology and homology theories which we call Bredon-style theories that are of this type and in the spirit of the classical Bredon cohomology and homology theories defined for the actions of compact topological groups on topological spaces. We establish Riemann-Roch theorems in this setting: it is shown elsewhere that such Riemann-Roch theorems provide a powerful tool for deriving formulae involving virtual fundamental classes associated to dg-stacks, for example, moduli stacks of stable curves provided with a virtual structure sheaf associated to a perfect obstruction theory. We conclude the present paper with a brief application of this nature.     

On the Binary Self-Dual Codes with an Automorphism of Order 2

Methods to design binary self-dual codes with an automorphism of order two without fixed points are presented. New extremal self-dual [40,20,8], [42,21,8],[44,22,8] and [64,32,12] codes with previously not known weight enumerators are constructed.     

Riemann-Roch and Abel-Jacobi theory on a finite graph

It is well known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linear equivalence of divisors. In particular, we formulate and prove a graph-theoretic analogue of the classical Riemann-Roch theorem. We also prove several results, analogous to classical facts about Riemann surfaces, concerning the Abel-Jacobi map from a graph to its Jacobian. As an application of our results, we characterize the existence or non-existence of a winning strategy for a certain chip-firing game played on the vertices of a graph.     

关于Banach空间中凸泛函的广义次梯度不等式

本文在前人^[1,2]的基础之上，以凸泛函的次梯度不等式为工具，将Jensen不等式推广到Banach空间中的凸泛函，导出了Banach空间中的Bochner积分型的广义Jensen不等式，给出其在Banach空间概率论中某些应用，从而推广了文献[3—6]的工作．