✦ LIBER ✦

The maximality of filters

✍ Scribed by Christopher J. Mulvey

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 382 KB
Volume: 68
Category: Article
ISSN: 0022-4049
DOI: 10.1016/0022-4049(90)90148-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Maximality of Cartesian Categories

✍ Kosta Došen; Zoran Petrić 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB

On ◁∗-maximality

✍ Mirna Džamonja; Saharon Shelah 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Maximally flat non-recursive digital fil

Maximally flat non-recursive digital filters

✍ M. F. Fahmy 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Abstract A new class of polynomials with derivative constraints at both x= ± 1, is introduced. Such polynomials can be used in the design of non‐recursive digital filters with maximally flat amplitude response at both ±T= 0 and ±T= 180 degrees, as well as the design of certain class of microwave

The axiom of choice holds iff maximal cl

The axiom of choice holds iff maximal closed filters exist

✍ Horst Herrlich 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 65 KB

## Abstract It is shown that in ZF set theory the axiom of choice holds iff every non empty topological space has a maximal closed filter.

The maximally flat fir fractional sample

The maximally flat fir fractional sample delay filter revisited

✍ Ewa Hermanowicz 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

Maximality of the cycle code of a graph

✍ Patrick Solé; Thomas Zaslavsky 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 274 KB

The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We characterize the graphs whose cycle codes are maximal for the packing problem, based on characterizing the graphs whose girth is at least :(n-c)+ 1 where n and c are the numbers of vertices and connecte