Math::Combinatorics - Perform combinations and permutations on lists

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their properties. As a jumping off point, refer to: http://mathworld.wolfram.com/Co...

/Math-Combinatorics-0.09   (4 reviews) - 12 Dec 2006 07:04:03 GMT - Search in distribution

Chemistry::Harmonia - Decision of simple and difficult chemical puzzles.

The module provides the necessary subroutines to solve some puzzles of the general inorganic and physical chemistry. The methods implemented in this module, are all oriented to known rules and laws of general and physical chemistry....

/Chemistry-Harmonia-0.118 - 18 May 2013 20:01:04 GMT - Search in distribution

Math::Prime::Util - Utilities related to prime numbers, including fast sieves and factoring

A module for number theory in Perl. This includes prime sieving, primality tests, primality proofs, integer factoring, counts / bounds / approximations for primes, nth primes, and twin primes, random prime generation, and much more. This module is th...

/Math-Prime-Util-0.60 - 10 Oct 2016 04:24:12 GMT - Search in distribution

Cluster::Similarity - compute the similarity of two classifications.

Computes the similarity of two word clusterings using several clustering similarity measures. Consider for eg. the following groupings: clustering_1: { {a, b, c}, {d, e, f} } clustering_2: { {a, b}, {c, d, e}, {f} } Cluster similarity measures provid...

/Cluster-Similarity-v0.02 - 18 Jan 2009 15:50:21 GMT - Search in distribution

Math::DyckWords - Perl module for generating Dyck words. Dyck words are named after the mathematician Walther von Dyck.

Dyck words are even numbered string of X's and Y's, or 0's and 1's, or any other binary alphabet for that matter, such that no initial segment has more Y's or 1's. The following are the Dyck words of length 2n where n = 3: 000111 010011 010101 001101...

/Math-DyckWords-0.03 - 14 Apr 2010 03:48:57 GMT - Search in distribution

Data::Entropy::Algorithms - basic entropy-using algorithms

This module contains a collection of fundamental algorithms that use entropy. They all use the entropy source mechanism described in Data::Entropy....

/Data-Entropy-0.007 - 27 Apr 2011 20:03:17 GMT - Search in distribution

Math::Counting - Combinatorial counting operations

Compute the factorial, number of permutations, number of derangements and number of combinations. The ":big" functions are wrappers around "bfac" in Math::BigInt with a bit of arithmetic between. The student versions exist to illustrate the computati...

/Math-Counting-0.1305   (1 review) - 20 Oct 2015 02:48:29 GMT - Search in distribution

Math::PlanePath::HilbertCurve - 2x2 self-similar quadrant traversal

This path is an integer version of the curve described by David Hilbert in 1891 for filling a unit square. It traverses a quadrant of the plane one step at a time in a self-similar 2x2 pattern, ... | | 7 | 63--62 49--48--47 44--43--42 | | | | | | 6 |...

/Math-PlanePath-123 - 29 Apr 2016 05:36:01 GMT - Search in distribution

Algorithm::Combinatorics - Efficient generation of combinatorial sequences

Algorithm::Combinatorics is an efficient generator of combinatorial sequences. Algorithms are selected from the literature (work in progress, see "REFERENCES"). Iterators do not use recursion, nor stacks, and are written in C. Tuples are generated in...

/Algorithm-Combinatorics-0.27   (2 reviews) - 10 Feb 2012 23:00:53 GMT - Search in distribution

/Advent-Bundles-0.05 - 21 Feb 2011 18:30:09 GMT - Search in distribution

Math::NumSeq::Factorials - factorials i! = 1*2*...*i

The factorials being product 1*2*3*...*i, 1 to i inclusive. 1, 2, 6, 24, 120, 720, ... starting i=1...

/Math-NumSeq-72 - 23 Jul 2016 06:49:13 GMT - Search in distribution

Telephone::Mnemonic::US::Math - Helper module that for combinatorics pertaining to mnemonic calculations

/Telephone-Mnemonic-US-0.07 - 17 Oct 2011 09:40:11 GMT - Search in distribution