Skip to content →

neverendingbooks Posts

Kasha-eating dragons

This semester I’m teaching a first course in representation theory. On campus, IRL! It’s a bit strange, using a big lecture room for a handful of students, everyone wearing masks, keeping distances, etc.



So far, this is their only course on campus, so it has primarily a social function. The breaks in between are infinitely more important than the lectures themselves. I’d guess breaks take up more than one third of the four hours scheduled.

At first, I hoped to make groups and their representations relevant by connecting to the crisis at hand, whence the the symmetries of Covid-19 post, and the Geometry of Viruses series of posts.

Not a great idea. I guess most of us are by now over-saturated with Corona-related news, and if students are allowed to come to campus just one afternoon per week, the last thing they want to hear about is, right, Covid.

So I need to change tactics. By now we’ve reached the computation of character tables, and googling around I found this MathOverflow-topic: Fun applications of representations of finite groups.

The highest rated answer, by Vladimir Dotsenko, suggests a problem attributed to Kirillov:

An example from Kirillov’s book on representation theory: write numbers 1,2,3,4,5,6 on the faces of a cube, and keep replacing (simultaneously) each number by the average of its neighbours. Describe (approximately) the numbers on the faces after many iterations.

A bit further down the list, the Lecture notes on representation theory by Vera Serganova are mentioned. They start off with a variation of Kirillov’s question (and an extension of it to the dodecahedron):

Hungry knights. There are n hungry knights at a round table. Each of them has a plate with certain amount of food. Instead of eating every minute each knight takes one half of his neighbors servings. They start at 10 in the evening. What can you tell about food distribution in the morning?

Breakfast at Mars. It is well known that marsians have four arms, a standard family has 6 persons and a breakfast table has a form of a cube with each person occupying a face on a cube. Do the analog of round table problem for the family of marsians.

Supper at Venus. They have five arms there, 12 persons in a family and sit on the faces of a dodecahedron (a regular polyhedron whose faces are pentagons).

Perhaps the nicest exposition of the problem (and its solution!) is in the paper Dragons eating kasha by Tanya Khovanova.

Suppose a four-armed dragon is sitting on every face of a cube. Each dragon has a bowl of kasha in front of him. Dragons are very greedy, so instead of eating their own kasha, they try to steal kasha from their neighbors. Every minute every dragon extends four arms to the four neighboring faces on the cube and tries to get the kasha from the bowls there. As four arms are fighting for every bowl of
kasha, each arm manages to steal one-fourth of what is in the bowl. Thus each
dragon steals one-fourth of the kasha of each of his neighbors, while at the same
time all of his own kasha is stolen. Given the initial amounts of kasha in every
bowl, what is the asymptotic behavior of the amounts of kasha?

I can give them quick hints to reach the solution:

  • the amounts of kasha on each face gives a vector in $\mathbb{R}^6$, which is an $S_4$-representation,
  • calculate the character of this kasha-representation,
  • use the character table of $S_4$ to decompose the representation into irreducibles,
  • identify each of the irreducible factors as instances in the kasha-representation,
  • check that the food-grabbing operation is an $S_4$-morphism,
  • remember Schur’s lemma, and compute the scaling factors on each irreducible component,
  • conclude!

But, I can never explain it better than Khovanova’s treatment of the kasha-eating dragons problem.

Comments closed

Teapot supremacy

No, this is not another timely post about the British Royal family.

It’s about Richard Borcherds’ “teapot test” for quantum computers.



A lot of money is being thrown at the quantum computing hype, causing people to leave academia for quantum computing firms. A recent example (hitting the press even in Belgium) being the move of Bob Coecke from Oxford University to Cambridge Quantum Computing.

Sure, quantum computing is an enticing idea, and we have fantastic quantum algorithms such as Shor’s factorisation algorithm and Grover’s search algorithm.

The (engineering) problem is building quantum computers with a large enough number of qubits, which is very difficult due to quantum decoherence. To an outsider it may appear that the number of qubits in a working quantum computer is growing at best linearly, if not logarithmic, in sharp contrast to Moore’s law for classical computers, stating that the number of transistors in an integrated circuit doubles every two years.

Quantum computing evangelists assure us that this is nonsense, and that we should replace Moore’s law by Neven’s law claiming that the computing power of quantum computers will grow not just exponentially, but doubly exponentially!

What is behind these exaggerated claims?

In 2015 the NSA released a policy statement on the need for post-quantum cryptography. In the paper “A riddle wrapped in an enigma”, Neil Koblitz and Alfred Menezes carefully examined NSA’s possible strategies behind this assertion.

Can the NSA break PQC? Can the NSA break RSA? Does the NSA believes that RSA-3072 is much more quantum-resistant than ECC-256 and even ECC-384?, and so on.

Perhaps the most plausible of all explanations is this one : the NSA is using a diversion strategy aimed at Russia and China.

Suppose that the NSA believes that, although a large-scale quantum computer might eventually be built, it will be hugely expensive. From a cost standpoint it will be less analogous to Alan Turingโ€™s bombe than to the Manhattan Project or the Apollo program, and it will be within the capabilities of only a small number of nation-states and huge corporations.

Suppose also that, in thinking about the somewhat adversarial relationship that still exists between the U.S. and both China and Russia, especially in the area of cybersecurity, the NSA asked itself โ€œHow did we win the Cold War? The main strategy was to goad the Soviet Union into an arms race that it could not afford, essentially bankrupting it. Their GNP was so much less than ours, what was a minor set-back for our economy was a major disaster for theirs. It was a great strategy. Letโ€™s try it again.โ€

This brings us to the claim of quantum supremacy, that is, demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time.

In 2019, Google claimed “to have reached quantum supremacy with an array of 54 qubits out of which 53 were functional, which were used to perform a series of operations in 200 seconds that would take a supercomputer about 10,000 years to complete”. In December 2020, a group based in USTC reached quantum supremacy by implementing a type of Boson sampling on 76 photons with their photonic quantum computer. They stated that to generate the number of samples the quantum computer generates in 20 seconds, a classical supercomputer would require 600 million years of computation.

Richard Borcherds rants against the type of problems used to claim quantum ‘supremacy’. He proposes the ‘teapot problem’ which a teapot can solve instantaneously, but will be impossibly hard for classical (and even quantum) computers. That is, any teapot achieves ‘teapot supremacy’ over classical and quantum computers!

Another point of contention are the ‘real-life applications’ quantum computers are said to be used for. Probably he is referring to Volkswagen’s plan for traffic optimization with a D-Wave quantum computer in Lisbon.

“You could give these guys a time machine and all they’d use it for was going back to watch some episodes of some soap opera they missed”

Enjoy!

One Comment

de Bruijn’s pentagrids

In a Rhombic tiling (aka a Penrose P3 tiling) we can identify five ribbons.

Opposite sides of a rhomb are parallel. We may form a ribbon by attaching rhombs along opposite sides. There are five directions taken by sides, so there are five families of ribbons that do not intersect, determined by the side directions.

Every ribbon determines a skeleton curve through the midpoints of opposite sides of the rhombs. If we straighten these skeleton curves we get a de Bruijn’s pentagrid.



A pentagrid is a grid of the plane consisting of five families of parallel lines, at angles multiples of $72^o = 360^o/5$, and with each family consisting of parallel lines with a spacing given by a number $\gamma_i$ for $0 \leq i \leq 4$, satisfying
\[
\gamma_0+\gamma_1+\gamma_2+\gamma_3+\gamma_4=0 \]

The points of the plane in the $j$-th family of the pentagrid are
\[
\{ \vec{x} \in \mathbb{R}^2~|~\vec{x}.\vec{v}_j + \gamma_j \in \mathbb{Z} \} \]
where $\vec{v}_j = \zeta^j = (cos(2 \pi j/5),sin(2 \pi j/5))$.

A pentagrid is regular if no point in $\mathbb{R}^2$ belongs to more than two of the five grids. For almost all choices $\gamma_0,\dots,\gamma_4$ the corresponding pentagrid is regular. The pentagrid coordinates of a point $\vec{x} \in \mathbb{R}^2$ are the five integers $(K_0(\vec{x}),\dots,K_4(\vec{x}) \in \mathbb{Z}^5$ defined by
\[
K_j(\vec{x}) = \lceil \vec{x}.\vec{v}_j + \gamma_j \rceil \]
with $\lceil r \rceil$ the smallest integer greater of equal to $r$, and clearly the function $K_j(\vec{x})$ is constant in regions between the $j$-th grid lines.



With these pentagrid-coordinates one can associate a vertex to any point $\vec{x} \in \mathbb{R}^2$
\[
V(\vec{x}) = \sum_{j=0}^4 K_j(\vec{x}) \vec{v}_j \]
which is constant in regions between grid lines.

Here’s de Bruijn‘s result:

For $\vec{x}$ running over $\mathbb{R}^2$, the vertices $V(\vec{x})$ coming from a pentagrid determine a Rhombic tiling of the plane. Even better, every Rhombic tiling comes from a pentagrid.



We’ll prove this for regular pentagrids (the singular case follows from a small deformation).

Any intersection point $\vec{x}_0$ of the pentagrid belongs to exactly two families of parallel lines, so we have two integers $r$ and $s$ with $0 \leq r < s \leq 4$ and integers $k_r,k_s \in \mathbb{Z}$ such that $\vec{x}_0$ is determined by the equations \[ \begin{cases} \vec{x}.\vec{v}_r + \gamma_r = k_r \\ \vec{x}.\vec{v}_s + \gamma_s = k_s \end{cases} \] In a small neighborhood of $\vec{x}_0$, $V(\vec{x})$ takes the values of four vertices of a rhomb. These vertices are associated to the $5$-tuples in $\mathbb{Z}^5$ given by \[ (K_0(\vec{x}_0),\dots,K_4(\vec{x}_0))+\epsilon_1 (\delta_{0r},\dots,\delta_{4r})+\epsilon_2 (\delta_{0s},\dots,\delta_{4s}) \] with $\epsilon_1,\epsilon_2 \in \{ 0,1 \}$. So, the intersection points of the regular pentagrid lines correspond to rhombs, and the regions between the grid lines (which are called meshes) correspond to vertices, whose positions are given by $V(\vec{x})$.

Observe that these four vertices give a thin rhombus if the angle between $\vec{v}_r$ and $\vec{v}_s$ is $144^o$ and determine a thick rhombus if the angle is $72^o$.

Not all pentagrid coordinates $(k_0,\dots,k_4)$ occur in the tiling though. For $\vec{x} \in \mathbb{R}^2$ we have
\[
K_j(\vec{x}) = \vec{x}.\vec{v}_j + \gamma_j + \lambda_j(\vec{x}) \]
with $0 \leq \lambda_j(\vec{x}) < 1$. In a regular pentagrid at most two of the $\lambda_j(\vec{x})$ can be zero and so we have \[ 0 < \lambda_0(\vec{x}) + \dots + \lambda_4(\vec{x}) < 5 \] and we have assumed that $\gamma_0 + \dots + \gamma_4 = 0$, giving us \[ \sum_{j=0}^4 K_j(\vec{x}) = \vec{x}.(\sum_{j=0}^4 \vec{v}_j) + \sum_{j=0}^4 \gamma_j + \sum_{j=0}^4 \lambda_j(\vec{x}) = \sum_{j=0}^4 \lambda_j(\vec{x}) \] The left hand side must be an integers and the right hand side a number strictly between $0$ and $5$. This defines the index of a vertex
\[
ind(\vec{x}) = \sum_{j=0}^4 K_j(\vec{x}) \in \{ 1,2,3,4 \} \]
Therefore, every vertex in the tiling may be represented as
\[
k_0 \vec{v}_0 + \dots + k_4 \vec{v}_4 \]
with $(k_0,\dots,k_4) \in \mathbb{Z}^5$ satisfying $\sum_{j=0}^4 k_j \in \{ 1,2,3,4 \}$. If we move a point along the edges of a rhombus, we note that the index increases by $1$ in the directions of $\vec{v}_0,\dots,\vec{v}_4$ and decreases by $1$ in the directions $-\vec{v}_0,\dots,-\vec{v}_4$.



It follows that the index-values of the vertices of a thick rhombus are either $1$ and $3$ at the $72^o$ angles and $2$ at the $108^o$ angles, or they are $2$ and $4$ at the $72^o$ angles, and $3$ at the $108^o$ angles. For a thin rhombus the index-values must be either $1$ and $3$ at the $144^o$ angles and $2$ at the $36^o$ angles, or $2$ and $4$ at the $144^o$ angles and $3$ at the $36^o$ angles.

We still have to show that this gives a legal Rhombic tiling, that is, that the gluing restrictions of Penrose’s rhombs are satisfied.



We do this by orienting and colouring the edges of the thin and thick rhombus towards the vertex defined by the semi-circles on the rhombus-pieces. Edges connecting a point of index $3$ to a point of index $2$ are coloured red, edges connecting a point of index $1$ to a point of index $2$, or connecting a point of index $3$ to one of index $4$ are coloured blue.

We orient green edges pointing from index $2$ to index $1$, or from index $3$ to index $4$. As this orientation depends only on the index-values of the vertices, two rhombs sharing a common green edge also have the same orientation on that edge.

On each individual rhomb, knowing the green edges and their orientation forced the red edges and their orientation, but we still have to show that if two rhombs share a common red edge, this edge has the same orientation on both (note in the picture above that a red edge can both flow from $2$ to $3$ as well as from $3$ to $2$).

From the gluing conditions of Penrose’s rhombs we see that if $PQ$ be a red edge, in common to two rhombs, and these rhombs have angle $\alpha$ resp. $\beta$ in $P$, then $\alpha$ and $\beta$ must be both less that $90^o$ or both bigger than $90^o$. We translate this in terms of the pentragrid.



The two rhombs correspond to two intersection points $A$ and $B$, and we may assume that they both lie on a line $l$ of family $0$ of parallel lines (other cases are treated similarly by cyclic permutation), and that $A$ is an intersection with a family $p$-line and $B$ with a family $q$-line, with $p,q \in \{ 1,2,3,4 \}$. The interval $AB$ crosses the unique edge common to the two rhombs determined by $A$ and $B$, and we call the interval $AB$ red if $\sum_j K_j(\vec{x})$ is $2$ on one side of $AB$ and $3$ on the other side. The claim about the angles $\alpha$ and $\beta$ above now translates to: if $AB$ is red, then $p+q$ is odd (in the picture above $p=1$ and $q=2$).

By a transformation we may assume that $\gamma_0=0$ and that $l$ is the $Y$-axis. For every $y \in \mathbb{R}$ we then get
\[
\begin{cases}
K_1(0,y) = \lceil y .sin(2 \pi/5) + \gamma_1 \rceil \\
K_2(0,y) = \lceil y .sin(4 \pi/5) + \gamma_2 \rceil \\
K_3(0,y) = \lceil -y .sin(4 \pi/5) + \gamma_3 \rceil \\
K_4(0,y) = \lceil -y .sin(2 \pi/5) + \gamma_4 \rceil
\end{cases}
\]
and $\gamma_1+\gamma_4$ and $\gamma_2+\gamma_3$ are not integers (otherwise the pentagrid is not regular). If $y$ runs from $-\infty$ to $+\infty$ we find that
\[
K_1(0,y)+K_4(0,y) – \lceil \gamma_1 + \gamma_4 \rceil = \begin{cases} 0 \\ 1 \end{cases} \]
with jumps from $0$ to $1$ at places where $(\lceil \gamma_1 + \gamma_4 \rceil – \gamma_1)/sin(2 \pi/5) \in \mathbb{Z}$ and from $1$ to $0$ when $\gamma_4/sin(2 \pi/5) \in \mathbb{Z}$. (A similar result holds replacing $K_1,K_4,\gamma_1,\gamma_4,sin(2 \pi/5)$ by $K_2,K_3,\gamma_2,\gamma_3,sin(4 \pi/5)$.

Because the points on $l$ intersecting with $1$-family and $4$-family gridlines alternate (and similarly for $2$- and $3$-family gridlines) we know already that $p \not= q$. If we assume that $p+q$ is even, we have two possibilities, either $\{p,g \}=\{ 1,3 \}$ or $\{ 2,4 \}$. As $\gamma_0=0$ we have $\gamma_1+\gamma_2+\gamma_3+\gamma_4=0$ and therefore
\[
\lceil \gamma_1 + \gamma_4 \rceil + \lceil \gamma_2+\gamma_3 \rceil = 1 \]
It then follows that $K_1(0,y)+K_2(0,y)+K_3(0,y)+K_4(0,y) = 1$ or $3$ between the points $A$ and $B$. Therefore $K_0(y,0) + \dots + K_4(0,y)$ is either $1$ on the left side and $2$ on the right side, or is $3$ on the left side and $4$ on the right side, so $AB$ must be green, a contradiction. Therefore, $p+q$ is odd, and the orientation of the red edge in both rhombs is the same. Done!

An alternative way to see this correspondence between regular pentagrids and Rhombic tilings as as follows. To every intersection of two gridlines we assign a rhombus, a thin one if they meet at an acute angle of $36^o$ and a thich one if this angle is $72^o$, with the long diagonal dissecting the obtuse angle.



Do this for all intersections, surrounding a given mesh.



Attach the rhombs by translating them towards the mesh, and finally draw the colours of the edges.



Another time, we will connect this to the cut-and-project method, using the representation theory of $D_5$.

Comments closed