What is an Answer?

DOI10.2307/2321713MaRDI QIDQ3944607zbMATH OpenOpenAlexWikidataFDO

Authors Herbert S. Wilf

Publication date 1982

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2321713

zbMATH Keywords

NP-complete problemspermutationssum of partitions

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Enumeration in graph theory (05C30) Analysis of algorithms and problem complexity (68Q25)

Cited in

(17)

• A holonomic systems approach to special functions identities
• Enumeration schemes and, more importantly, their automatic generation
• Generating permutations with restricted containers
• Counting 3-stack-sortable permutations
• An experimental mathematics approach to the area statistic of parking functions
• Tensors and Graphs
• Gamma and factorial in the Monthly
• Will the real Hardy-Ramanujan formula please stand up?
• Interview with Igor Pak
• Enumeration Schemes for Restricted Permutations
• Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s)
• A simple rederivation of Onsager's solution of the 2D Ising model using experimental mathematics
• Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
• Positivity of Schubert coefficients
• Integer diagonal forms for subset intersection relations
• Asymptotics of bivariate algebraico-logarithmic generating functions
• An invariant theory approach to graph enumeration

This page was built for publication: What is an Answer?

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