Related papers: Trigonometry of The Gold-Bug
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…
Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in $\mathbb C^2$, and we give an…
This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from…
Classical gravitation theory is formulated as gauge theory on natural bundles where gauge symmetries are general covariant transformations and a gravitational field is a Higgs field responsible for their spontaneous symmetry breaking.
A famous result of D. Walkup is that an $m\times n$ rectangle may be tiled by T-tetrominos if and only if both $m$ and $n$ are multiples of 4. The "if" portion may be proved by tiling a $4\times 4$ block, and then copying that block to fill…
A twisting system is one of the major tools to study graded algebras, however, it is often difficult to construct a (non-algebraic) twisting system if a graded algebra is given by generators and relations. In this paper, we show that a…
On each nonorientable surface of odd genus $g \geq 5$, we give a mapping class whose dilatation on an invariant subsurface is the golden ratio.
We present a foraging algorithm, GoldenFA, in which search direction is chosen based on the Golden Ratio. We show both theoretically and empirically that GoldenFA is more efficient for a single searcher than a comparable algorithm where…
We introduce the cohomological blow up of a graded Artinian Gorenstein (AG) algebra along a surjective map, which we term BUG (Blow Up Gorenstein) for short. This is intended to translate to an algebraic context the cohomology ring of a…
Expansions in noninteger bases often appear in number theory and probability theory, and they are closely connected to ergodic theory, measure theory and topology. For two-letter alphabets the golden ratio plays a special role: in smaller…
In this work we study three topologies defined over the same set: the hedgehog. As the name suggests, the hedgehog can be described as a set of spines identified at a single point. Among others, we give a proof of the Kowalsky hedgehog…
The Circle of Apollonius is named after the ancient geometrician Apollonius of Perga. This beautiful geometric construct can be helpful when solving some general problems of mathematical physics, optics and electricity. Here we discuss its…
Let $ G $ be a connected graph. If $\bar{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the proximity, $\pi(G)$, of $G$ is defined as the smallest value of $\bar{\sigma}(v)$ over all…
The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…
Gay and Meier asked if a trisection diagram for the Gluck twist on a spun or twist-spun 2-knot in $S^4$ obtained by a certain method is standard. In this paper, we show that the trisection diagram for the Gluck twist on the spun…
Given any closed, connected, orientable $3$--manifold and integers $g\geq g(M), D > 0$, we show the existence of knots in $M$ whose genus $g$ bridge number is greater than $D$. These knots lie in a page of an open book decomposition of $M$,…
We prove polynomial ergodicity for the one-dimensional Zig-Zag process on heavy tailed targets and identify the exact order of polynomial convergence of the process when targeting Student distributions.
The game of Cops and Robber is traditionally played on a finite graph. The purpose of this paper is to introduce and analyse the game that is played on an arbitrary geodesic space (a compact, path-connected space endowed with intrinsic…
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…
Gittins indices provide an optimal solution to the classical multi-armed bandit problem. An obstacle to their use has been the common perception that their computation is very difficult. This paper demonstrates an accessible general…