Related papers: Counting birthday collisions using partitions
We introduce a new particle-based hybrid code for planetary accretion. The code uses an $N$-body routine for interactions with planetary embryos while it can handle a large number of planetesimals using a super-particle approximation, in…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…
The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
Collisions are the core agent of planet formation. In this work, we derive an analytic description of the dynamical outcome for any collision between gravity-dominated bodies. We conduct high-resolution simulations of collisions between…
In this paper we explore Kruyswijk's method and show how to obtain congruences for cubic partition. That apart we also examine inequalities for a(n) and provide upper bound for it in the fashion of the classic partition function p(n).
We establish an integration by parts formula based on jumps times in an abstract framework in order to study the regularity of the law for processes solution of stochastic differential equations with jumps.
We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…
The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum system and phenomenon. However, for interacting many-body quantum systems, its…
Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two…
This paper deals with the problem of simulating dense dispersed systems composed by large numbers of particles undergoing ballistic aggregation. The most classical approaches for dealing with such problems are represented by the so-called…
We give several algorithms addressing computations of intersections of conjugate subgroups.
We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain classes of bijections which map limit shapes…
We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…
In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…
Collider data can play an important role in determining the parton distribution functions of the nucleon. I present a formalism which makes it possible to use next-to-leading order calculations in such a determination, while minimizing the…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
We show how the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$ enter different problems of counting simple and multiple planar partitions.
We consider the motion of a finite though large number of particles in the whole space R n. Particles move freely until they experience pairwise collisions. We use our recent theory of divergence-controlled positive symmetric tensors in…