Fokker——Planck——Boltzmann方程

本文研究空间均匀的Fokker--Plan     

RESEARCHANNOUNCEMENTS——TheCauchyProblemsandGlobalSolutionstoDeybeSystemandBurgers''''EquationsinPseudomeasureSpaces

In this paper we consider the construction of solutions to the Cauchy problem of Burgers' equationsut-γ△u + u·▽u = 0, t∈R+,x∈R3, (1)u(0,x)= u0(x), x ∈ R3, (2)in pseudomeasure spaces, where γ(?) 0 is a small parameter that plays the role of the viscosity and u = u(t,x) is a velocity-like vector field defined on R+×R3. The initial datum u0(x) is a vector-valued function defined on R3, In one space dimension Burgers' equation is     

О некоторых свойства х частичных сумм рядо в Фурье—Уолша—Пэли

In this paper we consider the behaviour of partial sums of Fourier—Walsh—Paley series on the group62-01. We prove the following theorems: Theorem 1. Let {n _k } _k ^=1/∞ be some increasing convex sequence of natural numbers such that $$\mathop {\lim sup}\limits_m m^{ - 1/2} \log n_m< \infty $$ . Then for anyf∈L ^∞(G) $$\left( {\frac{1}{m}\sum\limits_{j = 1}^m {|Sn_j (f;0)|^2 } } \right)^{1/2} \leqq C \cdot \left\| f \right\|_\infty $$ . Theorem 2. Let {n _k } _k ^=1/∞ be a lacunary sequence of natural numbers,n _k+1/n _k≧q>1. Then for anyfεL ^∞(G) $$\sum\limits_{j = 1}^m {|Sn_j (f;0)| \leqq C_q \cdot m^{1/2} \cdot \log n_m \cdot \left\| f \right\|_\infty } $$ . Theorems. Let µ _k =2 ^k +2 ^k-2+2 ^k-4+...+2^α ₀,α ₀=0,1. Then $$\begin{gathered} \{ \{ S_{\mu _k } (f:0\} _{k = 1}^\infty ;f \in L^\infty (G)\} = \{ \{ a_k \} _{k = 1}^\infty ;\sum\limits_{k = 1}^m {a_k^2 = 0(m)^2 \} .} \hfill \\ \{ \{ S_{\mu _k } (f:0\} _{k = 1}^\infty ;f \in C(G)\} = \{ \{ a_k \} _{k = 1}^\infty ;\sum\limits_{k = 1}^m {a_k^2 = o(m)^2 \} = } \hfill \\ = \{ \{ S_{\mu _k } (f:0\} _{k = 1}^\infty ;f \in C(G),f(0) = 0\} \hfill \\ \end{gathered} $$ . Theorem 4. {{S ₂ k(f: 0)} _k ^=1/∞ ,f∈L ^∞(G)}=m. $$\{ \{ S_{2_k } (f:0\} _{k = 1}^\infty ;f \in C(G)\} = c. \{ \{ S_{2_k } (f:0\} _{k = 1}^\infty ;f \in C(G),f(0) = 0\} = c_0 $$ .     

数学王子——高斯

高斯是近代数学伟大的奠基人之一 ,被人们誉为“数学王子” .他与阿基米德、牛顿一起被称为历史上最伟大的三位数学家 .高斯出生在一个贫苦的家庭里 ,祖父是农民 ,父亲做短工 .“穷人的孩子早当家” ,高斯从小爱动脑筋 ,如果承认历史上有神童 ,那么 ,高斯就是其中之一 .传说有一次 ,他父亲计算账目 ,小高斯在旁边好奇地看着 ,等父亲好不容易算完后 ,想不到小高斯说 :“爸爸 ,你算错了 ,应该是……” .经过核对 ,果然是小高斯正确 .高斯的父亲又惊又喜 ,本来不想送他上学 ,考虑到他出奇的聪明好学 ,于是在他 7岁的时候送他进了小学 .小高斯经…     

方法—效果—能力

数学教学的根本目的是使学生获得知识,同时发展学生的智力,培养学生的能力。要过河必须有船或桥,要达到教学目的,必须有行之有效的方法。怎样的方法有利于学生获得知识,有利于培养学生的能力呢?的确这是数学教学中不断研究探索的一个课题,也是关系到数学教学提高质量的重大问题,对此笔者根据自己的教学实践谈点浅见。一教学方法以少胜多数学上的解题是学生所学知识的综合运用,是培养学生能力的集中表现。因而,教给学生解题的思考方法是教学的关键所在。教学实践使我体会到:教方法,以少胜多,事半功倍。下面举例谈谈做法。     

反思—发现—再反思—再发现

学习数学的过程是发现问题和解决问题的过程 .要想发现问题 ,首先要思考 .思考的方式很多 ,在解决一个问题后 ,反思就是一种常用的思考方法 ,这种思考是在一定基础上对问题进行比较、深化和提高 ,这样的思考有利于我们优化解决问题的方法 ,培养思维的广阔性 .下面是笔者在教学中遇到的一例 .问题　已知点A( -1,-3 )为圆x2 +y2=4上一定点 ,B、C为圆上另外两动点 ,且∠BAC =3 0°,求△ABC面积的最大值 .分析　这是一个解析几何中的最值问题 ,解决这类问题的常用方法是 :引入参数 ,建立关于面积的目标函数 ,然后再求解 .设立怎样的参数是解…     

关于G——对称多项式

本文将对称多项式的基本定理推广到了关于一般群为对称的多元多项式中,并指出了这一推广在构造含有某些指定根的方程方面的应用。     

Demi-linear analysis Ⅱ——demi-distributions

In this paper, we develop the theory of demi-distributions which generalizes the usual distribution theory. In particular, we show that many results on differentiations, Fourier transforms, and convolutions can be generalized to demi-distributions theory.     

F—析取ω —语言

关于ω—语言的讨论,基本上者是从文法与自动机的角度([1],[2],[3]).但近年来,许多人从代数学的角度来研究ω—语言的特性([4],[5]).本文从语言的句法么半群出发.作为[5]中讨论的析取ω—语言的拓广,定义了 f—析取ω—语言,讨论了这类语言的若干特性.     

Existential monadic second order logic on random rooted trees

We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressible as an existential monadic second order sentence (EMSO). On the other hand, finiteness is not expressible as an EMSO. For a broad class of random tree models, including Galton–Watson trees with offspring distributions that have full support, we prove the stronger statement that finiteness does not agree up to a null set with any EMSO. We construct a finite tree and a non-null set of infinite trees that cannot be distinguished from each other by any EMSO of given parameters. This is proved via set-pebble Ehrenfeucht games (where an initial colouring round is followed by a given number of pebble rounds).     

树的线图的图扩充问题

图G的弦图扩充问题包含两个问题:图G的最小填充问题和树宽问题,分别表示为f(G)和TW(G);图G的区间图扩充问题也包含两个问题:侧廓问题和路宽问题,分别表示为P(G)和PW(G).对一般图而言,它们都是NP-困难问题.一些特殊图类的填充数、树宽、侧廓问题和路宽具体值已被求出.主要研究树T的线图L(T)的弦图扩充问题;其次涉及到了两类特殊树—毛虫树和直径为4的树的线图的区间图扩充问题.     

On arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ; from a result by Barth and Fournier it follows that Δ(T)?4. A necessary and a sufficient condition for being an arbitrarily vertex decomposable star-like tree have been exhibited. The conditions seem to be very close to each other.     

Packing two copies of a tree into its third power

A graph H of order n is said to be k-placeable into a graph G of order n, if G contains k edge-disjoint copies of H. It is well known that any non-star tree T of order n is 2-placeable into the complete graph K_n. In the paper by Kheddouci et al. [Packing two copies of a tree into its fourth power, Discrete Math. 213 (2000) 169-178], it is proved that any non-star tree T is 2-placeable into T⁴. In this paper, we prove that any non-star tree T is 2-placeable into T³.     

ON NUMBER OF LEAVES ANDBANDWIDTH OF TREES

1.IntroductionFOragraphG=(V,E)oforderp,aonetoonemappingfromVinto{l,2,',p}iscalledanumberingofG.Definition1.1.SupposefisanumberingofG.LetBj(G)=(u57teif(u)--f(v)l.ThebandwidthofG,denotedbyB(G),isdefinedbyB(G)=min{Bf(G)IfisanumberingofG}.Thebandwidthproblemofgraphshasbecomeveryimportantsincethemid-sixties(see[21or[4]).Itisverydifficulttodeterminethebandwidthofagraph.GareyetallllshowedthatthebandwidthproblemisNP-completeevenifitisrestrictedtotreeswithmaximumdegree3.Soitisinterestingtoe…     

给定度序列图的覆盖成本和反向覆盖成本的研究

具有n个顶点且度序列为(m,2,…,2,1,…,1)(1的重数为m)的连通图不止一个(这些图均为树),而每个树对应唯一一个段序列(l1,l2,…,lm).通过对任意一树移动最长段的悬挂点到最短段悬挂点的方式得到另一树,比较前后两树的覆盖成本和反向覆盖成本,给出了具有最小覆盖成本和反向覆盖成本的极树,并且进一步给出了取得...     

LIMITING BEHAVIOR OF UNIFORM RECURSIVE TREES

The authors consider the limiting behavior of various branches in a uniform recursive tree with size growing to infinity.The limiting distribution ofζ_(n,m),the number of branches with size m in a uniform recursive tree of order n,converges weakly to a Poisson distribution with parameter 1/m with convergence of all moments.The size of any large branch tends to infinity almost surely.     

Partitioning infinite trees

A graph G is bisectable if its edges can be colored by two colors so that the resulting monochromatic subgraphs are isomorphic. We show that any infinite tree of maximum degree Δ with infinitely many vertices of degree at least Δ −1 is bisectable as is any infinite tree of maximum degree Δ ≤ 4. Further, it is proved that every infinite tree T of finite maximum degree contains a finite subset E of its edges so that the graph T − E is bisectable. To measure how “far” a graph G is from being bisectable, we define c(G) to be the smallest number k > 1 so that there is a coloring of the edges of G by k colors with the property that any two monochromatic subgraphs are isomorphic. An upper bound on c(G), which is in a sense best possible, is presented. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 113–127, 2000     

Cayley树上非对称马氏链的强大数定律及渐近均分割性

In this paper,we study the strong law of large numbers for the frequencies of occurrence of states and ordered couples of states for nonsymmetric Markov chain（NSMC） indexed by Cayley tree with any finite states.The asymptotic equipartition properties with almost everywhere（a.e.） convergence for NSMC indexed by Cayley tree are obtained.This article generalizes a recent result.     

Szeged index, edge Szeged index, and semi-star trees

A semi-star tree is a star tree whose some edges may be replaced by paths of length more than one. In this paper we present some increasing and decreasing transformations for Szeged index of the semi-star trees. Then we introduce palm semi-star tree and uniform semi-star tree and show that they are extremal with respect to the Szeged index and edge Szeged index. In addition, we investigate the relation between the Szeged index and edge Szeged index for all trees.