自由群的直积的检验元素的注记

本文研究了自由群的直积的检验元素,通过对直积的自同态的分解,得到了直积中的元素为检验元素的充分必要条件,改进了O'neill和Turner的结果.此外,构造了两类具体的检验元素.     

乘方的指数与其幂的位数的关系

为了探究乘方的指数与其幂的位数的关系,定义了几个有关的新概念,并且证明了两个关于乘方以及进制进位的定理,由此建立起关于乘方以及进制进位的理论体系,其中包括进位理论中判定乘方的指数与其幂的位数是否存在周期规律的判别法,以及进位规律的求解法和四条相关的性质.     

树的最大特征值的上界的一个注记

设T是一个树,V是T的顶点集．记dv是υ∈V的度,△是T的最大顶点度．设υ∈V且dw=1．记k=ew+1,这里ew是w的excentricity．设δj′= max{dυ:dist(υ,w)=j},j=1,2,…,k-2,我们证明和这里μ1(T)和λ1(T)分别是T的Laplacian矩阵和邻接矩阵的最大特征值．特别地,记δo′=2．     

计算Hamilton矩阵特征值的一个稳定的有效的保结构的算法

提出了一个稳定的有效的保结构的计算Hamilton矩阵特征值和特征不变子空间的算法,该算法是由SR算法改进变形而得到的。在该算法中,提出了两个策略,一个叫做消失稳策略,另一个称为预处理技术。在消失稳策略中,通过求解减比方程和回溯彻底克服了Bunser Gerstner和Mehrmann提出的SR算法的严重失稳和中断现象的发生,两种策略的实施的代价都非常低。数值算例展示了该算法比其它求解Hamilton矩阵特征问题的算法更有效和可靠。     

Lindelf的工作与Chaplygin的工作的互补性

运用Vakonomic模型导出Lindel f方程 ,表明Lindel f的工作与Vakonomic模型相吻合 ;运用Chetaev模型导出Chaplygin方程 ,表明Chaplygin的工作与Chetaev模型相吻合·　在此基础上 ,通过改进Chaplygin方程和Lindel f方程的表示形式 ,实现了从Lindel f方程向Chaplygin方程的合理过渡和从Chaplygin方程向Lindel f方程的合理的过渡·　最后 ,给出一个典型实例·　结果表明 ,正如Vako nomic模型与Chetaev模型是互补的一样 ,Lindel f的工作与Chaplygin的工作也是互补的·     

不同的公理不同的几何

一位语文老师在博客上写反思.他在教《自相矛盾》这则寓言时,有学生站起来反驳:有这么傻的人么?太不可信了吧.面对这样大胆质疑的学生,这位老师不知如何处理为好! 现在的学生比以前更敢想敢做了.     

多维的一般的BBM-Burgers方程解的逐点估计

研究R~n中一般的BBM-Burgers方程解的渐进行为.运用Green函数法和Fourier分析方法得到了在非零常状态u~*附近小扰动解的逐点估计,作为一个推论,又得到了L~p(R~n)(1≤p∞)空间解的最佳的衰减估计.     

一元二次方程根的判别式的应用

<正>一元二次方程根的判别式是初中数学的重要内容,本文以近年中考中所考查的题型为例,归纳整理如下,供同仁们参考.一、求待定字母的取值范围(1)已知方程根的情况,求待定字母的取值范围例1若关于x的方程(k-1)x2+2(k)^(1/2)x+1=0有两个不相等的实数根.求k的獉獉取值范围.析解由题意"方程有两个不相等的实数獉獉根"可知:该方程是一元二次方程,且Δ>0,即     

纯正的群的正则带的构造

本文研究纯正的群的正则带.在给出这类半群的若干特征后,建立了纯正的群的正则带的构造定理.作为应用,同时给出了纯正的群的右拟正规带的构造定理.     

证明圆的切线的常用策略

圆的切线是初中数学的重点内容之一,也是中考的主要考察对象.本文举例介绍证明圆的切线的几种常用策略.一、当讨论的问题涉及圆的半径r及圆心到直线的距离d这样的数量关系时,往往可以     

On the Action of a Groupoid on a Manifold

In this paper,some properties of reduction for symplectic F-spaces are discussed.The properties of stable subgroups are discussed.We find that the symplectic action of a symplectic groupoid on a symplectic manifold can induce a symplectic map between reduced symplectic manifolds.This symplectic action can be characterized by the action of its induced symplectic groupoid on a symplectic manifold.Lastly,we shall discuss Poisson reduction and give a Poisson reduction theorem.     

On the duration of the total eclipse of a satellite of a body

This paper solves the problem of the duration of the total eclipseof a satellite of a body, provided that (a) the body is sphericalin shape and the mass distribution inside the body is sphericallysymmetrical; (b) the satellite is a very small object; (c) thesatellite's orbit around a body is circular and the satellitecan pass through the centre of its shadow; (d) a source of lightis the source of the conical body's shadow (umbra) and it doesnot change its apparent position in the sky; (e) there are noperturbations on the satellite's orbit. The solution presentedrepresents the general discussion of the problem based on utilizationof some parts of the theory of contraction mappings.     

On the nature of turbulence in a problem on the motion of a fluid behind a ledge

In the present paper, we suggest a numerical method for the analysis of the motion of a viscous incompressible fluid under the transition to the turbulent mode for an example of the numerical solution of a three-dimensional space problem on the fluid flow behind a ledge for various values of the Reynolds number. We show that, at the initial stages, the turbulence in the problem is developed via successive bifurcations of generation of a stable cycle, two-dimensional tori, and then three-dimensional tori in the infinite-dimensional phase space of the system.     

On the decisiveness of a game in a tournament

In sport tournaments in which teams are matched two at a time, it is useful for a variety of reasons to be able to quantify how important a particular game is. The need for such quantitative information has been addressed in the literature by several more or less simple measures of game importance. In this paper, we point out some of the drawbacks of those measures and we propose a different approach, which rather targets how decisive a game is with respect to the final victory. We give a definition of this idea of game decisiveness in terms of the uncertainty about the eventual winner prevailing in the tournament at the time of the game. As this uncertainty is strongly related to the notion of entropy of a probability distribution, our decisiveness measure is based on entropy-related concepts. We study the suggested decisiveness measure on two real tournaments, the 1988 NBA Championship Series and the UEFA 2012 European Football Championship (Euro 2012), and we show how well it agrees with what intuition suggests. Finally, we also use our decisiveness measure to objectively analyse the recent UEFA decision to expand the European Football Championship from 16 to 24 nations in the future, in terms of the overall attractiveness of the competition.     

关于一个素数和一个素数的k次方和问题

设k≥2,且Hk表示一个正整数n的集合,使得该集合中的元素满足a+bk≡n(modq)对任意的q,在模q的既约剩余系中有解,令Dk(N)表示所有的n≤N,且n∈Hk且不能表成p1+p2k=n形式的整数.那么在GRH下, Dk(N)相似文献   

关于群中乘积元素的阶

讨论群中两个元素a,b的阶不相等时其乘积ab的阶的一类计算问题.设ㄧaㄧ=m,ㄧ bㄧ=n,若(m,n)=1,且存在k∈N使a=bk,则有ㄧabㄧ=mn/d1d2,其中d1=(m,k+1),d2=(n,k+1).若m≠n,ab=ba,且(m,n)ㄧm/(m,n),或(m,n)ㄧn/(m,n),则有ㄧabㄧ=[m,n].     

一个素数和一个素数的平方和问题

H表示一个正整数N的集合,使对任意的正整数q,同余方程a+b~2≡N(mod q)在模q的既约剩余系中有解a;b.E(x)表示N≤x,N∈H,但不能表成p_1+p_2~2=N的数的个数,其中p_1,p_2个表示素数,则E(x)<相似文献   

An analysis of the a priori and a posteriori

I present and defend a unified, non-reductive analysis of the a priori and a posteriori. It is a mistake to remove all epistemic conditions from the analysis of the a priori (as, for example, Alvin Goldman has recently suggested doing). We can keep epistemic conditions (like unrevisability) in the analysis as long as we insist that a priori and a posteriori justification admit of degrees. I recommend making the degree to which a belief’s justification is a priori or a posteriori solely dependent on the revisability relations that obtain among the faculties that deliver the belief and all other faculties.     

On the probability of the occurrence of a copy of a fixed graph in a random distance graph

The threshold probability of the occurrence of a copy of a balanced graph in a random distance graph is obtained. The technique used by P. Erd?s and A. Rényi for determining the threshold probability for the classical random graph could not be applied in the model under consideration. In this connection, a new method for deriving estimates of the number of copies of a balanced graph in a complete distance graph is developed.