与Smarandache函数有关的一个方程的解的注记

设φ(n)、S(n)分别表示正整数n的Euler函数和Smarandache函数,白海荣和廖群英在[Smarandache函数的几类相关方程的解,数学学报中文版,2019,62(2):247-254]中称方程φ(n)=∑d|nS(d)只有两个解,分别为n=2^5和n=3×2^5.本文指出,这两个数均不是此方程的解,并指出其出错原因是因为他们对M?bius反转公式的错误理解所造成的.     

一类非牛顿流体模型解的渐近性态

本文主要讨论一类带p(1 2n/(n 2)■p＜3)幂增长耗散位势的非牛顿流体模型解的渐近性态,利用改进的Fourier分解方法,证明了其解在L~2范数下衰减率为(1 t)~(-n/4)．     

具有直线解微分系统的代数曲线环

右方为n次多项式的微分方程称为n次微分系统(E)_n,其极限环问题的研究是定性理论的重要课题,几年来国内外数学工作者对(E)_n具有代数曲线解的情形做过不少工作(主要对n=2、3)。在生态学、生物化学等领域中,描述两物种相互作用的数学模型常是具有二条直线解的一类n次微分系统(E)_n.     

多层规划和多目标规划的讨论

对任意给定的正整数 (n1,n2 ) ,构造了上下层决策变量分别是n1和n2 维的两层线性规划 ,其最优解不是相应双目标规划的有效解 ,进而构造出以任意给定的线性无关的向量d1,d2 为价格向量的两层规划 ,其最优解不是有效解 .这些讨论对现实问题的合理建模提供了理论依据 .此外 ,给出多层规划最优解是有效解的一个充分条件及判断其无效的方法 .     

自然数集的分拆及其表示函数

令N表示全体非负整数的集合.对给定的集合A C N及n∈N,令R_1(A,n)表示方程n=a+a',a,a'∈A的解的个数.令R_2(A,n)和R_3(A,n)分别表示方程n=a+a',a,a'∈A在条件aa'和a≤a'下解的个数.一个有趣的问题是:给定i∈{1,2,3},确定所有非负整数集合对(A;B),使其表示函数R_i(A,n)及R_i(B,n)最终相等.文章讨论了相关问题.     

R^n中一类半线性椭圆方程的k—NODE解的唯一性

本文主要讨论了R~n中超线性椭圆方程边值问题的k-node解的唯一性,在条件 p1(n)<-(ι+2)/(p-1)1,同时给出了 -△u+a(|x|)u=sum from t=1 to m a_i(|x|)|u|p~(i-1)u,u→0 (|x|→∞)的k-node解的唯一性结果。     

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.     

一类Poincaré差分方程解的渐近性质

以二阶的情形讨论了Poincaré差分方程y(n m) (a1 p1(m))y(n m-1) … (an pn(m)y(m)=0当其常系数部分x(n m) a1x(n m-1) … anx(m)=0的特征方程有相同的根时，解的渐近性质，通过不动点方法给出了Poincaré差分方程的解渐近于其常系数方程解的条件，并给出了渐近式高阶项的估计。     

关于不定方程x~2+4~n=y~(13)(n=4,5,6)的整数解

在高斯整环中,利用代数数论与同余理论的方法,讨论了不定方程x~2+4~n=y~(13)(n=4,5,6)的整数解问题,得出了当n=4,5时无整数解;n=6是仅有整数解(x,y)=(64,2)和(x,y)=(-64,2)的结论,推进了不定方程整数解的研究.     

(m,n,k)指派问题的最小费用流模型及其算法

构造(m,n,k)指派问题的最小费用流模型,并将基于对偶原理的最小费用流的允许边算法求解该模型,提出求解(m,n,k)指派问题的一种算法.算法直接在其对应的网络中保持互补松弛条件不变,通过调整节点势以扩大允许网络从而寻求增广链并进行流量增广,直至在网络中得到流量为k的最小费用流,此时非O流边对应(m,n,k)指派问题的最优解.给出了(m,n,k)指派问题的最优解及多重最优解的重要性质,数值试验表明算法有效可行.     

Algorithms for approximation of invariant measures for IFS

We prove convergence of two algorithms approximating invariant measures to iterated function systems numerically. We consider IFSs with finitely many continuous and injective non-overlapping maps on the unit interval. The first algorithm is a version of the Ulam algorithm for IFSs introduced by Strichartz et al. [16]. We obtain convergence in the supremum metric for distribution functions of the approximating eigen-measures to a unique invariant measure for the IFS. We have to make some modifications of the usual way of treating the Ulam algorithm due to a problem concerning approximate eigenvalues, which is part of our more general situation with weights not necessarily being related to the maps of the IFS. The second algorithm is a new recursive algorithm which is an analogue of forward step algorithms in the approximation theory of ODEs. It produces a sequence of approximating measures that converges to a unique invariant measure with geometric rate in the supremum metric. The main advantage of the recursive algorithm is that it runs much faster on a computer (using Maple) than the Ulam algorithm.Mathematics Subject Classification (2000): 37A30, 37C30, 37M25, 47A58Acknowledgement I would like to express my deep gratitude to Andreas Strömbergsson and to the anonymous referee. The referee had several very enlightening comments, which Andreas helped me to deal with. Section 4 is essentially due to Andreas and he also came up with the new Proposition 3 and helped me to improve Lemma 1. Thanks also to Svante Janson, Anders Johansson, Sten Kaijser, Robert Strichartz and Hans Wallin.     

Equations for coefficients of tactical decomposition matrices for t-designs

Equations for coefficients of tactical decomposition matrices for 2-designs are well-known and they have been used for constructions of many examples of 2-designs. In this paper, we generalize these equations and propose an explicit equation system for coefficients of tactical decomposition matrices for \(t\text{-}(v,k,\lambda _t)\) designs, for any integer value of \(t.\)      

Rates of Convergence for a Class of Rank Tests for Independence

An almost optimal rate of convergence estimate is obtained for a large class of rank statistics for testing independence, including Gini's and Spearman's rank correlation coefficients as well as Spearman's footrule. Bibliography: 18 titles.     

Equivalence of conditions for convergence of iterative methods for singular equations

Equivalence is shown between different conditions for convergence of iterative methods for consistent singular systems of linear equations on Banach spaces. These systems appear in many applications, such as Markov chains and Markov processes. The conditions considered relate the range and null spaces of different operators.     

Extensions of ValEncIA-IVP for reduction of overestimation,for simulation of differential algebraic systems,and for dynamical optimization

Simulation techniques are commonly used to analyze the influence of uncertainties of initial conditions and systemparameters on the trajectories of the state variables of dynamical systems. In this context, interval arithmetic approaches are of interest. They are capable of determining guaranteed bounds of all reachable states if worst-case bounds of the above-mentioned uncertainties are known. Furthermore, interval algorithms ensure the correctness of numerical results in spite of rounding errors which inevitably arise if floating point operations are carried out on a computer. However, naive implementations of interval algorithms often lead to overestimation, i.e., too conservative enclosures which can make the results meaningless. In this contribution, we summarize the basic routines of ValEncIA-IVP which computes interval enclosures of all reachable states of dynamical systems described by ordinary differential equations ODEs. ValEncIA-IVP , VAL idation of state ENC losures using I nterval A rithmetic for I nitial V alue P roblems, can be applied to the simulation of systems with both uncertain parameters and uncertain initial conditions. Advanced techniques for reduction of overestimation are demonstrated for a simplified catalytic reactor. Afirst approach to using VanEncIA-IVP for the simulation of sets of differential algebraic equations is outlined. Finally, an outlook on the integration of ValEncIA-IVP in an interval arithmetic framework for computation of optimal and robust control strategies for continuous-time processes is given. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

带有Gilbert阻尼项的Landau-Lifshitz铁磁链方程解的最佳衰减率

主要研究带有Gilbert阻尼项的Landau-Lifshitz铁磁链方程的柯西问题.当初值的一阶导数适当小时,基于加权能量估计,证明了强解的整体存在性并且给出了解的最优的L2和L∞衰减估计.     

积分中值定理中间点比较及有关平均不等式

中值定理中间点是区间端点的平均.设f (x)、g(x)在同一区间[a,b]内严格单调并可积,p(x)、q(x)恒正可积,按积分中值定理各有唯一的中间点ξf ,p(a,b)和ξg,q(a,b) .当f递增(减)且f (g- 1)凸(凹)时,有ξg,p(a,b) <ξf,p(a,b) ;当p(x)q(x) 递增(减)且q(x) ∫bap(x) dx >( <) 0时,有ξf,q(a,b) <ξf ,p(a,b) .由此可证明和发现一系列有关平均的不等式.     

Bounds for the number of moduli for irregular varieties of general type

LetX be a minimal surface of general type and M (X) the set of equivalence classes of complex structures on the differentiable manifold underlyingX; denoting byM _x the dimension of M(X) at [X], the point corresponding to the complex structure ofX we consider the problem of finding an upper bound forM _x in terms of the basic numerical invariants ofX. The main result is the Castelunovo's bound:M _xP_g(X)+2q(X) for certain irregular surfaces. We also generalize the above bound to an arbitrary dimension.     

Tests for the validation of numerical models for cracking of plain concrete

The paper deals with experiments on single edge notched beams, subjected to 2D and 3D stress states, for the validation of material models for cracking of plain concrete. Both, the test setup and the test results, mainly consisting of load – displacement curves and crack paths and crack surfaces, are described briefly. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)