number-theory

We develop moment and prime-trace formulations of the Riemann hypothesis and prove two classes of spectral exclusions. The analytic results use explicitly stated entire-function, moment, and operator hypotheses; a separate TCGS--SEQUENTION application formulates the source-to-readout realization problem. Writing $F(w)=\xi(\tfrac12+i\sqrt w)/\xi(\tfrac12)$ by its entire power series, we establish …

It is possible to use various methods to assign finite values to divergent series (e.g., regularization, analytic continuation). See, for instance, this or this Q&As here on MSE. The limits of ...

The formalization of Fermat’s Last Theorem (FLT) in the Lean proof assistant remains an ongoing community-led effort. It should not be attributed to Claude as a completed, first formalized proof. The distinction matters because formal verification is a demanding process: converting a mathematical argument into machine-checkable code can expose missing assumptions, unclear steps, and dependencies …

Eric Lu announced on X today that he has factored RSA-260, a number N with 260 digits (862 bits) that is the product of two large primes [1]. RSA numbers are challenge problems posed to gauge the security of RSA encryption, which rests on the difficulty of factoring large numbers [2]. The naming scheme is […] The post New RSA number factored first appeared on John D. Cook .

Urs Schreiber
5d ago

denotes ℤ the spectrum of the commutative ring of integers. Its underlying topological space (also known as the “prime spectrum” or “Zariski spectrum” of ) has the prime ideals of as points and carries the Zariski topology. The closed points are the maximal ideals , for each prime number in ; the non-maximal prime ideal is a generic point as it has as closure the whole of . A subset of is closed …

Urs Schreiber
5d ago

Alain Connes (born on April 1, 1947) is a French mathematician, Fields medalist (1982), Crafoord prize winner (2001), Professor at IHÉS, Professor at Collège de France and part-time working as a Professor at Vanderbilt University. His interests include geometry, topology, especially K-theory and index theory, operator algebras, the connections between noncommutative geometry and number theory, an…

This paper presents a new randomized algorithm for solving the exact shortest vector problem. For the $n$-dimensional lattice $\mathcal L$, our algorithm runs in time and space $2^{n/2+o(n)}$. Our algorithm can be viewed as a $q$-ary analogue of the midpoint Hessian for an odd prime $q$; more precisely, we use the fact that, for a shortest vector $v$, the gradient (rather than Hessian) of the p…

- Ponder This This puzzle was suggested by Hugo Pfoertner - thanks Hugo! In a now-famous 2004 article, Ben Green and Terence Tao proved that arbitrarily long arithmetic progressions exist in the primes. This holds true analogously for other sets of numbers if their density is sufficiently high, for example, numbers that are the sum of two squares. There are also enough numbers of the form x² + y²…

Aggarwal, Dadush, Regev, and Stephens-Davidowitz (ADRS) gave a $2^{n+o(n)}$ time algorithm for the Shortest Vector Problem (SVP) based on discrete Gaussian sampling (DGS), together with an honest sampler producing $2^{n/2}$ samples above the smoothing parameter in $2^{n/2+o(n)}$ time and space. Gao, Feng, and Hu (GFH) subsequently introduced DGS on random prime-index superlattices, making this sa…

Starting from the cognitive operation of information collapse, this paper re-anchors the foundational position of mathematics—as the pure grammar of information-collapse operations. Based on a strict correspondence between the four arithmetic operations and the four basic collapse actions, it argues that subtraction is the more primordial first action than addition: extracting the first determina…

This paper extends the information collapse analytical framework established in The Meaning of Mathematics (Part I), clearly distinguishing between two cognitive directions—grasping outward and deconstructing inward—and conducts a complete structural argumentation analysis of Ramanujan's summation of divergent series. Grasping outward extends along the temporal direction, producing determinate ob…

Say you have a dot. That dot explodes into an infinite number of dots. Each of those dots explode into a new infinite number of dots. Each of those dots explode into a new infinite number of dots, ad infinitum. How many dots do you have in total?

This paper deals with the hardness of finding short vectors in module lattices. Let $K$ be a number field of degree $d$ and $\mathcal{O}_K$ its ring of integers. We show that if a module lattice $M$ of rank $n$ in $\mathcal{O}_K^n$ has some Galois-symmetries, namely if it is fixed coordinate-wise (as a set) by a group $G$ of automorphisms of $K$, then $M$ can actually be seen as a module of ra…

A paper out today in Nature might interest some folks in this forum: https://www.nature.com/articles/s41586-021-03229-4 Permanent citation: Nature volume 590 , pages67–73(2021) The authors used machine learning to generate a large number of continued fraction expressions... Read more

research.ioresearch.io

Sign up to keep scrolling

Create your feed subscriptions, save articles, keep scrolling.

Already have an account?