有限域上一类方程组解数的直接公式

本文给出有限域F=F_q(q=p~f,f≥1,p是一个奇素数)上一类方程组∑_(i=s_(r-1)+1~(s_r)∑_(j=1)~(m_i-m_(i-1))a_(m_(i-1)+j)x_1~(d_m(i-1)+j,1)…x_(n_i)~d_(m_(i-1)+j,n_i)=b_r,r=1,…,k当指数满足一定条件时,在F~(n_s_k)上解数的一个直接公式,这里d_(ij)＞0,a_i∈F~*,b_i∈F,0= s_0＜s_1＜…＜s_k,0=m_0＜m_1＜…＜m_(s_k),0=n_0＜n_1＜…＜n_(s_k), m_1≤n_1,…,m_(s_k)≤n_(s_k)．     

矩阵张量积不可约性的表征

为矩阵A与B的张量积,记为C=A(?)B。 定义Ⅰ设A=(a_(ij))∈C~(n×n),B=(b_(ij))∈C~(m×m)。若A在某位置(f,f)之非零元素链中有一个含r_1个A中的非零元:A(f,f)=a_(fe_1)a_((e_1)(e_2)…a_(e_r))(?),B在某位置(t,t)之非零元素链中有一个含r_2个B中的非零元:B(t,t)=b_((ts_1))b_((s_1s_2))…bs_(s_r_2-1)l,且(r_1,r_2)=1,1≤f≤n,1≤r≤m,则称A,B满足弱链条件。     

由谱数据数值稳定地构造实对称带状矩阵

§1.引言 设r,n是正整数并且0r有a_(ij)=0.     

单位上三角矩阵群的注记

记Tr_1(n,Z)是整数环Z上对角线元素全是1的全体上三角矩阵组成的群,k_(ij)(1≤i相似文献   

有限域上Carlitz方程的解数

设F_q是含有q个元素的有限域,其中q=p~t,t≥1,p是一个奇素数.研究了Carlitz方程的推广形式(a_1x_1~(m_1)+…+a_nx_n~(m_n)+a_(n+1)x_(n+1)~(m_(n+1))+…+a_(n+s)x_(n+s)~(m_(n+s)))~k=bx_1~(k_1)…x_n~(k_n),其中ai,b∈F_q~*,s≥1,n≥1.当方程变量的指数满足一定条件时,得到了方程的解数公式.     

有向循环图的支撑树数

设k≥2,1≤a_1相似文献   

ON SCORE VECTORS AND CONNECTIVITY OF TOURNAMENTS

An n-tournament T is called k-strong (l≤k≤n-2), if every (n+1-k)-subtournament of T is strongly connected. This paper proves that a score vector (s_1, s_2,..., s_n), where s_1≤s_2≤...≤s_n, is the score vector of some k-strong tournament if and only if min{t_1, t_2,..., t_(n-1)}≥k, where t_f=s_1+s_2+...+s_j-j(j-1)/2, j=1, 2,..., n-1.     

二次指派问题的一个新的限界方法

二次指派问题(QAP)的数学模型是:min{z(x)=sum from i=1 to n sum from =1 to n a_(ip)x_(ip)+sum from i=1 to n sum from p=1 to n sum from j=1 to n sum from q=1 to n c_(ipjq)x_(ip)x_(jq)|x∈},(1)这里∈(n~2维布尔集)是满足如下约束的集合:sum from i=1 to n x_(ip)=1,1≤p≤n,(2)sum from p=1 to n x_(ip)=1,1≤i≤n,(3)x_(ip)=0,1,1≤i,p≤n.(4)因为 x_(ip)~2=x_(ip)并且有约束(2)和(3),我们可以约定 c_(ipjq)=0,当 i=j 或 p=q.如果所有二次项的系数都可以写成     

非对称阵的偏序变换

大系统里,具有一类指定关系的系统结构常常表现为十分复杂的有向网络,它对应着一个模糊的非对称阵.本文给出了一组满足于计算机搜索算法的命题,以使纷乱的逻辑结构在偏序决策链的前提下相对地清晰化.设二元序偶 G=(X,(?))是一个有实际背景的系统结构.X={x_1,x_2,…,x_m;m<∞} 为有限节点集,(?)=(a_(ij))_((?)x(?)),a_(ij)=(x_i,x_j) 为从 x_i 到 x_j 的赋权,{(x_i,x_j)}(?)X×X.有以下命题:1.设(?)是一个自反的非对称模糊矩阵.令 A~((0))=(?),(?)~((k))=(?)~(k-1)_。(?)~(k-1),“。”:(?)k,a_(ij)~(k)=(?)(a_(il)~(k-1)∧a_(li)~(k-1)).则只要(?),(?)即为(?)的传递闭包.     

有限域上由一组对角多项式确定的簇中的点

设F_q为有限域,f_i(x)=a_(i1)x_1~(d_(i1))+…+a_(in)x_n~(d_(in))+c_i(i=1,…,m)为F_q上一组对角多项式,用N(V)表示由f_i(i=1,…,m)确定的簇中的F_q．有理点的个数．通过应用Adolphson和Sperber所引进的牛顿多面体方法,证明了ord_qN(V)≥[1/d_1+…+1/d_n]-m,其中d_i=max{d_(1i),…,d_(mi)}．该结果在许多情形下可以改进Ax- Katz定理,并推广了Wan在m=1时得到的一个定理,而且我们对Wan的定理给出了一个不同的证明．     

On the Equation n_1n_2= n_3n_4 Restricted to Factor Closed Sets

We study the number of solutions N(B,F) of the diophantine equation n_1n_2 = n_3 n_4,where 1 ≤ n_1 ≤ B,1 ≤ n_3 ≤ B,n_2,n_4 ∈ F and F[1,B] is a factor closed set.We study more particularly the case when F={m = p_1~(ε1)···p_k~(εk),ε_j∈{0,1},1 ≤ j ≤ k},p_1,...,p_k being distinct prime numbers.     

Hrmander Type Theorem for Fourier Multipliers with Optimal Smoothness on Hardy Spaces of Arbitrary Number of Parameters

The main purpose of this paper is to establish the Hormander-Mihlin type theorem for Fourier multipliers with optimal smoothness on k-parameter Hardy spaces for k≥ 3 using the multiparameter Littlewood-Paley theory. For the sake of convenience and simplicity, we only consider the case k = 3, and the method works for all the cases k≥ 3:■where x =(x_1,x_2,x_3)∈R~(n_1)×R~(n_2)×R~(n_3) and ξ =(ξ_1,ξ_2,ξ_3)∈R~(n_1)×R~(n_2)×R~(n_3). One of our main results is the following:Assume that m(ξ) is a function on R~(n_1+n_2+n_3) satisfying ■ with s_i n_i(1/p-1/2) for 1≤i≤3. Then T_m is bounded from H~p(R~(n_1)×R~(n_2)×R~(n_3) to H~p(R~(n_1)×R~(n_2)×R~(n_3)for all 0 p≤1 and ■ Moreover, the smoothness assumption on s_i for 1≤i≤3 is optimal. Here we have used the notations m_(j,k,l)(ξ)=m(2~jξ_1,2~kξ_2,2~lξ_3)Ψ(ξ_1)Ψ(ξ_2)Ψ(ξ_3) and Ψ(ξ_i) is a suitable cut-off function on R~(n_i) for1≤i≤3, and W~(s_1,s_2,s_3) is a three-parameter Sobolev space on R~(n_1)×R~(n_2)× R~(n_3).Because the Fefferman criterion breaks down in three parameters or more, we consider the L~p boundedness of the Littlewood-Paley square function of T_mf to establish its boundedness on the multi-parameter Hardy spaces.     

代数特征值反问题可解的充分条件

本文讨论如下代数特征值反问题的可解性:问题G.设A=(a_(ij))和A_k=(a_(ij)~((k)))(k=1,…,n)是一组n+1个n×n实矩     

Rearrangement Inequalities

Ⅰ. Introduction Let (a_(1j), a_(2j),…, a_(t_jj_)(1≤j≤k) be sequences of length, where a_(ij)≥0 and n= be the arranged in non-dec reasingorde:and; and be the a_(ij)(1≤i≤t_j; 1≤j≤k) arranged in non-increasing order: We also write     

一类非参数回归函数估计的性质

设Z_(11),z_(12),…,Z_是在固定点(x_i,y_1),1≤≤n_1,1≤j≤n_2,的n_1n_2个观察值,适合模型 Z_(ij)=g(x_i,y_j)+ε_(ij),1≤i≤n_1,1≤j≤n_2。(1) 本文给出了g的一种估计并讨论了估计的性质。     

High-dimensional D. H. Lehmer problem over short intervals

Letk be a positive integer and n a nonnegative integer,0 λ1,...,λk+1 ≤ 1 be real numbers and w =(λ1,λ2,...,λk+1).Let q ≥ max{[1/λi ]:1 ≤ i ≤ k + 1} be a positive integer,and a an integer coprime to q.Denote by N(a,k,w,q,n) the 2n-th moment of(b1··· bk c) with b1··· bk c ≡ a(mod q),1 ≤ bi≤λiq(i = 1,...,k),1 ≤ c ≤λk+1 q and 2(b1+ ··· + bk + c).We first use the properties of trigonometric sum and the estimates of n-dimensional Kloosterman sum to give an interesting asymptotic formula for N(a,k,w,q,n),which generalized the result of Zhang.Then we use the properties of character sum and the estimates of Dirichlet L-function to sharpen the result of N(a,k,w,q,n) in the case ofw =(1/2,1/2,...,1/2) and n = 0.In order to show our result is close to the best possible,the mean-square value of N(a,k,q) φk(q)/2k+2and the mean value weighted by the high-dimensional Cochrane sum are studied too.     

裁元齐次Moran集的Hausdorff维数

将齐次Moran集迭代过程中的k项序列集Dk={(i1,...,ik):1≤ij≤nj,1≤j≤k}裁减为Dk={(i1,...,ik):1≤ij≤nj, ij≠2 unless ij-1=1, 2≤j≤k},相应的集合称为裁元齐次Moran集．本文确定了一类裁元齐次Moran集的Hausdorff维数．     

轨形Gromov-Witten不变量沿光滑点的加权涨开公式

本文考虑,当一个紧辛轨形群胚(X,ω)沿着光滑点作加权涨开时,它的形如<α_1,…,α_m,[pt]>_(g,A)~X的轨形Gromov-Witten不变量的变化公式,其中[pt]∈H_(dR)~(2n)(X)是生成元,dimX=2n.我们证明了对于非零A∈H_2(|X|,Z),<α_1,…,α_m,[pt]>_(g,A)~X={_(g_1,pl(A)-e’)~xdimX=4,g≥0,∑((-1)g_1·2)/(2g_1+2)!_(g_2,pl(A)-e’)~xdimX=6,g≥0,_(g_1,pl(A)-e’)~xdimX≥8,g=0其中x是X沿一光滑点的权α=(α_1,…,α_n)的加权涨开,且α_1≥α_i,2≤i≤n.     

关于矩阵切触有理插值

1 矩阵切触插值连分式 设实区间[a,b]中由不同点组成的插值结点为x_1,x_2,…,x_n,它们的重数分别为a_1,a_2,… ,a_n,M=sum from i=l to n(a_i-1),与之对应的待插值矩阵集为 {A_i~(k):k=0,1,…,a_i-1,i=1,2,…,n,A_i~(k)=A~(k)(x_i)∈R~(d×d)}. 设方阵A=(a_(ij)),它的广义矩阵逆定义为 A~(-1)= A/‖A‖~2 (A≠0) (1.1)     

关于有限域上线性方程的原根解

设q是一个素数的方幂,F_q是q个元素的有限域.对F_q中任意确定的非零元素a_1,…,a_r及b,如果存在F_q中的原根ξ_1,…,ξ_r,使得a_1ξ_1+…+a_rξ_r=b,则称(ξ_1,…,ξ_r)是方程 a_1x_1+…+a_rx_r=b (1) 的一个原根解。令N(r,q)表示方程(1)的原根解的个数。1952年,文[1]证明