Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 20 April

Algebraic Geometry

A Riemann-Hilbert correspondence for cohomology theories of closed 1-forms

Motivated by the work of Kontsevich-Soibelman on the comparison of isomorphisms conjecture for closed algebraic $1$-forms, we establish a Riemann-Hilbert correspondence of Deligne-Malgrange type. As an application, we prove a variant of the comparison of isomorphisms theorem for a simple class of algebraic $1$-forms on complex curves.
Read the full abstract

Statistics Theory

Quantitative Stability of the Shadow for Wasserstein Projections and Sample Complexity

In this paper, we study the stability of the shadow, a projection of a measure onto the set of couplings with respect to the Wasserstein distance. The shadow was introduced by \citet{Eckstein_Nutz_2022} to analyze the stability of the Sinkhorn algorithm, and was recently revisited by \citet{kim2026extensioncouplingprojectionoptimal} for statistical applications. Under mild conditions, we establish the bi-Hölder continuity of the shadow. As a consequence, we also derive the sample complexity of the shadow by combining smoothing techniques with recent results on the rate of convergence of empirical measures in Wasserstein distance. The key idea of the proof is twofold: first, a contraction property of the $L^p$ projection, recently used independently by \citet{kim2025stabilitywassersteinprojectionsconvex} and \citet{alfonsi2025wassersteinprojectionsconvexorder} to study the stability of projections onto the convex order cone in Wasserstein space; and second, the Hölder continuity of optimal transport maps established by \citet{Quantitative_stability_duke2023}, together with its recent extension by \citet{mischler2025quantitativestabilityoptimaltransport}.
Read the full abstract

Statistics Theory

Asymptotic behavior of the variance of the BLUE for the mean of stationary processes

In this paper, we survey results on the asymptotic behavior of the variance of the best linear unbiased estimator (BLUE) for the mean of stationary processes. This behavior is influenced by the regularity and memory structures of the observed models. The results show that the asymptotic behavior of the variance of the BLUE is determined solely by the behavior of the spectrum near the origin. For nondeterministic models, the variance of the BLUE exhibits hyperbolic behavior, similar to the power function, while for purely deterministic models, the variance decreases at an exponential rate. Specifically, a necessary condition for the variance of the BLUE to approach zero exponentially is that the spectral density of the model vanishes on a set of positive Lebesgue measure in any neighborhood of zero. We also present results on the asymptotic efficiency of various unbiased linear estimators in comparison to the BLUE.
Read the full abstract

Logic

Classification and deontic explosion for contrary-to-duty obligations

Carmo and Jones have presented a sequence of candidate axiom systems for conditional obligation between 1997 and 2022. For their most recent system we demonstrate a limited form of deontic explosion: given that a student does not get the highest possible grade on a test, any other passing grade is acceptable. In addition to that negative result, we give a positive one: revisiting the strongest version of Carmo and Jones' 1997 system, we provide a surprising classification of all satisfying models in terms of a single forbidden possible world.
Read the full abstract

Information Theory

WISV: Wireless-Informed Semantic Verification for Distributed Speculative Decoding in Device-Edge LLM Inference

While distributed device-edge speculative decoding enhances resource utilization across heterogeneous nodes, its performance is often bottlenecked by conventional token-level verification strategies. Such rigid alignment leads to excessive rejections, significantly diminishing the accepted sequence length and increasing interaction rounds under fluctuating wireless conditions. In this paper, we propose WISV (Wireless-Informed Semantic Verification), a novel distributed speculative decoding framework that goes beyond strict token-level matching via a channel-aware semantic acceptance policy. WISV integrates a lightweight decision head into the edge-side target LLM to dynamically evaluate speculative tokens by synthesizing high-dimensional hidden representations with instantaneous channel state information (CSI). To optimize the trade-off between verification fidelity and communication overhead, we further design two tailored communication protocols: full-hidden upload and mismatch-first selective-hidden upload. Extensive simulations using a 1B drafter and an 8B target model demonstrate that WISV achieves up to a 60.8% increase in accepted length, a 37.3% reduction in interaction rounds, and a 31.4% improvement in end-to-end latency compared to vanilla speculative decoding across tested settings, while maintaining a negligible task accuracy drop (<1%). Finally, we validate WISV on a hardware testbed comprising an NVIDIA Jetson AGX Orin and an A40-equipped server, confirming its real-world efficacy in accelerating edge-deployed LLM inference.
Read the full abstract

All authors Zixuan Liu, Zhiyong Chen, Nan Xue, Shengkang Chen, Jiangchao Yao, Meixia Tao, Wenjun Zhang

Combinatorics

On circulant ternary coherent configurations of prime degree

Ternary coherent configurations are, on the one hand, a special case of multidimensional coherent configurations introduced by L. Babai (2016), and, on the other hand, a natural generalization of association schemes on triples introduced by D. M. Mesner and P. Bhattacharya (1990). A ternary coherent configuration X is said to be circulant if the automorphism group Aut(X) of X has a regular cyclic subgroup, and schurian if the classes of X are the orbits of the componentwise action of the group Aut(X) on triples of points of X. It is proved that any circulant ternary coherent configuration X of prime degree p is schurian with the possible exception of the case when X is an association schemes on triples and either Aut(X) = AGL1(p) and p = +1, or -1 (mod 8), or Aut(X) is a proper subgrou of AGL1(p).
Read the full abstract

Optimization and Control

Steady-state Based Approach to Online Non-stochastic Control

We study the problem of online non-stochastic control (ONC), which is the control of a linear system under adversarial disturbances and adversarial cost functions, with the aim of minimizing the total cost incurred. A recent line of literature in ONC develops algorithms that enjoy sublinear regret with respect to a benchmark based on the set of steady-states that are attainable by a constant input. In this work, we extend this research direction by giving an algorithm that enjoys $\mathcal{O}(\sqrt{T})$ regret with respect to a richer benchmark set, namely the set of steady-states attainable under an affine controller. Since this benchmark substantially broadens the comparison class, it provides significantly stronger performance guarantees. Our proposed algorithm combines a Follow-The-Perturbed-Leader-style online non-convex optimization approach with a batching method that maintains stability despite changing policies. Although our proposed algorithm requires solving non-convex subproblems, we show that an approximate solution to this subproblem is sufficient to ensure $\mathcal{O}(\sqrt{T})$ regret. Furthermore, numerical experiments show that our algorithm enjoys lower total cost and similar computation to existing methods in certain settings.
Read the full abstract

All authors Vijeth Hebbar, Spencer Hutchinson, Mahnoosh Alizadeh, Cédric Langbort

Combinatorics

The Gamma-Switch Ramsey Number

We define and develop preliminary theoretical results for the $\Gamma$-switch Ramsey number, a variation on the classical $m$-colour Ramsey number for which we allow permuting the colours incident with a vertex using elements of a group $\Gamma \leq S_m$. We find bounds for the $\Gamma$-switch Ramsey number for groups with various properties as a function of the classical parameter. We prove $R_{C_3}(4,4,4) = R(3,3,3) + 1$, $R_{C_4}(3,4,3,4) = R(2,3,2,3) + 1$ and $43 \leq R_{C_4}(4,4,4,4) \leq R(3,3,3,3) + 1$.
Read the full abstract

Analysis of PDEs

Long time smooth solutions of 3D cubic quasilinear wave systems with small weakly decaying initial data

For the 3D cubic quasilinear wave system $\square_{c_i} u^i=G^i(u,\partial u,\partial^2u)=\displaystyle\sum_{\substack{0\le|\alpha|,|\beta|,|\gamma|\le1 \\ 1\le j,k,l \le m}}g_{\alpha\beta\gamma}^{ijkl}\partial^{\alpha}u^j\partial^{\beta}u^k\partial^{\gamma}u^l$, it is well known that global solution $u$ exists when the small smooth initial data $(u,\partial_tu)|_{t=0}$ $=(u_0(x), u_1(x))$ are compactly supported or decay rapidly at spatial infinity. However, when $(u_0, u_1)\in (H^{s+1}, H^s)$ with $s>\frac{5}{2}$ are small, it remains unknown whether $u$ exists globally or not. In this paper, we show that if $\|u_{0}\|_{H^{N+1}}+\|u_{1}\|_{H^N}\le\varepsilon$ ($N\ge 6$) is small, then the almost global solution $u$ exists in $[0, T_{\varepsilon}]$ with $T_{\varepsilon}\ge e^{C\varepsilon^{-1}}$ for the general $G(u,\partial u,\partial^2u)$ depending on $u$ and $T_{\varepsilon}\ge e^{C\varepsilon^{-2}}$ for the nonlinearity $G(\partial u,\partial^2u)$ independent of $u$, respectively. In addition, if $\displaystyle\sum_{|a|\le 5}\|\langle x\rangle^{\mu}\partial^a_x(u _0,u_1)\|_{L^2}\le\varepsilon$ holds for any fixed constant $\mu\in (0,1)$, then the solution $u$ exists globally and meanwhile the scattering property of $u$ is derived. Our main ingredients consist in establishing a series of new weighted $L^\infty-L^2$ estimates and Strichartz estimates based on the strong Huygens' principle for 3D linear wave equations.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Subsample-Based Estimation under Dynamic Contamination

This paper studies a structural failure of subsample-based estimation in dynamic time series models. Even under oracle knowledge of contamination locations, removing contaminated observations does not restore the uncontaminated objective. In such settings, contamination propagates through the residual filter and distorts the estimation criterion. As a result, subsample-based estimators are generically inconsistent for the clean-data parameter. We characterise this failure as a structural incompatibility between pointwise subsampling and residual propagation. More generally, the failure arises whenever contamination propagates through transformations that enter the estimation criterion, with dynamic time series models as a leading example. To address it, we propose a propagation-compatible transformation of index sets via a patch removal operator. Under general high-level conditions, this transformation leaves the estimator asymptotically unchanged under the uncontaminated model while restoring consistency under contamination. The results apply to a broad class of residual-based estimators and do not rely on modelling the contamination process.
Read the full abstract

Rings and Algebras

Rigidity and Cohomology of Seaweed Lie Algebras

Seaweed (biparabolic) subalgebras form a large and structurally rich class of subalgebras of simple Lie algebras. We determine their adjoint cohomology. If $\mathfrak{s}$ is an indecomposable seaweed subalgebra of a complex simple Lie algebra, then \[ H^\ast(\mathfrak{s},\mathfrak{s})=0, \] and hence $\mathfrak{s}$ is absolutely rigid. If $\mathfrak{s}$ is decomposable, then the Coll–Gerstenhaber decomposition for Lie semidirect products gives, for each $n\ge 0$, a canonical description of $H^n(\mathfrak{s},\mathfrak{s})$ in terms of exterior powers of $\mathcal{Z}(\mathfrak{s})^\ast$ and the zero-weight cohomology of $\mathfrak{s}/\mathcal{Z}(\mathfrak{s})$. In particular, the center is the unique source of nontrivial adjoint cohomology. These results identify indecomposability as the precise condition for cohomological rigidity and give a uniform description of adjoint cohomology for seaweed Lie algebras.
Read the full abstract

Sunday 19 April

Numerical Analysis · Cross-listed from physics.comp-ph

On the Fast Fourier Transform on SU(2)

The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing spectral analysis on this non-abelian compact Lie group. We present the Fourier Transform (FT) on SU(2) and develop a Fast Fourier Transform (FFT) algorithm inspired by the classical Cooley-Tukey divide-and-conquer scheme. Our approach efficiently discretizes the group using Euler angles, applying a two-dimensional FFT on the angular variables and exploiting the recursive properties of Jacobi polynomials. We provide an analysis of the computational complexity, demonstrating that our FFT-based method significantly outperforms the direct computation of the FT. This algorithm serves as a foundational tool for understanding the implementation of the FFT on SU(2), a key component in numerical simulations and advanced data analysis for high-performance computing applications on curved manifolds and quantum systems.
Read the full abstract

Information Theory · Cross-listed from cs.LG

AirFM-DDA: Air-Interface Foundation Model in the Delay-Doppler-Angle Domain for AI-Native 6G

The success of large foundation models is catalyzing a new paradigm for AI-native 6G network design: wireless foundation models for physical-layer design. However, existing models often operate on channel state information (CSI) in the spatial-temporal-frequency (STF) domain, where multipath components are superimposed and structurally entangled. This hinders the learning of a universal channel representation. Their reliance on global attention also incurs prohibitive overhead. In this paper, we propose AirFM-DDA, an Air-interface Foundation Model in the Delay-Doppler-Angle (DDA) domain. AirFM-DDA reparameterizes CSI into the DDA domain to resolve multipath components along physically meaningful axes and employs window-based attention with frame-structure-aware positional encoding. Extensive experiments demonstrate transferability across scenarios, tasks, datasets, and antenna configurations. For channel prediction and estimation, AirFM-DDA generalizes zero-shot to unseen cities, achieving average normalized mean-square error (NMSE) gains of 4.9-8.5 dB over the strongest baselines. With only 10% labeled data, it achieves average gains of 12.0 percentage points in Top-1 accuracy for beam prediction and 3.4 percentage points in F1 score for line-of-sight (LoS) identification. It further transfers across simulated datasets and adapts to measured data and different antenna arrays. Compared with global attention, window-based attention reduces training and inference costs by nearly an order of magnitude.
Read the full abstract

All authors Kejia Bian, Meixia Tao, Jianhua Mo, Zhiyong Chen, Leyan Chen

Differential Geometry

A Weierstrass-Kenmotsu Type Representation for CMC $0\le H<1$ in \$\mathbb{H}^3(-1)$

We develop a Weierstrass-Kenmotsu type representation for conformal immersions of constant mean curvature $0\le H<1$ in hyperbolic $3$-space $\HH$. The construction is based on the Hermitian model of $\HH$, a balanced spectral deformation, and Iwasawa splitting of $\SL$. We show that such immersions arise locally from a rank-one $(1,0)$-form $\eta$ and a constant complex parameter $\lambda\in\C^*$ through a flat $\SL$-connection of the form \[ S^{-1}dS=\eta-\lambda\,\eta^*, \] with mean curvature \[ H=\frac{1-|\lambda|^2}{1+|\lambda|^2}. \] Conversely, every conformal CMC immersion with $0\le H<1$ is locally obtained from such flat rank-one data. We establish an explicit correspondence with the representation of Aiyama and Akutagawa via a gauge transformation, and interpret the construction in terms of Kokubu's adjusted normal Gauss map. We further discuss the role of the flatness condition, present simple local and cylindrical model examples, and outline aspects of monodromy and numerical implementation within this framework.
Read the full abstract

General Mathematics

Structure and Growth of Galileo Sequences

A Galileo sequence \((a_n)\) is a sequence of positive integers whose partial sums $S_n$ satisfy $S_{2n}=kS_n$ for some $k>1$. In this paper we prove that every polynomial Galileo sequence is given by first differences of the form \(a_n= C\left(n^d-(n-1)^d\right)\). We then show that every positive Galileo sequence has a binary-tree representation. Finally, for positive monotone integer-valued Galileo sequences, we prove power-law growth bounds, and give a continuous analog together with a characterization of all continuous solutions.
Read the full abstract

General Mathematics

Climate-Driven Dengue Forecasting in Bangladesh: Division-Specific Feature-Set Design and Lag Structure

Bangladesh exhibits marked year-to-year variability in dengue, partly driven by meteorological fluctuations that shape Aedes breeding-site persistence, mosquito development, and transmission. We exploit a contrast between Dhaka (consistently high burden) and Barishal (recently rising burden despite lower population density) and frame feature-set design and predictor structure as the main methodological contributions. Using monthly dengue data from DGHS \cite{DGHS} and meteorological data from World Weather Online \cite{Weather} for January 2022–October 2025, we compare four climate feature sets that vary wetness (rainy days vs.\ rainfall) and sunshine (sun days vs.\ sun hours), while temperature and humidity appear in all sets. We evaluate two predictor configurations: lagged climate covariates only, and lagged climate covariates plus 1-month lagged dengue incidence ($Y_{t-1}$). Climate lags (0–4 months) are applied in correlation and forecasting. Both divisions show similar delayed associations: rainfall metrics peak positively near a 2-month lag, humidity near a 1-month lag, sunshine metrics are most negative around a 2-month lag, and temperature is weakly positive at longer lags. We then benchmark MPR, ANN, XGBoost, and SARIMAX across all sets. Best performance differs: Dhaka favors ANN-1 with SET-1 (RMSE=2176.70, MAE=1282.00, MAPE=31.54%), whereas Barishal favors SARIMAX(0,1,1)(1,0,0,12) with SET-2 (RMSE=817.56, MAE=717.78, MAPE=39.96%). Analyses use consistent monthly aggregation and division-specific tuning.
Read the full abstract

General Mathematics

Projection, Measure, and Idempotent Relations: Collapse, Rigidity, and a Fixed-Point Coupling Law

We introduce a minimal ZFC-internal axiom system for pre-structural data (X, A, mu, mu^{otimes2}, R, I, Pi_R, G, E_0, eta), coupling a finitely additive measure mu, an idempotent retraction Pi_R : X -> R, and an idempotent symmetric relation G through a single coupling law (Axiom III). Our central result is a collapse theorem: every admissible model is concentrated on the representative sector R, namely mu(X\R)=0, with no full-partition hypothesis. As immediate consequences, eta<1 holds automatically and the two-point load is rigidly determined, mu^{otimes2}((B x X) cap G) = mu(B)/(1-eta), so it is not an independent datum once (mu, eta) are fixed. A further consequence is component quantization: every measurable G-equivalence class C has mass mu(C) in {0, (1-eta)^{-1}}; as an arithmetic corollary, when finitely many positive-mass classes exhaust the measure their count equals (1-eta)E_0, a positive integer, tying the scale E_0 and the rate eta together. We establish consistency in ZFC by explicit finite, countable, and continuous (Lebesgue) models with eta neq 0, and prove mutual independence of the three axioms and of the three subclauses of Axiom III: collapse is driven by invariance III(b) alone, eta<1 and load rigidity add the coupling law III(c) and the retraction property (Axiom I), and Axiom II enters only at quantization. Finally we give a fixed-point reformulation of the coupling law as the unique bounded finitely additive solution of a Banach contraction f = T_eta f, and a null-extension factorization exhibiting every admissible model as its identity-retraction core extended by mu- and mu^{otimes2}-null data.
Read the full abstract

2604.18640 · 19 Apr · 25 pages. v2: major revision; v1 title "Independent Axioms and a Fixed-Point Coupling Law". Strengthens support concentration to an unconditional global collapse mu(X\R)=0; adds automatic eta<1, load rigidity, component quantization and integrality (1-eta)E_0 in Z_{>0}, a continuous model, and a null-extension factorization; corrects the countable model

Algebraic Geometry

On a relation of a conjecture of Goncharov to the co-Lie algebra of Bloch-Kriz mixed Tate motives

Goncharov defined for each field $F$ and an integer $n$ greater than 1 a certain group $B_n(F)$. We consider the possibility of defining a linear map from $B_n(F)$ to the co-Lie algebra of the category of mixed Tate motives defined by Bloch and Kriz, in terms of motivic polylogarithms. We give results which support this possibility assuming part of the conjecture by Beilinson and Soulé on vanishing of $K$-groups of fields.
Read the full abstract

Rings and Algebras

The Jordan multiplication semigroup of matrix algebras is the full endomorphism semigroup

Let $\mathbb{K}$ be a field of characteristic different from $2$, and let $M_n(\mathbb{K})$ be the algebra of all $n\times n$ matrices over $\mathbb{K}$. We consider the corresponding special Jordan algebra $\mathcal{A}:=M_n(\mathbb{K})^+$ with symmetrized product $A\circ B:=(AB+BA)/2$, and write $\mathcal{A}_{\mathrm v}:=M_n(\mathbb{K})$ for the underlying $\mathbb{K}$-vector space of $\mathcal{A}$. For $A\in\mathcal{A}$, let $\mathrm{L}_A(X):=A\circ X$ be the multiplication operator. We consider the Jordan multiplication semigroup generated by all multiplication operators, \[ \mathrm{JMS}(\mathcal{A}):=\langle \mathrm{L}_A:A\in\mathcal{A}\rangle\subseteq \mathrm{End}_{\mathbb{K}}(\mathcal{A}_{\mathrm v}). \] We prove that $\mathrm{JMS}(\mathcal{A})=\mathrm{End}_{\mathbb{K}}(\mathcal{A}_{\mathrm v})$. Equivalently, every $\mathbb{K}$-linear endomorphism of $\mathcal{A}_{\mathrm v}$ is a composition of multiplication operators. The proof is primarily linear-algebraic. The main step is to show that $\mathrm{SL}(\mathcal{A}_{\mathrm v})\subseteq \mathrm{JMS}(\mathcal{A})$ by constructing elementary transvections inside the semigroup. We then prove determinant surjectivity on the unit group of $\mathrm{JMS}(\mathcal{A})$ and combine it with the existence of a singular element of rank $n^2-1$ to obtain the full endomorphism semigroup. In the finite-field case, the determinant-surjectivity step is established via Jacobi-sum estimates.
Read the full abstract

Optimization and Control

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach

We present experimental work on a primal-dual framework simultaneously approximating maximum cut and weighted fractional cut-covering instances. In this primal-dual framework, we solve a semidefinite programming (SDP) relaxation to either the maximum cut problem or to the weighted fractional cut-covering problem, and then independently sample a collection of cuts via the random-hyperplane technique. We then simultaneously certify the approximate optimality of a cut and a fractional cut cover. We present several implementations which reliably achieve the celebrated Goemans and Williamson approximation ratio of $\alpha_{\mathrm{GW}} \approx 0.878$ for both optimization problems simultaneously, after $\lceil 128 \ln m \rceil$ samples, a number significantly smaller than the best theoretical bounds. This is the first experimental work approximating the weighted fractional cut-covering problem, and we deliver robust and repeatable results despite the use of randomized algorithms and floating-point arithmetic. Careful pre-processing of instances and post-processing of numeric results allow for good empirical outcomes with both first-order and second-order SDP solvers. Nearly optimal SDP solutions are suitably perturbed to ensure better probabilistic and numerical behavior. Our experiments deviate from theory by using a linear programming (LP) solver to compute fractional cut covers. For most instances studied, LP solving produces certifiably better results than the theoretical algorithm after $\lceil 128 \ln m \rceil$ samples. All our experiments strictly follow a unified pipeline which explicitly documents all parameters used in each run.
Read the full abstract

All authors Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel

Optimization and Control

On The Mathematics of the Natural Physics of Optimization

A number of optimization algorithms have been inspired by the physics of Newtonian motion. Here, we ask the question: do algorithms themselves obey some “natural laws of motion,” and can they be derived by an application of these laws? We explore this question by positing the theory that optimization algorithms may be considered as some manifestation of hidden algorithm primitives that obey certain universal non-Newtonian dynamics. This natural physics of optimization is developed by equating the terminal transversality conditions of an optimal control problem to the generalized Karush/John-Kuhn-Tucker conditions of an optimization problem. Through this equivalence formulation, the data functions of a given constrained optimization problem generate a natural vector field that permeates an entire hidden space with information on the optimality conditions. An “action-at-a-distance” operation via a Pontryagin-type minimum principle produces a local action to deliver a globalized result by way of a Hamilton-Jacobi inequality. An inverse-optimal algorithm is generated by performing control jumps that dissipate quantized “energy” defined by a search Lyapunov function. Illustrative applications of the proposed theory show that a large number of algorithms can be generated and explained in terms of the new mathematical physics of optimization.
Read the full abstract

Information Theory · Cross-listed from physics.soc-ph

Is segregation encoded in urban form? An entropy-based analysis

The footprints of residential segregation have long been documented, yet the role of urban form as both medium and manifestation of segregation remains under-specified. We investigate whether the configuration of the built fabric may encode residential segregation in its spatial structure, hypothesising that built-form entropy (BFE) regimes are associated with the spatial distribution of income groups and their local clustering in non-linear ways. We examine this by quantifying BFE through a Shannon-based measure computed from building footprints, characterising income-based distributions using the Gini index and Moran's I, and placing both on a common spatial footing through a regular tessellation. Applying this framework to Sao Paulo, Latin America's largest city, we find non-linear relationships between BFE, income, and segregation: income levels and residential clustering increase toward both extremes of the entropy spectrum, with a stronger rise at the high-entropy end. This asymmetry suggests that high-entropy urban forms are associated with distinct spatial processes of segregation, including elite enclaving and incremental development in lower-income settlements, while low-entropy forms reflect more selective occupation shaped by planning and market filtering. Overall, the findings suggest that built form is more than a neutral backdrop, functioning as both affordance and signal of segregation.
Read the full abstract

All authors Vinicius M. Netto, Caio Cacholas, Camila Carvalho, Edgardo Brigatti

Analysis of PDEs

Convergence of Potential Mean-Field Games via Lyapunov Methods

We consider discounted infinite-horizon potential mean-field games (MFGs) on the $d$-dimensional torus. Without imposing monotonicity assumptions, we prove that every weak limit point of a time-dependent equilibrium, as time tends to infinity, is a stationary equilibrium. As a consequence, equilibria converge whenever the stationary solution is unique. The short proof is based on a novel Lyapunov functional for the time-dependent MFG system. We also provide a new uniqueness criterion for stationary equilibria. Finally, we apply our results to the subcritical Kuramoto MFG studied by Carmona, Cormier, and Soner, showing that every equilibrium converges to the incoherent solution.
Read the full abstract

Differential Geometry

A Transverse Averaging Operator and Cohomology of Quotients by Homogeneous Non-closed Subgroups

In this article, we introduce a transverse averaging operator for basic forms on a complete Riemannian foliation with compact leaf closure space, equipped with an isometric transverse Lie algebra action. In contrast to the classical averaging operator in equivariant geometry, which is defined by integration over a compact Lie group, our operator is constructed purely from infinitesimal transverse data and does not require any global group action. We prove that every closed basic form is sent to an invariant basic form representing the same basic cohomology class. The main application is formulated independently of foliation theory. We compute the diffeological de Rham cohomology of the homogeneous quotient $G/H$, where $G$ is a connected Lie group, not necessarily compact, and $H$ is a connected Lie subgroup, not necessarily closed. Let $\mathfrak g$ and $\mathfrak h$ be the Lie algebras of $G$ and $H$, respectively. Assuming that $\mathfrak g$ is of compact type and that $G/\overline{H}$ is compact, we prove that $ H^\bullet_{\mathrm{dR}}(G/H) \cong H^\bullet(\mathfrak g,\mathfrak h)$. When $\mathfrak h$ is an ideal in $\mathfrak g$, the compact-type assumption on $\mathfrak g$ can be dropped, and under the sole assumption that $G/\overline{H}$ is compact we obtain $ H^\bullet_{\mathrm{dR}}(G/H) \cong H^\bullet(\mathfrak g/\mathfrak h)$. These results extend the classical Chevalley–Eilenberg computation from compact Lie groups and closed subgroups to homogeneous quotients $G/H$ by possibly non-closed subgroups $H$.
Read the full abstract

Combinatorics

Forbidden subgraphs in divisor graphs and an Erdős divisibility problem

Erdős asked for the largest size $f(n)$ of a subset of $\{1,\dots,n\}$ with no element dividing two others. We show that $f(n)=c_2\,n+o(n)$ for an effectively computable constant $c_2$, and moreover that the number $q(n)$ of such subsets satisfies $q(n)=\beta_2^{n+o(n)}$ for a computable constant $\beta_2$. To prove this, we recast the divisibility constraint as forbidding a certain directed subgraph in the divisor graph on $\{1,\dots,n\}$ and prove a more general result: for any finite family of connected forbidden subgraphs of the divisor graph, both the extremal density and counting rate are effectively computable. The proof uses a theorem of McNew on local statistics of divisor graphs.
Read the full abstract

Dynamical Systems

Uniform Hyperbolicity and Symbolic Dynamics: Markov Partitions, Shadowing, and the Coding of Axiom A Diffeomorphisms

This Part establishes the geometric theory of uniformly hyperbolic sets with explicit quantitative bounds throughout, and contains five main theorems. The Stable Manifold Theorem is proved via the backward graph transform, with a complete fiber-contraction argument yielding $C^r$ regularity and Hölder dependence of the local stable and unstable manifolds on the base point, with explicit manifold-size estimate in terms of the contraction rate $\lambda$ and the second-derivative bound of the diffeomorphism. The Spectral Decomposition Theorem gives the unique decomposition of the nonwandering set into basic sets, with explicit mixing rates for the topologically mixing factors. The Shadowing Lemma provides explicit error bounds controlling how far a pseudo-orbit deviates from a tracking true orbit. The existence of Markov partitions of arbitrarily small diameter is established constructively, with explicit diameter bounds expressed in terms of the shadowing constants. Finally, the coding map from the subshift of finite type to the hyperbolic set is constructed and shown to be Hölder continuous with quantitative control on the exceptional set where it fails to be injective. Along the way we establish canonical coordinates through the bracket map with quantitative bounds. All constants are expressed in terms of the contraction rate, the Hölder exponent of the derivative, the manifold dimension, and the injectivity radius, providing the quantitative infrastructure required to transfer the symbolic spectral theory of Part I Thiam (2026a) and the variational theory of Part II Thiam (2026b) to the smooth setting. This Part constitutes Part III of a six-part series on the thermodynamic formalism for hyperbolic dynamical systems.
Read the full abstract

Combinatorics

On (distance) Laplacian characteristic polynomials of power graphs

The characteristic polynomials of the Laplacian and the distance Laplacian matrices of power graphs of groups of order $ pqr $, where $ p,q $ and $ r $ are { primes,} are obtained. Further, the characteristic polynomials of these matrices for proper power graphs of cyclic and dicyclic groups are given. The important inequalities for the zeros of the distance Laplacian characteristic polynomials of power graphs of finite groups are presented in comments.
Read the full abstract

Numerical Analysis

Fully discrete scheme for the fifth-order KdV-Burgers-Fisher equation using Strang splitting and Fourier collocation methods

Operator splitting is an effective technique for the numerical solution of nonlinear partial differential equations by decomposing a complex problem into simpler subproblems. In this study, we present and analyze a fully discrete scheme for the fifth-order Korteweg-de Vries-Burgers-Fisher equation (KBF) by combining Strang splitting for time discretization with the Fourier collocation method for spatial discretization. In particular, the Fourier collocation method is an essential component of the proposed fully discrete scheme and yields spectral accuracy in space under suitable regularity assumptions. The KBF equation describes the interaction of reaction, dissipative, and dispersive mechanisms by incorporating the Fisher reaction term together with Burgers-type diffusion and higher-order KdV dispersion. The equation is split into a linear operator and a nonlinear operator, and the resulting subproblems are solved within the Strang splitting framework. Convergence is analyzed in the Sobolev space $H^s$. The local error is derived using operator-theoretic arguments in Banach spaces together with Lie commutator estimates, while the global error is obtained using the Lady Windermere's fan argument. The analysis yields second-order convergence in time and spectral convergence in space. Numerical results confirm the theoretical error estimates and demonstrate the accuracy of the proposed fully discrete scheme.
Read the full abstract

Optimization and Control

Decentralized Stability-Constrained Optimal Power Flow for Inverter-Based Power Systems

Future inverter-dominated power systems feature higher variability and more stressed operating conditions, which motivates the consideration of stability in operational settings. Existing approaches to stability-constrained OPF often rely on eigenvalue calculation, global model information, or dynamic evaluation inside optimization formulation, which are computationally intensive and difficult to scale. This paper proposes the first decentralized stability-constrained OPF framework for inverter-based power systems. The key novelty lies in the incorporation of a class of algebraic decentralized small-signal stability criteria that admits tractable representations in steady-state variables and is therefore suitable for optimization. The decentralized stability condition is based on local voltage differences and enables clear theoretical and practical economic interpretation of the stability contribution from each inverter. We define a Nodal Stability Shadow Price (NSSP) for each inverter, and characterize the role of these stability constraints through their associated shadow prices, enabling a nodal interpretation of their economic impacts. It is proved that under active-power-only objectives in lossless networks, binding stability constraints may occur but will admit zero shadow prices if all other operational constraints are inactive. Most importantly, we reveal the importance of considering the opportunity cost of reactive power for inverter-based resources (IBRs) that have limited capacity. When reactive power costs are considered, stability constraints can carry strictly positive shadow prices and admit meaningful economic impacts.
Read the full abstract

Differential Geometry

Geometric Stability of the Schoen-Yau Zero Mass Theorem

In 1979, Schoen and Yau proved their famous Positive Mass Theorem which is a combination of a comparison theorem: a three dimensional asymptotically flat Riemannian manifold with nonnegative scalar curvature has nonnegative ADM mass, and a rigidity theorem: if such a manifold has zero ADM mass then it is isometric to Euclidean space. Here we review results and open questions on the geometric stability of their zero mass rigidity theorem: if such a manifold has almost zero mass, how close is its geometry to that of Euclidean space? We review the geometry of these spaces, examples of sequences of such spaces with mass approaching zero, and a variety of geometric notions of convergence. Although there has been much progress, it is still an open question (even in dimension three): exactly which geometric notion of convergence works best to capture the geometric stability of this famous rigidity theorem.
Read the full abstract