scientific article; zbMATH DE number 1016362

MaRDI QIDQ4338928zbMATHFDO

Authors Konrad Engel

Publication date 2 June 1997

zbMATH Keywords

extremal problemsposetsBoolean latticesfinite setsSperner theoryMacaulay posetsproduct theoremspartition latticeextremal setchain decompositionsset familiesPeck posetsflow morphismscomplete intersection theoremprofile polytopesKruskal-Katona propertyraising operator method

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Recommendations

• scientific article; zbMATH DE number 4063157
• scientific article; zbMATH DE number 3974960
• Extremal Finite Set Theory
• A new proof of a theorem of Harper on the Sperner-Erdős problem
• Extremal problems for finite sets

Cited in

(only showing first 100 items - show all)

• Computational aspects of the 2-dimension of partially ordered sets
• Logical geometries and information in the square of oppositions
• Diamond-free subsets in the linear lattices
• The vertex isoperimetric problem for the powers of the diamond graph
• Supersaturation and stability for forbidden subposet problems.
• Largest family without \(A \cup B \subseteq C \cap D\)
• Polynomials with palindromic and unimodal coefficients
• On the polytope of non-additive measures
• The generalized Füredi conjecture holds for finite linear lattices
• Counting inequivalent monotone Boolean functions.
• The necklace poset is a symmetric chain order
• Singularity points for first passage percolation
• The width of random subsets of Boolean lattices
• Morphisms for resistive electrical networks
• Intersecting antichains and shadows in linear lattices
• Identification of fuzzy measures from sample data with genetic algorithms
• On Dedekind's problem for complete simple games
• A tour of \(M\)-part \(L\)-Sperner families
• Bijective mapping preserving intersecting antichains for \(k\)-valued cubes
• Solution of a problem on non-negative subset sums
• Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
• Two-weight codes: upper bounds and new optimal constructions
• A Meshalkin theorem for projective geometries
• Nested chain partitions of LYM posets
• The Goldman-Rota identity and the Grassmann scheme
• Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
• Some new bounds on partition critical hypergraphs
• Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets.
• Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
• Updown categories: generating functions and universal covers
• Sperner's theorem and a problem of Erdős, Katona and Kleitman
• Invitation to intersection problems for finite sets
• Profile polytopes of some classes of families
• Bounds on the \(k\)-dimension of products of special posets
• Influence decision models: from cooperative game theory to social network analysis
• The spider poset is Macaulay
• Methods for nesting rank 3 normalized matching rank-unimodal posets
• Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
• Counting maximal antichains and independent sets
• Hamiltonian cycles and symmetric chains in Boolean lattices.
• Algebraic methods toward higher-order probability inequalities. II.
• A note on tilted Sperner families with patterns
• Forbidding intersection patterns between layers of the cube
• Interactive Communication, Diagnosis and Error Control in Networks
• Finite posets and Ferrers shapes
• Sperner type theorems with excluded subposets
• Enumeration of certain affine invariant extended cyclic codes
• On Bernoulli decompositions for random variables, concentration bounds, and spectral localization
• Cross-intersecting families and primitivity of symmetric systems
• A generalization of Sperner's theorem and an application to graph orientations
• Boundary optimization for rough sets
• A generalization of Sperner's theorem on compressed ideals
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Profile vectors in the lattice of subspaces
• Extremal problems under dimension constraints.
• Another generalization of Lindström's theorem on subcubes of a cube
• On an equivalence in discrete extremal problems
• Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
• The splitting technique in monotone recognition
• Partitioning the Boolean lattice into chains of large minimum size
• Minimal half-spaces and external representation of tropical polyhedra
• The complexity of embedding orders into small products of chains
• Optimal matrix-segmentation by rectangles
• Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
• Large deviations in the reinforced random walk model on trees
• scientific article; zbMATH DE number 3974960 (Why is no real title available?)
• Integer partitions and the Sperner property
• Optimal channel allocation for several types of cellular radio networks
• The size of the largest antichain in the partition lattice
• The maximum number of subset divisors of a given size
• On nested chain decompositions of normalized matching posets of rank 3
• \(q\)-weighted log-concavity and \(q\)-product theorem on the normality of posets
• A new approach to Macaulay posets
• A combinatorial approach to nonlocality and contextuality
• Minimum weight flat antichains of subsets
• Optimal collapsing protocol for multiparty pointer jumping
• The symmetric group, ordered by refinement of cycles, is strongly Sperner
• Sperner theory in a difference of Boolean lattices
• Forbidden subposet problems for traces of set families
• On the distance of databases
• Intersection theorems under dimension constraints
• Admissible sequences and the preprojective component of a quiver.
• scientific article; zbMATH DE number 7607423 (Why is no real title available?)
• New types of automata to solve fixed point problems
• On \(L\)-close Sperner systems
• Antichain codes
• Inclusion matrices for rainbow subsets
• The \(t\)-intersection problem in the truncated Boolean lattice
• Possibilistic keys
• Wide-sense 2-frameproof codes
• Old and new applications of Katona's circle
• The normalized matching property in random and pseudorandom bipartite graphs
• Abelian groups yield many large families for the diamond problem
• Inequalities for cross-unions of collections of finite sets
• The covering lemma and q-analogues of extremal set theory problems
• A new proof of a theorem of Harper on the Sperner-Erdős problem
• Geometric covering number: covering points with curves
• Additive posets, CW-complexes, and graphs
• Avoiding brooms, forks, and butterflies in the linear lattices
• Generalized forbidden subposet problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338928)