Results 11 to 20 of about 4,436 (299)
Integer partitions detect the primes. [PDF]
We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in partition functions. For example, an integer n ≥ 2 is prime if and only if
Craig W, van Ittersum JW, Ono K.
europepmc +8 more sources
Combinatorics and Statistical Mechanics of Integer Partitions [PDF]
We study the set of integer partitions as a probability space that generates distributions and, in the asymptotic limit, obeys thermodynamics. We view ordered integer partition as a configuration of cluster masses and associate them with the distribution
Themis Matsoukas
doaj +2 more sources
Partitions of an Integer into Powers [PDF]
In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results.
Matthieu Latapy
doaj +2 more sources
Parallel Rank of Two Sandpile Models of Signed Integer Partitions [PDF]
We introduce the concept of fundamental sequence for a finite graded poset X which is also a discrete dynamical model. The concept of fundamental sequence is a refinement of the concept of parallel convergence time for these models.
G. Chiaselotti +3 more
doaj +2 more sources
Integer partitions probability distributions [PDF]
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when considering equally-likely random permutations on the set of $n$ letters.
Andrew V. Sills
openalex +4 more sources
ON SEQUENCES OF ELEMENTARY TRANSFORMATIONS IN THE INTEGER PARTITIONS LATTICE [PDF]
An integer partition, or simply, a partition is a nonincreasing sequence \(\lambda = (\lambda_1, \lambda_2, \dots)\) of nonnegative integers that contains only a finite number of nonzero components. The length \(\ell(\lambda)\) of a partition \(\lambda\
Vitaly A. Baransky, Tatiana A. Senchonok
doaj +2 more sources
Additive Integer Partitions in R [PDF]
This paper introduces the partitions package of R routines, for numerical calculation of integer partititions. Functionality for unrestricted partitions, unequal partitions, and restricted partitions is provided in a small package that accompanies this ...
Robin K. S. Hankin
doaj +4 more sources
Latin hypercubes realizing integer partitions [PDF]
For an integer partition $h_1 + \dots + h_n = N$, a 2-realization of this partition is a latin square of order $N$ with disjoint subsquares of orders $h_1,\dots,h_n$. The existence of 2-realizations is a partially solved problem posed by Fuchs. In this paper, we extend Fuchs' problem to $m$-ary quasigroups, or, equivalently, latin hypercubes.
Diane Donovan, Tara Kemp, James Lefevre
openalex +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernhard Ganter
openaire +5 more sources
A phase transition in the distribution of the length of integer partitions [PDF]
We assign a uniform probability to the set consisting of partitions of a positive integer $n$ such that the multiplicity of each summand is less than a given number $d$ and we study the limiting distribution of the number of summands in a random ...
Dimbinaina Ralaivaosaona
doaj +2 more sources

