scientific article; zbMATH DE number 1016362

MaRDI QIDQ4338928zbMATH OpenFDO

Authors Konrad Engel

Publication date 2 June 1997

zbMATH Keywords

Macaulay posetsSperner theoryset familiesraising operator methodprofile polytopesproduct theoremsposetsPeck posetspartition latticeBoolean latticesKruskal-Katona propertyflow morphismsfinite setsextremal setextremal problemscomplete intersection theoremchain decompositions

Mathematics Subject Classification ID

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

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)

• Methods for nesting rank 3 normalized matching rank-unimodal posets
• A generalization of Sperner's theorem and an application to graph orientations
• Profile vectors in the lattice of subspaces
• A new proof of a theorem of Harper on the Sperner-Erdős problem
• The size of the largest antichain in the partition lattice
• On posets whose products are Macaulay
• On an equivalence in discrete extremal problems
• Optimal channel allocation for several types of cellular radio networks
• A Meshalkin theorem for projective geometries
• Extremal problems under dimension constraints.
• Maximal antichains under dimension constraints
• On the orthogonal product of simplices and direct products of truncated Boolean lattices
• On the log-concavity of sequences arising from integer bases.
• Strong Sperner property of the subgroup lattice of an Abelian \(p\)-group
• Partitioning the Boolean lattice into chains of large minimum size
• Limit theorems for maximum flows on a lattice
• Additive posets, CW-complexes, and graphs
• Maximum antichains in posets of quiver representations
• Nested chain partitions of LYM posets
• Admissible sequences and the preprojective component of a quiver.
• Enumeration of certain affine invariant extended cyclic codes
• Forbidden subposet problems for traces of set families
• Incidence matrices for matchings
• On quotients of posets, with an application to the q-analog of the hypercube
• Sperner theory in a difference of Boolean lattices
• The \(t\)-intersection problem in the truncated Boolean lattice
• The width of random subsets of Boolean lattices
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Algebraic methods toward higher-order probability inequalities. II.
• A new matching property for posets and existence of disjoint chains
• Computational aspects of the 2-dimension of partially ordered sets
• Integer partitions and the Sperner property
• On the distance of databases
• The spider poset is Macaulay
• Old and new applications of Katona's circle
• The normalized matching property in random and pseudorandom bipartite graphs
• On \(L\)-close Sperner systems
• On the Sperner property for the absolute order on complex reflection groups
• Projection inequalities for antichains
• Wide-sense 2-frameproof codes
• A combinatorial approach to nonlocality and contextuality
• Logical geometries and information in the square of oppositions
• On the structure of minimal winning coalitions in simple voting games
• Some remarks on nestings in the normalized matching posets of rank 3
• A continuous analogue of Erdős' \(k\)-Sperner theorem
• Majorization and Rényi entropy inequalities via Sperner theory
• Two-weight codes: upper bounds and new optimal constructions
• Possibilistic keys
• Harmonicity and invariance on slices of the Boolean cube
• Polynomials with palindromic and unimodal coefficients
• Symmetric chain decompositions of quotients by wreath products.
• Forbidding intersection patterns between layers of the cube
• Abelian groups yield many large families for the diamond problem
• Intersection theorems under dimension constraints
• Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
• On Dedekind's problem for complete simple games
• Counting maximal antichains and independent sets
• Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
• Tight bound for deciding convergence of consensus systems
• Morphisms for resistive electrical networks
• Counting inequivalent monotone Boolean functions.
• On local LYM identities
• Optimal collapsing protocol for multiparty pointer jumping
• Profile polytopes of some classes of families
• AZ-identities and strict 2-part Sperner properties of product posets
• Sequences of reflection functors and the preprojective component of a valued quiver.
• The vertex isoperimetric problem for the powers of the diamond graph
• Identification of fuzzy measures from sample data with genetic algorithms
• Singularity points for first passage percolation
• Inequalities for cross-unions of collections of finite sets
• Largest family without A B C D
• A note on tilted Sperner families with patterns
• Minimum weight flat antichains of subsets
• The maximum number of subset divisors of a given size
• A generalization of Sperner's theorem on compressed ideals
• On the orthogonal product of simplices and products of truncated Boolean lattices
• Sparse asymmetric connectors in communication networks
• Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• Interactive Communication, Diagnosis and Error Control in Networks
• scientific article; zbMATH DE number 3974960 (Why is no real title available?)
• Bounds on the k-dimension of products of special posets
• Sperner type theorems with excluded subposets
• The Goldman-Rota identity and the Grassmann scheme
• Some new bounds on partition critical hypergraphs
• Solution of a problem on non-negative subset sums
• Bijective mapping preserving intersecting antichains for k-valued cubes
• Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets.
• Diamond-free subsets in the linear lattices
• Large deviations in the reinforced random walk model on trees
• Hamiltonian cycles and symmetric chains in Boolean lattices.
• Supersaturation and stability for forbidden subposet problems.
• The symmetric group, ordered by refinement of cycles, is strongly Sperner
• scientific article; zbMATH DE number 7607423 (Why is no real title available?)
• A Note on Infinite Antichain Density
• Symmetric chain decompositions and the strong Sperner property for noncrossing partition lattices
• The splitting technique in monotone recognition
• Nonhomogeneous analytic families of trees
• Sperner's problem for \(G\)-independent families
• Sperner's theorem and a problem of Erdős, Katona and Kleitman

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)