Blog

This is mostly a reference request. I start with my problem setting which might be studied under more general framework. Let $ S\subset\mathbb R^d$ be a closed (connected, bounded and as good as possible) subset. Consider a sequence of “partitions” $ E_n$ of $ S$ , i.e. each $ E_n$ denotes $ l\ge 1$ subsetsRead more

I’m trying to create a universal updater-script but I’v run into a bit of a wall. I can’t find any universal way to mount a given partition. In order to mount something in the edify scripting language I need to provide a fs_type, partition_type, name, mount_point. I expect partition_type, name, mount_point to be fairly universal,Read more

This is slightly complicated, hopefully I’ll describe it well enough to be understood. So I’m using linux (Ubuntu), and I have a 2TB portable hard drive, and a 500GB main drive. On the portable drive I had 3 partitions. The first was about 650GB, not exactly sure on the other two. I had a bitRead more

A partition of a Boolean algebra is a collection of pairwise disjoint nonzero elements with supremum 1. For any infinite Boolean algebra $ A$ let $ a(A)$ be the least size of an infinite partition of $ A$ . Is $ a(A+B)=\min\{a(A),a(B)\}$ , where $ A+B$ is the free product of $ A$ and $Read more