"Dr. Charles Misner, who passed away in 2023 at the age of 91, was a professor of physics at the University of Maryland from 1963 to 2000, and a renowned expert in General Relativity. He was the recipient of the Albert Einstein medal in 2015, and was the co-author of “Gravitation”, one of the best-selling books in the subject of General Relativity, featuring none other than Kip Thorne on the cover."
Crystal-Field--Driven Magnetoelectricity in the Triangular Quantum Magnet CeMgAl$_{11}$O$_{19}$
Sonu Kumar (Charles University, Faculty of Mathematics and Physics, Department of Condensed Matter Physics, Prague, Czech Republic, Adam Mickiewicz University, Faculty of Physics and Astronomy, Department of Experimental Physics of Condensed Phase, Pozna\'n, Poland), Ga\"el Bastien (Charles University, Faculty of Mathematics and Physics, Department of Condensed Matter Physics, Pragu…
The chanciness of time
John M. Myers, Hadi Madjid
https://arxiv.org/abs/2511.08611 https://arxiv.org/pdf/2511.08611 https://arxiv.org/html/2511.08611
arXiv:2511.08611v1 Announce Type: new
Abstract: Digital network failures stemming from instabilities in measurements of temporal order motivate attention to concurrent events. A century of attempts to resolve the instabilities have never eliminated them. Do concurrent events occur at indeterminate times, or are they better seen as events to which the very concept of temporal order cannot apply? Logical dependencies of messages propagating through digital networks can be represented by marked graphs on which tokens are moved in formal token games. However, available mathematical formulations of these token games invoke "markings"-- global snapshots of the locations of tokens on the graph. The formulation in terms of global snapshots is misleading, because distributed networks are never still: they exhibit concurrent events inexpressible by global snapshots. We reformulate token games used to represent digital networks so as to express concurrency. The trick is to replace global snapshots with "local snapshots." Detached from any central clock, a local snapshot records an action at a node during a play of a token game. Assemblages of local records define acyclic directed graphs that we call history graphs. We show how history graphs represent plays of token games with concurrent motions, and, importantly, how history graphs can represent the history of a network operating while undergoing unpredictable changes.
toXiv_bot_toot