On the Applications of Mobius Inversion in Combinatorial Analysis
From MaRDI portal
Publication:4075467
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Arithmetic functions; related numbers; inversion formulas (11A25)
Cited in
(35)- scientific article; zbMATH DE number 7731179 (Why is no real title available?)
- Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields
- Counting symmetric colorings of \(G \times \mathbb Z_2\)
- Generalized binomial coefficients and the subset-subspace problem
- On the number of cyclic projective planes
- The Möbius function of the affine linear group \(\text{AGL }(1,\mathbb{F}_q)\)
- The combinatorics of discrete self-similarity
- A further look at a generalization of Waring's formula
- A bibliography on chromatic polynomials
- On open questions in the geometric approach to structural learning Bayesian nets
- Alternating colourings of the vertices of a regular polygon
- Periodic points of asymmetric Bernoulli shifts
- Structures characterizing partially ordered sets, and their automorphism groups
- Rook theory. V: Rook polynomials, Möbius inversion and the umbral calculus
- Bigraded Betti numbers and generalized persistence diagrams
- Enumeration of subspaces by dimension sequence
- Homotopy type and Euler characteristic of partially ordered sets
- The weight enumerator polynomials of some classes of codes with composite parity-check polynomials
- Symmetric colorings of G × Z_2
- Bernoulli numbers and symmetric functions
- Counting symmetric bracelets
- Symmetric colorings of the dihedral group
- On Möbius duality and coarse-graining
- Incidence codes of posets: Eulerian posets and Reed-Muller codes
- \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
- Applications of a binoomial-type identity
- The asymptotic probability that a random biased matrix is invertible
- Geometria combinatoria e geometrie finite
- Interpretation of the permanent as the sum of the weights of the injections of an m-element set into an n-element set (m?n)
- Generalized persistence diagrams
- Stirling numbers and integer partitions
- A natural parametrization of multivariate distributions with limited memory
- Optimal binary constant weight codes and affine linear groups over finite fields
- Counting symmetric colourings of the vertices of a regular polygon
- The \(r\)-Stirling numbers of the first kind in terms of the Möbius function
This page was built for publication: On the Applications of Mobius Inversion in Combinatorial Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075467)