Related papers: A strange bridge by Leonardo
We consider a graph with colored edges. A trail (vertices may repeat but not edges) is called \emph{alternating} when successive edges have different colors. Given a set of vertices called \emph{terminals}, the \emph{alternating…
This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…
We address the possibility that intelligent civilisations that destroy themselves could present signatures observable by humanity. Placing limits on the number of self-destroyed civilisations in the Milky Way has strong implications for the…
The BRIDGES meeting in gauge theory, extremal structures, and stability was held June 2024 at l'Institut d'\'Etudes Scientifiques de Carg\`ese in Corsica, organized by Daniele Faenzi, Eveline Legendre, Eric Loubeau, and Henrique S\'a Earp.…
While paradoxical linkages famously violate the Chebyshev-Grubler-Kutzbach criterion by exhibiting unexpected mobility, we identify an opposing phenomenon: a class of linkages that appear mobile according to the same criterion, yet are in…
An oblivious point on a translation surface is a point with no closed geodesic passing through it. Nguyen, Pan, and Su (2017) showed that there are at most finitely many oblivious points on any given translation surface and constructed a…
The author, in her previous paper, constructed an infinite family of 3-bridge links each of which admits infinitely many 3-bridge spheres up to isotopy. In this paper, we prove that if a prime, unsplittable link $L$ in $S^3$ admits…
We present high-precision Monte Carlo data for the phase diagram of a two-species driven diffusive system, reminiscent of traffic across a narrow bridge. Earlier studies reported two phases with broken symmetry; the existence of one of…
There has been much recent interest devoted to a class of frustrated one-dimensional statistical mechanics lattice models which exhibit sharp thermodynamics. In this work, we study an extension of one of these models to two dimensions; the…
We analyze the geometrical structure of the astonishing Nasca geoglyphs in terms of their fractal dimension with the idea of dating these manifestations of human cultural engagements in relation to one another. Our findings suggest that the…
Marathons are now common ways of seeing cities, yet little is known about how representative their routes are. Using 311 marathon routes across five continents, we compare landmarks and amenities along the course with those elsewhere in the…
Theta-graphs are a type of spatial graph with two vertices connected by three edges. We investigate embeddings of theta-graphs in the square and simple cubic lattices, using a combination of the Wang-Landau Monte Carlo method with a variant…
We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…
Bridge Theory was born in 1979 from a simple idea. An observer of a dipolar source cannot measure instantaneously all the energy and momentum effectively produced along the own line of view because the source has not a spherical symmetry.…
We consider a hybrid Monte Carlo algorithm which is applicable to lattice theories defined on Lefschetz thimbles. In the algorithm, any point (field configuration) on a thimble is parametrized uniquely by the flow-direction and the…
Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka 50 years ago. It is easy to see that every symmetric union represents a ribbon knot, but the converse is still…
Let $G$ be a bridgeless cubic graph. The Berge--Fulkerson Conjecture (1970s) states that $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to exactly two of these perfect matchings. If answered in the…
A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…
Are symmetries discovered or rather invented by humans ? The stand you may take firmly here reveals a lot of your epistemological position. Conversely, the arguments you may forge for answering to this question, or to one of its numerous…
The computation of the dimension of linear systems of plane curves through a bunch of given multiple points is one of the most classic issues in Algebraic Geometry. In general, it is still an open problem to understand when the points fail…