## Tag: Combinatorics

## My Response to “Stop trying to find ‘cutting edge’ magic”

eftresq wrote: Stop trying to find “cutting edge” magick, get off your ass, and learn the magick that already exists. You guys are always so quick to declare “it’s not better just because it’s older!” but utterly fail to comprehend the exact opposite is also true. You want “cutting edge”? Then follow Dee’s example, learn the Old Magick, contact the spirits, and ask them to teach you something new. That’s how it’s supposed to work.” –Aaron Leitch Too good to not pass on… I wrote: Stop trying to find “cutting edge” magick, get off your ass, and learn the magick Read More

## Geomancy and Thaumaturgy: Creating a Lo Shu Magic Square in Python

I am not a ceremonial magician; however, I practice Alchemy, Geomancy, and Thaumaturgy. There was a discussion on Thaumaturgy and how it relates to classical medieval figures such as Agrippa and John Dee. That conversation between zsd23 and I can be found here. I go in-depth on the mathematical basis for John Dee. I mention Agrippa, but I don’t explain too much the algorithms he was using. Agrippa was using a class of algorithms called magic square algorithms. In the book De occulta philosophia libri tres, Agrippa mentions 7 planetary magic squares. Those magic squares form the basis of a Read More

## Lecture 17: Counting Rules II

## Lecture 16: Counting Rules I

## Simplicial Complexes: Part 2

Last episode we saw that your neural network can be modeled as a graph, which — we’ll show in this episode — can be viewed as a higher-dimensional simplicial complex. So… what is a simplicial complex??

## Applied Discrete Structures

This textbook contains the content of a two semester course in discrete structures, which is typically a second-year course for students in computer science or mathematics, but it does not have a calculus prerequisite. The material for the first semester is in chapters 1-10 and includes logic, set theory, functions, relations, recursion, graphs, trees, and elementary combinatorics. The second semester material in chapters 11-16 deals with algebraic structures: binary operations, groups, matrix algebra, Boolean algebra, monoids and automata, rings and fields.

## SageMath

SageMath is a computer algebra system with features covering many aspects of mathematics, including algebra, combinatorics, graph theory, numerical analysis, number theory, calculus and statistics. SageMath is a free open-source mathematics software system licensed under the GPL. It builds on top of many existing open-source packages: NumPy, SciPy, matplotlib, Sympy, Maxima, GAP, FLINT, R and many more. Access their combined power through a common, Python-based language or directly via interfaces or wrappers. Mission: Creating a viable free open source alternative to Magma, Maple, Mathematica and Matlab.