A mechanical counting method and combinatorial applications

DOI10.1016/S0021-9800(68)80006-7MaRDI QIDQ5544315zbMATH OpenOpenAlexFDO

Authors Herbert S. Wilf

Publication date 1968

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(68)80006-7

zbMATH Keywords

combinatorics

Cited in

(15)

• Permanents of doubly stochastic matrices
• A polynomial identity for the permanent
• The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking)
• Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
• Another combinatorial determinant
• Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system
• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
• A note on a conjecture of M. Marcus and H. Minc
• A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
• A Formal Calculus for the Enumerative System of Sequences-II. Applications
• A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
• The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
• Counting patterns in graphs
• scientific article; zbMATH DE number 7732126 (Why is no real title available?)
• Finite differences and determinant identities

This page was built for publication: A mechanical counting method and combinatorial applications

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