scientific article; zbMATH DE number 1016362
zbMATH Open0868.05001MaRDI QIDQ4338928FDOQ4338928
Authors: Konrad Engel
Publication date: 2 June 1997
Title of this publication is not available (Why is that?)
Recommendations
extremal problemsposetsBoolean latticesfinite setsSperner theoryMacaulay posetsproduct theoremspartition latticeextremal setchain decompositionsset familiesPeck posetsflow morphismscomplete intersection theoremprofile polytopesKruskal-Katona propertyraising operator method
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)
Cited In (only showing first 100 items - show all)
- Partitioning the Boolean lattice into chains of large minimum size
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
- The maximum number of subset divisors of a given size
- Finite posets and Ferrers shapes
- Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
- The Goldman-Rota identity and the Grassmann scheme
- Some new bounds on partition critical hypergraphs
- Extremal problems under dimension constraints.
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- A generalization of Sperner's theorem and an application to graph orientations
- Intersecting antichains and shadows in linear lattices
- Cross-intersecting families and primitivity of symmetric systems
- Another generalization of Lindström's theorem on subcubes of a cube
- Minimal half-spaces and external representation of tropical polyhedra
- Bijective mapping preserving intersecting antichains for \(k\)-valued cubes
- Solution of a problem on non-negative subset sums
- Profile vectors in the lattice of subspaces
- \(q\)-weighted log-concavity and \(q\)-product theorem on the normality of posets
- Boundary optimization for rough sets
- Integer partitions and the Sperner property
- On the polytope of non-additive measures
- The spider poset is Macaulay
- Forbidding intersection patterns between layers of the cube
- Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets.
- Profile polytopes of some classes of families
- A new approach to Macaulay posets
- A note on tilted Sperner families with patterns
- Title not available (Why is that?)
- A generalization of Sperner's theorem on compressed ideals
- Largest family without \(A \cup B \subseteq C \cap D\)
- Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
- Counting inequivalent monotone Boolean functions.
- Morphisms for resistive electrical networks
- On an equivalence in discrete extremal problems
- Diamond-free subsets in the linear lattices
- The necklace poset is a symmetric chain order
- A tour of \(M\)-part \(L\)-Sperner families
- Updown categories: generating functions and universal covers
- Influence decision models: from cooperative game theory to social network analysis
- The complexity of embedding orders into small products of chains
- Identification of fuzzy measures from sample data with genetic algorithms
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- The size of the largest antichain in the partition lattice
- A combinatorial approach to nonlocality and contextuality
- Singularity points for first passage percolation
- Optimal matrix-segmentation by rectangles
- Large deviations in the reinforced random walk model on trees
- Optimal channel allocation for several types of cellular radio networks
- On nested chain decompositions of normalized matching posets of rank 3
- Polynomials with palindromic and unimodal coefficients
- Computational aspects of the 2-dimension of partially ordered sets
- Logical geometries and information in the square of oppositions
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
- Hamiltonian cycles and symmetric chains in Boolean lattices.
- Supersaturation and stability for forbidden subposet problems.
- Methods for nesting rank 3 normalized matching rank-unimodal posets
- The width of random subsets of Boolean lattices
- Two-weight codes: upper bounds and new optimal constructions
- A Meshalkin theorem for projective geometries
- Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
- Algebraic methods toward higher-order probability inequalities. II.
- The generalized Füredi conjecture holds for finite linear lattices
- Invitation to intersection problems for finite sets
- Enumeration of certain affine invariant extended cyclic codes
- The vertex isoperimetric problem for the powers of the diamond graph
- Bounds on the \(k\)-dimension of products of special posets
- Nested chain partitions of LYM posets
- Counting maximal antichains and independent sets
- Interactive Communication, Diagnosis and Error Control in Networks
- The splitting technique in monotone recognition
- Sperner type theorems with excluded subposets
- On Bernoulli decompositions for random variables, concentration bounds, and spectral localization
- On Dedekind's problem for complete simple games
- Wide-sense 2-frameproof codes
- Counting combinatorial choice rules
- On the orthogonal product of simplices and products of truncated Boolean lattices
- Sparse asymmetric connectors in communication networks
- The \(t\)-intersection problem in the truncated Boolean lattice
- Abelian groups yield many large families for the diamond problem
- Nonhomogeneous analytic families of trees
- On the Sperner property for the absolute order on complex reflection groups
- Possibilistic keys
- On local LYM identities
- Harmonicity and invariance on slices of the Boolean cube
- Projection inequalities for antichains
- Sperner theory in a difference of Boolean lattices
- Antichain codes
- On the orthogonal product of simplices and direct products of truncated Boolean lattices
- AZ-identities and strict 2-part Sperner properties of product posets
- Construction of asymmetric connectors of depth two
- On posets whose products are Macaulay
- Sequences of reflection functors and the preprojective component of a valued quiver.
- Maximal antichains under dimension constraints
- The symmetric group, ordered by refinement of cycles, is strongly Sperner
- Strong Sperner property of the subgroup lattice of an Abelian \(p\)-group
- Shelling the \(m=1\) amplituhedron
- Limit theorems for maximum flows on a lattice
- Admissible sequences and the preprojective component of a quiver.
- Inclusion matrices for rainbow subsets
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)