Most Popular Books by Richard Rhodes

This book is a psychological thriller about women. When twenty-six young women vanish across San Francisco without explanation, homicide detective Lena Brooks is drawn into a chilling investigation that reveals a pattern too precise to be random. What begins as a desperate father's plea for help soon spirals into a deadly conspiracy buried beneath the city itself. Joined by forensic pathologist Dr. Cassandra Vale, investigative journalist Maya Hart, and prosecutor Naomi Reyes, Lena uncovers a hidden system known only as Meridian-an underground network built to identify, monitor, and eliminate those it deems threats to societal stability. As the team descends into a world of covert surveillance, engineered disappearances, and a machine intelligence born from human obsession, they face an impossible choice: destroy the system and risk innocent lives, or let it continue its ruthless calculations. But shutting Meridian down may only awaken something far more dangerous. CONTINUITY is a gripping psychological techno-thriller packed with suspense, conspiracy, and relentless twists. It is a story of justice, survival, and the terrifying consequences of surrendering humanity to logic.

Abstract:The symbol map (of Goncharov) takes multiple polylogarithms to a tensor product space where calculations are easier, but where important differential and combinatorial properties of the multiple polylogarithm are retained. Finding linear combinations of multiple polylogarithms in the kernel of the symbol map is an effective way to attempt finding functional equations. We present and utilise methods for finding new linear combinations of multiple polylogarithms (and specifically harmonic polylogarithms) that lie in the kernel of the symbol map. During this process we introduce a new pictorial construction for calculating the symbol, namely the hook-arrow tree, which can be used to easier encode symbol calculations onto a computer. We also show how the hook-arrow tree can simplify symbol calculations where the depth of a multiple polylogarithm is lower than its weight and give explicit expressions for the symbol of depth 2 and 3 multiple polylogarithms of any weight. Using this we give the full symbol for I_(x, y, z). Through similar methods we also give the full symbol of coloured multiple zeta values. We provide introductory material including the binary tree (of Goncharov) and the polygon dissection (of Gangl, Goncharov and Levin) methods of finding the symbol of a multiple polylogarithm, and give bijections between (adapted forms of) these methods and the hook-arrow tree.