Tootfinder

"OOP grew dramatically during the decade between 1985 and 95. The first OOPSLA Conf was held in '86, chaired by Daniel Ingalls of Smalltalk fame. Bjarne Stroustrup released the first versions of C . Brad Cox melted Smalltalk on top of C and created Objective-C. Bertrand Meyer released both Eiffel and his bestseller book. Borland added OOP support to Turbo Pascal 5.5. Famous groups like “The Three Amigos,” “The Gang of Four,” and the Agile movement coalesced around OOP."
…

The Hype Cycle Of OOP
Even though Marketing buzzwords might have an effect akin to Kryptonite against our readers, we're going to use the famous Gartner's Five-Step Hype Cycle to take a closer look at the practice of Object-Oriented Programming (OOP) and its various ups and downs in the past 50 years. Remembering that one of the core tenets of this magazine is to make the impossible dialogue possible, the framework provided by Gartner fits this task perfectly well.

Higher dimensional geometry of $p$-jets
Lance Edward Miller, Jackson S. Morrow
https://arxiv.org/abs/2510.00336 https://arxiv.org/pdf/2510.00336

Higher dimensional geometry of $p$-jets
In this work, we prove a quantitative version of the prime-to-$p$ Manin--Mumford conjecture for varieties with ample cotangent bundle. More precisely, let $A$ be an abelian variety defined over a number field $F$, and let $X$ be a smooth projective subvariety of $A$ with ample cotangent bundle. We prove that for every prime $p\gg 0$, the intersection of $X(F^{\text{alg}})$ and the geometric prime-to-$p$ torsion of $A$ is finite and explicitly bounded by a summation involving cycle classes in …

Colour-biased Hamilton cycles in dense graphs and random graphs
Natalie Behague, Debsoumya Chakraborti, Jared Le\'on
https://arxiv.org/abs/2509.18012 https://

Colour-biased Hamilton cycles in dense graphs and random graphs
A classical result of Dirac says that every $n$-vertex graph with minimum degree at least $\frac{n}{2}$ contains a Hamilton cycle. A `discrepancy' version of Dirac's theorem was shown by Balogh--Csaba--Jing--Pluhár, Freschi--Hyde--Lada--Treglown, and Gishboliner--Krivelevich--Michaeli as follows. Every $r$-colouring of the edge set of every $n$-vertex graph with minimum degree at least $(\frac{1}{2} + \frac{1}{2r} + o(1))n$ contains a Hamilton cycle where one of the colours appears at least $(…

Multivariate Quadratic Hawkes Processes -- Part II: Non-Parametric Empirical Calibration
Cecilia Aubrun, Michael Benzaquen, Jean-Philippe Bouchaud
https://arxiv.org/abs/2509.21244

Multivariate Quadratic Hawkes Processes -- Part II: Non-Parametric Empirical Calibration
This is the second part of our work on Multivariate Quadratic Hawkes (MQHawkes) Processes, devoted to the calibration of the model defined and studied analytically in Aubrun, C., Benzaquen, M., & Bouchaud, J. P., Quantitative Finance, 23(5), 741-758 (2023). We propose a non-parametric calibration method based on the general method of moments applied to a coarse-grained version of the MQHawkes model. This allows us to bypass challenges inherent to tick by tick data. Our main methodological innov…

p-multigrid method for the discontinuous Galerkin discretization of elliptic problems
Nuo Lei, Donghang Zhang, Weiying Zheng
https://arxiv.org/abs/2509.13669 https://

p-multigrid method for the discontinuous Galerkin discretization of elliptic problems
In this paper, we propose a $W$-cycle $p$-multigrid method for solving the $p$-version symmetric interior penalty discontinuous Galerkin (SIPDG) discretization of elliptic problems. This SIPDG discretization employs hierarchical Legendre polynomial basis functions. Inspired by the uniform convergence theory of the $W$-cycle $hp$-multigrid method in [P. F. Antonietti, et al., SIAM J. Numer. Anal., 53 (2015)], we provide a rigorous convergence analysis for the proposed $p$-multigrid method, consi…

Minimal volume entropy of mapping tori over 3-manifolds
Giuseppe Bargagnati, Alberto Casali, Francesco Milizia, Marco Moraschini
https://arxiv.org/abs/2509.17851 https://…

Minimal volume entropy of mapping tori over 3-manifolds
We prove that the minimal volume entropy of mapping tori over oriented closed smooth $3$-manifolds vanishes. Our approach uses a variation of the amenable category and a suitable version of the minimal volume entropy of a homology class introduced by Babenko and Sabourau.

Oriented trees in digraphs with large girth
Junying Lu, Yaojun Chen
https://arxiv.org/abs/2509.17756 https://arxiv.org/pdf/2509.17756

Oriented trees in digraphs with large girth
The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum degree does not exceed the minimum degree of $G$. Let $δ^0(D)$ be the minimum semidegree of a digraph $D$ and $Δ(D)$ be the maximum degree of $D$. In this paper, we establish a digraph version of Jiang's result, stating that every oriented graph $D$ of girth at …

🇺🇦 #NowPlaying on BBCRadio3's #Breakfast
Modest Mussorgsky, Sir Antonio Pappano & Orchestra of the Academy of Santa Cecilia, Rome:
🎵 Night on Bald Mountain (1867 Version) [Live]
#ModestMussorgsky #SirAntonioPappano
https://open.spotify.com/track/4pKuaAKSfQAI6ceHx9IKuu