Combinatorial theory.
From MaRDI portal
Publication:2565249
permutationlatticessequencesenumerationmatrixgenerating functionsinversionmatroidposetsrecursionpatternsvaluationscounting functionsincidence algebrasincidence functionsordered structuresRamsey theoremsgeometric latticescounting coefficientsmaximum-minimum theoremsSperner theoremstransversal theoremsMöbius functionMöbius inversion
Recommendations
Cited in
(76)- On the irrationality of factorial series. II
- On axiomatizability of the class of finitary matroids and decidability of their universal theory
- On the computational complexity of the order polynomial
- The power of randomness in Bayesian optimal mechanism design
- The lattice of finite subspace partitions
- 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
- scientific article; zbMATH DE number 46161 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 5018197 (Why is no real title available?)
- Combinatory analysis. Vols. I, II (bound in one volume)
- scientific article; zbMATH DE number 3877179 (Why is no real title available?)
- A geometric study of cores of idempotent stochastic matrices
- Yes, the ``missing axiom of matroid theory is lost forever
- The \(r\)-Stirling numbers of the first kind in terms of the Möbius function
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Foundations of enumeration theory for finite nilpotent groups
- Riordan posets and associated incidence matrices
- Ring geometries, two-weight codes, and strongly regular graphs
- Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees.
- Compactification of the energy surfaces for \(n\) bodies
- 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
- Supersolvable posets and fiber-type abelian arrangements
- Equicovering matroids by distinct bases
- On n-arithmetical triangles constructed for polynomial coefficients
- Evaluation codes and their basic parameters
- Atomic semicommutations
- Relation spaces of hyperplane arrangements and modules defined by graphs of fiber zonotopes
- MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
- Discrete model of static loads distribution management on lattice structures
- scientific article; zbMATH DE number 1792287 (Why is no real title available?)
- Multicuts and perturb \& MAP for probabilistic graph clustering
- A course in combinatorics.
- 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
- Lattice flows in networks
- A new matching property for posets and existence of disjoint chains
- The Lattice of Computably Enumerable Vector Spaces
- Discrete orthogonal transforms on multisets associated with complete sequences
- On matroid parity and matching polytopes
- A topological representation of lattices
- Asymptotic sampling distributions made easy: loose linkage in the ancestral recombination graph
- Extremal problems for the Möbius function in the face lattice of the n-octahedron
- scientific article; zbMATH DE number 7497513 (Why is no real title available?)
- Some identities involving second kind Stirling numbers of types \(B\) and \(D\)
- The ring of polyfunctions over Z/nZ
- Inequalities for the number of monotonic functions of partial orders
- Stirling numbers and integer partitions
- scientific article; zbMATH DE number 1044833 (Why is no real title available?)
- Sampling complete designs
- The link between segregation and phylogenetic diversity
- The factorial moments of the generalized Bernoulli-Fibonacci distribution
- The recombination equation for interval partitions
- Search and sweep numbers of finite directed acyclic graphs
- scientific article; zbMATH DE number 3253121 (Why is no real title available?)
- Ring graphs and complete intersection toric ideals
- The general recombination equation in continuous time and its solution
- Haldane linearisation done right: solving the nonlinear recombination equation the easy way
- A new view of relationship between atomic posets and complete (algebraic) lattices
- mathlib4 Module Mathlib/Combinatorics/Enumerative/IncidenceAlgebra
- Probabilistic correlation clustering and image partitioning using perturbed multicuts
- Symmetrische Zerlegung von Kettenprodukten
- Notes on introductory combinatorics
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)
