scientific article; zbMATH DE number 1016362
From MaRDI portal
Publication:4338928
zbMath0868.05001MaRDI QIDQ4338928
Publication date: 2 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
posetsextremal problemsfinite setsBoolean latticesSperner 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)
Related Items (only showing first 100 items - show all)
Shelling the \(m=1\) amplituhedron ⋮ A note on tilted Sperner families with patterns ⋮ A Note on Infinite Antichain Density ⋮ Minimum weight flat antichains of subsets ⋮ Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces ⋮ Multidimension: a dimensionality extension of simple games ⋮ The Profile Polytope of Nontrivial Intersecting Families ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ On the generalized dimension and codimension of simple games ⋮ Unnamed Item ⋮ Improved bounds for cross-Sperner systems ⋮ Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) ⋮ Inclusion matrices for rainbow subsets ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ Sperner's Problem forG-Independent Families ⋮ Sperner's Theorem and a Problem of Erdős, Katona and Kleitman ⋮ 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 ⋮ Unnamed Item ⋮ Sequences of reflection functors and the preprojective component of a valued quiver. ⋮ Optimal matrix-segmentation by rectangles ⋮ Antichain codes ⋮ The vertex isoperimetric problem for the powers of the diamond graph ⋮ Finite posets and Ferrers shapes ⋮ Identification of fuzzy measures from sample data with genetic algorithms ⋮ New types of automata to solve fixed point problems ⋮ Singularity points for first passage percolation ⋮ Inequalities for cross-unions of collections of finite sets ⋮ Partial order embeddings with convex range ⋮ Unnamed Item ⋮ Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Nonhomogeneous analytic families of trees ⋮ The symmetric group, ordered by refinement of cycles, is strongly Sperner ⋮ Largest family without \(A \cup B \subseteq C \cap D\) ⋮ On the orthogonal product of simplices and products of truncated Boolean lattices ⋮ Sparse asymmetric connectors in communication networks ⋮ The maximum number of subset divisors of a given size ⋮ Influence decision models: from cooperative game theory to social network analysis ⋮ Algebraic methods toward higher-order probability inequalities. II. ⋮ A new matching property for posets and existence of disjoint chains ⋮ Intersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)] ⋮ Intersection theorems under dimension constraints ⋮ Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ Computational aspects of the 2-dimension of partially ordered sets ⋮ Integer partitions and the Sperner property ⋮ On the polytope of non-additive measures ⋮ On Dedekind's problem for complete simple games ⋮ Counting maximal antichains and independent sets ⋮ A generalization of Sperner's theorem on compressed ideals ⋮ Limit theorems for maximum flows on a lattice ⋮ Construction of asymmetric connectors of depth two ⋮ The generalized Füredi conjecture holds for finite linear lattices ⋮ Symmetric decompositions and the strong Sperner property for noncrossing partition lattices ⋮ Optimal channel allocation for several types of cellular radio networks ⋮ A new approach to Macaulay posets ⋮ Counting combinatorial choice rules ⋮ The complexity of embedding orders into small products of chains ⋮ Tight bound for deciding convergence of consensus systems ⋮ Bounds on the \(k\)-dimension of products of special posets ⋮ Sperner type theorems with excluded subposets ⋮ On the distance of databases ⋮ Additive posets, CW-complexes, and graphs ⋮ Cross-intersecting families and primitivity of symmetric systems ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ On the Sperner property for the absolute order on complex reflection groups ⋮ A Meshalkin theorem for projective geometries ⋮ The Goldman-Rota identity and the Grassmann scheme ⋮ Hilbert functions of colored quotient rings and a generalization of the Clements-Lindström theorem ⋮ Some new bounds on partition critical hypergraphs ⋮ Updown categories: generating functions and universal covers ⋮ Projection inequalities for antichains ⋮ Solution of a problem on non-negative subset sums ⋮ Bijective mapping preserving intersecting antichains for \(k\)-valued cubes ⋮ Minimal half-spaces and external representation of tropical polyhedra ⋮ Maximum antichains in posets of quiver representations ⋮ On nested chain decompositions of normalized matching posets of rank 3 ⋮ Morphisms for resistive electrical networks ⋮ Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets. ⋮ Extremal problems under dimension constraints. ⋮ Maximal antichains under dimension constraints ⋮ On the orthogonal product of simplices and direct products of truncated Boolean lattices ⋮ Counting inequivalent monotone Boolean functions. ⋮ Wide-sense 2-frameproof codes ⋮ Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme ⋮ On local LYM identities ⋮ Diamond-free subsets in the linear lattices ⋮ On the log-concavity of sequences arising from integer bases. ⋮ Large deviations in the reinforced random walk model on trees ⋮ The spider poset is Macaulay ⋮ Hamiltonian cycles and symmetric chains in Boolean lattices. ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ \(q\)-weighted log-concavity and \(q\)-product theorem on the normality of posets ⋮ The splitting technique in monotone recognition ⋮ On Bernoulli decompositions for random variables, concentration bounds, and spectral localization ⋮ Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings ⋮ Another generalization of Lindström's theorem on subcubes of a cube ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Logical geometries and information in the square of oppositions
This page was built for publication: