✦ LIBER ✦

An Independent Non-Helson Set of Spectral Synthesis

✍ Scribed by C.Robert Warner

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 83 KB
Volume: 198
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.1996.0114

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Independence Relation for Sets of Sec

An Independence Relation for Sets of Secrets

✍ Sara Miner More; Pavel Naumov 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 212 KB

An Absolutely Independent Set of ΣO-Sent

An Absolutely Independent Set of ΣO-Sentences

✍ John Myhill 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

An independent dominating set in the com

An independent dominating set in the complement of a minimum dominating set of a tree

✍ Michael A. Henning; Christian Löwenstein; Dieter Rautenbach 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 267 KB

We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.

An AR spectral analysis of non-stationar

An AR spectral analysis of non-stationary signals

✍ N. Martin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 865 KB

The closure of the numerical range of an

The closure of the numerical range of an operator as spectral set

✍ Stefan Hildebrandt 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

Classification of non-well-founded sets

Classification of non-well-founded sets and an application

✍ Nitta Takashi; Okada Tomoko; Athanassios Tzouvaras 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract A complete list of Finsler, Scott and Boffa sets whose transitive closures contain 1, 2 and 3 elements is given. An algorithm for deciding the identity of hereditarily finite Scott sets is presented. Anti‐well‐founded (awf) sets, i. e., non‐well‐founded sets whose all maximal ∈‐paths ar