A \(q\)-analog of approximation inclusion-exclusion

DOI10.1006/aama.1997.0568zbMath0897.05009OpenAlexW2045940527MaRDI QIDQ1383437

Marios Mavronicolas

Publication date: 19 October 1998

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1997.0568

zbMATH Keywords

Chebyshev polynomial\(q\)-analog\(q\)-inclusion-exclusion

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Combinatorial inequalities (05A20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• A \(q\)-analog of the exponential formula
• Approximate inclusion-exclusion
• Unimodality of Gaussian polynomials
• Inductive proofs of \(q\)-log concavity
• \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
• The q-Stirling numbers of first and second kinds
• \(q\)-Bernoulli numbers and polynomials
• On Approximation Algorithms for # P
• On the lattice of faces of the 𝑛-cube
• The theory of Möbius functions
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: A \(q\)-analog of approximation inclusion-exclusion