Causality Detection via Symplectic Quandles

Amirbek Baxshilloyev

Home/Archive/arXiv

arXiv · 2508.18323

Causality Detection via Symplectic Quandles

Amirbek Baxshilloyev

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study whether symplectic quandle colorings can reveal causal structure encoded by "sky links" - i.e. links consisting of spheres of all light rays through two points in the space of all light rays of a spacetime. Building on the known limitations of the Alexander-Conway polynomial, we compare the connected sum of two Hopf links (which represents all causally unrelated situations) with the first two Allen-Swenberg links (that are the only known examples when this polynomial does not work). For each diagram we report both the quandle counting invariant (total number of colorings) and an enhanced version that records how many distinct colors appear in each coloring. In our tests over small finite fields, plain counts often agree across examples, but the enhanced invariant consistently separates the Hopf case from the Allen-Swenberg family, and becomes more discriminating as the field grows. A simple transfer step suggests that this effect persists along the whole sequence. These results point to enhanced symplectic quandle colorings as a practical, computable indication of causality that classical polynomials alone may miss; the first examples of this kind were discovered by Jain.

Explore related subjects

math.GT gr-qc

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Amirbek Baxshilloyev. 2025-08-24. Causality Detection via Symplectic Quandles. https://arxiv.org/abs/2508.18323

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hyperbolic links associated to Hamiltonian subgraphs in simple $3$-polytopes

We build a large family of hyperbolic links with an explicit decomposition of the complement into right-angled hyperbolic polytopes of finite volume. Namely, in a series of papers A.D.Mednykn and A.Yu.Vesnin introduced a construction that for a given right-angled polytope $P$ in geometry $\mathbb L^3$, $\mathbb R^3$, $\mathbb S^3$, $\mathbb L^2\times \mathbb R$, $\mathbb S^2\times \mathbb R$ and a Hamiltonian cycle, theta-subgraph or $K_4$-subgraph $Γ$ in the $1$-skeleton of $P$ builds a geometric $3$-manifold $N(P,Γ)$ with an involution $τ$ such that $N(P,Γ)/\langleτ\rangle\simeq S^3$. The brach set of the corresponding $2$-sheeted branched covering $N(P,Γ)\to S^3$ is a link $C_Γ\subset S^3$ consisting of trivially embedded circles. This construction reformulated in the language of toric topology works for such a subgraph $Γ$ in any simple $3$-polytope $P$ and gives a topological $3$-manifold $N(P,Γ)$. We give a criterion when $S^3\setminus C_Γ$ has a complete hyperbolic structure of finite volume and generalize this criterion to similar links in $3$-manifolds different from $S^3$. We prove that hyperbolic links $C_Γ$ are parametrized by nonselfcrossing Eulerian cycles, Eulerian theta-subgraphs and Eulerian $K_4$-subgraphs in hyperbolic right-angled $3$-polytopes of finite volume in $\mathbb L^3$ with $0$, $2$ or $4$ finite vertices. The complement $S^3\setminus C_Γ$ is glued of $4$, $8$ or $16$ copies of the corresponding right-angled polytope. We give a criterion when the link $C_Γ$ consists of mutually unlinked circles and prove that if such a link is nontrivial, then it contains the Borromean rings. The latter problem is motivated by the Efimov effect in quantum mechanics.

math.GT↗

arXiv2026

Knots and the Sierpinski Tetrahedron

In this paper we prove that there are infinitely many knots that cannot be embedded in the 1-skeletons of the finite iterations of the Sierpinski tetrahedron fractal. We do this by proving that such an embedding induces a sphere decomposition of weight at most 6. There are infinitely many knots with spherewidth greater than this.