In many practical combinatorial problems there arises the need to iterate over all permutations of a given set. Since the number of permutations increases in factorial time, that is, n! for a n-element set, this can lead to a huge amount of data. Permutations of a given list [x1, x2…

The problem is as follows: Consider an undirected, connected graph G and a set of vertexes V within the same graph. What is the shortest distance from a given vertex w to V. The distance is measured by counting the number of edges within a path. For example in the…

The problem is as follows: Consider an ordered list of positive integers with possible zeros in between. Example: [0, 1, 0, 0, 2] The question is, how many possible displacements of these positive numbers do exist such that the list still remains ordered. In the example above, one possible displacement…

Set theory is a very fundamental and interesting part of mathematics. Typically its basics are being taught in the first semester of a course in mathematics. Everybody who uses mathematics in some form should have a basic knowledge of this subject. In this series of articles I want to provide…

Set theory is a very fundamental and interesting part of mathematics. Typically its basics are being taught in the first semester of a course in mathematics. Everybody who uses mathematics in some form should have a basic knowledge of this subject. In this series of articles I want to provide…

Rust + TypeScript — It is already some time ago that I have written a small account about how to use Rust within a full-stack web application (see here). This post is intended to follow up on this by offering an alternative approach in how to include Rust into the application. In general, we…

Set theory is a very fundamental and interesting part of mathematics. Typically its basics are being taught in the first semester of a course in mathematics. Everybody who uses mathematics in some form should have a basic knowledge of this subject. In this series of articles I want to provide…

The Tower of Hanoi is a well-known combinatorial game. If you don’t know it yet, it doesn’t mind! In this post we are going to look at a mathematically defined version and write an algorithm that solves it in Rust. Some basic knowledge of Rust is required to understand the…

Set theory is a very fundamental and interesting part of mathematics. Typically its basics are being taught in the first semester of a course in mathematics. Everybody who uses mathematics in some form should have a basic knowledge of this subject. In this series of articles I want to provide…