On Countably Generated Dimension

In this article,we introduce and study the concept of countably generated dimension,which is a Krull-like dimension extension of the concept of DCC on countably generated submodules.We show that some of the basic results of Krull dimension are true for countably generated dimension.It is shown that an R-module M has Krull dimension if and only if it has countably generated dimension,and its Krull dimension and countably generated dimension coincide.     

A Lower Bound for Pseudodimension in Terms of Topological Dimension

Mathematical Notes -     

A New Upper Bound for the Dimension of Trace Codes

We shall derive a new non-trivial upper bound for the dimensionof trace codes connected to algebraic-geometric codes. Furthermore,we shall deduce their true dimension if certain conditions aresatisfied.     

A Homological Lower Bound for Order Dimension of Lattices

We prove that if a finite lattice L has order dimension at most d, then the homology of the order complex of its proper part L vanishes in dimensions d – 1 and higher. If L can be embedded as a join-sublattice in N ^d , then L actually has the homotopy type of a simplicial complex with d vertices.     

Weak Global Dimension of Coherent Rings

In this article, we study the weak global dimension of coherent rings in terms of the left FP-injective resolutions of modules. Let R be a left coherent ring and ? ? the class of all FP-injective left R-modules. It is shown that wD(R) ≤ n (n ≥ 1) if and only if every nth ? ?-syzygy of a left R-module is FP-injective; and wD(R) ≤ n (n ≥ 2) if and only if every (n ? 2)th ? ?-syzygy in a minimal ? ?-resolution of a left R-module has an FP-injective cover with the unique mapping property. Some results for the weak global dimension of commutative coherent rings are also given.     

An Upper Bound for List T-Colourings

Erds, Rubin and Taylor showed in 1979 that for any connectedgraph G which is not a complete graph or an odd cycle, ch(G) , where is the maximum degree of a vertex in G and ch(G) isthe choice number of the graph (also proved by Vizing in 1976).They also gave a characterisation of D-choosability. A graphG is D-choosable if, when we assign to each vertex v of G alist containing d(v) elements, where d(v) is the degree of vertexv, we can always choose a proper vertex colouring from theselists, however the lists were chosen. In this paper we shallgeneralise their results on the choice number of G and D-choosabilityto the case where we have T-colourings.     

An Upper Bound for d-dimensional Difference Sets

Let be the maximal positive number for which the inequality holds for every finite set of affine dimension . What can one say about ? The exact value of is known only for d = 1, 2 and 3. It is shown that , for every . This disproves a conjecture of Ruzsa. Some further related questions are posed and discussed. Received March 27, 2000     

关于有限维数猜想的一些新进展

在Artin代数的表示理论中,有一个著名的有限维数猜想：任意给定一个Artin代数,它的有限维数都是有限的．这个猜想已有45年的历史,至今悬而未决．本文主要综述它的一些历史发展情况,并介绍关于有限维数猜想的一些最新进展．     

有限域上一类等维码的下界

等维码凭借其在随机线性网络编码中的良好的差错控制得到广泛研究,对于给定维数和最小距离的等维码所含码字的最大个数目前还没有一般性结果.Tuvi Etzion和Alexander Vardy给出了一定等维码所含码字最大个数的上界和下界,首先利用对偶空间构造等维码C(n,M,2k,k),达到了此类码所含码字的下界,然后具体构造了最优等维码C(7,41,4,2).     

On the Global Attractor of Generalized Ginzburg-Landau Equation in One Spatial Dimension

The target of this paper is the long time behaviour of solutions for a generalized Ginzburg-Landau equation on IR. The authors establish the existence of a global attractor of finite Hausdorff and fractal dimension in a weighted Hilbert space for the equation.     

一类Morita Contexts的M-投射左总体维数

我们引进了模的M-投射维数和环的M-左总体维数的概念,采用比较新颖简便的方法,得到了一类Morita Contexts T=R ReeR eRe,e∈R,e2=e和环的M-左总体维数之间的相等关系.     

关于规范型拉丁方个数的上界

In this note,the author find an upper bound formula for the number of the p×p normalized Latin Square,the first row and column of which are both standard order 1,2,...,p.     

树的几何反比度上界

设G(V,E)是一个任意图，定义为G的几何反比度，本文证明了，其中T为顶点数为n的树，这个上界值是精确的     

An Upper Bound for the Regularity of Ideals of Borel Type

We show that the regularity of monomial ideals of K[x ₁,…, x _n ] (K being a field), whose associated prime ideals are totally ordered by inclusion is upper bounded by a linear function in n.     

An Upper Bound for the Hyperbolic Metric of a Convex Domain

In [1], Beardon introduced the Apollonian metric defined forany domain D in Rⁿ by This metric is Möbius invariant, and for simply connectedplane domains it satisfies the inequality _D2_D, where _D denotesthe hyperbolic distance in D, and so gives a lower bound onthe hyperbolic distance. Furthermore, it is shown in [1, Theorem6.1] that for convex plane domains, the Apollonian metric satisfies, and, by considering the example of the infinite strip {x + iy:|y|<1}, that the best possibleconstant in this inequality is at least . In this paper we makethe following improvements.     

An Upper Bound for the Total Restrained Domination Number of Graphs

Let G be a graph with vertex set V. A set ${D \subseteq V}$ is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in ${V \setminus D}$ has a neighbor in ${V \setminus D}$ . The minimum cardinality of a total restrained dominating set of G is called the total restrained domination number of G, and is denoted by γ _tr (G). In this paper, we prove that if G is a connected graph of order n ≥ 4 and minimum degree at least two, then ${\gamma_{tr}(G) \leq n-\sqrt[3]{n \over 4}}$ .     

An Improved Upper Bound for Leo Moser's Worm Problem

   Abstract. A worm ω is a continuous rectifiable arc of unit length in the Cartesian plane. Let W denote the class of all worms. A planar region C is called a cover for W if it contains a copy of every worm in W . That is, C will cover or contain any member ω of W after an appropriate translation and/ or rotation of ω is completed (no reflections). The open problem of determining a cover C of smallest area is attributed to Leo Moser [7], [8]. This paper reduces the smallest known upper bound for this area from 0.275237 [10] to 0.260437.     

An Improved Upper Bound for Leo Moser's Worm Problem

Abstract. A worm ω is a continuous rectifiable arc of unit length in the Cartesian plane. Let W denote the class of all worms. A planar region C is called a cover for W if it contains a copy of every worm in W . That is, C will cover or contain any member ω of W after an appropriate translation and/ or rotation of ω is completed (no reflections). The open problem of determining a cover C of smallest area is attributed to Leo Moser [7], [8]. This paper reduces the smallest known upper bound for this area from 0.275237 [10] to 0.260437.     

改进型Hardy-Sobolev不等式最好常数的一个上界

在本文,我们对改进型Hardy-Sobolev不等式的最好常数进行研究,得到该常数的一个上界.     

An Upper Bound on the Average Size of Silhouettes

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for a large class of objects, namely for polyhedra or, more generally, tessellated surfaces that approximate surfaces in some reasonable way. The approximated surfaces are two-manifolds that may be nonconvex and nondifferentiable and may have boundaries. The tessellated surfaces should, roughly speaking, have no short edges, have fat faces, and the distance between the mesh and the surface it approximates should never be too large. We prove that such tessellated surfaces of complexity n have silhouettes of expected size where the average is taken over all points of view. The viewpoints can be chosen at random at infinity or at random in a bounded region.