A method and two algorithms on the theory of partitions
From MaRDI portal
Publication:1214419
DOI10.1016/0097-3165(75)90013-8zbMath0298.05015OpenAlexW2015438050MaRDI QIDQ1214419
Herbert S. Wilf, Albert Nijenhuis
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(75)90013-8
Combinatorial aspects of partitions of integers (05A17) Enumerative combinatorics (05A99) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)
Related Items (59)
A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space ⋮ Multivariate Poisson interpoint distances ⋮ Uniform generation of forests of restricted height ⋮ A calculus for the random generation of labelled combinatorial structures ⋮ On combinatorial differential equations ⋮ The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking) ⋮ Algorithms for the Chinese postman problem on mixed networks ⋮ Combinatorial structures and structures for classification ⋮ Recent developments and problems in the domain of random generation ⋮ Uniform random generation of words of rational languages ⋮ On coding labeled trees ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ A bibliography on chromatic polynomials ⋮ Calculation of the probability of eventual ruin by Beekman's convolution series ⋮ Random and uniform generation of words ⋮ Probabilistic divide-and-conquer: deterministic second half ⋮ Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ The enumeration of connected graphs and linked diagrams ⋮ Boltzmann samplers for \(v\)-balanced cycles ⋮ Lexicographic permutations with restrictions ⋮ Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method ⋮ Extended boxed product and application to synchronized trees ⋮ Star transposition Gray codes for multiset permutations ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ On the measurement of complexity in activity networks ⋮ Heuristics and their design: A survey ⋮ On the structure of random graphs with constant \(r\)-balls ⋮ Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example ⋮ A solution of the Sperner-Erdős problem ⋮ Containing All Permutations ⋮ Tours for the traveling salesman ⋮ A loopless algorithm for generating binary tree sequences ⋮ Generating permutations with given ups and downs ⋮ Computing structure: Sets, structures, and invariants in LISP ⋮ Fast computation of the exact null distribution of Spearman's \(\rho\) and Page's \(L\) statistic for samples with and without ties ⋮ Families of prudent self-avoiding walks ⋮ A method and two algorithms on the theory of partitions ⋮ Matrix permanent inequalities for approximating joint assignment matrices in tracking systems ⋮ Partial products in finite groups ⋮ A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem ⋮ A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects ⋮ Enumeration and random generation of accessible automata ⋮ A probabilistic proof of a formula for the number of Young tableaux of a given shape ⋮ An algorithm for the most economic link addition in a tree communications network ⋮ A pentagonal number sieve ⋮ On the \((n,t)\)-antipodal Gray codes ⋮ Generating random binary trees -- a survey ⋮ Algorithms for sequential generation of combinatorial structures ⋮ Sieve equivalence in generalized partition theory ⋮ Random generation of trees and other combinatorial objects ⋮ Uniform random generation of decomposable structures using floating-point arithmetic ⋮ Chromatic polynomials and order ideals of monomials ⋮ On the computational complexity of path cover problems ⋮ Efficient iteration in admissible combinatorial classes ⋮ On sampling representatives of relational schemas with a functional dependency ⋮ On permutations of wires and states ⋮ Fast algorithms for genegrating integer partitions
Cites Work
This page was built for publication: A method and two algorithms on the theory of partitions
