H~2×R中给定平均曲率曲面的Weierstrass表示

定义了H~2×R中曲面的法高斯映照,给出了给定平均曲率曲面的Weierstrass表示,证明了法高斯映照满足一个二阶偏微分方程,并且该方程是所得到的Weierstrass表示的完全可积条件.     

Minimally generated Boolean algebras

We introduce the class of minimally generated Boolean algebras, i.e. those algebras representable as the union of a continuous well-ordered chain of subalgebras A ₁ where A _i+1 is a minimal extension of A _i. Minimally generated algebras are closely related to interval algebras and superatomic algebras.     

Preemptive scheduling of interval orders is polynomial

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

Desch‐Schappacher perturbation of one‐parameter semigroups on locally convex spaces

We prove a Desch‐Schappacher type perturbation theorem for strongly continuous and locally equicontinuous one‐parameter semigroups which are defined on a sequentially complete locally convex space.     

States on systems of sets that are closed under symmetric difference

We consider extensions of certain states. The states are defined on the systems of sets that are closed under the formation of the symmetric difference (concrete quantum logics). These systems can be viewed as certain set‐representable quantum logics enriched with the symmetric difference. We first show how the compactness argument allows us to extend states on Boolean algebras over such systems of sets. We then observe that the extensions are sometimes possible even for non‐Boolean situations. On the other hand, a difference‐closed system can be constructed such that even two‐valued states do not allow for extensions. Finally, we consider these questions in a σ‐complete setup and find a large class of such systems with rather interesting state properties.     

The projective dimension of three cubics is at most 5

Let R be a polynomial ring over a field and I an ideal generated by three forms of degree three. Motivated by Stillman's question, Engheta proved that the projective dimension $\mathrm{pd}(R/I)$ of $R/I$ is at most 36, although the example with largest projective dimension he constructed has $\mathrm{pd}(R/I)=5$. Based on computational evidence, it had been conjectured that $\mathrm{pd}(R/I)\le 5$. In the present paper we prove this conjectured sharp bound.     

Fractional Hardy–Hénon equations on exterior domains

In this paper, we consider the fractional Hardy–Hénon equations with an isolated singularity. If the isolated singularity is located at the origin, we give a classification of solutions to this equation. If the isolated singularity is located at infinity, in the case of exterior domains, we provide decay estimates of solutions and their gradients at infinity. Our results are an extension of the classical work by Caffarelli, Gidas et al.     

Model-completions for Abelian lattice-ordered groups with finitely many disjoint elements

This paper axiomatizes classes of Abelian lattice-ordered groups with a finite upper bound on the number of pairwise disjoint positive elements; finds model-completions for these theories; derives corresponding Nullstellensätze; determines which model-completions eliminate quantifiers; and examines quantifier elimination in a different language and for positive formulas.