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

一元二次方程的根的判别式是初中代数的重要内容之一 ,它在中学数学中有着广泛的应用 ,成为近几年全国各地中考的热点问题 .为了帮助读者更好地掌握好这部分知识内容 ,现对它在初中数学中的应用进行归纳 ,以餮读者 .应用一 :判断一元二次方程 (或二元二次方程组 )的根的情况 ;或已知根的情况 ,求方程 (或组 )中的待定系数的取值范围 .一元二次方程ａｘ2 +ｂｘ +ｃ =0 (ａ≠ 0 )的根的判别式为△ =ｂ2 - 4ａｃ,它与这个方程的根有着十分密切的关系 :( 1)△ >0 方程有两个不等的实数根 ;( 2 )△ =0 方程有两个相等的实数根 .( 3)△ <0 方程…     

纯正的群的正则带的构造

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

图的邻域复形的同调群的不变性

本文研究了图的邻域复形同调群的不变性质。设G是一个简单连通图,x是G的一个顶点,以G/x表示G中剔去点v及其关联边而得到的图,给出了G和G/x的邻域复形的同阶同调群同构的充要条件。     

多项式的根的一个性质的判定

文献[1]在讨论多项式型的函数迭代方程的局部解析解的存在性时涉及到了多项式的根的一个性质.本文给出了判定该性质是否成立的一个简洁的条件,证明了多项式λ_nzⁿ+…+λ₂z²+λ₁z+λ₀有一个根α满足inf{｜λ_nα^nm+…+λ₂a^2m+λ₁α^m+λ₀｜：m=2,3,…｝>0当且仅当如下两个条件之中至少有一个成立：(i)该多项式有一个根β满足｜β｜>1;(ii)该多项式有一个根β满足｜β｜<1,且λ₀≠0.     

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

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

鞅的极大函数的Lp-范数的上界

设 2 ≤ p<∞ ,(fn)是一个鞅 ,利用P(｜fn｜>λ‖T(fn)‖∞)型的概率指数界 ,其中 ,T是作用在鞅上的拟线性算子 ,本文估计了鞅的极大函数的Lp_范数的上界。本文结果改进与推广了先前由HITCZENKO [7,8,9]与作者 [1 0 ]得到的结果     

算术课的开始的组织

每堂课的开始的合理组织,使很多教师感到困难,而且不仅是初教书的教师而已.每堂课的开始是由下列因素组成的:1. 家庭作业的检查.2. 能达到各种目的的口算作业.3. 为准备学习新教材和巩固旧教材的复习提问.4. 为了检查独立完成家庭作业的简短书     

关于子空间的和的推广的注记

对向量空间的子空间的和的概念不能推广到无限多个子空间的情形进行了讨论.     

■的解的稳定性

<正> 零解的稳定性,还没有一般解决的方法.许多研究工作者,都寻求保证解的稳定的充分条件.例如[1],[2],[3],[4]等等.事实上,要验证上述方法的条件是否满足,亦非常困难.如[1]要求已知方程的特征方程的根均具有负实部,因而必须验证 n 阶行列式(含 t)的不     

随机变量的差的分布函数的积分表达式

本文利用Lebesgue-Stieltjes积分，把连续型随机变量差的密度函数的积分表选式推广为一般随机变量的分布函数的积分表达式。     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

Asymptotics of families of solutions of nonlinear difference equations

One method to determine the asymptotics of particular solutions of a difference equation is by solving an associated asymptotic functional equation. Here we study the behaviour of the solutions in an asymptotic neighbourhood of such individual solutions. We identify several types of attraction and repulsion, which range from almost orthogonality to almost parallelness. Necessary and sufficient conditions for these types of behaviour are given.     

图表示范畴的两个子范畴

引进图表示范畴的两个子范畴,研究它们的同调性质。     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².