scientific article

From MaRDI portal
Revision as of 10:48, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3741626

zbMath0604.05001MaRDI QIDQ3741626

Ian Anderson

Publication date: 1987


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Ranks of Semigroups Generated by Order-Preserving Transformations with a Fixed Partition TypeA Note on Infinite Antichain DensityOn the set coincidence gameTopological Aspects of Matrix Abduction 1Uniform chain decompositions and applicationsNon-empty cross-3-intersection theorems of subsetsDisjoint systemsPartially unate Boolean functions: properties of their sum-of-products representationsTwo proofs of Bondy's theorem on induced subsets and two related questionsMineurs d'arbres avec racinesPattern Completion in Symmetric Threshold-Linear NetworksTwo Decompositions in Topological Combinatorics with Applications to Matroid ComplexesGotzmann monomials in four variablesThe Stanley Depth in the Upper Half of the Koszul ComplexIntersecting families of permutationsPartitions, their classes, and multicolour evennessOn the distribution of sums of residuesUnnamed ItemConsistent global checkpoints based on direct dependency trackingEdge isoperimetric inequalities for powers of the hypercubeSixty years of network reliabilityA class of posets with integral Laplacian spectrumForbidden induced subposets of given heightSolution of a research problem on trees of subsetsAnother generalization of the Kruskal-Katona theoremApplications of the symmetric chain decomposition of the lattice of divisorsAxiomatisations of functional dependencies in the presence of records, lists, sets and multisetsComputational aspects of the 2-dimension of partially ordered setsLattice-based refinement in bounded model checkingDecompositions of the Boolean lattice into rank-symmetric chains.On the density of sets of divisorsExtreme \(k\)-familiesA generalization of Sperner's theorem on compressed idealsMarkovian log-supermodularity, and its applications in phylogeneticsTowards characterizing equality in correlation inequalitiesA coding theoretic approach to extending designsOn specifying Boolean functions by labelled examplesMatchings, cutsets, and chain partitions in graded posetsGotzmann theorems for exterior algebras and combinatoricsThe cubical poset is additiveThe normalized matching property from the generalized Macaulay theoremThe poset on connected induced subgraphs of a graph need not be SpernerMaximum trees of finite sequencesSolving the job-shop scheduling problem optimally by dynamic programmingSome greedy \(t\)-intersecting families of finite sequencesThe poset on connected graphs is SpernerWhat can be said about pure O-sequences?Characterizing profiles of \(k\)-families in additive Macaulay posetsHomomorphically full graphsThe complexity of embedding orders into small products of chainsShadows and isoperimetry under the sequence-subsequence relationHilbert polynomials in combinatoricsPseudo-LYM inequalities and AZ identitiesERCW PRAMs and optical communicationSupersaturation in posets and applications involving the container methodOn ideals with the Rees propertyAn Erdős-Ko-Rado theorem for signed setsA Meshalkin theorem for projective geometriesAn upper bound on the sum of squares of degrees in a hypergraphConstructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroupsCounting techniques to label constant weight Gray codes with links to minimal generating sets of semigroupsFinding lower bounds on the complexity of secret sharing schemes by linear programmingOn \(k\)-hypertournament matricesUnimodality of Gaussian coefficients: A constructive proofWide-sense 2-frameproof codesSymmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming schemeThe local Kostant-PBW orderingNew bounds on the maximum size of Sperner partition systemsHamiltonian cycles and symmetric chains in Boolean lattices.Symmetric difference-free and symmetric difference-closed collections of setsInclusion matrices and chainsImproved bounds on the partitioning of the Boolean lattice into chains of equal size.A new result on Chvátal's conjectureA Graham-Sloane type construction for \(s\)-surjective matricesA combinatorial decomposition of acyclic simplicial complexesMatchings and the sum functionThe minimum number of disjoint pairs in set systems and related problemsCharacterising nested database dependencies by fragments of propositional logicThe convex hull of antichains in posetsAlgebraic shifting of strongly edge decomposable spheresA combinatorial approach to nonlocality and contextualityNested chain partitions of LYM posetsIntersecting antichains and shadows in linear latticesThe homotopy classes of continuous maps between some nonmetrizable manifoldsEssential covers of the cube by hyperplanesAn Erdős-Ko-Rado theorem for restricted signed setsEmbeddings and other mappings of rooted trees into complete treesPower indices and minimal winning coalitionsAdjacency on the order polytope with applications to the theory of fuzzy measuresSeveral families with incomparability and complementarity conditionsProof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-groupA generalization of Talbot's theorem about King Arthur and his knights of the round tableA generalization of Sperner's theorem and an application to graph orientationsKruskal-Katona function and variants of cross-intersecting antichainsForbidden subposet problems in the gridCross-intersecting sub-families of hereditary familiesSolution of a research problemInvestigating posets via their maximal chainsShifting operations and graded Betti numbersA note on a lemma of Brauer







This page was built for publication: