Posts

We can identify natural numbers with the multiset of their prime factors. The operations of GCD and LCM then correspond to multiset intersection and symmetric difference. We elaborate on this in great detail accessible to math & CS undergraduates.

Taking selected undergraduate material of math and CS that is classically taught with sets & functions and now presenting it with multisets & relations.

I presented a talk at LFMTP on the utility of operators transforming diagrams of formalization in a meta-programming fashion. The talk corresponded to an extended abstract me and my advisor submitted.

Our paper on “detangling knowledge management from game design in serious games” was accepted.

I presented a talk on a yet unsubmitted paper from me and my advisor for which our extended abstract was accepted.

We prove that if a ∈ M ⊆ [a, b] is an upwards-closed and open set (wrt. the subspace topology [a, b]), then M = [a, b].

We recap the usual OTP with encryption in $\{0, 1\}^n$ being $m \oplus K$ and note how its slogan “every ciphertext can come from any plaintext” justifying its security is just a consequence of the group structure in $\{0, 1\}^n$. We then formulate the more general OTP over groups.

A rundown of how I approached supervision of the children. Mostly as a mental note to myself.

Compilation of possible dangers and hints for coaches to make their clients avoid them

📁 Offering my B. Sc. thesis for download.