comboGroupsCount

Source vector. If <code>v</code> is a positive integer, it will be converted to the sequence <code>1:v</code>. If <code>v</code> is a negative integer, it will be converted to the sequence <code>v:-1</code>. All atomic types are supported (See <code><a rd-options="" href="/link/is.atomic?package=RcppAlgos&version=2.5.0" data-mini-rdoc="RcppAlgos::is.atomic">is.atomic</a></code>).

An Integer. The number of groups that the vector will be partitioned into. Must divide the length of v (if v is a vector) or v (if v is a scalar).

numGroups

Calculate the number of partitions of a vector into groups of equal size. See the related integer sequences A025035-A025042 at <a href="https://oeis.org">OEIS</a> (E.g. <a href="https://oeis.org/A025036">A025036</a> for Number of partitions of 1, 2, ..., 4n into sets of size 4.)

Provides optimized functions and flexible combinatorial iterators
implemented in C++ for solving problems in combinatorics and
computational mathematics. Utilizes the RMatrix class from 'RcppParallel'
for thread safety. There are combination/permutation functions with
constraint parameters that allow for generation of all results of a vector
meeting specific criteria (e.g. generating integer partitions
or finding all combinations such that the sum is between two bounds).
Capable of generating specific combinations/permutations (e.g. retrieve
only the nth lexicographical result) which sets up nicely for
parallelization as well as random sampling. Gmp support permits exploration
where the total number of results is large (e.g. comboSample(10000, 500,
n = 4)). Additionally, there are several high performance number theoretic
functions that are useful for problems common in computational mathematics.
Some of these functions make use of the fast integer division library
'libdivide'. The primeSieve function is based on the segmented sieve of
Eratosthenes implementation by Kim Walisch. It is also efficient for large
numbers by using the cache friendly improvements originally developed by
Tom<c3><a1>s Oliveira. Finally, there is a prime counting function that implements
Legendre's formula based on the work of Kim Walisch.

Joseph Wood

RcppAlgos

High Performance Tools for Combinatorics and Computational
Mathematics

comboGroupsCount function

Source vector. If <code>v</code> is a positive integer, it will be converted to the sequence <code>1:v</code>. If <code>v</code> is a negative integer, it will be converted to the sequence <code>v:-1</code>. All atomic types are supported (See <code><a rd-options='' href='is.atomic'>is.atomic</a></code>).

Calculate the number of partitions of a vector into groups of equal size. See the related integer sequences A025035-A025042 at <a href='https://oeis.org'>OEIS</a> (E.g. <a href='https://oeis.org/A025036'>A025036</a> for Number of partitions of 1, 2, ..., 4n into sets of size 4.)

comboGroupsCount: Number of Partitions of a Vector into Groups of Equal Size

Description

Usage

Arguments

Value

References

Examples