Continuation method for -sublinear mappings

Let be a real Banach space partially ordered by a closed convex cone with nonempty interior . We study the continuation method for the monotone operator which satisfies

for all , , where . Thompson's metric is among the main tools we are using.     

Generalized Steiner Systems GS(2, 4, v, 2) with v a Prime Power ≡ 7 (mod 12)

Generalized Steiner systems GS(2, 4, v, g) were first introduced by Etzion and were used to construct optimal constant weight codes over an alphabet of size g + 1 with minimum Hamming distance 5, in which each codeword has length v and weight 4. Etzion conjectured that the necessary conditions v 1 (mod 3) and v ; 7 are also sufficient for the existence of a GS(2,4,v,2). Except for the example of a GS(2,4,10,2) and some recursive constructions given by Etzion, nothing else is known about this conjecture. In this paper, Weil's theorem on character sum estimates is used to show that the conjecture is true for any prime power v 7 (mod 12) except v = 7, for which there does not exist a GS(2,4,7,2).     

Preconditioned sor methods for generalized least-squares problems

1.IntroductionThegeneralizedleastsquaresproblem,definedasmin(Ax--b)"W--'(Ax--b),(1.1)xacwhereAERm",m>n,bERm,andWERm'misasymmetricandpositivedefinitematrix,isfrequentlyfoundwhensolvingproblemsinstatistics,engineeringandeconomics.Forexample,wegetgeneralizedleastsquaresproblemswhensolvingnonlinearregressionanalysisbyquasi-likelihoodestimation,imagereconstructionproblemsandeconomicmodelsobtainedbythemaximumlikelihoodmethod(of.[1,21).Paige[3,4]investigatestheproblemexplicitly.Hechangestheorig…     

Representations of 2-Groups by Polynomials

It is known that any finite p-group can be represented by polynomials. However, how to represent p-groups and how to classify p-groups up to isomorphism are interesting and open questions. In this article, we investigate the 2-groups of order 8, and represent the dihedral group D_2n, the generalized quaternion group Q_2n, and the infinite dihedral group D.2000 Mathematics Subject Classification: 20C99, 20E99     

一种新的岩石非线性黏弹塑性蠕变模型研究

为了克服传统元件组合模型不能描述岩石蠕变过程中非线性特征的缺陷,首先根据加速蠕变阶段的应变和应变率随蠕变时间急剧增大的特点,建立黏塑性应变与蠕变时间的指数函数关系并提出非线性黏塑性体.将该非线性黏塑性体与广义Burgers蠕变模型串联,建立可以描述岩石全蠕变过程的非线性黏弹塑性蠕变模型,根据叠加原理得到一维应力状态下的轴向蠕变方程.然后基于塑性力学理论指出岩石三维蠕变本构方程建立过程中的不足之处,并给出非线性黏弹塑性蠕变模型合理的三维蠕变方程.最后采用不同应力水平下砂岩轴向蠕变试验对模型合理性进行验证,结果表明:拟合曲线与试验曲线吻合度较高,所建蠕变模型能够很好地描述砂岩在不同应力水平下的蠕变变形规律,尤其对加速蠕变阶段的非线性特征描述效果很好,验证了模型的合理性.     

On the Convolution of the Generalized Finite Legendre Transform

The translation operator and the convolution for the finite Legendre transformation are investigated in the space ??(?1,1) of testing-functions and its dual through an approach that emphasizes the close similarity existing between this transform and the infinite Mehler - Fock transformation. The theory developed is used in solving some distributional boundary-value problems.     

Generalized Uncertainty Principle and Black Hole Entropy of Higher-Dimensional de Sitter Spacetime

Recently, there has been much attention devoted to resolving the quantum corrections to the Bekenstein-- Hawking black hole entropy. In particular, many researchers have expressed a vested interest in the coetticient of the logarithmic term of the black hole entropy correction term. In this paper, we calculate the correction value of the black hole entropy by utilizing the generalized uncertainty prlnciple and obtain the correction term caused by the generalized uncertainty principle. Because in our calculation we think that the Bekenstein-Hawking area theorem is still valid after considering the generalized uncertainty principle, we derive that the coefficient of the logarithmic term of the black hole entropy correction term is positive. This result is different from the known result at present. Our method is valid not only for four-dimensional spacetimes but also for higher-dimensional spacetimes. In the whole process, the physics idea is clear and calculation is simple. It offers a new way for studying the entropy correction of the complicated spacetime.     

Replica sub-permutation method for molecular dynamics and monte carlo simulations

We propose an improvement of the replica-exchange and replica-permutation methods, which we call the replica sub-permutation method (RSPM). Instead of considering all permutations, this method uses a new algorithm referred to as sub-permutation to perform parameter transition. The RSPM succeeds in reducing the number of combinations between replicas and parameters without the loss of sampling efficiency. For comparison, we applied the replica sub-permutation, replica-permutation, and replica-exchange methods to a β-hairpin mini protein, chignolin, in explicit water. We calculated the transition ratio and number of tunneling events in the parameter space, the number of folding–unfolding events, the autocorrelation function, and the autocorrelation time as measures of sampling efficiency. The results indicate that among the three methods, the proposed RSPM is the most efficient in both parameter and conformational spaces. © 2019 Wiley Periodicals, Inc.     

Explicit solutions of the Bogoyavlensky-Konoplechenko equation

By means of the generalized direct method, a relationship is constructed between the new solutions and the old ones of the Bogoyavlensky-Konoplechenko equation. Based on the relationship, a new solution is obtained by using a given solution of the equation. The symmetry is also obtained for the BK equation. Then we get the reductions using the symmetry and give some exact solutions of the BK equation.