✦ LIBER ✦

Sperner families over a subset

✍ Scribed by Ko-Wei Lih

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 254 KB
Volume: 29
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90007-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sperner families of bounded VC-dimension

✍ R.P. Anstee; A. Sali 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 344 KB

We explore a problem of Frankl (1989). A family ~ of subsets of {1, 2, ..., m} is said to have trace Kk if there is a subset SC\_{1,2 ..... m} with IS] = k so that {FNSIF C .~} yields all 2 k possible subsets. Frankl (1989) conjectured that a family ~ which is an antichain (in poser given by C\_ ord

A Sperner theorem on unrelated chains of

A Sperner theorem on unrelated chains of subsets

✍ Jerrold R Griggs; Jürgen Stahl; William T Trotter Jr. 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Families of chains of a poset and Sperne

Families of chains of a poset and Sperner properties

✍ Bruno Leclerc 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 626 KB

A subset A of a poset P is a q-anti&in if it can be obtained as the union of at most q antichains. A ranked poset P is said to be q-Sperner if the maximum number of elements of a q-antichain of P is the sum of the cardinalities of its q larger rank-sets. P is strongly Spernu if it is q-Sperner for a

On the average size of the sets in a Spe

On the average size of the sets in a Sperner family

✍ D.J. Kleitman; E.C. Milner 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Generalized Factorials and Fixed Divisor

Generalized Factorials and Fixed Divisors over Subsets of a Dedekind Domain

✍ Manjul Bhargava 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Given a subset X of a Dedekind domain D, and a polynomial F # D[x], the fixed divisor d(X, F) of F over X is defined to be the ideal in D generated by the elements F(a), a # X. In this paper we derive a simple expression for d(X, F) explicitly in terms of the coefficients of F, using a generalized n

A hybrid algorithm for finding minimal u

A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs

✍ I. Shah 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

Minimal Unsatisfiable Subsets (MUSes) are the subsets of constraints of an overconstrained constraint satisfaction problem (CSP) that cannot be satisfied simultaneously and therefore are responsible for the conflict in the CSP. In this paper, we present a hybrid algorithm for finding MUSes in overco