Step 7 – Hybrid Character DFT Linkv1.4 Validation Report

English Summary | Number-Theoretic Holography Toy Model Executive Summary This report evaluates a hybrid link combining Dirichlet characters with a discrete Fourier transform (DFT) applied to a prime-ledger signal. The originally observed -28σ to -42σ “arithmetic signal” does not survive as evidence of a non-trivial number-theoretic signature. After improved null models were introduced, the signal was decomposed into… Read More »

Number-Theoretic Holography Toy-Model SeriesResearch Project Summaries (Steps 3 to 6)

Four Main Findings Exact Equivalence of Quadratic Twists: Quadratic-twist pairs of CM elliptic curveswith the same CM type are majorization-equivalent, meaning their descending sortedspectra are identical to numerical precision. Furthermore, the majorization frameworkcleanly separates these from cubic twists. Incomparability of Distinct CM Types: All 24 pairs of CM curves with distinct CMtypes (such as Z[i], Z[ω], and D=-7)… Read More »

Number-Theoretic Holography Toy-Model SeriesResearch Project Summaries (Steps 3, 4, & 5)

Four Main Findings Exact Equivalence of Quadratic Twists: Quadratic-twist pairs of CM elliptic curveswith the same CM type are majorization-equivalent, meaning their descending sortedspectra are identical to numerical precision. Furthermore, the majorization frameworkcleanly separates these from cubic twists. Incomparability of Distinct CM Types: All 24 pairs of CM curves with distinct CMtypes (such as Z[i], Z[ω], and D=-7)… Read More »

Summary of Step 4 Report: Majorization and Finite Channel Reachability

This report details Step 4 of the Number-Theoretic Holography Toy-Model Series. It builds upon the statistical findings of Step 3 by investigating whether probability spectra derived from elliptic curves and Dirichlet L-values are related structurally via finite channels, specifically through doubly stochastic transformations (majorization). Four Main Findings Exact Equivalence of Quadratic Twists: Quadratic-twist pairs of CM elliptic curveswith… Read More »

What is IUT Theory?

Inter-universal Teichmüller Theory (IUT) is a mathematical theory developed by Professor Shinichi Mochizuki of Kyoto University, made public around 2012. The Goal The main objective is to prove the ABC conjecture, a long-standing open problem in number theory. Roughly speaking, the ABC conjecture says that there’s a deep constraint between two seemingly unrelated operations: addition (a + b = c) and multiplication (prime factorization). What… Read More »

ABC Conjecture – outline

In short, the ABC Conjecture states that “in a simple addition equation ($a + b = c$), it is extremely rare for the numbers involved to be made by multiplying the same small prime numbers over and over again.” Proposed in 1985, it has long been considered one of the ultimate master-puzzles in modern mathematics, exploring the profound relationship between addition… Read More »

IUT Theory: A Fatal Difference of View Regarding “Corollary 3.12”

The clash over “Corollary 3.12” is not a simple disagreement over a calculation error. Instead, it is a profound conflict between two fundamentally different mathematical visions regarding what the true identity of a “number” actually is. Here is a deeper look into the core of this dispute. 1. The Critics’ Stance (Prof. Scholze et al.): “A Logical Collapse”… Read More »

Euclidean Algorithm

simple algorithm The Euclidean algorithm is a classical method for computing the greatest common divisor (GCD) of two non‑negative integers.The key idea is based on the following property: For any integers a and b (with a ≥ b), the GCD of a and b is the same as the GCD of b and a mod b. Because the remainder becomes strictly smaller each step, the process terminates after only a few iterations, even… Read More »

Depth‑First Search (DFS) Classic AI Algorithms

Simple Python Example The code below shows a recursive DFS on an undirected graph represented as an adjacency list.Vertices are numbered starting from 0. Expected output Iterative (stack‑based) version If you prefer an explicit stack (e.g., to avoid Python’s recursion limit), here’s a compact iterative version: Both implementations produce the same visitation order; choose the style that best… Read More »