Profile cover photo
Profile photo
Nicolau Werneck (Nic)
Engineer with a love for loud music and horror films.
Engineer with a love for loud music and horror films.

Nicolau's interests
View all
Nicolau's posts

Post has shared content
New paper from +Alec Radford, +Luke Metz and me on stabilizing generative adversarial networks. Alec and Luke are quite awesome.

A summary of the paper:
Arxiv link:

Post has attachment

Post has shared content
Keleti's Perimeter to Area Conjecture

It is clear that dividing the perimeter of a square of side 1 by its area results in a ratio of 4. Doing the same for two adjacent unit squares that share an edge results in a smaller ratio, in this case 3. So what can be said about this ratio in the case of an arbitrary union of (possibly overlapping) unit squares in the plane? Keleti's Perimeter to Area Conjecture was that this ratio never exceeds 4, although this is now known to be false. The picture shows a counterexample to the conjecture in which the ratio is approximately 4.28.

A problem related to this one appeared as Problem 6 on the famous Hungarian Schweitzer Competition in 1998. That problem asked for a proof that the perimeter-to-area ratio of a union of unit squares in the plane has an upper bound. Impressively, several Hungarian undergraduates were able to prove this for the competition. In the same year, Tamás Keleti published his Perimeter to Area Conjecture that the bound was exactly 4. This is now known to be incorrect; the best known bound is about 5.551 and was found by Keleti's student Zoltán Gyenes in his 2005 Master's thesis.

I found out about this problem from the paper Bounded – yes, but 4? ( by Paul D. Humke, Cameron Marcott, Bjorn Mellem and Cole Stiegler. This paper was posted recently but is dated November 2013, and it does not mention progress on the problem that has been made since then. The 2014 paper Unions of regular polygons with large perimeter-to-area ratio ( by Viktor Kiss and Zoltán Vidnyánszky proves that Keleti's conjecture is false. The picture here comes from Kiss and Vidnyánszky's paper.

The counterexample in the picture uses 25 unit squares, but Kiss and Vidnyánszky use a systematic method to construct (in Theorem 2.4) a counterexample using only five unit squares, and use an ad hoc method to construct (in Section 3) a counterexample using only four squares. They also (in Theorem 2.8) show that the analogue of Keleti's conjecture for equilateral triangles is false, by exhibiting a counterexample involving four triangles. The authors conjecture that similar constructions can be made for other regular polygons; more specifically, that their systematic method can be used to produce an analogous configuration of n+1 regular n-gons that has a greater perimeter-to-area ratio than a single regular n-gon. 

Kiss and Vidnyánszky pose a number of other interesting questions in their closing section. For example, is n the minimal possible number of n-gons in a counterexample? And does something analogous happen in three dimensions, with regular polyhedra?

Although Keleti's conjecture is false, it is known to be true under certain additional hypotheses. In his Master's thesis and in a 2011 paper, Gyenes proved that the conjecture holds (a) if the squares have a common centre, or (b) if all the squares have sides parallel to the x or y axes, or (c) if only two squares are involved.

Relevant links

Gyenes' Masters thesis:

A mathoverflow discussion of Keleti's Perimeter to Area Conjecture from 2010 ( includes some interesting commentary on the problem from various people, including +Timothy Gowers.

The picture contains an oblique reference to Betteridge's law of headlines ('s_law_of_headlines) which states that Any headline that ends in a question mark can be answered by the word “no”. This principle also applies to the title of the paper by Humke et al. 

#mathematics #sciencesunday #spnetwork arXiv:1507.08536

Post has attachment

Post has attachment
A classic-punk playlist I created some time ago. Trying to make it catch.

Post has attachment

Post has attachment

Post has attachment

Post has shared content
A Scala JSON parsing benchmark experiment

I have just published a project on GitHub with an experiment to compare the speed from different Scala libraries to de-serialize JSON data into case classes. I have been using JSON reading and writing not only for web, but also data analysis in general,…
Wait while more posts are being loaded