有限域上一类三项式的研究

利用有限域理论,按照扩张次数k的奇偶性,研究了p~k元域上一类三项式的可约性判定问题,并在一定的条件下给出了该类三项式的一个分解式,最后给出了两种利用此类三项式构造新的不可约多项式的方法.     

关于多项式不可约性的定理

本文给出两个定理及两个推论，将在有理数域上判别一个整系数多项式的不可约性的Ｅｉｓｅｎｓｔｅｉｎ定理及文［２］中给出的另一个定理统一起来，使之可以互相转化．     

关于多项式不可约性的定理

本给出两个定理及两个推论，将在有理数域上判别一个整系数多项式的不可约性的Eisenstein定理及[2]中给出的另一个定理统一起来，使之可以互相转化。     

有限域上与仿射多项式有关的一些多项式的可约性

在这篇文章中,研究了有限域上一些与仿射多项式有关的多项式的可约性.对于有限域Fp上不是xppt-x-1的仿射三项式,得到了这些三项式的一个明确的因式.完全确定了多项式g(xps-ax-b)在Fp[x]中的分解,这里g(x)是Fp[x]中一个不可约多项式.证明了Fp上次数相同的不可约多项式的全体可以构成一个正则图.同时给出了多项式g(xqs-x-b)在Fp[x]不可约因式的个数公式,这里g(x)是Fp上一个不可约多项式.     

多项式不可约性的一个定理

本文给出了判别有理数域上多项式不可约性的一个定理     

x~(2~ap~br~c)-1在有限域上的完全分解

F_q是阶为奇素数幂q的有限域.本文给出了x~(2~ap~br~c)-1在Fq中完全分解式,其中a,b,c均为正整数,p,r为q-1的两个不同的奇素数因子.结果表明x~(2~ap~br~c)-1在F_q上的所有不可约因子均为二项式或三项式.对一般情况,如果用v_p(m)表示正整数m的标准分解中素因子p的次数,假设m的每个素因子都整除q-1,那么:(1)当v_p(m)≤v_p(q-1)对任意素数p|q-1成立时,x~m-1在F_q上的不可约因子都是二项式;(2)当q≡3(mod 4)时,x~m-1在F_q上的不可约因子都是二项式或者三项式.     

关于非齐次马氏信源的渐进均匀分割性

本文的目的是要研究非齐次马氏信源的渐进均分割性，首先应用鞅差收敛定理给出关于非齐次马氏信源二元函数一类平均的极限定理．作为推论，得到了对任意非齐次马氏信源均成立的几个极限定理和熵密度极限定理．最后给出一类非齐次马氏信源满足渐进均分割性的充分条件．     

可列非齐次马氏链的强极限性质

本文主要研究可列状态非齐次马氏链的强极限性质.文中在Cesaro收敛条件下证明了非齐次马氏链的N+1元函数的一系列强极限性质,推广了已有的关于二元随机变量函数的类似结果.最后,作为推论给出了齐次马氏链的N+1元函数的强极限定理.     

Verlinde模性范畴上的Casimir数及其应用

本文计算了秩为n+1的一类特殊的Verlinde模性范畴L的Casimir数,计算结果表明该Casimir数为2n+4.作为应用,由Higman定理知域K上的Grothendieck代数Gr(L)_Z K是半单代数当且仅当2n+4在域K中不为零.这也给出了第二类型n+1次Dickson多项式E_(n+1)(X)在K[X]中无重因式的一个等价刻画.如果2n+4在域K中为零,借助于Dickson多项式的有关因式分解定理,本文完全给出了Grothendieck代数Gr(L)_Z K的Jacobson根.     

一类随机内积空间的正交投影定理及应用

本文建立了一类随机内积空间上的正交投影定理,并利用它首次建立了a.s 有界的随机线性泛函的所谓Biesz表示定理,给出了其重要推论:Lax-Milgram定理的随机化。     

On Isomorphisms of Relations Embedded into Each Other

In this paper, we consider analogs of the Cantor--Bernstein theorem for sets with binary relations. In Sec. 1, we prove an analog of this theorem for arbitrary binary relations; in Sec. 2, we consider an application; in Sec. 3, we study a class of relations with the Cantor-- Bernstein property and a class of exact relations, and prove that these classes are closed under certain operations.     

Nilpotency of the Alternator Ideal of a Finitely Generated Binary (-1,1)-Algebra

We prove nilpotency of the alternator ideal of a finitely generated binary (-1,1)-algebra. An algebra is a binary (-1,1)-algebra if its every 2-generated subalgebra is an algebra of type (-1,1). While proving the main theorem we obtain various consequences: a prime finitely generated binary (-1,1)-algebra is alternative; the Mikheev radical of an arbitrary binary (-1,1)-algebra coincides with the locally nilpotent radical; a simple binary (-1,1)-algebra is alternative; the radical of a free finitely generated binary (-1,1)-algebra is solvable. Moreover, from the main result we derive nilpotency of the radical of a finitely generated binary (-1,1)-algebra with an essential identity.     

Fixed Point Theorems for Weakly Contractive Mappings in Ordered Metric Spaces with an Application

In this paper, we prove fixed point theorem for weakly contractive mappings using locally $T$-transitivity of binary relation and presenting an analogous version of Harjani and Sadarangani theorem involving more general relation theoretic metrical notions. Our fixed point results under universal relation reduces to Harjani and Sadarangani [Nonlinear Anal., 71 (2009), 3403–3410] fixed point theorems. In this way we also generalize some of the recent fixed point theorems for weak contraction in the existing literature.     

Generalization of the Rödseth–Gupta Theorem on Binary Partitions

In this article, we give a new proof of the Rödseth–Gupta theorem on binary partitions and give one possible generalization of this theorem.     

Combinatorial numbers in binary recurrences

We give several effective and explicit results concerning the values of some polynomials in binary recurrence sequences. First we provide an effective finiteness theorem for certain combinatorial numbers (binomial coefficients, products of consecutive integers, power sums, alternating power sums) in binary recurrence sequences, under some assumptions. We also give an efficient algorithm (based on genus 1 curves) for determining the values of certain degree 4 polynomials in such sequences. Finally, partly by the help of this algorithm we completely determine all combinatorial numbers of the above type for the small values of the parameter involved in the Fibonacci, Lucas, Pell and associated Pell sequences.      

Generalized KKM theorems,minimax inequalities,and their applications

This paper extends the well-known KKM theorem and variational inequalities by relaxing the closedness of values of a correspondence and lower semicontinuity of a function. The approach adopted is based on Michael's continuous selection theorem. As applications, we provide theorems for the existence of maximum elements of a binary relation, a price equilibrium, and the complementarity problem. Thus our theorems, which do not require the openness of lower sections of the preference correspondences and the lower semicontinuity of the excess demand functions, generalize many of the existence theorems such as those in Sonnenschein (Ref. 1), Yannelis and Prabhakar (Ref. 2), and Border (Ref. 3).The author is grateful to Professor Franco Giannessi for helpful comments and suggestions.     

序Banach空间非混合单调二元算子不动点的存在唯一性及应用

利用锥理论和Banach压缩映象原理在更一般的条件下建立了序Banach空间中一类非混合单调二元算子不动点的存在唯一性定理,并应用到Banach空间中二阶非线性Volterra型微分-积分方程初值问题,改进并推广了已有的一些结果.     

二元数字期权定价与copula的关系

首先简要介绍了 copula的一些基本概念和性质 ,然后探讨了一种多元未定权益——二元数字期权的价格与 copula的关系 .结论表明 ,一个二元数字期权的价格恰好是一个 copula函数 ,由此结论进而给出了根据实际数据获得二元数字期权价格的基本思路和步骤 .     

A Simple Proof of Suzumura's Extension Theorem for Finite Domains With Applications

In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extension theorem due to Szpilrajn [1930] follows from this theorem. Szpilrajns extension theorem is used to show that an asymmetric binary relation is contained in the asymmetric part of a linear order if and only if it is acyclic. This theorem is then applied to prove three results. Finally we introduce the concept of a threshold choice function, and our third result says that such choice functions are the only ones to satisfy a property called functional acyclicity.     

二阶P—Laplacian问题三个正解的存在性

本文要讨论了二阶P—Laplaci!an方程边值问题{△（φ（Au（t-1）））＋a（t），（t，u（t））=0，t∈N[1，T＋1]；△u（O）=0，u（T＋2）=0三个正解的存在性。通过利用一个三解不动点定理，证明了当，（t，x）在满足较弱条件时该方程至少三个正解的存在性。