Related papers: The Hurwitz existence problem and the prime-degree…

The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute…

We investigate the combinatorics of real double Hurwitz numbers with real positive branch points using the symmetric group. Our main focus is twofold. First, we prove correspondence theorems relating these numbers to counts of tropical real…

We seek to derive the probability--expressed in terms of the Hilbert-Schmidt (Euclidean or flat) metric--that a generic (nine-dimensional) real two-qubit system is separable, by implementing the well-known Peres-Horodecki test on the…

We find that the first Hurwitz triplet possesses two distinct arithmetic structures. As Shimura curves $X_1$, $X_2$, $X_3$, whose levels are with norm 13. As non-congruence modular curves $Y_1$, $Y_2$, $Y_3$, whose levels are 7. Both of…

While much work has been done to characterize the Turing degrees computing members of various collections of fast growing functions, much less has been done to characterize the rate of growth necessary to compute particular degrees. Prior…

Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…

The Hurwitz form of a projective variety characterizes linear spaces of complementary dimension which meet the variety non-transversally. We extend this notion to varieties in a product of projective spaces. This parallels the multigraded…

For the partition graph $G_n$, whose vertices are the partitions of $n$ and whose edges correspond to elementary unit transfers between parts, we develop a degree theory with three levels: exact value theory, exact profile theory, and…

Recently, Gunningham \cite{G} calculated all spin Hurwitz numbers in terms of combinatorics of Sergeev algebra. In this paper, we use a spin curve degeneration to obtain a recursion formula for degree three spin Hurwitz numbers.

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…

The projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We show that the number of numerical semigroups with multiplicity three, four or five and fixed genus is increasing as a function in the genus. To this end we use the Kunz polytope for these multiplicities. Counting numerical semigroups…

Each finite $p$-perfect group $G$ ($p$ a prime) has a universal central $p$-extension. For a perfect group these central extensions come from its {\sl Schur multiplier}. Serre gave a Stiefel-Whitney class approach to analyzing spin covers…

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or…

We present a fully device-resident, multi-GPU architecture for the large-scale computational verification of Goldbach's conjecture. In prior work, a segmented double-sieve eliminated monolithic VRAM bottlenecks but remained constrained by…

Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$…