We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1 k-1 ) is at least k provided that k 6 n=2
Christian Bey, Konrad Engel, Gyula O. H. Katona, U...
We present a sampling strategy and rendering framework for intersectable models, whose surface is implicitly defined by a black box intersection test that provides the location a...
In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formul...
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khac...
This paper first gives a brief overview over some interesting descriptions of conic sections, showing formulations in the three geometric algebras of Euclidean spaces, projective ...
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...