Logarithmic order of free distributive lattice

DOI10.2969/JMSJ/00630343zbMATH Open0056.26301OpenAlexW2084913436WikidataQ56430227 ScholiaQ56430227MaRDI QIDQ2651979FDOQ2651979

Authors: Koichi Yamamoto 

Publication date: 1954

Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2969/jmsj/00630343

zbMATH Keywords

Rings, modules, fields

Cited In (69)

• Variations on the Bollobás set-pair theorem
• Formalising the Kruskal-Katona theorem in Lean
• AZ-identities and strict 2-part Sperner properties of product posets
• Colouring set families without monochromatic \(k\)-chains
• Old and new applications of Katona's circle
• The covering lemma and q-analogues of extremal set theory problems
• Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals
• On two-part Sperner systems for regular posets (extended abstract)
• Sperner's Problem forG-Independent Families
• Generic type of Ahlswede–Zhang style identities
• Uniqueness in Harper's vertex-isoperimetric theorem
• Pseudo-LYM inequalities and AZ identities
• Localized versions of extremal problems
• Yanamoto inequality and gatherings
• Abelian groups yield many large families for the diamond problem
• \(Q _{2}\)-free families in the Boolean lattice
• On almost \(k\)-covers of hypercubes
• The number of monotone and self-dual Boolean functions.
• EKR type inequalities for 4-wise intersecting families
• Extremal properties of collections of subsets containing no two sets and their union
• Multicoloured extremal problems
• On Sperner families in which no k sets have an empty intersection. III
• The number of unrelated partitions
• Extremal set theory for the binomial norm
• Extensions of the Erdös-Ko-Rado Theorem
• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• Helly property in finite set systems
• The local Kostant-PBW ordering
• Saturated Graphs of Prescribed Minimum Degree
• On counting Sperner families
• Some properties of solution sets to nonconvex quadratic programming problems
• The level polynomials of the free distributive lattices
• Largest families without an \(r\)-fork
• On maximal families of subsets of a finite set
• On maximal antichains consisting of sets and their complements
• An identity in combinatorial extremal theory
• A generalization of the AZ identity
• An upper bound on the size of diamond-free families of sets
• Weighted cross-intersecting families
• A tour of \(M\)-part \(L\)-Sperner families
• Multiply-intersecting families revisited
• A probabilistic proof for the Lym-inequality
• Minimum weight flat antichains of subsets
• Minimum number of affine simplices of given dimension
• Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
• Intersecting Sperner families and their convex hulls
• Some new results on the Littlewood-Offord problem
• \(l\)-trace \(k\)-Sperner families of sets
• Generalizing Sperner's lemma to a free module over a special principal ideal ring
• On nested chain decompositions of normalized matching posets of rank 3
• Some remarks on normalized matching
• Supersaturation and stability for forbidden subposet problems.
• The complexity of monotone boolean functions
• Investigating posets via their maximal chains
• The convex hull of antichains in posets
• The variety of Boolean semirings
• A Generalized Rota Conjecture for Partitions
• A Meshalkin theorem for projective geometries
• Sharpening the LYM inequality
• AZ-style identities of downsets and upsets
• An adaptive algorithm for group testing for complexes
• Families of chains of a poset and Sperner properties
• A LYM inequality for induced posets
• Combinatorics in the exterior algebra and the Bollobás Two Families Theorem
• Maximum-size antichains in random set-systems
• On maximal antichains containing no set and its complement
• A survey of some combinatorial results concerning functional dependencies in database relations.
• On the average rank of LYM-sets
• A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains

This page was built for publication: Logarithmic order of free distributive lattice

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