✦ LIBER ✦

A Family of Inequalities for Intersecting Antichain of Subsets of an n-set

✍ Scribed by Changyu Wang; Huishan Zhou

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 252 KB
Volume: 17
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum Antichains in Random Subsets of

Maximum Antichains in Random Subsets of a Finite Set

✍ Deryk Osthus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p

An intersection theorem for systems of s

An intersection theorem for systems of sets

✍ A. V. Kostochka 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 2 views

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

A New Method for a Class of Nonlinear Se

A New Method for a Class of Nonlinear Set-valued Variational Inequalities

✍ N.-J. Huang 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

ry gywwxsgesyx eww Á F ngewF wthF wehF UV @IWWVA TD RPU± ±RQH rungD xFEjF e xew wethod for glss of xonliner etEvlued ritionl snequlities sn this pper we onstrut new itertive lgorithm for solving new lss of nonliner vritionl inequlities with setE vlued mppingD nd give some onvergene nlysis of itertiv

An Inequality on the Size of a Set in a

An Inequality on the Size of a Set in a Cartesian Product

✍ H. Maehara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Let be a finite subset of the Cartesian product W 1 × • • • × W n of n sets. For A ⊂ {1, 2, . . . , n}, denote by A the projection of onto the Cartesian product of W i , i ∈ A. Generalizing an inequality given in an article by Shen, we prove that , 2, . . . , n}. This inequality is applied to give s

Perturbation Inequalities and Confidence

Perturbation Inequalities and Confidence Sets for Functions of a Scatter Matrix

✍ Lutz Dümbgen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Let 7 be an unknown covariance matrix. Perturbation (in)equalities are derived for various scale-invariant functionals of 7 such as correlations (including partial, multiple and canonical correlations) or angles between eigenspaces. These results show that a particular confidence set for 7 is canoni