若干个齐次对称康托集的交

Γ是齐次对称康托集,对n个实数t_1,…,t_n讨论了交集Γ∩(Γ+t_1)∩…∩(Γ+t_n)≠(?)的条件,以及计算出Γ∩(Γ+t_1)∩…∩(Γ+t_n)的Hausdorff维数的精确表达式.     

BEST SIMULTANEOUS Lp APPROXIMATION

In this paper we discuss the exigtenoe of best simultaneous L_p approximation and give the characterization theorems of best simultaneous L_p approximation using the elements of an arbitrary quasioonvex set K in the space \[{L_p}(X,\sum ,\mu )\], A set \[K \subset {L_p}(X,\sum ,\mu )\] is called quasiconvex if for arbitrary elements \[{h_1},{h_2} \in K\] there exists a sequenoe \[{t_n} > 0\] (n = l, 2, ...), \[{t_n} > 0\]->0 (n—>∞) such that \[{t_n}{h_1} + (1 - {t_n}){h_2} \in \bar K(n = 1,2,...)\] where \[{\bar K}\] denotes a closure of K.     

字典序地生成有序根树的一个算法

§1.引言由于树的生成在计算机科学中有着重要应用,近年来许多文章研究了树的生成,其中大多数文章是讨论2分树及 k 分树的生成.研究一般有序根树的文章尚少.文献[1]给出了有序根树的一个序列表示法,并描述了一个生成有序根树的算法.文献[2]及[3]讨论了生成2分树及 k 分树的算法.本文用0,1序列表示有序根树,并给出了一个字典序地生成具有 n 个顶点的所有有序根树的算法.本文的表示法及算法与文献[1]中所提方法不同.本算法亦可用来生成具有 n 个叶子的所有2分树.它比[2]中的算法更简单.本文中未加说明的术语皆见[1].     

按字典序遍数K分树

本文研究了Ll-限制K分树,文中用叶子的层数表示一个K分树,每个具有n个叶子的K分树对应一个n个正整数组成的序列.首先给出由n个正整数组成的序列代表一个具有n个叶子的Ll-限制K分树的充分必要条件.然后给出一个字典序列出所有具有n个叶子的Ll-限制K分树的算法.     

FREDHOLM OPERATORS ON THE SPACE OF BOUNDED SEQUENCES

Necessary and sufficient conditions are studied that a bounded operator T_x =(x_1~*x, x_2~*x,···) on the space ?_∞, where x_n~*∈ ?_∞~*, is lower or upper semi-Fredholm; in particular, topological properties of the set {x_1~*, x_2~*,···} are investigated. Various estimates of the defect d(T) = codim R(T), where R(T) is the range of T, are given. The case of x_n~*= d_nx_(tn)~*,where dn ∈ R and x_(tn)~*≥ 0 are extreme points of the unit ball B_?_∞~*, that is, t_n ∈βN, is considered. In terms of the sequence {t_n}, the conditions of the closedness of the range R(T)are given and the value d(T) is calculated. For example, the condition {n:0 |d_n| δ} = Φ for some δ is sufficient and if for large n points tn are isolated elements of the sequence {t_n},then it is also necessary for the closedness of R(T)(t_(n0) is isolated if there is a neighborhood U of t_(n0) satisfying t_n ■ U for all n ≠ n0). If {n:|d_n| δ} =Φ, then d(T) is equal to the defect δ{_tn} of {t_n}. It is shown that if d(T) = ∞ and R(T) is closed, then there exists a sequence {A_n} of pairwise disjoint subsets of N satisfying χ_(A_n)■R(T).     

多项式不动点的进一步研究

对文[1]中关于多项式不动点的主要定理进行了修正和发展,进而研究了多项式的广义(高阶)不动点,证明了对任意给定的n个点t_1≤t_2≤…≤t_n,存在唯一的首项系数为α∈R(α≠0)的n次多项式P(x)以它们为广义不动点.     

Equivalence of Non-Gaussian Linear Processes

Two random processes x_t and y_t on an index set G are said to be equivalent iffor any positive integer n and any t_1,t_2,…,t_n∈G, (x_(t_1),x_(t_2),…,x_(t_n)) and (y_(t1),y_(t2),…, y_(t_n)) have the same joint probability distributions. Note that x_t and y_t may betwo random processes on a probability space or on two different probability spaces. The Equivalence Theorem Let x_t and y_t be non-Gaussian linear processes ona countable abelian group G:     

一个在置换图中寻找DFS树的最优算法

本是通过在连通置换图中构造辅助树的方法,给出了一个在具有n个顶点的置换图G中寻找深度优先支撑树（简称,DFS树）的最优算法,并证明了该算法的时间复杂性为O(n)。     

Minimum Global Height支撑树及相关问题

本文研究了两个组合优化问题:minimum g1obal height支撑树和minimum aveageheight支撑树问题.利用3SAT问题的时间复杂性,本文证明了这两个问题都是NP-hard的,并分别给出了一个算法,即（mgh）-算法和（mah）-算法.在非负网络中,这两个算法的时间复杂性都为O（n3）.利用第一个问题的复杂性,本文证明了minimum height支撑树问题也是NP-hard的,从而纠正了有关文献中的一个错误结论.     

有向树的几个组合问题

本文计算有n个结点,m个叶子和具有叶路径长度为s的有向树的个数,以及n个结点,结点路径总长度为r的有向树个数。从而,解决了有向树的叶路径总长度,结点路径总长度的计算问题。     

Second-Order Methods for Solving Stochastic Differential Equations

In this paper we discuss the numerical methods with second-order accuracy for solving stochastic differential equations. An unbiased sample approximation method for $I_n=\int ^{t_{n+1}}_{t_n}(B_u-B_{t_n})^2du$ is proposed, where {$B_u$} is a Brownian motion. Then second-order schemes are derived both for scalar cases and for system cases. The errors are measured in the mean square sense. Several numerical examples are included, and numerical results indicate that second-order schemes compare favorably with Euler's schemes and 1.5th-order schemes.     

More infinite products: Thue–Morse and the gamma function

The Ramanujan Journal - Letting $$(t_n)$$ denote the Thue–Morse sequence with values 0, 1, we note that the Woods–Robbins product $$\begin{aligned} \prod _{n \ge 0}\left(...     

Results on undecidability of isomorphism of forms over polynomial rings

We show the undecidability of the question of isomorphism of forms over a polynomial ring $ R[t_1,\ldots,t_n] $, assuming a hypothesis about units in certain quaternion rings. Assuming this, it follows that isomorphisms of modules, and of affine algebraic varieties over R are undecidable.In memory of Gian-Carlo Rota     

A Class of Single Step Methods with a Large Interval of Absolute Stability

In this paper, a class of integration formulas is derived from the approximation so that the first derivative can be expressed within an interval $[nh,(n+1)h]$ as $$\frac{dy}{dt}=-P(y-y_n)+f_n+Q_n(t).$$ The class of formulas is exact if the differential equation has the shown form, where $P$ is a diagonal matrix, whose elements $$-pj=\frac{\partial}{\partial y_j}f_j(t_n,y_n),j=1,\cdots,m$$ are constant in the interval $[nh,(n+1)h]$, and $Q_n(t)$ is a polynomial in $t$. Each of the formulas derived in this paper includes only the first derivative $f$ and $$-pj=\frac{\partial}{\partial y_j}f_j(t_n,y_n).$$ It is identical with a certain Runge-Kutta method. In particular, when $Q_n(t)$ is a polynomial of degree two, one of our formulas is an extension of Treanor's method, and possesses better stability properties. Therefore the formulas derived in this paper can be regarded as a modified or an extended form of the classical Runge-Kutta methods. Preliminary numerical results indicate that our fourth order formula is superior to Treanor's in stability properties.     

Convergence of paths and approximation of fixed points of asymptotically nonexpansive mappings

Let be a real Banach space with a uniformly Gâteaux differentiable norm possessing uniform normal structure, be a nonempty closed convex and bounded subset of , be an asymptotically nonexpansive mapping with sequence . Let be fixed, be such that , , and . Define the sequence iteratively by , n= 0, 1, 2, ..._. $"> It is proved that, for each integer , there is a unique such that If, in addition, and , then converges strongly to a fixed point of .

     

Some extremal properties of positive trigonometric polynomials

For n=8 an upper bound is given for the functional $$V_n = \mathop {\inf }\limits_{t_n } \frac{{\alpha _1 + \alpha _2 + \cdots + \alpha _n }}{{\left( {\sqrt {\alpha _1 } - \sqrt {\alpha _0 } } \right)^2 }}$$ , which is defined on the class of even, nonnegative, trigonometric polynomials \(t_n (\phi ) = \sum\nolimits_{k = 0}^n {\alpha _k } cos k\phi \) , such that α _k ? 0 (k=0, ...,n) α₁>α₀ :V _s ? 34.54461566.     

Some extremal properties of positive trigonometric polynomials

A class P_n of even positive trigonometric polynomials tn(?)=a₀ + a₁ cos ?+ ... + a_n cos · n?, satisfying the conditions: a_k ≥0 (k = 0,1, ..., n), a₀ < a₁ is considered. The behavior of the sequence of functionals $$v_n = _{t_n \mathop { \in P_n }\limits^{\inf } } \frac{{t_n \left( 0 \right) - a_o }}{{\left( {\sqrt {a_1 } - \sqrt {a_o } } \right)}}$$ , is studied; two-sided estimations are given for V_n and \(V_\infty = \mathop {\lim }\limits_{n \to \infty } V_n \) .     

(渐近)非扩张映象的不动点的迭代逼近

Let E be a uniformly convex Banach space which satisfies Opial‘s condition or has aFrechet differentiable norm,and C be a bounded closed convex subset of E. If T： C→C is(asymptotically)nonexpansive,then the modified Ishikawa iteration process defined by     

Stabilized finite element method based on the Crank-Nicolson extrapolation scheme for the time-dependent Navier-Stokes equations

This paper provides an error analysis for the Crank-Nicolson extrapolation scheme of time discretization applied to the spatially discrete stabilized finite element approximation of the two-dimensional time-dependent Navier-Stokes problem, where the finite element space pair for the approximation of the velocity and the pressure is constructed by the low-order finite element: the quadrilateral element or the triangle element with mesh size . Error estimates of the numerical solution to the exact solution with are derived.