# Uwe Leck

Macaulay posets are posets for which there is an analogue of the classical KruskalKatona theorem for finite sets. These posets are of great importance in many branches of combinatorics and have numerous applications. We survey mostly new and also some old results on Macaulay posets, where the intention is to present them as pieces of a general theory. In(More)
• Australasian J. Combinatorics
• 2012
It is proved that, for any positive integer m, the weight of the unionclosure of any m distinct 2-sets is at least as large as the weight of the union-closure of the first m 2-sets in squashed (antilexicographic) order, where all i-sets have the same non-negative weight wi with wi ≤ wi+1 for all i, and the weight of a family of sets is the sum of the(More)
• Electr. J. Comb.
• 2009
We study maximal families A of subsets of [n] = {1, 2, . . . , n} such that A contains only pairs and triples and A 6⊆ B for all {A,B} ⊆ A, i.e. A is an antichain. For any n, all such families A of minimum size are determined. This is equivalent to finding all graphs G = (V,E) with |V | = n and with the property that every edge is contained in some triangle(More)
• 1
• We consider the poset SO(n) of all words over an n{element alphabet ordered by the subword relation. It is known that SO(2) falls into the class of Macaulay posets, i.e. there is a theorem of Kruskal{Katona type for SO(2). As the corresponding linear ordering of the elements of SO(2) the vip{order can be chosen. Daykin introduced the V {order which(More)
A ranked poset P is a Macaulay poset if there is a linear order of the elements of P such that for any m; i the set C(m; i) of the m (with respect to) smallest elements of rank i has minimum{sized shadow among all m{element subsets of the i{th level, and the shadow of C(m; i) consists of the smallest elements of the (i ? 1){st level. P is called(More)
• Eur. J. Comb.
• 2014
Some inequalities for cross-unions of families of finite sets are proved that are related to the problem of minimizing the unionclosure of a uniform family of given size. The cross-union of two familiesF andG of subsets of [n] = {1, 2, . . . , n} is the familyF ∨ G = {F ∪ G : F ∈ F ,G ∈ G}. It is shown that |F ∨ G|/|F | ≥ |G ∨ Bn|/2, where Bn denotes the(More)
• 1
• Comput. J.
• 2011
Keys allow a database management system to uniquely identify tuples in a database. Consequently, the class of keys is of great significance for almost all data processing tasks. In the relational model of data, keys have received considerable interest and are well understood. However, for efficient means of data processing most commercial relational(More)
• JELIA
• 2014
Possibility theory is applied to introduce and reason about the fundamental notion of a key for uncertain data. Uncertainty is modeled qualitatively by assigning to tuples of data a degree of possibility with which they occur in a relation, and assigning to keys a degree of certainty which says to which tuples the key applies. The associated implication(More)