Showing 5 of total 5 results (show query)
jwood000
RcppAlgos:High Performance Tools for Combinatorics and Computational Mathematics
Provides optimized functions and flexible iterators implemented in C++ for solving problems in combinatorics and computational mathematics. Handles various combinatorial objects including combinations, permutations, integer partitions and compositions, Cartesian products, unordered Cartesian products, and partition of groups. Utilizes the RMatrix class from 'RcppParallel' for thread safety. The combination and permutation functions contain constraint parameters that allow for generation of all results of a vector meeting specific criteria (e.g. finding all combinations such that the sum is between two bounds). Capable of ranking/unranking combinatorial objects efficiently (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ás Oliveira. Finally, there is a prime counting function that implements Legendre's formula based on the work of Kim Walisch.
Maintained by Joseph Wood. Last updated 2 months ago.
combinationscombinatoricsfactorizationnumber-theoryparallelpermutationprime-factorizationsprimesievegmpcpp
45 stars 10.04 score 153 scripts 12 dependents
stla
syt:Young Tableaux
Deals with Young tableaux (field of combinatorics). For standard Young tabeaux, performs enumeration, counting, random generation, the Robinson-Schensted correspondence, and conversion to and from paths on the Young lattice. Also performs enumeration and counting of semistandard Young tableaux, enumeration of skew semistandard Young tableaux, enumeration of Gelfand-Tsetlin patterns, and computation of Kostka numbers.
Maintained by Stéphane Laurent. Last updated 9 months ago.
3 stars 4.94 score 24 scripts 1 dependents
alextkalinka
hint:Tools for Hypothesis Testing Based on Hypergeometric Intersection Distributions
Hypergeometric Intersection distributions are a broad group of distributions that describe the probability of picking intersections when drawing independently from two (or more) urns containing variable numbers of balls belonging to the same n categories. <arXiv:1305.0717>.
Maintained by Alex T. Kalinka. Last updated 3 years ago.
combinatoricsdiscrete-mathematicsfrequentist-statisticshypergeometric-distributionhypothesis-testingprobabilitycpp
2.90 score 16 scripts
mhenderson
wallis:Room squares in R
Room squares in R.
Maintained by Matthew Henderson. Last updated 8 months ago.
combinatorial-designscombinatoricsroom-squares
2.54 score 1 scriptsmhenderson
keedwell:Latin Squares in R
Completion and embedding of latin squares in R.
Maintained by Matthew Henderson. Last updated 10 months ago.
2.40 score 3 scripts