✦ LIBER ✦

Some Results on Tight Closure and Completion

✍ Scribed by S. Loepp; C. Rotthaus

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 153 KB
Volume: 246
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.2001.9006

No coin nor oath required. For personal study only.

✦ Synopsis

We construct two examples of nonexcellent local Noetherian domains which demonstrate that tight closure and completion do not commute. The first example is a local normal domain A with a height one principal prime ideal P such that ˆŽ .

PA * / P*A. We also construct an example of a complete local normal Gorenstein domain which is not F-regular but is the completion of an F-regular local ring.

📜 SIMILAR VOLUMES

Some new results on 1-rotational 2-facto

Some new results on 1-rotational 2-factorizations of the complete graph

✍ Tommaso Traetta 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract It is known that a necessary condition for the existence of a 1‐rotational 2‐factorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans

Some results on generalized exponents

✍ Neufeld, Stewart; Shen, Jian 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

A digraph G = (V, E) is primitive if, for some positive integer k, there is a u → v walk of length k for every pair u, v of vertices of V . The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u ∈ V , denoted exp(u), is the least integer k such that there is a u →

Some results on linear arboricity

✍ Filip Guldan 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

Some Results on Carathéodory Selections

Some Results on Carathéodory Selections and Extensions

✍ Anna Kucia 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 240 KB

On Some Results Concerning the Reduite a

On Some Results Concerning the Reduite and Balayage

✍ Valentin Grecea 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB 👁 1 views

Some results on the achromatic number

✍ Cairnie, Niall; Edwards, Keith 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ( k 2 ) ≤ m. We show that the problem of dete