This paper proves that if a space, three dimensions or higher, has a certain amount of positive curvature everywhere, meaning it curves inward like a sphere, then its total volume cannot exceed that of a perfect sphere.
On the proof of Bray's conjecture · Xumin Jiang, Mingxiang Li, Zhehui Wang · arXiv:2608.20215
This paper fundamentally re-evaluates how we understand and bound random processes, especially when we stop observing them at unpredictable times. It precisely quantifies the "slack" or information discarded by many classical statistical bounds, providing new, tighter ways to estimate how much these processes can deviate.
Information on trajectories: martingales and random times · Akshay Balsubramani · arXiv:2608.20337
Imagine networks where connections spread out efficiently but not excessively, a property called "sublinear expansion." This paper disproves a recent conjecture that such networks always contain very long cycles, even ones that visit every node.
Small circumference in regular sublinear expanders · Yaobin Chen, Hong Liu, Xin Wei et al. · arXiv:2608.20190
A fundamental question in geometry: when can a special kind of curved space be shaped so it curves positively everywhere, like the surface of a ball? This geometric property is equivalent to several other mathematical conditions, providing powerful new tools to identify and understand such spaces.
A Variational Characterization of Positive Scalar Curvature Kähler metrics · Zehao Sha · arXiv:2608.20023
Powerful new mathematical tools to find reliable "rules" for how solutions behave in a particularly challenging type of equation that describes the fundamental shapes of complex, high-dimensional spaces.
Uniform estimates for complex Monge-Ampère equations: big cohomology classes · Quang-Tuan Dang, Lei Zhang, Bin Zhou · arXiv:2608.19600
This paper in graph theory investigates "critical" graphs, those that need a certain number of colors, but would need fewer if any single point were removed. The authors find a clear "dichotomy": depending on what simple patterns are forbidden within the graph, there are either only a finite number of such critical graphs, or infinitely many.
A dichotomy for the number of vertex-critical ($P_5$, $H$)-free graphs when $H$ is bipartite · Iain Beaton, Ben Cameron · arXiv:2608.20045
Tensor networks are a way to represent incredibly complex data or physical systems, crucial for quantum physics and AI. This paper uncovers the fundamental mathematical equations that precisely define certain types of these networks, showing they are essentially a kind of statistical model.
Equations of Tree Tensor Network Varieties · Serkan Hoşten, Niharika Chakrabarty Paul, Otto T. P. Schmidt et al. · arXiv:2608.19071
A new mathematical tool to precisely measure how repetitive or patterned an infinitely long sequence of symbols, like a repeating code or the digits of pi, truly is.
Spectrum of the refined Diophantine exponent · Quang-Khai Nguyen · arXiv:2608.20191
A new framework for understanding cause-and-effect in systems with feedback loops, like a thermostat controlling a room's temperature. It shows how different ways of forcing a specific outcome (e.g., making the room 20 degrees by opening a window versus adjusting the heater) can have distinct overall effects, a subtlety often missed by standard models.
Causal Reasoning with Bipartite Graphical Causal Models · Joris M. Mooij · arXiv:2608.19831