关于凸规划对偶模型的讨论

修正了文[1]中的错误,在其基础上讨论了凸规划的Lagrange对偶,Subgradient对偶及Wolfe对偶等四种对偶模型之间的关系,给出了它们之间等价的条件.     

“Painlevé 34” equation: Equivalence test

We give the complete solution of the Equivalence Problem for “Painlevé 34” equation.     

一类微分-差分方程组的内禀对称和等价群变换

研究一类微分-差分方程组的对称和等价群变换.采取内禀的无穷小算子方法,给出了方程组的内禀对称和等价群变换.为结合抽象Lie代数结构,给方程完全分类提供了理论基础.     

关于微分同胚的一个充分必要条件

确定两个流形是否C^r-微分同胚是微分流形研究中的重要课题,本文定义了反层的概念,给出了反层范畴,由此找到两个微分流形,C^r-微分同胚的特征刻画,于是给出了一种较以往更优的判定法．     

On Stable Equivalence of Tensor Products of Algebras

The paper investigates the following problem. Let bimodules N, M yield a stable equivalence of Morita type between self-injective K-algebras A and E. Further, let bimodules S, T yield a stable equivalence of Morita type between self-injective K-algebras B and F. Then we want to know whether the functor M ? _A  ? ? _B S: mod(A ? _K B ^op ) → mod(E ? _K F ^op ) induces a stable equivalence between A ? _K B ^op and E ? _K F ^op . There is given a reduction of this problem to some smaller subcategories for self-injective algebras. Moreover, new invariants of stable equivalences of Morita type are constructed in a general case of arbitrary finite-dimensional algebras over a field.     

On V-semirings and Semirings All of Whose Cyclic Semimodules Are Injective

In this article, we introduce and study V- and CI-semirings—semirings all of whose simple and cyclic, respectively, semimodules are injective. We describe V-semirings for some classes of semirings and establish some fundamental properties of V-semirings. We show that all Jacobson-semisimple V-semirings are V-rings. We also completely describe the bounded distributive lattices, Gelfand, subtractive, semisimple, and antibounded, semirings that are CI-semirings. Applying these results, we give complete characterizations of congruence-simple subtractive and congruence-simple antibounded CI-semirings which solve two earlier open problems for these classes of CI-semirings.     

Weber Correspondence Analysis: The One-Dimensional Case

When designing programs or software for the implementation of Monte Carlo (MC) hypothesis tests, we can save computation time by using sequential stopping boundaries. Such boundaries imply stopping resampling after relatively few replications if the early replications indicate a very large or a very small p value. We study a truncated sequential probability ratio test (SPRT) boundary and provide a tractable algorithm to implement it. We review two properties desired of any MC p value, the validity of the p value and a small resampling risk, where resampling risk is the probability that the accept/reject decision will be different than the decision from complete enumeration. We show how the algorithm can be used to calculate a valid p value and confidence intervals for any truncated SPRT boundary. We show that a class of SPRT boundaries is minimax with respect to resampling risk and recommend a truncated version of boundaries in that class by comparing their resampling risk (RR) to the RR of fixed boundaries with the same maximum resample size. We study the lack of validity of some simple estimators of p values and offer a new, simple valid p value for the recommended truncated SPRT boundary. We explore the use of these methods in a practical example and provide the MChtest R package to perform the methods.