Combinatorial theory.

zbMATH Open0858.05001MaRDI QIDQ2565249FDOQ2565249

Martin Aigner

Publication date: 27 January 1997

Published in: Classics in Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1219592
• Combinatory analysis. Vols. I, II (bound in one volume)
• Notes on introductory combinatorics
• scientific article; zbMATH DE number 3943824

zbMATH Keywords

permutationlatticessequencesenumerationmatrixgenerating functionsinversionmatroidposetsrecursionpatternsvaluationscounting functionsincidence algebrasincidence functionsordered structuresRamsey theoremsgeometric latticescounting coefficientsmaximum-minimum theoremsSperner theoremstransversal theoremsMöbius functionMöbius inversion

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)

Cited In (73)

• On the computational complexity of the order polynomial
• The power of randomness in Bayesian optimal mechanism design
• The lattice of finite subspace partitions
• DISCRETE MODEL OF STATIC LOADS DISTRIBUTION MANAGEMENT ON LATTICE STRUCTURES
• Fischer matrices for generalised symmetric groups -- a combinatorial approach
• Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem
• An elementary approach to the location of the maximum Stirling number(s) of the second kind
• Asymptotic probabilities of extension properties and random \(l\)-colourable structures
• The Sylvester-Gallai theorem, colourings and algebra
• Diagrams for modular lattices
• Particular solutions of equations with multiple characteristics expressed through hypergeometric functions
• Enumeration of injective partial transformations
• A compact representation for modular semilattices and its applications
• Finitary topos for locally finite, causal and quantal vacuum Einstein gravity
• Posets with maximal Möbius function
• Combinatory analysis. Vols. I, II (bound in one volume)
• The \(r\)-Stirling numbers of the first kind in terms of the Möbius function
• Foundations of enumeration theory for finite nilpotent groups
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Ring geometries, two-weight codes, and strongly regular graphs
• Compactification of the energy surfaces for \(n\) bodies
• Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees.
• One more well-solved case of the multifacility location problem
• Normalization of monomial ideals and Hilbert functions
• Eigenvalues and equivalent transformation of a trigonometric matrix associated with filter design
• On the dimension of twisted centralizer codes
• Producing posets
• Equicovering matroids by distinct bases
• On \(n\)-arithmetical triangles constructed for polynomial coefficients
• Evaluation codes and their basic parameters
• Atomic semicommutations
• MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
• Title not available (Why is that?)
• Relation spaces of hyperplane arrangements and modules defined by graphs of fiber zonotopes
• A course in combinatorics.
• Multicuts and perturb \& MAP for probabilistic graph clustering
• Matrix algebra for higher order moments
• An almost accurate location of the maximum Stirling number(s) of the second kind
• On the linear classification of even and odd permutation matrices and the complexity of computing the permanent
• The Lattice of Computably Enumerable Vector Spaces
• Lattice flows in networks
• A new matching property for posets and existence of disjoint chains
• Discrete orthogonal transforms on multisets associated with complete sequences
• On matroid parity and matching polytopes
• A topological representation of lattices
• Extremal problems for the Möbius function in the face lattice of the \(n\)-octahedron
• The ring of polyfunctions over Z/nZ
• Title not available (Why is that?)
• Inequalities for the number of monotonic functions of partial orders
• Stirling numbers and integer partitions
• Yes, the “missing axiom” of matroid theory is lost forever
• Title not available (Why is that?)
• Sampling complete designs
• The link between segregation and phylogenetic diversity
• The recombination equation for interval partitions
• Search and sweep numbers of finite directed acyclic graphs
• The general recombination equation in continuous time and its solution
• Ring graphs and complete intersection toric ideals
• Haldane linearisation done right: solving the nonlinear recombination equation the easy way
• A new view of relationship between atomic posets and complete (algebraic) lattices
• Symmetrische Zerlegung von Kettenprodukten
• On the irrationality of factorial series. II
• On axiomatizability of the class of finitary matroids and decidability of their universal theory
• Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts
• Title not available (Why is that?)
• Title not available (Why is that?)
• A geometric study of cores of idempotent stochastic matrices
• Riordan posets and associated incidence matrices
• Supersolvable posets and fiber-type abelian arrangements
• Title not available (Why is that?)
• Asymptotic sampling distributions made easy: loose linkage in the ancestral recombination graph
• Some identities involving second kind Stirling numbers of types \(B\) and \(D\)
• Title not available (Why is that?)

This page was built for publication: Combinatorial theory.

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