Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 12 May

Differential Geometry

Curvature-free effects from volume growth and ends-counting and their applications

In this paper, we investigate two curvature-free effects from volume growth and ends-counting, respectively. Motivated by generalizing classical results from Ricci curvature to other common curvatures, we establish two main theorems. First, any complete non-compact manifold with lower sublinear volume growth admits a smooth bounded mean-concave exhaustion. Second, any complete manifold with infinitely many ends contains escaping geodesic lines outside every compact subset. As applications, we provide new proofs of the Calabi–Yau minimal volume growth theorem and the Cai–Li–Tam finite-ends theorem for nonnegative Ricci curvature, without relying on the Bishop–Gromov volume comparison theorem or analytic tools specific to Ricci curvature. We further extend these results to Riemannian manifolds with nonnegative scalar curvature and Kähler manifolds with positive holomorphic sectional curvature.
Read the full abstract

Dynamical Systems · Cross-listed from cond-mat.soft

Variational approach to droplet motion on uneven solid surfaces, including contact line dynamics and evaporation

We show how dynamical equations for liquid films and drops on uneven surfaces, including contact line dynamics and evaporation/condensation effects, may be formulated as a variational dynamics, generated via Onsager's variational principle. The theory applies in the isothermal overdamped-dynamics limit. We apply this general approach to obtain several well-known results on contact line dynamics and to study drops pinning and sliding on inclined corrugated surfaces. This approach constructs the dynamical equations starting from the free energy of the system and therefore has the advantage that it naturally incorporates the correct equilibrium properties.
Read the full abstract

All authors Gyula I Tóth, David N Sibley, Agnes J Bokányi-Tóth, Dmitri Tseluiko, Andrew J Archer

Differential Geometry · Cross-listed from gr-qc

On the Geometry of Cotton Gravity

We analyze the geometry of the field equations of Cotton gravity (for a quite general energy-momentum tensor) on a static space-time. In particular, we describe the local structure of the spatial Riemannian factor. This structure, that we call Cotton-$\varphi$-perfect fluid (C-$\varphi$-PF, for short) is a generalization to the regime of Cotton Gravity of the recently introduced notion of $\varphi$-static perfect fluid space-time ($\varphi$-SPFST). After discussing the variational origin of this system, we provide sufficient conditions for a C-$\varphi$-PF to reduce to a $\varphi$-SPFST. We also study the geometry of the level sets of the lapse function $f$ and we provide a rigidity result for C-$\varphi$-PFs under some curvature conditions. The role that Codazzi tensors hold in this theory is highlighted.
Read the full abstract

Combinatorics

A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96

This article is the $5^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 4. Here, we study Type-2 isomorphic circulant graphs of $C_{48}(r_1,r_2,r_3)$, $C_{81}(r_1,r_2,r_3)$ and $C_{96}(r_1,r_2,r_3,r_4)$. We find that for $n$ = 48,96, total number of pairs of isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2 of the forms $C_{n}(r_1,r_2,r_3)$ and $C_{n}(s_1,s_2,s_3)$ are 18 and 72, respectively, and total number of triples of isomorphic circulant graphs of Type-2 w.r.t. $m$ = 3 of the form $C_{81}(x_1,x_2,x_3)$, $C_{81}(y_1,y_2,y_3)$ and $C_{81}(z_1,z_2,z_3)$ are 27.
Read the full abstract

Analysis of PDEs

Novel implementation of the extended sampling method for inverse biharmonic scattering

This paper considers an inverse shape problem for recovering an unknown clamped obstacle in two dimensions from far–field measurements generated by a single incident wave or just a few incident waves for the biharmonic (flexural) wave equation. Here we will develop a new extended sampling method (ESM) that is derived using the analysis of the well–known factorization method. We will also consider an ESM using both sound–soft and sound–hard sampling disks to identify sampling points where the reference disk intersects the unknown cavity. The use of a sound–hard sampling disk has not been studied in the literature whereas the sound–soft sampling disk has been used in most recent works. Traditionally the ESM seeks to find the location of the scatterer from limited incident directional data. Here, our method acts more like the factorization method to obtain the location as well as the size (and possibly the shape) of the obstacle. We present numerical experiments with synthetic data that demonstrate how effective this new implementation is with respect to noisy data and illustrate the influence of the reference disk radius on the reconstruction.
Read the full abstract

Group Theory

Asymmetry of $\ell^{2}$-cohomology via skewed Følner geometry

We study the two $\ell^{2}$-Dirichlet structures on a countable group $G$ arising from the left and right regular actions on $\mathbb{R}^{G}$. Although the two regular representations are unitarily equivalent, their $\ell^{2}$-Dirichlet subspaces of $\mathbb{R}^{G}$ need not coincide. Our main result gives a complete classification of this asymmetry for countable amenable groups: $$\mathcal{D}_{2}\left(G,\lambda\right)=\mathcal{D}_{2}\left(G,\rho\right)\quad\Longleftrightarrow\quad G \text{ is an FC-group}.$$ The proof is based on a skewed Følner-geometric mechanism, called a left scheme, combining summability of left boundaries with displacement under a right translation. We develop this mechanism generally, and demonstrate it concretely in the Heisenberg group and amenable wreath products over $\mathbb{Z}$. We also show that this mechanism has a dynamical counterpart in the theory of nonsingular Bernoulli shifts: every countable amenable group that is not an FC-group admits Bernoulli schemes whose left shift is nonsingular, conservative and weakly mixing, whereas the right shift by some element is singular.
Read the full abstract

Differential Geometry

A Comparison Theorem For the Mass of ALE and ALF Toric 4-Manifolds

We establish sharp lower bounds for the mass of asymptotically locally Euclidean (ALE) and asymptotically locally flat (ALF) toric 4-manifolds, in terms of equilibrium geometries consisting of gravitational instantons. More precisely, the mass of a complete ALE or ALF toric 4-manifold with nonnegative scalar curvature is bounded below by a sum comprised of the following quantities: the mass of the corresponding toric gravitational instanton having the same orbit space (rod) structure as the original ALE/ALF manifold, and an expression determined by the conical angle defects of totally geodesic 2-spheres within the instanton that serve as generators for its second homology. The inequality may be generalized to the situation in which the ALE/ALF manifold also possesses conical singularities as well as orbifold singularities, and it suggests a refined notion of `total mass' in which the result simply states that the total mass of the ALE/ALF manifold is not less than that of the corresponding gravitational instanton. Furthermore, we prove rigidity for these statements, namely the inequality is saturated only when the ALE/ALF manifold is Ricci flat and in fact agrees with the corresponding instanton. These results may be viewed in the context of positive mass theorems, providing an explanation of how positivity can fail in the ALE/ALF setting. Moreover, the main theorem may be interpreted as yielding a variational characterization of the relevant toric gravitational instantons.
Read the full abstract

Logic

Proof Theory for Bimodal Provability Logics

We provide the first (non-labelled) sequent calculi for bimodal provability logics with "usual" provability predicates. In particular, we introduce calculi for the logics CS, CSM and ER. Additionally, we present non-wellfounded versions of our calculi, and use them to establish a cut-elimination procedure. Finally, we prove the first interpolation results for these logics showing that they all enjoy the uniform Lyndon interpolation property.
Read the full abstract

Mathematical Physics · Cross-listed from physics.optics

General and concise operator approach to the dyadic Green's function of layered media

Dyadic Green's function is an important tool of computational photonics, giving deeper insights into light-matter interaction. We present an operator approach to the derivation of the dyadic Green's function of a generic anisotropic planarly-layered medium for both electric and magnetic fields. The resulting Green's function is expressed through the evolution operators (a kind of transfer matrices) of the comprising layers and the surface impedance tensors, the singular term being naturally separated from other terms. The operator approach to the Green's function simplifies both the conceptual understanding of the problem and the subsequent practical applications, some of which are demonstrated here. The proposed approach can be easily generalized to the case of spherical and cylindrical layers, as well as bi-anisotropic layered media. The obtained results can be applied in nanophotonics engineering problems.
Read the full abstract

All authors Aliaksandr Arlouski, Lei Gao, Dongliang Gao, Andrey Novitsky

Rings and Algebras

Groups of permutations that are even on maximal proper subsets, and related monoids

Let $n$ be a positive integer and let $[n]=\{1,2,\ldots,n\}$. Let $\Gamma_n$ denote the group of permutations on $[n]$ whose restrictions to maximal proper subsets of $[n]$ are even, let $\Sigma_n$ denote the monoid of transformations on $[n]$ whose injective restrictions to maximal proper subsets of $[n]$ are even and let $\Delta_n$ denote the submonoid of $\Sigma_n$ generated by transformations of rank at least $n-1$. In this paper, we present descriptions of $\Gamma_n$, $\Delta_n$ and $\Sigma_n$, determine their cardinalities and ranks, and provide minimal generating sets for each of them.
Read the full abstract

Logic

Trace definability III: Infinite dimensional space over a model of $T$

We show that for a number of theories $T^*$ of model-theoretic interest there is a simpler theory $T$ and $\kappa \ge \aleph_0$ such that $T^*$ is trace equivalent to the theory of $\kappa$-dimensional space over a model of $T$.

Combinatorics

The polytope of all matroids in ranks 2 and 3

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity conjectures for valuative invariants. We supplement our theoretical construction by an implementation, which allows for the computation of $\Omega_{2,n}$ for $n\leq 33$ and $\Omega_{3,n}$ for $n\leq 10$. Further, we compute Schubert expansions for all isomorphism classes of matroids of rank $2$ up to $n = 80$, and for rank $3$ up to $n = 11$.
Read the full abstract

Logic

Trace definability II: model-theoretic linearity

We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite group but the Shelah completion of $\mathscr{M}$ interprets an infinite field. We introduce a weak notion of interpretability called local trace definability between first order structures and an associated weak notion of equivalence. We give a dichotomy between “linearity" and “field structure" for dp-minimal expansions of archimedean ordered abelian groups. We also prove several other results about trace definability and local trace definability between various classes of structures.
Read the full abstract

Combinatorics

Tower heights for color-avoiding Ramsey numbers of monotone paths

Ramsey numbers of monotone paths in ordered hypergraphs form a natural higher-uniformity extension of the classical Erdős–Szekeres theorems, and their tower height was determined by Moshkovitz and Shapira. A color-avoiding variant, initiated by Loh and further developed by Gowers and Long and by Mulrenin, Pohoata, and Zakharov, asks for monotone paths whose edges use only a bounded number of colors rather than a single color. For integers $q>p$, let $A_k(n;q,p)$ be the least integer $N$ such that every $q$-coloring of the ordered complete $k$-uniform hypergraph on $\{1,\ldots,N\}$ contains a monotone path of length $n$ whose edges use at most $p$ colors. We prove that, for every fixed $p$ and all sufficiently large $q$, the exact tower height of $A_k(n;q,p)$ is $\lceil (k-1)/p\rceil$. Thus the number of colors allowed on the path affects the Ramsey number at the level of tower height: allowing $p$ colors lowers the height from $k-1$ in the monochromatic problem to $\lceil (k-1)/p\rceil$. This answers questions of Mulrenin, Pohoata, and Zakharov. The upper bound follows from a simple block-compression argument. The main contribution is the matching lower bound, for which we develop a novel variant of the stepping-up method. A surprising feature of the proof is the appearance of the Morse–Hedlund theorem, a foundational result in symbolic dynamics and combinatorics on words. We establish and use a finite version of this theorem, which may be of independent interest.
Read the full abstract

Mathematical Physics

Quasi-Sierpinski Structure for Uniform Load Distribution

Land reclamation methods, indispensable for the proper development of modern coastal cities, are ecologically destructive. We present a fractal structure, similar to a Sierpinski triangle, which solves this problem by resting directly on the seabed thanks to the uniform load distribution we achieve on its base. To obtain this uniform distribution, we show that the supports of the structure must displace vertically following any function of the Takagi class. This causes the vertical deformations of the structure to follow this same class and the horizontal deformations to be related to the Cantor function. The structure works with an unlimited number of combinations of areas of its elements and materials, which gives designers a high degree of constructive flexibility.
Read the full abstract

Differential Geometry

Generalized pseudo-product structures and finite type distributions via abnormal extremals

We generalize the classical Tanaka result on the finiteness of the Lie algebra of infinitesimal symmetries for non-degenerate pseudo-product structures to the case when the completely integrable distributions defining the pseudo-product structure are no longer concentrated in the degree $-1$. In order to do this, we modify the notion of universal prolongation of graded nilpotent Lie algebras and generalize the original finiteness criterion of Tanaka. Using this result, we demonstrate that in real analytic category, distributions that are controllable by regular abnormal extremal trajectories, also known as singularly transitive, have finite-dimensional symmetries. This result settles Problem V in the affirmative from the 2013 list of open problems by Andrei Agrachev. Additionally, we discuss applications to symmetries and natural equivalence problems for systems of ODEs of mixed order.
Read the full abstract

Algebraic Geometry

A sharp degree bound in the real Jacobian conjecture

Let $F=(p,q):\mathbb R^2\to \mathbb R^2$ be a polynomial map with nowhere zero Jacobian determinant. A long-standing problem is to determine the largest integer $k$ such that the condition $\deg p\le k$ guarantees the global injectivity of $F$. Although several partial results have been obtained over the past $30$ years, the sharp degree bound has remained unknown. In this paper, we prove that $F$ is injective whenever $\deg p=6$. On the other hand, we construct a non-injective polynomial map with nowhere vanishing Jacobian determinant for which $\deg p=7$. Combined with the previously known injectivity results for $\deg p\le 5$, our results completely settle the problem and establish the optimal degree bound. More precisely, we show that $7$ is the minimal degree for which non-injective examples can occur.
Read the full abstract

All authors F. Braun, J. Gwoździewicz, F. Fernandes, B. Oréfice-Okamoto

Statistics Theory · Cross-listed from cs.LG

Approximation of Maximally Monotone Operators : A Graph Convergence Perspective

Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued, and lie outside classical approximation frameworks. We propose a paradigm shift by formulating approximation via graph convergence (Painlevé-Kuratowski convergence), which is well-suited for closed operators. We show that uniform and $L^p$ approximation are fundamentally inadequate in this setting. Focusing on maximally monotone operators, we prove that any such operator can be approximated in the sense of local graph convergence by continuous encoder-decoder architectures, and further construct structure-preserving approximations that retain maximal monotonicity via resolvent-based parameterizations.
Read the full abstract

Group Theory

Quasiisometric embeddings between right-angled Artin groups: rigidity

We prove a range of rigidity results for quasiisometric embeddings between right-angled Artin groups. Among other things, we: (1) classify all self–quasiisometric-embeddings of RAAGs defined on cycles; (2) show that no $n$–dimensional RAAG is a universal receiver for quasiisometric embeddings of $n$–dimensional RAAGs. (3) prove that if the direct product $F_2^n\times A_{C_5}^m$ can be quasiisometrically embedded in a RAAG $A_\Gamma$ of the same dimension, then the defining graph of $F_2^n\times A_{C_5}^m$ must appear as an induced subgraph of $\Gamma$; We also establish a strong rigidity theorem for quasiisometrically embedded images of 2–flats in RAAGs defined by triangle-free graphs that are not stars, generalising a theorem of Bestvina–Kleiner–Sageev.
Read the full abstract

Statistics Theory

Efficiency of pattern-based independence test

Tests of independence are an important tool in applications, specifically in connection with the detection of a relationship between variables; they also have initiated many developments in statistical theory. In the present paper we build upon and extend a recently established link to Discrete Mathematics and Theoretical Computer Science, exemplified by the appearance of copulas in connection with limits of permutation sequences, and by the connection between quasi-randomness and consistency of pattern-based tests of independence. The latter include classical procedures, such as Kendall's tau, which uses patterns of length two. Longer patterns lead to tests that are consistent against large classes of alternatives, as first shown by Hoeffding (1948) with patterns of length five, and by Yanagimoto (1970) and Bergsma and Dassios (2014) for patterns of length four. More recently Chan et al.\ (2020) characterized quasi-randomness for sets of patterns of length four, which leads to several new consistent pattern-based test for independence. We give a detailed and complete description of the respective limiting null distributions. In connection with the power performance of the tests, which is of interest for practical purposes, we provide results on their (local) asymptotic relative efficiencies. We also include a small simulation study that supports our theoretical findings.
Read the full abstract

Combinatorics

Symmetric Tensor Decompositions over Finite Fields

We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing symmetric tensor decompositions to be reformulated as spanning problems by rank-one symmetric linearized polynomials. We translate these spanning conditions into explicit linear systems over finite fields and use the Frobenius automorphism to obtain computationally effective criteria. As applications, we recover known values of the symmetric bilinear complexity for small extension degrees and obtain explicit symmetric decompositions for several parameters. We also introduce the symmetric tensor-rank of a symmetric rank-metric code and show that, for the natural one-dimensional Gabidulin code associated with finite field multiplication, this invariant coincides with the symmetric tensor rank of the multiplication map.
Read the full abstract

Combinatorics

Feedback vertex sets of planar digraphs with fixed digirth

Let $fvs(G)$ denote the size of a minimum feedback vertex set of a digraph $G$. We study $fvs_g(n)$, which is the maximum $fvs(G)$ over all $n$-vertex planar digraphs $G$ of digirth $g$. We prove a planar-digraph analogue of the celebrated Lucchesi-Younger theorem showing that the minimum feedback vertex set is at most the maximum packing of a special type of directed cycles. As a corollary, we derive that $fvs_g(n)\le \frac{n-2}{g-2}$ for all $g\geq 3$. This improves all previously known upper bounds for $g \ge 4$, and for $g \ge 6$ it supersedes the best known upper bound of $\frac{2n-6}{g}$ (Esperet, Lemoine and Maffray, 2017) by a factor of 2. On the other hand, we develop a new framework to construct planar digraphs of fixed digirth and large $fvs$. Using it, for $g = 6$ and every $g \ge 8$, we construct an infinite family of planar digraphs of digirth $g$ and $fvs(G) = \frac{g+2}{g^2} n + O(1)$. For $g= 7$, our construction gives $fvs(G) = \frac{2}{11} n + O(1)$ and for $g = 4$ and $5$, $fvs(G) = \frac{n}{g-1}$. These improve the best known lower bound of $\frac{n-1}{g-1}$ (Knauer, Valicov and Wenger, 2017) for all $g \ge 4$. We thus obtain the two-sided bound $\frac{g+2}{g^2} \le \sup_{n \ge 1} \frac{fvs_g(n)}{n} \le \frac{1}{g-2}$ for all values $g = 6$ and every $g \ge 8$. The gap between the lower and the upper bound for $\sup_{n \ge 1} \frac{fvs_g(n)}{n}$ decreases from $\frac{g-2}{g(g-1)}$ to $\frac{4}{g^2(g-2)}$.
Read the full abstract

Differential Geometry

Tangential limits of stable minimal capillary surfaces

We characterize all compact embedded stable minimal capillary surfaces with capillary angle close to either $0$ or $\pi$ that are supported on a complete embedded minimal surface with finite total curvature that is not an affine plane. Moreover, we characterize all compact embedded weakly stable minimal capillary surfaces with capillary angle close to either $0$ or $\pi$ that are supported on a closed surface whose mean curvature is positive and has no degenerate maxima. An important ingredient in our work are curvature estimates for sequences of weakly stable minimal capillary surfaces with capillary angles tending to $0$ or $\pi$ that enable us to analyze the tangential limits of such sequences at suitable scales.
Read the full abstract

Probability

Itô integral for a two-sided Lévy process

In this article, we construct an Itô integral with respect to a two-sided finite-variance Lévy process $\{L(x)\}_{x\in \mathbb{R}}$, without a Gaussian component. Using Rosenthal inequality for discrete-time martingales, we give an estimate for the $p$-th moment of this integral, for any even integer $p\geq 2$. Then, using Poisson-Malliavin calculus, we show that the Itô integral is an extension of the Hitsuda-Skorohod integral with respect to the compensated Poisson random measure associated to the Lévy process.
Read the full abstract

Number Theory

Squared edge lengths of regular simplices with rational vertices

We determine exactly which positive rational numbers occur as squared edge lengths of regular $d$-simplices with vertices in $\mathbb{Q}^n$. The answer exhibits a sharp stabilization phenomenon: once $n-d\geq 3$, every positive rational number occurs, while codimensions $0$, $1$, and $2$ are governed by explicit square-class, norm-group, and Hilbert-symbol conditions. The proof reduces simplex realizability to the Hasse–Minkowski classification of rational quadratic forms.
Read the full abstract

Combinatorics

Two Results on Outer-String Graphs

An outer-string representation of a graph $G$ is an intersection representation of $G$ where vertices are represented by curves (strings) inside the unit disk and each curve has exactly one endpoint on the boundary of the unit disk (the anchor of the curve). Additionally, if each two curves are allowed to cross at most once, we call this an \emph{outer-$1$-string representation} of $G$. If we impose a cyclic ordering on the vertices of $G$ and require the cyclic order of the anchors to respect this cyclic order, such a representation is called a constrained outer-string representation. In this paper, we present two results about graphs admitting outer-string representations. Firstly, we show that for a bipartite graph $G$ (and, more generally, for any $\{C_3,C_5\}$-free graph $G$) with a given cyclic order of vertices, we can decide in polynomial time whether $G$ admits a constrained outer-string representation. Our algorithm follows from a characterization by a single forbidden configuration, similar to that of Biedl et al. [GD 2024] for chordal graphs. Secondly, we answer an open question from the same authors and show that determining whether a given graph admits an outer-1-string representation is NP-hard. More generally, we show that it is NP-hard to determine if a given graph $G$ admits an outer-$k$-string representation for any fixed $k\ge1$.
Read the full abstract

All authors Todor Antić, Vít Jelínek, Jan Kratochvíl, Peter Stumpf

Rings and Algebras · Cross-listed from eess.SY

Estimation Problems and the Modulating Function Method: The Algebra of Modulating Functions

The modulating function method is an algebraic estimation framework that has been used for state and parameter estimation, as well as fault detection, of linear and some nonlinear systems. At the core of the method is the modulating function: a function that evaluates to 0 at the left or right boundaries up to a certain order of derivatives, being classified as left, right, or total modulating functions. Despite being an algebraic framework, there is no paper that analyzes the algebraic properties of the three types of modulating functions and the consequences of these properties. In light of this gap, this paper discusses the algebraic properties of modulating functions and, after formalizing their closedness and group properties, simple algorithms to construct new modulating functions are proposed, discussed, and illustrated. Moreover, the fact that total modulating functions form an algebra and a vector space is exploited to construct orthonormal modulating functions, which are then used to significantly improve the well-known matrix conditioning issue of the modulating function method, illustrated with the parameter estimation of a boat's nonlinear roll dynamics.
Read the full abstract

Category Theory · Cross-listed from cs.PL

Harness Engineering as Categorical Architecture

The agent harness, the system layer comprising prompts, tools, memory, and orchestration logic that surrounds the model, has emerged as the central engineering abstraction for LLMbased agents. Yet harness design remains ad hoc, with no formal theory governing composition, preservation of properties under compilation, or systematic comparison across frameworks. We show that the categorical Architecture triple (G, Know, Phi) from the ArchAgents framework provides exactly this formalization. The four pillars of agent externalization (Memory, Skills, Protocols, Harness Engineering) map onto the triple's components: Memory as coalgebraic state, Skills as operad-composed objects, Protocols as syntactic wiring G, and the full Harness as the Architecture itself. Structural guarantees-integrity gates, quality-based escalation, supported convergence checks-are Know-level certificates whose preservation is structural replay: our compiler checks identity and verifier replay, not output-layer correctness or model behavior. We validate this correspondence with a reference implementation featuring compiler functors targeting Swarms, DeerFlow, Ralph, Scion, and LangGraph: the four configuration compilers preserve three named certificate types by identity or replay, and LangGraph preserves the same certificates through its shared per-stage execution path. The LangGraph compiler creates one node per stage using the same per-stage method as the native runtime, providing LangGraph-native observability without reimplementing harness logic. An end-to-end escalation experiment with real LLM agents confirms that the quality-based escalation control path is model-parametric in this two-model, one-task experiment. The result positions categorical architecture as the formal theory behind harness engineering.
Read the full abstract

Dynamical Systems

Topological Entropy for Power-Law Unimodal Maps

In this paper we prove that the monotonicity of kneading sequences and topological entropy, a fundamental structural property of the quadratic family, extends to the class of power-law unimodal maps $f_a(x)=a-|x|^r$ for arbitrary critical exponent $r>1$. This generalization is nontrivial: the absence of polynomial structure and the presence of non-integer criticality preclude the direct use of classical arguments. Our approach adapts and extends the Milnor-Thurston framework by introducing a Thurston-type operator associated with the critical orbit and establishing a determinant identity that relates its linearization to the parameter derivative of the orbit. The main difficulty proving positivity of this determinant in the absence of algebraic structure - is resolved via a contraction argument on an associated Torelli space endowed with the Teichmüller metric, extending Thurston's pullback construction beyond the polynomial setting, that is to critical powers $r=2^\nu/k$, $\nu\geq 1$, $k$ odd, and finally use continuity in $r$. As a consequence, we show that the kneading sequence varies monotonically with the parameter, and hence that the topological entropy is an increasing function of $a$. Our results show that the combinatorial organization of parameter space familiar from the quadratic family persists for unimodal maps with arbitrary power-law criticality, indicating that monotonicity of entropy is a robust phenomenon beyond polynomial dynamics.
Read the full abstract

Combinatorics

On set-like sunflower-free families of subspaces over finite fields

The Erdős–Rado sunflower problem admits two natural analogues in finite vector spaces, corresponding to two different ways of generalising the set-theoretic notion of a sunflower. The first, used by Ihringer and Kupavskii [FFA 110 (2026) 102746], requires the petals to be in general position over the kernel; the second, used in the subspace codes literature (cf.\ Etzion–Raviv [DAM 186 (2015) 87-97], Blokhuis–De Boeck–D'haeseleer [DCC 90 (2022) 2101-2111]), requires only that the kernel equals the pairwise intersection of distinct petals. We refer to the second version as a set-like sunflower, following Blokhuis, De Boeck and D'haeseleer. In this note, we focus on the set-like setting. {We first observe by illustrations that general-position sunflower-freeness does not imply set-like sunflower-freeness.} We then present a construction of set-like $s$-sunflower-free families of $k$-spaces \revised{in $\mathbb{F}_q^n$ for $\lceil(n+1)/2\rceil \leq k \leq n-1$, of size $q^{n-k}$ (and $q^{n-k}+1$ for even $q$),} based on a manipulated version of the lifting construction; to our knowledge, this is the first systematic construction tailored to this setting. Finally, we compare the size of the construction with the exact optimum for small parameters, computed by exhaustive search.
Read the full abstract