On a Generalized Finite Intersection Property

We continue the study of the right finite intersection property under a weaker condition on annihilators, introducing the concept of generalized right finite intersection property (simply, generalized right FIP). We observe the structure of rings with the generalized right FIP and examine the generalized right FIP for various kinds of basic extensions of rings with the property. We show that the generalized right FIP does not go up to polynomial rings, and that the 2-by-2 full matrix ring over a domain has the generalized right FIP. In the process, we also obtain an equivalent condition for which a nonzero polynomial, over the ring of integers modulo n ≥ 2, is a non-zero-divisor.     

Right P-Comparable Semigroups

In this article we utilise the notion of right waist and right comparizer to study the ideal theory of semigroups. We also consider which of the properties of right cones can be carried over to right P-comparable semigroups. We give sufficient and necessary conditions on the set of nilpotent elements of a semigroup to be an ideal, and we provide several equivalent characterizations for a right ideal being a right waist. In one of our main results we show that in a right P ₁-comparable semigroup with left cancellation law, a prime segment P ₂ ? P ₁ is Archimedean, simple or exceptional. This extends a similar result pertaining to right cones.     

On Ordered Semigroups Which are Semilattices of Simple and Regular Semigroups

We characterize the ordered semigroups which are decomposable into simple and regular components. We prove that each ordered semigroup which is both regular and intra-regular is decomposable into simple and regular semigroups, and the converse statement also holds. We also prove that an ordered semigroup S is both regular and intra-regular if and only if every bi-ideal of S is an intra-regular (resp. semisimple) subsemigroup of S. An ordered semigroup S is both regular and intra-regular if and only if the left (resp. right) ideals of S are right (resp. left) quasi-regular subsemigroups of S. We characterize the chains of simple and regular semigroups, and we prove that S is a complete semilattice of simple and regular semigroups if and only if S is a semilattice of simple and regular semigroups. While a semigroup which is both π-regular and intra-regular is a semilattice of simple and regular semigroups, this does not hold in ordered semigroups, in general.     

A Braided Version of Some Results of Skryabin

We extend the main result of Skryabin in [9 Skryabin , S. ( 2007 ). Projectivity and freeness over comodule algebras . Trans. Amer. Math. Soc. 359 : 2597 – 2623 .[Crossref], [Web of Science ®] , [Google Scholar]] to Yetter-Drinfeld Hopf algebras over an arbitrary Hopf algebra H with bijective antipode.     

Estimating Stochastically Ordered Survival Functions via Geometric Programming

Many procedures have been proposed to compute nonparametric maximum likelihood estimators (NPMLEs) of survival functions under stochastic ordering constraints. However, each of them is only applicable to a specific type of stochastic ordering constraint and censoring, and is often hard to implement. In this article, we describe a general and flexible method based on geometric programming for computing the NPMLEs from right- or interval-censored data. To this end, we show that the monotonicity properties of the likelihood function and the stochastic ordering constraints considered in the literature allow us to reformulate the estimation problem as a geometric program (GP), a special type of mathematical optimization problem, which can be transformed to a convex optimization problem, and then solved globally and efficiently. We apply this GP-based method to real data examples to illustrate its generality in handling different types of ordering constraints and censoring. We also conduct simulation studies to examine its numerical performance for various sample sizes. Supplemental materials including technical details, computer code, and data files are available online.     

Estimation of the number of failures in the Weibull model using the ordinary differential equation

In estimating the number of failures using right truncated grouped data, we often encounter cases that the estimate is smaller than the true one when we use the likelihood principle to conditional probability. In infectious disease spread predictions, the SIR model described by simultaneous ordinary differential equations is commonly used, and it can predict reasonably well the number of infected patients even when the size of observed data is small. We have investigated whether the ordinary differential equation model can estimate the number of failures more accurately than does the likelihood principle under the condition of right truncated grouped data. The positive results are obtained in the Weibull model, similarly to the cases of the SARS, A(H1N1), and FMD.     

求解右定两参数特征值问题的精化Jacobi-Davidson方法(英文)

在文献[1]中,作者M E Hochstenbach和B Plestenjak认为精化的方法不适合两参数特征值问题,原因是求解两参数特征值问题的精化方法存在着三个问题:即精化Ritz向量收敛性差,运算量大,不能计算多个特征值.本文指出,事实并非如此.针对右定两参数特征值问题,本文提出了一种有效的精化数值方法.并通过理论证明和数值实验说明了Ritz值的收敛性,以及精化Ritz向量具有比通常的Ritz向量更好的收敛性.     

On transitive Cayley graphs of strong semilattices of right (left) groups

We investigate Cayley graphs of strong semilattices of right (left) groups, of right (left) zero semigroups, and of groups. We show under which conditions they enjoy the property of automorphism vertex transitivity in analogy to Cayley graphs of groups.     

Right ideals generated by an idempotent of finite rank

Let R be a K-algebra acting densely on V_D, where K is a commutative ring with unity and V is a right vector space over a division K-algebra D. Let f(X₁,…,X_t) be an arbitrary and fixed polynomial over K in noncommuting indeterminates X₁,…,X_t with constant term 0 such that for some μK occurring in the coefficients of f(X₁,…,X_t). It is proved that a right ideal ρ of R is generated by an idempotent of finite rank if and only if the rank of f(x₁,…,x_t) is bounded above by a same natural number for all x₁,…,x_tρ. In this case, the rank of the idempotent that generates ρ is also explicitly given. The results are then applied to considering the triangularization of ρ and the irreducibility of f(ρ), where f(ρ) denotes the additive subgroup of R generated by the elements f(x₁,…,x_t) for x₁,…,x_tρ.     

半群中的(λ,μ)-模糊理想(英文)

在半群中给出了(λ,μ)-模糊子半群和各种(λ,μ)-模糊理想的概念,讨讹了它们的一些性质,并给出了各种(λ,μ)-模糊理想的充分必要条件.