R-universe search: combinatorics

Showing 17 of total 17 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 1 months ago.

combinations combinatorics factorization number-theory parallel permutation prime-factorizations primesieve gmp cpp

15.2 match 45 stars 10.04 score 153 scripts 12 dependents

anik4322

combinatorics:Introduction to Some Combinatorial Relations

Determining the value of Stirling numbers of 1st kind and 2nd kind,references: Bóna,Miklós(2017,ISBN 9789813148840).

Maintained by Anik Paul. Last updated 2 years ago.

53.8 match 2.00 score 3 scripts

andrisignorell

DescTools:Tools for Descriptive Statistics

A collection of miscellaneous basic statistic functions and convenience wrappers for efficiently describing data. The author's intention was to create a toolbox, which facilitates the (notoriously time consuming) first descriptive tasks in data analysis, consisting of calculating descriptive statistics, drawing graphical summaries and reporting the results. The package contains furthermore functions to produce documents using MS Word (or PowerPoint) and functions to import data from Excel. Many of the included functions can be found scattered in other packages and other sources written partly by Titans of R. The reason for collecting them here, was primarily to have them consolidated in ONE instead of dozens of packages (which themselves might depend on other packages which are not needed at all), and to provide a common and consistent interface as far as function and arguments naming, NA handling, recycling rules etc. are concerned. Google style guides were used as naming rules (in absence of convincing alternatives). The 'BigCamelCase' style was consequently applied to functions borrowed from contributed R packages as well.

Maintained by Andri Signorell. Last updated 9 days ago.

fortran cpp

5.0 match 87 stars 16.68 score 7.7k scripts 99 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 8 months ago.

combinatorics young-tableaux

10.5 match 3 stars 5.03 score 24 scripts 1 dependents

vjcitn

combinat:combinatorics utilities

routines for combinatorics

Maintained by Vince Carey. Last updated 12 years ago.

4.5 match 7.75 score 744 scripts 229 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.

combinatorics discrete-mathematics frequentist-statistics hypergeometric-distribution hypothesis-testing probability cpp

10.0 match 2.90 score 16 scripts

mhenderson

wallis:Room squares in R

Room squares in R.

Maintained by Matthew Henderson. Last updated 7 months ago.

combinatorial-designs combinatorics room-squares

10.0 match 2.54 score 1 scripts

sigbertklinke

exams.forge:Support for Compiling Examination Tasks using the 'exams' Package

The main aim is to further facilitate the creation of exercises based on the package 'exams' by Grün, B., and Zeileis, A. (2009) <doi:10.18637/jss.v029.i10>. Creating effective student exercises involves challenges such as creating appropriate data sets and ensuring access to intermediate values for accurate explanation of solutions. The functionality includes the generation of univariate and bivariate data including simple time series, functions for theoretical distributions and their approximation, statistical and mathematical calculations for tasks in basic statistics courses as well as general tasks such as string manipulation, LaTeX/HTML formatting and the editing of XML task files for 'Moodle'.

Maintained by Sigbert Klinke. Last updated 8 months ago.

9.3 match 2.70 score 1 scripts

mhenderson

keedwell:Latin Squares in R

Completion and embedding of latin squares in R.

Maintained by Matthew Henderson. Last updated 9 months ago.

combinatorics latin-squares

10.0 match 2.40 score 3 scripts

kota7

combiter:Combinatorics Iterators

Provides iterators for combinations, permutations, subsets, and Cartesian product, which allow one to go through all elements without creating a huge set of all possible values.

Maintained by Kota Mori. Last updated 7 years ago.

cpp

3.8 match 4 stars 3.56 score 18 scripts

alwinw

epocakir:Clinical Coding of Patients with Kidney Disease

Clinical coding and diagnosis of patients with kidney using clinical practice guidelines. The guidelines used are the evidence-based KDIGO guidelines, see <https://kdigo.org/guidelines/> for more information. This package covers acute kidney injury (AKI), anemia, and chronic kidney disease (CKD).

Maintained by Alwin Wang. Last updated 1 years ago.

kdigo kdigo-guidelines kidney-disease medical

2.3 match 5 stars 5.00 score 5 scripts

wraff

wrMisc:Analyze Experimental High-Throughput (Omics) Data

The efficient treatment and convenient analysis of experimental high-throughput (omics) data gets facilitated through this collection of diverse functions. Several functions address advanced object-conversions, like manipulating lists of lists or lists of arrays, reorganizing lists to arrays or into separate vectors, merging of multiple entries, etc. Another set of functions provides speed-optimized calculation of standard deviation (sd), coefficient of variance (CV) or standard error of the mean (SEM) for data in matrixes or means per line with respect to additional grouping (eg n groups of replicates). A group of functions facilitate dealing with non-redundant information, by indexing unique, adding counters to redundant or eliminating lines with respect redundancy in a given reference-column, etc. Help is provided to identify very closely matching numeric values to generate (partial) distance matrixes for very big data in a memory efficient manner or to reduce the complexity of large data-sets by combining very close values. Other functions help aligning a matrix or data.frame to a reference using partial matching or to mine an experimental setup to extract patterns of replicate samples. Many times large experimental datasets need some additional filtering, adequate functions are provided. Convenient data normalization is supported in various different modes, parameter estimation via permutations or boot-strap as well as flexible testing of multiple pair-wise combinations using the framework of 'limma' is provided, too. Batch reading (or writing) of sets of files and combining data to arrays is supported, too.

Maintained by Wolfgang Raffelsberger. Last updated 7 months ago.

1.5 match 4.44 score 33 scripts 4 dependents

jmcurran

multicool:Permutations of Multisets in Cool-Lex Order

A set of tools to permute multisets without loops or hash tables and to generate integer partitions. The permutation functions are based on C code from Aaron Williams. Cool-lex order is similar to colexicographical order. The algorithm is described in Williams, A. Loopless Generation of Multiset Permutations by Prefix Shifts. SODA 2009, Symposium on Discrete Algorithms, New York, United States. The permutation code is distributed without restrictions. The code for stable and efficient computation of multinomial coefficients comes from Dave Barber. The code can be download from <http://tamivox.org/dave/multinomial/index.html> and is distributed without conditions. The package also generates the integer partitions of a positive, non-zero integer n. The C++ code for this is based on Python code from Jerome Kelleher which can be found here <https://jeromekelleher.net/category/combinatorics.html>. The C++ code and Python code are distributed without conditions.

Maintained by James Curran. Last updated 1 years ago.

cpp

0.5 match 2 stars 7.74 score 11 scripts 273 dependents

stla

jack:Jack, Zonal, Schur, and Other Symmetric Polynomials

Schur polynomials appear in combinatorics and zonal polynomials appear in random matrix theory. They are particular cases of Jack polynomials. This package allows to compute these polynomials and other symmetric multivariate polynomials: flagged Schur polynomials, factorial Schur polynomials, t-Schur polynomials, Hall-Littlewood polynomials, Green polynomials, Macdonald polynomials, and modified Macdonald polynomials. In addition, it can compute the Kostka-Jack numbers, the Kostka-Foulkes polynomials, the Kostka-Macdonald polynomials, and the Hall polynomials. Mainly based on Demmel & Koev's paper (2006) <doi:10.1090/S0025-5718-05-01780-1> and Macdonald's book (1995) <doi:10.1093/oso/9780198534891.003.0001>.

Maintained by Stéphane Laurent. Last updated 7 months ago.

jack-polynomials schur-polynomials symmetric-polynomials zonal-polynomials gmp cpp

0.5 match 1 stars 4.71 score 41 scripts

stla

cyclotomic:The Field of Cyclotomic Numbers

The cyclotomic numbers are complex numbers that can be thought of as the rational numbers extended with the roots of unity. They are represented exactly, enabling exact computations. They contain the Gaussian rationals (complex numbers with rational real and imaginary parts) as well as the square roots of all rational numbers. They also contain the sine and cosine of all rational multiples of pi. The algorithms implemented in this package are taken from the 'Haskell' package 'cyclotomic', whose algorithms are adapted from code by Martin Schoenert and Thomas Breuer in the 'GAP' project (<https://www.gap-system.org/>). Cyclotomic numbers have applications in number theory, algebraic geometry, algebraic number theory, coding theory, and in the theory of graphs and combinatorics. They have connections to the theory of modular functions and modular curves.

Maintained by Stéphane Laurent. Last updated 1 years ago.

arithmetic cyclotomic-numbers

0.5 match 1 stars 2.70 score 9 scripts

sophie-lebre

DCODE:List Linear n-Peptide Constraints for Overlapping Protein Regions

Traversal graph algorithm for listing linear n-peptide constraints for overlapping protein regions. (Lebre and Gascuel, The combinatorics of overlapping genes, freely available from arXiv at : http://arxiv.org/abs/1602.04971).

Maintained by Sophie Lebre. Last updated 9 years ago.

0.5 match 1.60 score 3 scripts

ram6ler

trotter:Pseudo-Vectors Containing All Permutations, Combinations and Subsets of Objects Taken from a Vector.

Class definitions and constructors for pseudo-vectors containing all permutations, combinations and subsets of objects taken from a vector. Simplifies working with structures commonly encountered in combinatorics.

Maintained by Richard Ambler. Last updated 11 years ago.

0.5 match 1.00 score 6 scripts