Search arXiv⌕ Search

arXiv · 2610.39354

Construction and formal verification of a special topology on {\mathbb{Z}}^{n}: characterization of connected subsets

Abstract

We examine whether the integers admit a topology whose connected subsets are precisely the sets of consecutive integers. The main result gives a construction for every integer lattice {\mathbb{Z}}^{n}, n>0; the answer for Z is then obtained as a corollary. We prove that the neighborhoods determined by the parity of the sum of the coordinates form a basis and that topological connectedness agrees exactly with accessibility by finite paths of unit lattice steps. We also present a deductive audit and the correspondence between this argument and a verification in Lean 4 and Mathlib, including the empty set and the independent formal characterization of integer intervals. The construction and mathematical result originate in Problem 5712, proposed by Dan Marcus and solved in 1970 by the Cleveland State University group; the present article contributes a detailed exposition and a report on formal verification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ignacio Vega-Páez. 2026-10-29. Construction and formal verification of a special topology on {\mathbb{Z}}^{n}: characterization of connected subsets. https://arxiv.org/abs/2610.39354

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

KEEP EXPLORING

Related papers

On the Complexity of Computing with p-adic Lattices

We study the complexity of two fundamental problems attached to p-adic lattices: computing an N-orthogonal basis, and deciding whether a given basis is N-orthogonal. When the norm is supplied through an explicit diagonal representation, both problems are polynomial. However, in the black-box model, where the ultrametric norm N is fixed and only accessible through an evaluation oracle, we prove that both problems require $Ω$(p^{v-1} ) queries in the worst case, where v $\le$ n is the largest multiplicity of a commensurability class of N and n is the dimension of the ambient vector space. We then analyse the optimality of these bounds by providing explicit algorithms. Our results answer formally an open question of Zhang, Deng and Wang and refine the recent results of Duan and Wu by providing pointwise query bounds depending on the norm's structure, in addition to uniform bounds.

cs.SC↗

Barik transform and Barik eliminant: a novel algebraic method to solve polynomial equations in the sine and cosine of one variable

Systems of trigonometric equations appear frequently in problems related to geometry, kinematics, computer graphics, robotics, and astronomy, among many other fields. Most often these are first converted to algebraic equations via the ``tangent half-angle'' substitution and solved subsequently using various algebraic methods, such as computation of resultants. In the process, parametric singularities are introduced in the equations, and their degrees are also doubled. In this article, a novel concept call the ``Barik transform'' is introduced, which can help solve such a system without encumbering these issues, albeit only in systems that contain {\em at least} one equation of the first degree in the sine and cosine of the variable to be eliminated. It is shown how Barik transform can produce extremely compact eliminants in the closed form, without resorting to any resultant computation.

cs.SC↗

GPU-Accelerated Search for Fast Matrix Multiplication over $\mathbb{F}_2$

We present a GPU-accelerated algorithm for searching for ways to multiply matrices with few scalar multiplications. Our algorithm searches the matrix multiplication flip graph and, on an NVIDIA H200, performs over a billion search steps per second for matrix sizes up to $7\times7$, a roughly $380\times$ improvement over previous GPU-accelerated search on the tensor for $7\times7$ matrix multiplication. We also prove that, over \(\mathbb{F}_2\), the directed matrix multiplication flip graph is strongly connected with only flip and plus edges. This removes the need for computationally expensive reduction edges in the connectivity argument used by previous work. Using this GPU-accelerated search procedure on our simplified flip graph, we find a way to multiply $7\times 7$ matrices over $\mathbb{F}_2$ using 245 multiplications, a three-multiplication improvement over the previous record.

cs.SC↗