scientific article; zbMATH DE number 1016362

zbMATH Open0868.05001MaRDI QIDQ4338928FDOQ4338928

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)

• 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
• Investigating posets via their maximal chains
• Nonhomogeneous analytic families of trees
• Majorization and Rényi entropy inequalities via Sperner theory
• Sperner's problem for \(G\)-independent families
• Some remarks on nestings in the normalized matching posets of rank 3
• On the structure of minimal winning coalitions in simple voting games
• Multidimension: a dimensionality extension of simple games
• On non-empty cross-\(t\)-intersecting families
• A new matching property for posets and existence of disjoint chains
• Sequences of reflection functors and the preprojective component of a valued quiver.
• Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces
• On the generalized dimension and codimension of simple games
• Construction of asymmetric connectors of depth two
• scientific article; zbMATH DE number 7592927 (Why is no real title available?)
• A continuous analogue of Erdős' \(k\)-Sperner theorem
• Limit theorems for maximum flows on a lattice
• Maximum antichains in posets of quiver representations
• Strong Sperner property of the subgroup lattice of an Abelian \(p\)-group
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• Reflect-push methods. Part I: Two dimensional techniques
• On quotients of posets, with an application to the \(q\)-analog of the hypercube
• On the orthogonal product of simplices and direct products of truncated Boolean lattices
• On the log-concavity of sequences arising from integer bases.
• Shelling the \(m=1\) amplituhedron
• Counting combinatorial choice rules
• AZ-identities and strict 2-part Sperner properties of product posets
• On the orthogonal product of simplices and products of truncated Boolean lattices
• Sparse asymmetric connectors in communication networks
• Improved bounds for cross-Sperner systems
• A Note on Infinite Antichain Density
• The Profile Polytope of Nontrivial Intersecting Families
• Projection inequalities for antichains
• Incidence matrices for matchings
• Tight bound for deciding convergence of consensus systems
• On local LYM identities
• Maximal antichains under dimension constraints
• Symmetric chain decompositions of quotients by wreath products.
• Hilbert functions of colored quotient rings and a generalization of the Clements-Lindström theorem
• On posets whose products are Macaulay
• On the Sperner property for the absolute order on complex reflection groups
• Symmetric chain decompositions and the strong Sperner property for noncrossing partition lattices
• Harmonicity and invariance on slices of the Boolean cube
• mathlib4 Module Mathlib/Order/Grade
• Partial order embeddings with convex range
• 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

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)