关于一类中心循环的有限P-群的自同构群

确定了一类中心循环的有限p-群G的自同构群.设G=X_3(p~m)~(*n)*Z_(p~(m+r)),其中m≥1,n≥1和r≥0,并且X_3(p~m)=x,y|x~(p~m)=y~(p~m)=1,[x,y]~(p~m)=1,[x,[x,y]]=[y,[x,y]]=1.Aut_nG表示Aut G中平凡地作用在N上的元素形成的正规子群,其中G'≤N≤ζG,|N|=p~(m+s),0≤s≤r,则(i)如果p是一个奇素数,那么AutG/Aut_nG≌Z_(p~((m+s-1)(p-1))),Aut_nG/InnG≌Sp(2n,Z_(p~m))×Z_(p~(r-s)).(ii)如果p=2,那么AutG/Aut_nG≌H,其中H=1(当m+s=1时)或者Z_(2~(m+s-2))×Z_2(当m+s≥2时).进一步地,Aut_nG/InnG≌K×L,其中K=Sp(2n,Z_(2~m))(当r0时)或者O(2n,Z_(2~m))(当r=0时),L=Z_(2~(r-1))×Z_2(当m=1,s=0,r≥1时)或者Z_(2~(r-s)).     

借助于圓的二次方程的图解

1.假設已知化簡后的二次方程 x~2 px q=0配成完全平方: (x p/2)~2-(p~2/4-q)=0, -(x p/2)~2 (p~2/4-4)=0。用y~2表示方程的左端 y~2=(p~2/4-q)-(x p/2)~2,由此, (x p/2)~2 y~2=p~2/4-q,所得到的是一个圓的方程,其圓心为点(-p/2,0),半径为r=(p~2/4-q)~(1/p~2/4-q),此圓与Ox軸的交点的横坐标就是二次方程的根。例.图解方程 3x~2-8x-51=0,化簡后的方程是 x~2-2(2/3x)-17=0,或者 -(x-1(1/3))~2 18(7/9)=0。用y~2表示它的左端,得到一个圓的方程 (x-1(1/3)))~2 y~2=18(7/9)。圓心在点(1(1/3),0)半径等于当x=1(1/3)时的y的     

交点似有似无

我们来研究当正数P取何值时,圆(x-1/2p)~2 y~2=1与抛物线y~2=2px 有公共点。将两方程联立,消去y整理即方程 x~2 px 1/4p~2-1=0 (*) ∵△=p~2-4(1/4p~2-1)=4>0 所以方程(＊)恒有实根,圆与抛物线恒有公共点。然而,倘若假想p趋向正无穷大,我们知道,此时圆的大小不变,圆心将沿x轴正向移     

丢番图方程X~2-(a~2+4p~(2n))Y~4=-4p~(2n)

令α,n≥1为整数,p为素数.本文证明了丢番图方程X~2-(a~2+4p~(2n))Y~4=-4p~(2n)以及X~2-(a~2+p~(2n))Y~4=-p~(2n)在一定条件下最多只有两组互素的正整数解(X,Y).     

一类p′-自由的幂零群的p-自同构(Ⅱ)

设G=KP,其中K是有限生成的p′-自由的幂零群,P是有限秩的幂零p-群,并且[K,P]=1,即G是K和P的中心积,α和β是G的两个p-自同构,记I:=〈(αβ(g))·(βα(g))~(-1)|g∈G〉,则(i)当I=Z_(p~n)(?)Z_(p~∞)时,α和β生成一个可解的剩余有限p-群,它是有限生成的无挠幂零群被有限p-群的扩张;在下列3种情形下,α和β生成一个可解的剩余有限p-群,其幂零长度不超过3.(ii)当I=Z(?)Z_(p~∞)时;(iii)当I有正规列1相似文献   

Smarandache函数的几类相关方程的解

设φ(n),S(n)分别表示正整数n的Euler函数和Smarandache函数,利用初等的方法和技巧,依据Smarandache函数计算公式,给出k的方程φ(p~αm)=S(p~(ακ))的所有解,其中p为素数,α,m为正整数且gcd(m,p)=1,由此得到方程φ(n)=S(n~k)的所有解(n,k)进而确定了满足条件S(n)|σ(n)的全部正整数n.最后,根据莫比乌斯变换反演定理证明了方程φ(n)=∑_(d|n)S(d)仅有两个解,分别为n=2~5和n=3×2~5.     

蝴蝶定理在高考试题中的应用——2022全国甲卷理科第20题背景探幽

<正>1 试题呈现例 (2022全国甲卷520)设抛物线C:y2=2px(p>0)的焦点为F,点D(p,0),过点F的直线交C于M,N两点.当直线MD垂直于x轴时，|MF|=3.(1)求C的方程；(2)设直线MD,ND与C的另一个交点分别为A,B,     

广义超特殊p-群的自同构群Ⅲ

确定了广义超特殊p-群G的自同构群的结构.设|G|=p~(2n+m),|■G|=p~m,其中n≥1,m≥2,Aut_fG是AutG中平凡地作用在Frat G上的元素形成的正规子群,则(1)当G的幂指数是p~m时,(i)如果p是奇素数,那么AutG/AutfG≌Z_((p-1)p~(m-2)),并且AutfG/InnG≌Sp(2n,p)×Zp.(ii)如果p=2,那么AutG=Aut_fG(若m=2)或者AutG/AutfG≌Z_(2~(m-3))×Z_2(若m≥3),并且AutfG/InnG≌Sp(2n,2)×Z_2.(2)当G的幂指数是p~(m+1)时,(i)如果p是奇素数,那么AutG=〈θ〉■Aut_fG,其中θ的阶是(p-1)p~(m-1),且Aut_f G/Inn G≌K■Sp(2n-2,p),其中K是p~(2n-1)阶超特殊p-群.(ii)如果p=2,那么AutG=〈θ_1,θ_2〉■Aut_fG,其中〈θ_1,θ_2〉=〈θ_1〉×〈θ_2〉≌Z_(2~(m-2))×Z_2,并且Aut_fG/Inn G≌K×Sp(2n-2,2),其中K是2~(2n-1)阶初等Abel 2-群.特别地,当n=1时...     

广义离散傅里叶变换的模多项式分解算法(MPDA)及其矩阵表现形式

§1.引言 离散傅里叶变换(DFT)和卷积计算在图象、数字信号处理中起着极为重要的作用,它们是实现数字滤波、进行频谱分析的基本工具.因此,其快速算法的研究异常活跃.在以上众多算法中,由于基-2、基-4快速傅氏变换(FFT)算法具有简洁的蝶式结构,并且可在原置实现等特点,应用极为广泛.70年代末提出的数论变换、多项式变换已发展成完整的理论,成为处理多维DFT和卷积的有力工具.然而它们对一般一     

具有凹凸非线性项和变号位势函数拟线性椭圆系统解的多重结果

研究拟线性椭圆系统(?)的非平凡非负解或正解的多重性,这里Ω(?)R~N是具有光滑边界(?)Ω的有界域,1≤qp~*/p~*-q,其中当N≤p时,p~*=+∞,而当1相似文献   

关于矩阵乘法与整数卷积最佳算法运算量的估计

§1.引言 [1]通过构造一个大整数然后作整数乘除法给出了用于有理数矩阵相乘的算法,运算量为O(n~2),达到了矩阵乘法复杂性下界,是最佳算法。[2]曾指出[1]中忽略了不同字长有不同运算量这一事实。但对[1]中算法复杂性未作具体讨论和质疑。最近,[3]—[4]采用类似于[1]中的大整数乘除法分别提出整数向量卷积的算法,并认为运算量级为     

On the Poles of Rankin-Selberg Convolutions of Modular Forms

The Rankin-Selberg convolution is usually normalized by the multiplication of a zeta factor. One naturally expects that the non-normalized convolution will have poles where the zeta factor has zeros, and that these poles will have the same order as the zeros of the zeta factor. However, this will only happen if the normalized convolution does not vanish at the zeros of the zeta factor. In this paper, we prove that given any point inside the critical strip, which is not equal to and is not a zero of the Riemann zeta function, there exist infinitely many cusp forms whose normalized convolutions do not vanish at that point.

     

Fourier coefficients of Siegel cusp forms of genus n

Let F(Z) be a cusp form of integral weight k relative to the Siegel modular group Sp_n(Z) and let f(N) be its Fourier coefficient with index N. Making use of Rankin's convolution, one proves the estimate (1) $$f(\mathcal{N}) = O(\left| \mathcal{N} \right|^{\tfrac{k}{2} - \tfrac{1}{2}\delta (n)} ),$$ where $$\delta (n) = \frac{{n + 1}}{{\left( {n + 1} \right)\left( {2n + \tfrac{{1 + ( - 1)^n }}{2}} \right) + 1}}.$$ Previously, for n ≥ 2 one has known Raghavan's estimate $$f(\mathcal{N}) = O(\left| \mathcal{N} \right|^{\tfrac{k}{2}} )$$ In the case n=2, Kitaoka has obtained a result, sharper than (1), namely: (2) $$f(\mathcal{N}) = O(\left| \mathcal{N} \right|^{\tfrac{k}{2} - \tfrac{1}{4} + \varepsilon } ).$$ At the end of the paper one investigates specially the case n=2. It is shown that in some cases the result (2) can be improved to, apparently, unimprovable estimates if one assumes some analogues of the Petersson conjecture. These results lead to a conjecture regarding the optimal estimates of f(N), n=2.     

The bit-complexity of arithmetic algorithms

Time-complexity and space-complexity of arithmetic algorithms without divisions measured by the number of binary bits processed in computations are estimated for algorithms for discrete Fourier transform (DFT) and polynomial multiplication (PM, or convolution of vectors). It is proved that $\text{Ω(N}{}^2\text{)}$ bit-operations are required in an evaluation-interpolation algorithm for PM over the field of real constants while O(N log²N) arithmetic operations suffice.     

二次系统极限环的相对位置与个数

<正> 中的P_2(x,y)与Q_2(x,y)为x,y的二次多项式.文[1].曾指出,系统(1)最多有三个指标为+1的奇点,且极限环只可能在两个指标为+1的奇点附近同时出现.如果方程(1)的极限环只可能分布在一个奇点外围,我们就说此系统的极限环是集中分布的.本文主要研究具非粗焦点的方程(1)的极限环的集中分布问题,和极限环的最多个数问题.文[2]-[5]曾证明,当方程(1)有非粗焦点与直线解或有两个非粗焦点或有非粗焦点与具特征根模相等的鞍点时。方程(1)无极限环.本文给出方程(1)具非粗焦点时,极限环集     

Convolution quadrature and discretized operational calculus. I

Numerical methods are derived for problems in integral equations (Volterra, Wiener-Hopf equations) and numerical integration (singular integrands, multiple time-scale convolution). The basic tool of this theory is the numerical approximation of convolution integrals

Operators of discrete convolution type and their Noetherianess

The class of all multiplication operators is described which up to a compact summand commute with the convolution operators in , where H is an infinite discrete Abelian group. A criterion is established for the operators in the algebra generated by these multiplication operators and the convolution operators to be Noetherian.Translated from Matematicheskie Zametki, Vol. 23, No. 3, pp. 417–423, March, 1978.The author is grateful to V. S. Pilidya for much valuable advice.     

Approximation of convolutions by accompanying laws under the existence of moments of low orders

It is shown that if a one-dimensional distribution F has finite moment of order 1+β for some β, 1/2≤β≤1, then the rate of approximation of the n-fold convolution Fⁿ by accompanying laws is O(n^−1/2). Futhermore, if Eξ² = ∞ and 1/2<β<1, then the rate of approximation is o(n^−1/2). The question about the true rate of approximation of Fⁿ by infinitely divisible and accompanying laws is discussed. Bibliography: 27 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 228, 1996, pp. 135–141.     

r－轮换矩阵快速求逆算法的推广

ｒ－轮换矩阵快速求逆算法的推广成礼智（国防科技大学）ＴＨＥＧＥＮＥＲＡＬＩＺＡＴＩＯＮＯＦＴＨＥＦＡＳＴＡＬＧＯＲＩＴＨＭＦＯＲＩＮＶＥＲＴＩＮＧｒ－ＣＩＲＣＵＬＡＮＴＭＡＴＲＩＣＥＳ￥ＣｈｅｎｇＬｉ－ｚｈｉ（ＮａｔｉｏｎａｌＵｎｉｖｅｒｓｉｔｙｏｆ...     

Sums of random symmetric matrices and quadratic optimization under orthogonality constraints

Let B _i be deterministic real symmetric m × m matrices, and ξ _i be independent random scalars with zero mean and “of order of one” (e.g., ). We are interested to know under what conditions “typical norm” of the random matrix is of order of 1. An evident necessary condition is , which, essentially, translates to ; a natural conjecture is that the latter condition is sufficient as well. In the paper, we prove a relaxed version of this conjecture, specifically, that under the above condition the typical norm of S _N is : for all Ω > 0 We outline some applications of this result, primarily in investigating the quality of semidefinite relaxations of a general quadratic optimization problem with orthogonality constraints , where F is quadratic in X = (X ₁,... ,X _k ). We show that when F is convex in every one of X _j , a natural semidefinite relaxation of the problem is tight within a factor slowly growing with the size m of the matrices . Research was partly supported by the Binational Science Foundation grant #2002038.