Dutch / Nederlands
Site map

I write, therefore I am

With this variation on a famous statement by the philosopher Descartes, I would like to express that writing about what happens in my life is important to me.

Sunday, June 28, 2015

Link


Saturday, June 27, 2015

Books and AKI finals 2015

At 11:45:33, I bought the following two books from bookshop Broekhuis:
  • Both Flesh and Not, a collection of essays by David Foster Wallace, ISBN:9780241146095, for € 5.95.
  • De Nederlandse erotische literatuur in 80 en enige verhalen selected and collected by Elsbeth Etty, ISBN:9780241146095, for € 5.00.
In the afternoon, I visited the 'Finals AKI 2015' exhibition with a friend. We went to TETEM art space and next to the AKI ArtEZ building. Finally, we also went to the city center to have a look at Concordia art exhibition center, where a selection of the 'best' works were on display. I found the following artists interesting:

At 15:07, I bought Reproductie / Reproduction / Reproduktion, ISBN:9789075522365, the exhibition catalogue for € 15.00.


Thursday, June 25, 2015

'Volume' of planar graph

Given the followoing four collections of points:
    PA = { (2i, 2j, 2k) | i,j,k ∈ ℕ }
    PB = { (2i+1, 2j+1, 2k) | i,j,k ∈ ℕ }
    PC = { (2i, 2j+1, 2k+1) | i,j,k ∈ ℕ }
    PD = { (2i+1, 2j, 2k+1) | i,j,k ∈ ℕ }
And a given triangular planar graph (where each face is a triangle), the vertices can be mappeld on the union of these collection, such that each edge connects two points (from different collections) such that the distance between the points is equal to the root of 2. The implication is that each triangle face of the graph is mapped to equilateral triangle. It is relatively easy to calculate the volume of the resulting triangular mesh. For each triangular planar graph there is one (or more) mapping with a maximum volume. We could call this the 'volume' of a planar graph.

The proof that a mapping exists is as follows. For each triangular planar graph there exists a four colouring of the vertices with the colors A, B, C, and D. It is clear that one could assign each of the vertices with to the 'zero'-element of the collection matching the colour, where the 'zero'-element is the element with i, j, and k being zero. The edges can be labelled with α, β and γ depending on the colours of the edges they connect, such that edges between A and B and edges between C and D are labelled with α, that edges between A and C and edges between B and D are labelled with β, and that edges between A and D and edges between B and D are labelled with γ. In this case each triangle face will be labelled with α, β and γ exactly once. The Kempe chains αγ, αβ, and βγ in the dual graph partition the vertices for each type of Kempe chain. These partions can be assigned a natural number such that adjecent partitions differ exactly one. These numbers match with the three coordinates of the points. The case where the numbers are restricted to 0 and 1 is equavalent with the mapping to the zero-elements. But other mappings are possible resulting in a greater volume.


Sunday, June 21, 2015

Steve Jobs

Today, I finished reading the Dutch translation of Steve Jobs the authorized biography of Steve Jobs written by Walter Isaacson, which I started reading on March 20, the day after which I bought it. My primary motivation to read this book was to evaluate The Bite in the Apple by Chrisann Brennan. I have come to the conclusion that that book does indeed not give a very different view of Jobs than I had thought at first. The Japanese Zen priest Kobun is but mentioned as a side note in the authorized biography, while Brennan describes him as a key figure in the life of Jobs. While reading the biography, I often felt that my achievements fall very short of those of Jobs, but on the other hand, I am also happy I do not share his character and ambitions. I am much more like Steve Wozniak.


Friday, June 19, 2015

Link


Sunday, June 14, 2015

Antwerp trip

This weekend we went to Antwerp with the company and stayed there for one night, because the company exists for 15 year. Yesterday, I visited all kinds of bookships. Today, I also walked around a little. (Here the GPS tracks and the route I walked in Google Earth or in Google Maps). The bookshops I visited are:
  • Bookshop De Markies. I bought the book the samurai tree invariants from Gabriel Orozco, ISBN:9873865691667, for € 22.00.
  • Copyright
  • Fnac. Not really a bookshop.
  • Standaard Boekhandel Huidevettersstraat. I bought the book Consciousness and the Brain by Stanislas Dehaene, ISBN:9780143126263, for € 18.95.
  • Standaard Student Shop Campus Antwerpen. For highschool.
  • De Slegte. I only visited the second hand part of the shop. Only later I discovered that there was a second shop just beside it with cheaply priced books.
  • 't Verschil.
  • De Groene Waterman.
  • Anti-quariaat at Wolstraat 2. I had a short conversation with the owner and a visiting author.
This morning, I went back to bookshop De Markies, because after I opened the book that I bought there, I realized that it might have been part of a set of books, because it only contained images and no text. I remembered that there was another book close to it with no price tag. That was indeed correct, and I was given Gabriel Orozco. The Samurai's Tree Variants, ISBN:9783865601803.


This text is displayed if your browser does not support HTML5 Canvas.

Saturday, June 6, 2015

IJduino animation

I created an animation for the IJduino based on the patterns used in Komputerstrukturen 2 and 2a by Peter Struycken. To the right, a reproduction of the animation using JavaScript. The pattern changes every second, except if the change would introduce four dots to come together to form a square. It looks like there are some complex rules behind the movements of the dots, but in fact every dot moves around in its own two by two square. There are 16 dots moving around in four by four such squares.



Wednesday, June 10, 2015

Link


Wednesday, June 3, 2015

Book

At 10:57, I bought the book Najaarstentoonstelling 1999: 19e eeuw written and published by Simonis & Buunk Kunsthandel, ISBN:9080072605, from charity shop Het Goed for € 1.25.


Saturday, May 30, 2015

Book

At 13:07:45, I bought the book Eja Siepman van den Berg bij bookshop Broekhuis for € 7.50. The book contains pictures of the statues by Eja Siepman van den Berg and commentaries (in Dutch and English) by Hans Sizoo and Peter Struycken.


Monday, May 25, 2015

Rijksmuseum Twenthe

This afternoon, I went to the Rijksmuseum Twenthe with a friend. We went to see the Sublime Landscapes in Gaming exhibition. We first walked through the The Forest Dweller exhibition to get there. Works we saw are: Next we walked through the Metamorphoses. Ovid in contemporary art. We were not very impressed by this. And finally we walked (in reverse order) through The House of Heek exhibition. To my surprise, I discovered that it included three works by Peter Strucyken: Structuur II A, Structuur, and Structuur XXXXV, all from 1967. Left of the works was the work Cirkel en zeshoek in overgang by Ad Dekkers. The painting Falaises près de Pourville from 1882 by Claude Monet was also included.


Sunday, May 24, 2015

Volunteer

In the past year, I have become a regular vistor at a local meeting for people with average or above-average intelligence with a autism spectrum disorder. At first I has some doubts whether I would be allowed to attend because I do not have an official diagnoses. But I very much feel at home and feel that I always have meaningful conversations with other people attending, and even building some friendships with people. Now they are looking for new volunteers for leading the activities and welcoming (new) people. I feel that I would be able to do this and have a meaningful input. But one of the requirements is that one should have an authism spectrum disorder. Asperger's Syndrome is one of the most common forms in the spectrum for individuals with an above average intelligence, but I feel that I do not perfectly fit with it based on the people I have met that have gotten a diagnoses. I get the impression that I have no problem with information processing, I do not suffer from face and/or emotion blindness, and I do not suffer from sensory overload. I get tired from attending meetings and interacting with people a lot. This week, I discovered that I scored rahter low on the psychopathy scale, meaning that I find it hard to be dishonest and to lie. I have some problem dealing with non-verbal communication or if people are saying something else than they mean. I do know that I am quite strong introvert and that my performance-IQ is probably significantly higher than my verbal-IQ. I also know that my interests are often different from my colleagues. I do not want to go for an official diagnoses, because for the rest, I am just functioning okay, and there no reason to get a diagnoses, to which some costs are attached.

MySample: Right border marker

I still edit my website as a collection of HTML files, which I edit with the MySample editor that I have been adapting through the years for this purpose. I always like my files not to extend beyond the eightieth column, but that is not always easy. This afternoon, I though about adding a red line in the syntax highlighting just at the that column. It was not so difficult to implement. Just some statements at the right place. It really looks great and works nice as you can see on the image on the right.

Since the last release of the MySample, I also have made some additions to the script language. I have introduced a type for points. I have added a method for closing editors (both text and image) so that you can actually use it for batch processing large ranges of images. And there is some support to read text files. It is now also possible to just the key 1 to 9 to when pointing at point in an image file and read those points from the script. I just extend the language when I feel the need. So, the set of available methods is probably not very balanced.


Saturday, May 23, 2015

Book

At 11:55:12, I bought the book Proeven van Liefde (Dutch translation of Essays in Love) by Alain de Botton from bookshop Broekhuis for € 6.95.


Thursday, May 21, 2015

Old Kempe proof after all?

I started writing a paper, thinking that I had found a truely elagant way of proving the four colour theorem based on the ideas that I developed earlier this week. But when I biked home yesterday, I discovered that I had overlooked an important fact, which destroyed the simple proof. But then I got another idea, but after investigating it a little I discovered that it might also not work. Earlier this week, I wrote to some people, why I thought that the proof I had in mind, was different from all other 'simple' proof attempts, like the first one from Alfred Kempe, namely: that the proof used an incremental procedure, instead of fixing a problem in a steady state, and that the problem it has to fix is localized. The first is actually not true and even if the second is true, it might still be true that the proof still belongs to the same catergory of proofs that are never going to work in the sense that you encounter problem cases (no matter how few they are) that can not be resolved. The reason might be that these proofs are based on a limited representation of an 'object' that does not capture all the complexity that is needed to resolve all cases. This exercise did give me some new ideas that I feel are worth pondering about. I gained some deeper understanding of the problem, and maybe that is worth all the effort.


Tuesday, May 19, 2015

Resolving the details

What I call Kempe chains yesterday are more often called 'Kempe chains on edges'. When I searched for that term, I found a website about the Four color theorem by Mario Stefanutti, where he talks about impasses and resolving them with swapping along Kempe chains on edges, much like what I am using. So, it seems that some of my ideas are not original. He also gives a counter example of a graph where his method does not work. There are some important difference between his method and my proof strategy.

Since I wrote the above yesterday morning, I have continued thinking about it. One important observations is that both the edges on the side of an open face with the value 0 assigned to it, must have the same edge color, lets say α, because otherwise the vertex closing the open face could be assigned a value 1 or 2. Which means that the possible Kempe chains (on edges) that are connected to this node, must be αβ and αγ chains. Another observation is that Kempe chains of a certain type cannot cross within a planar cubic graph.

Lets look at the case where there are only two Kempe chains connected to the two edges. We look to the vertices attached to the neighbour edges on both sides. It seems impossible that both of the Kempe chains pass through one of these vertices, because then one of them must end at the outside edge (which is a contradiction). It is possible that one of the Kempe chains passes through both these vertices, but there is always one Kempe chain that does not pass through both. If one of the Kempe chains passes through one of the vertices, the other Kempe chain will need to be reversed, causing this Kempe chain to be broken into two pieces, where one piece leaves through the neighbour outside edge.

Now when both Kempe chains do not pass through either of the vertices at the neighbour edges, there is a problem. Because there is a counter example, where alternating reversing the Kempe chains will result in a cycle never to resolve the issue. But there is an escape. We simply have to 'pull' one of the Kempe chains to one of the vertices. Lets say the Kempe path leaving from the edge to the right of the open face at the location towards the right neighbour is an αβ Kempe path. Now there must be some vertices along the open face between the left edge and it neighbour. The vertex closest to the neighbour edge that is included in the αβ Kempe path, must have a γ edge colour on the edge on the right. If the edge on the left has the colour α we can reverse the Kempe path βγ going through this vertex, which causes the αβ Kempe path to extend towards the neighbour edge. This process can be repeated until the vertex at the neighbour edge is included. (It is possible that during this process the other Kempe path is broken, but that would be no problem, as that would result in a faster way in three Kempe path to be connected to the two edges.) This proves that it is aways possible in a finite number of Kempe path reversals to create a sequences that has a value different than 0 at the problem location.


Monday, May 18, 2015

Proof with Kempe chains?

In the past week, I have been rereading parts of the book Four Colors Suffice and thinking about Kempe chains for solving the four colour theorem. For proving the four colour theorem it is sufficient to look at all 2-connected (planar) cubic graphs that are free of digons, triangles, and squares. A partial cubic graph, is a cubic graph that has some open edges on the outside. The partial cubic graphs can be ordered by the number of vertices that they contain. Every (complete) cubic graph can be reached by 'closing' one of the partial cubic graphs with three outgoing edges, by joining these three edges. Furthermore, every partial cubic graph of size n+1 can be constructed by adding a vertex to that connects either one or two of the open edges of a partial cubic graph of size n.

Every face colouring of a partial cubic graph is related to a three colouring of the edges, say with α, β, and γ (or a, b, and c, as I used in my first entry). Around each vertex the edge colours are either labeled in a clockwise or anti-clockwise manner with respect to the alphabetical order of the letters. If we assign values 1 to all clockwise and 2 to all anti-clockwise vertices, a value of 0, 1, or 2 can be assigned to each (open and closed) face by adding the values of the vertices modulo 3. For the closed (inside) faces of a partial cubic graph these should be zero. With the open (outside) faces of a partial cubic graph a cyclic sequence can be associated. With each partial cubic graphs it is possible to assign a set of sequences based on all possible face colourings (as I descibed before). It is possible that more than one face colouring of the partial cubic graph leads to the same sequence.

If a partial cubic graph of size n+1 can be constructed by adding a vertex to a partial cubic graph of size n that is connected with one open edge, then a set of sequences can be constructed by expanding the sequences of partial cubic graph of size n. Every sequence of the partial cubic graph of size n results in two sequences of the partial cubic graph of size n+1 by either inserting a 1 or a 2 at the corresponding location and adding that value (modulo 3) to its neighbours. If a partial cubic graph of size n+1 can be constructed by adding a vertex to two open edges, the set of sequences can be constructed by contracting the sequences of the partial cubic graph of size n. For every sequence that has a value 1 or 2 at the corresponding location, that value needs to be removed and substracted (modulo 3) from its neighbours. If all sequences have a 0 at the corresponding location, it is not possible to colour the partial cubic graph of size n+1 and the four colour theorem would be disproven. If we can proof that every set of sequences of all partial planar graphs of size n have at least one value unequal to 0 at every possible location, then the four colour theorem can be proven from this. (If I am not mistaken, as I reasoned before, every (complete) cubic graph can be constructed from a sequence of partial cubic graphs in increasing size such that first n/2 expansions are made and next n/2 contractions are made.)

A kempe chain is made out of a combination of two edge colours. There are thus three kinds of Kempe chains: αβ, αγ, and βγ. For a partial graph the Kempe chains form cycles (assuming that it has a correct face colouring). This is because the three edges attaced to each vertex have three distinct edge colours (either assigned in a clockwise or anti-clockwise manner). This causes each outer edge to be connected with two other outer edges through two Kempe chains marked with different combinations of the edge colours. Now suppose that there is set of sequences for a partial cubic graph of size n, such that at some location all the sequences contain the value 0. Take one of the sequences and select one of the face colourings associated with this sequence, there must be at least one, and determine the Kempe chains for this colouring. Now the edges on the sides of the open face at which the 0 is located are either connected with two, three or four Kempe chains. In case there are four connected, then pick one, and exchange the values 1 and 2 on the Kempe chain resulting in another face colouring of the partial cubic graph, which has a sequence associated with it that has a value different than 0 at the given location. In case there are three connected, one of them must connect the two edges on the side of the open face. Now exchange the values 1 and 2 on one of the other two the Kempe chains resulting in another colouring, which has a sequence associated with a value different than 0 at the location. In case there are only two Kempe chains connected to the two edges on the side of the face, exchanging the 1 and 2 values of the vertices on either of them will result in a new face colouring, but there will still be 0 at the given location. However, because every Kempe chain in a partial cubic graph traverses a distinct subset of vertices (assuming that it does not contain a digon), it means that the two edges must now be connected to three Kempe chains. If this reasoning is correct, it proves the four colour theorem, because another flip of one of the Kempe chains not connecting the two edges, will result in a sequence with a value different from 0. Thus all cases lead to a contradiction, from which it must follow that all sets of sequences of all partial cubic graphs contain at least one value different from 0 at every location.

(Remark: during the day, I have been editing this description to improve its readability.)


Tuesday, May 12, 2015

Introduction

Diaries
June 2015
May 2015
April 2015
March 2015
February 2015
2015
2014
2013
Alzheimer's Disease
Trip to China 2010
-- contact --

Family

Frans
Li-Xia
Annabel
Andy
Honeymoon
Friends
Others
Pictures

Kabuki Syndroom

Collecting

Books
Maps
Bookshelves
Computers
Cameras
Trips
Flights
Weddings
Funerals
Reading
Movies
Useless lists

Hacking

My life as a hacker
Signature programs
Software enginering
The Art of Programming
HTML to LaTeX
JavaScript
eXtreme Programming

Puzzles

Hamilton cycles
cutting sticks
Califlower fractal
more...


Katla

Earthquakes
Graphs
Tremors
Helirecorders
Volcano Blog



Email

The email address below, may only be used for private communications. This email address may not be put on any mailing list. I do not want to receive emails with advertisements of any kind. My email address is:

Site statistics

If I did not count wrong, this site consists of 866 HTML-files with a total size of 18,397,784 characters, having 39200 internal links and 8168 external links. (About 679 of the external links are broken.) Furthermore, it contains 151 C/C++ program files with a total size of 3,412,360 characters, and 3 PASCAL program files with a total size of 35,259 characters. There are 55 text files with a total size of 351,644 characters. With respect to images, this site containts 1146 JPEG images (total size 49,430,146 bytes), 146 GIF images (total size 3,765,046 bytes), 82 PNG images (total size 2,029,477 bytes), and 2 BMP images (total size 3,727 bytes). With respect to sounds, it contains 14 WAV files with a total size of 389,002 bytes and 1 MP3 files with a total size of 70,182 bytes. It also contains 43 PostScript files (total size 308,387 bytes), 2 LaTeX files (total size 132,020 characters), 8 PDF files (total size 640,573 characters), 21 zip files (total size 2,275,072 bytes), 3 gzipped tar files (total size 52,345 bytes), 44 SGF files with a total size of 83,527 bytes, 90 KML files with a total size of 4,271,736 bytes, and 2 EXE files with a total size of 38,340 bytes. It also uses 16 JavaScript files with a total size of 909,421 bytes,

Copyright

Creative Commons License

I, Frans hold the copyrights of this and all other pages on this website. For this website a Creative Commons License is applicable. You may not use this work for commercial purposes. I consider all computer programs to be copyrighted by me under the GNU General Public License, unless stated explicitly otherwise. All quotes (text and program fragments) from other sources are excluded from this, and should be considered as copyrighted by their authors.

An alternative link for this website is: http://5z8.info/back-to-africa_b2t1i_super-nsfw.


























(This space is intentionially left empty)