Related papers: Counting birthday collisions using partitions
Direct collisions between finite-sized particles occur commonly in many areas of astrophysics. Such collisions are typically mediated by chaotic, bound gravitational interactions involving small numbers of particles. An important…
This paper presents formulae for calculation of cumulative probability of effect made by blast fragments. Analysis with Mott distribution, discrete fragment enumeration, spatial non-uniformity, numerical issues, and a generalisation for a…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
This paper deals with the complex problem of how to simulate multiparticle contacts. The collision process is responsible for the transfer and dissipation of energy in granular media. A novel model of the interaction force between particles…
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…
We propose a definition of partition quantum spaces. They are given by universal $C^*$-algebras whose relations come from partitions of sets. We ask for the maximal compact matrix quantum group acting on them. We show how those fit into the…
The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…
We show that cylindric partitions are in one-to-one correspondence with a pair which has an ordinary partition and a colored partition into distinct parts. Then, we show the general form of the generating function for cylindric partitions…
Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. A purely numeric mechanism, like those proposed so far, cannot provide a…
In this note, we will give a short proof of an identity for cubic partitions.
In this short note, we give basic enumerative results on colored integer partitions.
In this paper we study skyline queries in the distributed computational model, where we have $s$ remote sites and a central coordinator (the query node); each site holds a piece of data, and the coordinator wants to compute the skyline of…
The counting of partitions according to their genus is revisited. The case of genus 0 -- non-crossing partitions -- is well known. Our approach relies on two pillars: first a functional equation between generating functions, originally…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…
We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…
In this work, we provide a solution to the problem of computing collision stress in particle-tracking simulations. First, a formulation for the collision stress between particles is derived as an extension of the virial stress formula to…
In this paper, we investigate the combinatorial properties of three classes of integer partitions: (1) $s$-modular partitions, a class consisting of partitions into parts with a number of occurrences (i.e., multiplicity) congruent to $0$ or…
The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…