Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example (Q5366902): Difference between revisions

Revision as of 12:16, 14 July 2024

scientific article; zbMATH DE number 6788908

Language	Label	Description	Also known as
English	Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example	scientific article; zbMATH DE number 6788908

Statements

instance of

scholarly article

0 references

title

Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example (English)

0 references

0 references

0 references

Combinatorics, Probability and Computing

0 references

publication date

10 October 2017

0 references

full work available at URL

https://arxiv.org/abs/1110.3856

0 references

describes a project that uses

Mathematica

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Exact asymptotic formulas for the coefficients of nonmodular functions

0 references

A Hardy-Ramanujan formula for restricted partitions

0 references

Uniform generation of a Motzkin word

0 references

Q3801620

0 references

On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer

0 references

The Erdős-Rényi law in distribution, for coin tossing and sequence matching

0 references

Independent process approximations for random combinatorial structures

0 references

Critical phenomena in sequence matching

0 references

Random Sampling of Plane Partitions

0 references

Paths in graphs

0 references

Q4023085

0 references

Uniform random generation of decomposable structures using floating-point arithmetic

0 references

Probabilistic divide-and-conquer: deterministic second half

0 references

Log-concavity of the partition function

0 references

Q3723577

0 references

Boltzmann Samplers for the Random Generation of Combinatorial Structures

0 references

Log-concavity of the overpartition function

0 references

The distribution of the number of summands in the partitions of a positive integer

0 references

The Structure of Random Partitions of Large Integers

0 references

Efficient implementation of the Hardy–Ramanujan–Rademacher formula

0 references

Partition Asymptotics from Recursion Equations

0 references

Q4178385

0 references

Affine insertion and Pieri rules for the affine Grassmannian

0 references

Uniform generation of random regular graphs of moderate degree

0 references

A Hardy-Ramanujan-Rademacher-type formula for \((r,s)\)-regular partitions

0 references

Sur les entiers n pour lesquels il y à beaucoup de groupes abéliens d'ordre \(n\)

0 references

A method and two algorithms on the theory of partitions

0 references

Q3932310

0 references

Partition bijections, a survey

0 references

On a likely shape of the random Ferrers diagram

0 references

Random set partitions: Asymptotics of subset counts

0 references

Bijective proofs of some classical partition identities

0 references

Rademacher-type formulas for restricted partition and overpartition functions

0 references

Identifiers

zbMATH Open document ID

1372.60006

0 references

DOI

10.1017/S0963548315000358

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5366902

@@ Property / cites work @@
+Exact asymptotic formulas for the coefficients of nonmodular functions
+Normal rank
@@ Property / cites work @@
+A Hardy-Ramanujan formula for restricted partitions
+Normal rank
@@ Property / cites work @@
+Uniform generation of a Motzkin word
@@ Property / cites work: Uniform generation of a Motzkin word / rank @@
+Normal rank
@@ Property / cites work @@
+Q3801620
@@ Property / cites work: Q3801620 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
+Normal rank
@@ Property / cites work @@
+The Erdős-Rényi law in distribution, for coin tossing and sequence matching
+Normal rank
@@ Property / cites work @@
+Independent process approximations for random combinatorial structures
+Normal rank
@@ Property / cites work @@
+Critical phenomena in sequence matching
@@ Property / cites work: Critical phenomena in sequence matching / rank @@
+Normal rank
@@ Property / cites work @@
+Random Sampling of Plane Partitions
@@ Property / cites work: Random Sampling of Plane Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform random generation of decomposable structures using floating-point arithmetic
+Normal rank
@@ Property / cites work @@
+Probabilistic divide-and-conquer: deterministic second half
+Normal rank
@@ Property / cites work @@
+Log-concavity of the partition function
@@ Property / cites work: Log-concavity of the partition function / rank @@
+Normal rank
@@ Property / cites work @@
+Q3723577
@@ Property / cites work: Q3723577 / rank @@
+Normal rank
@@ Property / cites work @@
+Boltzmann Samplers for the Random Generation of Combinatorial Structures
+Normal rank
@@ Property / cites work @@
+Log-concavity of the overpartition function
@@ Property / cites work: Log-concavity of the overpartition function / rank @@
+Normal rank
@@ Property / cites work @@
+The distribution of the number of summands in the partitions of a positive integer
+Normal rank
@@ Property / cites work @@
+The Structure of Random Partitions of Large Integers
+Normal rank
@@ Property / cites work @@
+Efficient implementation of the Hardy–Ramanujan–Rademacher formula
+Normal rank
@@ Property / cites work @@
+Partition Asymptotics from Recursion Equations
@@ Property / cites work: Partition Asymptotics from Recursion Equations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178385
@@ Property / cites work: Q4178385 / rank @@
+Normal rank
@@ Property / cites work @@
+Affine insertion and Pieri rules for the affine Grassmannian
+Normal rank
@@ Property / cites work @@
+Uniform generation of random regular graphs of moderate degree
+Normal rank
@@ Property / cites work @@
+A Hardy-Ramanujan-Rademacher-type formula for \((r,s)\)-regular partitions
+Normal rank
@@ Property / cites work @@
+Sur les entiers n pour lesquels il y à beaucoup de groupes abéliens d'ordre \(n\)
+Normal rank
@@ Property / cites work @@
+A method and two algorithms on the theory of partitions
+Normal rank
@@ Property / cites work @@
+Q3932310
@@ Property / cites work: Q3932310 / rank @@
+Normal rank
@@ Property / cites work @@
+Partition bijections, a survey
@@ Property / cites work: Partition bijections, a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On a likely shape of the random Ferrers diagram
@@ Property / cites work: On a likely shape of the random Ferrers diagram / rank @@
+Normal rank
@@ Property / cites work @@
+Random set partitions: Asymptotics of subset counts
+Normal rank
@@ Property / cites work @@
+Bijective proofs of some classical partition identities
+Normal rank
@@ Property / cites work @@
+Rademacher-type formulas for restricted partition and overpartition functions
+Normal rank