Search Packages

thewalrus

A library for the calculation of hafnians, Hermite polynomials and Gaussian boson sampling.

dress-graph

DRESS: A Continuous Framework for Structural Graph Refinement

icepool

Python dice probability package.

cfspy

A package to simulate the output of a control system by means of the Chen-Fliess series.

catkit

General purpose tools for high-throughput catalysis

permutations

Python library for instantiating and working with permutation collections that provide efficient implementations of all sequence methods (including random-access retrieval by index).

sage-acsv

A SageMath package with algorithms for analytic combinatorics in several variables.

trotter

A Python library for working with structures that commonly come up in combinatorics, such as permutations, combinations and subsets.

plabic

Cluster algebraic/geometric structures related to plabic graphs

tspy

An optimization package for the traveling salesman problem

boofun

A toolkit for teaching, learning, and doing research in Boolean function analysis. Fourier analysis, property testing, query complexity, hypercontractivity, pseudorandomness, and more

reedmuller

Reed-Muller encoding and decoding

stoichiograph

Spell words with elemental symbols from the periodic table ("He", "Cu", etc).

matroid-database

Python interface to matroid database

generalcartesianproduct

Implementation of the general cartesian product, allowing to generate sequences based on variable limits

bisc-algorithm

This package implements the BiSC algorithm from the research paper "BiSC: An algorithm for discovering generalized permutation patterns" by Henning Ulfarsson. The algorithm automatically discovers forbidden patterns in sets of permutations, bridging computer science and mathematics through automated conjecture.

exhaust

Exhaustively enumerate a combinatorial space represented by a function

kombin-algo-pranavpatel-ca

A library for bijectively mapping all ordered pairs from two finite sets A and B into a single linear index. KombiN orders pairs by ascending weight (sum of indices) using a three-region zig-zag algorithm, enabling O(1) bidirectional lookups.

sinterbot

A program to manage secret santa assignments.

wwu

which way up to store your boxes

ccc-calculator

Calculate the probability of drawing specific combinations of items

reluctant-walks

Reluctant walks tend to exit the quarter-plane in which they are constrained (because of strong negative drift), but this work shows how to randomly sample large reluctant walks anyway. (Lumbroso, Mishna, Ponty, 2017)

combstruct2json

Lightweight library to parse combstruct grammars, and standalone tool to convert them to JSON.

pysyt

Standard Young tableaux