Entropy in the category of perfect complexes with cohomology of finite length

Local and category-theoretical entropies associated with an endomorphism of finite length (i.e., with zero-dimensional closed fiber) of a commutative Noetherian local ring are compared. Local entropy is shown to be less than or equal to category-theoretical entropy. The two entropies are shown to be equal when the ring is regular, and also for the Frobenius endomorphism of a complete local ring of positive characteristic.Furthermore, given a flat morphism of Cohen–Macaulay local rings endowed with compatible endomorphisms of finite length, it is shown that local entropy is “additive”. Finally, over a ring that is a homomorphic image of a regular local ring, a formula for local entropy in terms of an asymptotic partial Euler characteristic is given.     

Homological properties of modules over semigroup algebras

Let S be a semigroup. In this paper we investigate the injectivity of ?¹(S) as a Banach right module over ?¹(S). For weakly cancellative S this is the same as studying the flatness of the predual left module c₀(S). For such semigroups S, we also investigate the projectivity of c₀(S). We prove that for many semigroups S for which the Banach algebra ?¹(S) is non-amenable, the ?¹(S)-module ?¹(S) is not injective. The main result about the projectivity of c₀(S) states that for a weakly cancellative inverse semigroup S, c₀(S) is projective if and only if S is finite.     

平坦的多项式剩余类环

本文证明了如果多项式的剩余类环 A=R[T]/fR[T]作为 R-模是平坦模,且R是约化环,则f是正规多项式.特别地,若R还是连通的,则f的首项系数是单位.也证明了弱整体有限的凝聚环是约化环,以及弱整体为有限的凝聚连通环是整环.     

Injective hulls are not natural

In a category with injective hulls and a cogenerator, the embeddings into injective hulls can never form a natural transformation, unless all objects are injective. In particular, assigning to a field its algebraic closure, to a poset or Boolean algebra its Mac-Neille completion, and to an R-module its injective envelope is not functorial, if one wants the respective embeddings to form a natural transformation. Received January 21, 2000; accepted in final form August 10, 2001. RID="h1" RID="h2" RID="h3" ID="h1"The hospitality of York University is gratefully acknowledged by the first author. ID="h2"Third author partially supported by the Grant Agency of the Czech Republic under Grant no. 201/99/0310, and the hospitality of York University is also acknowledged. ID="h3"Partial financial assistance by the Natural Sciences and Engineering Councel of Canada is acknowledged by the fourth author.     

On the state of strength‐three covering arrays

A covering array of size N, strength t, degree k, and order υ is a k × N array on υ symbols in which every t × N subarray contains every possible t × 1 column at least once. We present explicit constructions, constructive upper bounds on the size of various covering arrays, and compare our results with those of a commercial product. Applications of covering arrays include software testing, drug screening, and data compression. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 217–238, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10002     

The space of lines in cyclic covers of projective space

Take positive integers m, n and d. Let Y be an m-fold cyclic cover of ${\mathbb{P}}^n$ ramified over a general hypersurface $X\subset P^n$ of degree md. In this paper we study the space $F(Y)$ of lines in Y and show that it is smooth of dimension $2(n-1)-d(m-1)$ if $md>2n-3$ and $2(n-1)-d(m-1)\ge 0$. When $2(n-1)=d(m-1)$, our result gives a formula on the number of m-contact order lines of X (see Definition 1.2).     

Worm Problem的一个新上界

1966年,Leo Moser提出了一个基本的几何问题,即Worm Problem．该问题是指:在平面上寻找一个面积最小的(凸)区域,使得任何一条长为1的平面曲线都能够通过旋转和平移完全放入该(凸)区域之中．对于要寻找的区域是凸的情形,本文将把目前所知道的最小的上界由0．2738086降低至0．270911861．在最后一部分,我们推广了Worm Problem,并初步给出了一些相应的结果．     

基于三角模糊数序列的灰色预测模型

以GM(1,1)模型为代表的灰色预测模型是以精确数序列为基础,难以满足实际需要.为了使灰色模型适应于模糊数序列,具体给出了一种基于三角模糊数序列的建模方法,这种方法也可以实现对二元区间模糊数和梯形模糊数序列的建模.首先由三角模糊数序列得出三个含有等量信息的精确数序列:重心序列、隶属函数的覆盖面积序列和中界点序列,对这三个序列分别建模后,再导出原始三角模糊数序列的三个界点的预测模型.这种建模方法既保持了模糊数的整体性又提高了建模序列的光滑度,提高了预测精度.最后进行了多组随机三角模糊数序列的数据模拟,验证了模型的有效性.     

Examples of Calabi–Yau Threefolds as Covers of Almost-Fano Threefolds

We give a method for producing examples of Calabi–Yau threefolds as covers of degree d ≤ 8 of almost-Fano threefolds, computing explicitely their Euler– Poincaré characteristic. Such a method generalizes the well-knownclassical construction of Calabi–Yau threefolds as double covers of the projective space branched along octic surfaces.