Logarithmic order of free distributive lattice

From MaRDI portal
Publication:2651979

DOI10.2969/jmsj/00630343zbMath0056.26301OpenAlexW2084913436WikidataQ56430227 ScholiaQ56430227MaRDI QIDQ2651979

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




Related Items (68)

Combinatorics in the exterior algebra and the Bollobás Two Families TheoremThe number of monotone and self-dual Boolean functions.Multicoloured extremal problemsA survey of some combinatorial results concerning functional dependencies in database relations.On the average rank of LYM-setsMultiply-intersecting families revisitedFamilies of chains of a poset and Sperner propertiesAZ-style identities of downsets and upsetsThe number of unrelated partitionsAn extremal problem of \(d\) permutations containing every permutation of every \(t\) elementsMinimum weight flat antichains of subsetsEKR type inequalities for 4-wise intersecting familiesPseudo-LYM inequalities and AZ identitiesOn counting Sperner familiesA tour of \(M\)-part \(L\)-Sperner familiesA Meshalkin theorem for projective geometriesA LYM inequality for induced posetsThe level polynomials of the free distributive latticesThe covering lemma and q-analogues of extremal set theory problemsGeneric type of Ahlswede–Zhang style identitiesForbidden Intersection Patterns in the Families of Subsets (Introducing a Method)Generalizing Sperner's lemma to a free module over a special principal ideal ringOn maximal families of subsets of a finite setFormalising the Kruskal-Katona theorem in LeanLocalized versions of extremal problemsOn maximal antichains consisting of sets and their complementsSperner's Problem forG-Independent FamiliesOn nested chain decompositions of normalized matching posets of rank 3On maximal antichains containing no set and its complementAn upper bound on the size of diamond-free families of setsSaturated Graphs of Prescribed Minimum DegreeAn identity in combinatorial extremal theoryOn Sperner families in which no k sets have an empty intersection. IIIOn almost \(k\)-covers of hypercubesA probabilistic proof for the Lym-inequalityMinimum number of affine simplices of given dimensionThe local Kostant-PBW orderingAZ-identities and strict 2-part Sperner properties of product posetsSupersaturation and stability for forbidden subposet problems.Largest families without an \(r\)-forkAn adaptive algorithm for group testing for complexesThe variety of Boolean semiringsExtensions of the Erdös-Ko-Rado TheoremSharpening the LYM inequalityMixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full MultitransversalsThe convex hull of antichains in posetsHelly property in finite set systemsWeighted cross-intersecting familiesSome properties of solution sets to nonconvex quadratic programming problemsExtremal set theory for the binomial normUnnamed ItemThe complexity of monotone boolean functionsExtremal properties of collections of subsets containing no two sets and their unionA Generalized Rota Conjecture for PartitionsSome new results on the Littlewood-Offord problemYanamoto inequality and gatheringsOld and new applications of Katona's circleUniqueness in Harper's vertex-isoperimetric theoremMaximum-size antichains in random set-systems\(l\)-trace \(k\)-Sperner families of sets\(Q _{2}\)-free families in the Boolean latticeColouring set families without monochromatic \(k\)-chainsInvestigating posets via their maximal chainsSome remarks on normalized matchingIntersecting Sperner families and their convex hullsA generalization of the AZ identityA shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichainsAbelian groups yield many large families for the diamond problem




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