✦ LIBER ✦

Minimal sets in finite rings

✍ Scribed by LeAnne Conaway; Keith A. Kearnes

Publisher: Springer
Year: 2004
Tongue: English
Weight: 379 KB
Volume: 51
Category: Article
ISSN: 0002-5240
DOI: 10.1007/s00012-004-1850-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Zero sets of polynomials in finite rings

✍ John Isbell 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 238 KB

Boolean Rings of Sets with Finite Subcov

Boolean Rings of Sets with Finite Subcovering Property

✍ Alexander Abian 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

Based on the above Definition, we prove the following Lemmas.

A minimization problem concerning subset

A minimization problem concerning subsets of a finite set

✍ G.F. Clements 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Then-generator property in rings of inte

Then-generator property in rings of integer-valued polynomials determined by finite sets

✍ Jason Boynton; Lee Klingler 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 88 KB

Largest minimal blocking sets in PG(2,8)

✍ J. Barát; S. Innamorati 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

## Abstract Bruen and Thas proved that the size of a large minimal blocking set is bounded by $q \cdot {\sqrt{q}} + 1$. Hence, if __q__ = 8, then the maximal possible size is 23. Since 8 is not a square, it was conjectured that a minimal blocking 23‐set does not exist in PG(2,8). We show that this

Finite Separating Sets in Locally Finite

Finite Separating Sets in Locally Finite Graphs

✍ H.A. Jung; M.E. Watkins 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 386 KB

An $(m, n)$-separator of an infinite graph $\Gamma$ is a smallest finite set of vertices whose deletion leaves at least $m$ finite components and at least $n$ infinite components. It is shown that a vertex of $\Gamma$ of finite valence belongs to only finitely many $(0,2)$-separators. Va