Related papers: Why is a soap bubble like a railway?
It is easy to imagine that a subvariety of a vector bundle, whose intersection with every fibre is a vector subspace of constant dimension, must necessarily be a sub-bundle. We give two examples to show that this is not true, and several…
Bishop's volume comparison theorem states that a compact $n$-manifold with Ricci curvature larger than the standard $n$-sphere has less volume. While the traditional proof uses geodesic balls, we present another proof using isoperimetric…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
Humans are capable of abstracting away irrelevant details when studying problems. This is especially noticeable for problems over grid-cells, as humans are able to disregard certain parts of the grid and focus on the key elements important…
The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this…
If the nodes of a graph are considered to be identical barrels - featuring different water levels - and the edges to be (locked) water-filled pipes in between the barrels, consider the optimization problem of how much the water level in a…
This paper proposes a mathematical justification of the phenomenon of extreme congestion at a very limited number of nodes in very large networks. It is argued that this phenomenon occurs as a combination of the negative curvature property…
This paper presents an under-appreciated way to conceptualize stationary black holes, which we call the river model. The river model is mathematically sound, yet simple enough that the basic picture can be understood by non-experts. %that…
Network-based modeling of complex systems and data using the language of graphs has become an essential topic across a range of different disciplines. Arguably, this graph-based perspective derives its success from the relative simplicity…
Kendall's Similarity Shape Theory for constellations of N points in the carrier space $\mathbb{R}^d$ as quotiented by the similarity group was developed for use in Probability and Statistics. It was subsequently shown to reside within…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
Soap bubbles occupy the rare position of delighting and fascinating both young children and scientific minds alike. Sir Isaac Newton, Joseph Plateau, Carlo Marangoni, and Pierre-Gilles de Gennes, not to mention countless others, have…
Developing on a recent work on localized bubbles of ordinary relativistic fluids, we study the comparatively richer leading order surface physics of relativistic superfluids, coupled to an arbitrary stationary background metric and gauge…
We study the problem of planning paths for $p$ distinguishable pebbles (robots) residing on the vertices of an $n$-vertex connected graph with $p \le n$. A pebble may move from a vertex to an adjacent one in a time step provided that it…
The Rubix Cube is a 3-dimensional single-player combination puzzle attracting attention in the reinforcement learning community. A Rubix Cube has six faces and twelve possible actions, leading to a small and unconstrained action space and a…
A path in an edge-colored graph is \textit{rainbow} if no two edges of it are colored the same. The graph is said to be \textit{rainbow connected} if there is a rainbow path between every pair of vertices. If there is a rainbow shortest…
Automata networks are a versatile model of finite discrete dynamical systems composed of interacting entities (the automata), able to embed any directed graph as a dynamics on its space of configurations (the set of vertices, representing…
River-bed sediments display two universal downstream trends: fining, in which particle size decreases; and rounding, where pebble shapes evolve toward ellipsoids. Rounding is known to result from transport-induced abrasion; however many…
The least-area hypersurface enclosing and separating two given volumes in R^n is the standard double bubble.
One of the most intriguing findings in the structure of neural network landscape is the phenomenon of mode connectivity: For two typical global minima, there exists a path connecting them without barrier. This concept of mode connectivity…