A computational way to study discrete mathematics using Haskell
-
Updated
Mar 3, 2019 - Haskell
A computational way to study discrete mathematics using Haskell
A Haskell DistinguishedSymmetricCyclesModule.hs module exporting a few functions that describe a `computation-free' decomposition of a vertex of a hypercube graph with respect to its distinguished symmetric cycle. Based on Proposition 5.9 of the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023.
Solutions to the book Discrete Maths using a Computer
Cryptography in Haskell.
A Haskell module exporting functions that implement enumeration mechanisms described in Theorems 7.5, 7.7, 7.9 and 7.11 from the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023, and illustrated in Examples 7.6, 7.8, 7.10 and 7.12.
A Haskell module exporting five functions that implement enumeration mechanisms described in Theorem 6.4 from the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023, and illustrated in Example 6.5.
This repository contains research and tools for a paper in progress: "Deriving Sequence Generation Functions via Sequence Derivatives."
This is the project for the discrete mathematics class CSC281
Add a description, image, and links to the discrete-mathematics topic page so that developers can more easily learn about it.
To associate your repository with the discrete-mathematics topic, visit your repo's landing page and select "manage topics."