Paperlane

no. 12 · from the archive← Mon 9 Nov archive Wed 11 Nov →

Tuesday, 10 November 2026

1385 papers in 32 fields

Optimization and Control91

We examine the problem of efficiently learning coarse correlated equilibria (CCE) in polyhedral games, that is, normal-form games with an exponentially large number of actions per player and an underlying combinatorial structure. Prominent examples of such games are the classical Colonel Blotto and congestion games. To achieve computational efficiency, the learning algorithms must exhibit regret and per-iteration complexity that scale polylogarithmically in the size of the players' action sets. This challenge has recently been addressed in the full-information setting, primarily through the use of kernelization. However, in the case of the realistic, but mathematically challenging, partial-information setting, existing approaches result in suboptimal and impractical runtime complexity to learn CCE. We tackle this limitation by building a framework based on the kernelization paradigm. We apply this framework to prominent examples of polyhedral games -- namely the Colonel Blotto, graphic matroid and network congestion games -- and provide computationally efficient payoff-based learning algorithms, which significantly improve upon prior works in terms of the runtime for learning CCE in these settings.

comments
Accepted at NeurIPS 2025
fields
Optimization and Control
pdf ↗ page arXiv:2509.20919 ↗

This paper addresses the problem of designing efficient no-swap regret algorithms for combinatorial bandits, where the number of actions $N$ is exponentially large in the dimensionality of the problem. In this setting, designing efficient no-swap regret translates to sublinear -- in horizon $T$ -- swap regret with polylogarithmic dependence on $N$. In contrast to the weaker notion of external regret minimization - a problem which is fairly well understood in the literature - achieving no-swap regret with a polylogarithmic dependence on $N$ has remained elusive in combinatorial bandits. Our paper resolves this challenge, by introducing a no-swap-regret learning algorithm with regret that scales polylogarithmically in $N$ and is tight for the class of combinatorial bandits. To ground our results, we also demonstrate how to implement the proposed algorithm efficiently -- that is, with a per-iteration complexity that also scales polylogarithmically in $N$ -- across a wide range of well-studied applications.

comments
Accepted at AISTATS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2602.02087 ↗

We study the computation of variational generalized Nash equilibria (v-GNE) in games with strongly monotone pseudo-gradients and nonlinear convex shared constraints. We show that the v-GNE problem is exactly equivalent to a hierarchical variational inequality, whose lower level is given by the gradient of a smooth convex penalty of the constraint violation over the local action sets. Building on this reformulation, we propose a hierarchical regularization scheme that operates entirely in the primal space and requires only projections onto the local action sets. In the centralized setting, we prove last-iterate squared distance convergence to the v-GNE with rate $O(1/t^{\scriptscriptstyle 2/3})$ under a local error bound condition, which holds, e.g., under Slater's condition, improved to $O(1/t)$ under a global error bound condition. We then extend the scheme to the partial-decision information setting, where the agents communicate over a network and maintain local estimates of the joint action. We derive a distributed algorithm with a constant stepsize operating in the primal space and converging to the v-GNE with rate $O(1/t)$.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10172 ↗

Stochastic bilevel optimization provides a general framework for many machine learning applications, such as hyperparameter learning, data reweighting, language model alignment, and actor-critic reinforcement learning. However, most existing bilevel optimization methods treat matrix-valued gradients as flattened vectors and perform optimization in the resulting vectorized space, ignoring the matrix structures common in modern neural networks. Moreover, the lower-level (LL) problem curvature can induce significant spectral imbalance in the upper-level (UL) geometry. Such limitations of existing bilevel optimization methods motivate us to develop BiMuon, a geometry-aware stochastic bilevel optimization method that integrates implicit hypergradient estimation in bilevel optimization with Muon-style orthogonalized updates at the UL. To our knowledge, BiMuon is the first stochastic BLO method with Muon-style orthogonalized matrix updates and an $O(ε^{-4})$ iteration-complexity guarantee, matching the best-known rates achieved by Muon-type methods based on matrix parameterizations. To improve computational and parallel efficiency for models with multiple matrix parameters, we further study BiMuon for blockwise diagonal matrix approximation and derive a relative stepsize allocation rule based on UL progress and blockwise LL sensitivity. We evaluate BiMuon on representation learning and blockwise bilevel optimization, providing empirical support for our methods.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10188 ↗

We study the convergence rate of the Nesetrov's accelerated proximal gradient method for a smooth, strongly convex composite minimization objective across a range of value of the momentum extrapolation. The literature proves a convergence rate of the method for a specific momentum extrapolation parameter choice based on the knowledge of strong convexity and Lipschitz smoothness constants. For the heavy ball method it is established that every choice of the momentum parameter either fails to accelerate or fails to converge on the same function class. We prove in this paper that a range of Nesterov style constant momentum extrapolation parameters produces a linear convergence rate. We corroborate these results numerically via performance estimation which computes a method's exact worst case rate as a semidefinite program.

comments
with appendix, 35 pages. It's already submitted at the time of uploading to arxiv
fields
Optimization and Control
pdf ↗ page arXiv:2611.10205 ↗

In recent years, singular-spectrum-based optimizers have attracted increasing attention due to their ability to preserve the matrix structure of neural network gradients, thereby enabling geometry-aware optimization. However, most singular-spectrum-based (SSB) approaches remain centralized, limiting their use in distributed learning infrastructures that exploit massive parallelism. Distributed SSB optimization is still at an early stage, with open questions about convergence guarantees and communication efficiency. To fill this gap, we propose the Distributed Momentum-based Spectral Estimator (DisMUSE), an efficient distributed SSB optimization framework for both data-center and federated settings. Using Muon-style exact orthogonalized momentum as the spectral update, DisMUSE integrates a recursive variance-reduced momentum estimator and achieves an $O((KT)^{-1/3})$ convergence rate, where $K$ and $T$ denote the number of nodes and local iterations per node, respectively. This rate matches the best-known rates for variance-reduced nonconvex distributed optimization. Building on this variance-reduced framework, we study two extensions. First, our DisMUSE method with finite Newton-Schulz (NS) iterations preserves the same convergence order under a uniform normalized support-spectrum condition, up to a multiplicative factor. Second, we develop a communication-efficient variant based on low-rank (LR) momentum transmission and quantify the error it introduces to the stationarity bound, characterizing the trade-off between accuracy and communication cost.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10212 ↗

Bilevel optimization is a fundamental framework for machine learning problems, where an upper-level (UL) objective depends on the solution of a nested lower-level (LL) problem. Existing bilevel algorithms typically assume that the LL objective is available for evaluation, differentiation, or unrolling. However, this assumption can fail when the LL response is produced by a black-box solver, simulator, adversary, or learned predictor. In this paper, we study LL agnostic bilevel optimization, where the UL learner has access only to an approximate LL solution $\bar{\mathbf{y}}(\mathbf{x})$ and cannot query the LL objective, its gradients, Hessian/Jacobian information, or the procedure that generates the LL response. We propose LeGo-BiO, a coordinate-wise pseudo-hypergradient method that estimates the missing Jacobian $\nabla _{\mathbf{x}}\bar{\mathbf{y}}(\mathbf{x})$ using finite differences of $\bar{\mathbf{y}}(\cdot)$. For each UL coordinate, LeGo-BiO constructs a decision vector subject to 1-sparse updates, thereby isolating the corresponding Jacobian column needed in the UL gradient computation. This avoids the directional-projection limitation of full-parameter response differences and, unlike derivative-free/zeroth-order approximations of the entire UL gradient, preserves the available first-order gradient information with respect to the UL variables for more accurate UL gradient evaluation. We establish convergence guarantees for LeGo-BiO in both deterministic and stochastic settings under an LL error-bound/Polyak-Lojasiewicz-type condition, without requiring LL strong convexity. Our bounds yield an $O(T^{-1})$ rate in the deterministic setting and an $O(T^{-1/2})$ rate in the stochastic setting when the LL approximation error decreases geometrically. Experiments demonstrate competitive performance of LeGo-BiO despite being agnostic to the LL objective.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10223 ↗

We study how knowledge about partially observable model parameters is being created and propagated in large scale systems. Information is generated from observational signals whose dynamics depend endogenously on the learning history, the learning duration, the decisions and the related costs encountered by a continuum of decision makers. Such characteristics give rise to a new class of sequential testing problems in which there is continuous endogenous feedback. Adopting the classical approach of Shiryaev, we relate the problem to an optimal stopping one for the representative belief process, whose generator now depends on the evolving interactions. Considering a fixed point for the latter, we introduce a notion of mean field game and prove the existence of an equilibrium. Our arguments, which are based on a combination of pde and probabilistic techniques, involve a detailed analysis of the underlying variational inequality and the geometry, stability and continuity of the free boundaries.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10244 ↗

In this paper, we study the computational aspects of the Unbalanced Optimal Transport (UOT) problem between two given positive measures $μ$ and $ν$. The UOT is a variant to the classic Optimal Transportation problem in which the linear constraints modeling mass preservation are relaxed and replaced by a convex penalty $\Dphi$ in the objective function. First, we show that any UOT problem admits a discrete solution as long as $μ$ and $ν$ are discrete, allowing us to express the optimality conditions characterizing the solution to the UOT problem in an easy-to-handle form. By exploiting the optimality conditions we provide an upper and lower bound on the marginals of the solution as well as a bound on the mass that any solution assigns to any couple of points. The bounds on the mass assigned to each couple of points reveal that, under suitable conditions, the support of any solution to the UOT is contained within a compact set that does not depend on the measures $μ$ and $ν$, but only on the penalty function $\Dphi$ and the cost function $c$. We then introduce a truncated version of the UOT problem that fully leverages the sparsity of the optimal solution by introducing a parameter $R$ that saturates $c$. We show that any solution to the truncated problem naturally yields an approximation of the optimal solution for the standard UOT problem and bound the primal sub-optimality gap between the real solution and the solution induced by the truncated problem via a decreasing power-like function of $R$. Lastly, we study the convergence speed of the Pairwise Frank-Wolfe algorithm when applied to the truncated UOT problem and show that such routine is able to identify the support of the solution within a finite number of iterations.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10268 ↗

We extend the analysis of Asl and Overton~\cite{AO2021} for memoryless BFGS (also known as L-BFGS-1) using an Armijo-Wolfe line search and applied to the nonsmooth convex function $f(x)=a|x^{(1)}|+\sum_{i=2}^n x^{(i)}$, where $n\ge2$ and $a \geq \sqrt{n-1}$. This function is unbounded below, so the method is successful if it generates function values diverging to $-\infty$, and fails otherwise. For scaled L-BFGS-1, we sharpen the sufficient condition for % az{convergence of the absolute normalized search directions} in Theorem~3.1 of failure in \cite{AO2021} from $a\ge2\sqrt{n-1}$ to $a\ge\sqrt{3(n-1)}$. For the unscaled version, we prove success for every $a$: either the method generates a direction along which no Armijo-Wolfe step exists, certifying unboundedness below, or its function values diverge to $-\infty$. Both results are consistent with the numerical experiments in \cite{AO2021}. Both proofs given here were derived with help from GPT 6 in discussions directed by the first author and corrected and rephrased afterward.

fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2611.10284 ↗

When interior-point methods are applied to solve numerical trajectory optimisation problems, they spend most of their per-iteration time on a structured Newton–KKT system, associated to an equality-constrained linear-quadratic optimal control problem. Riccati-type algorithms exhibit linear complexity in the trajectory horizon. Parallel-in-time algorithms are able to reduce this to logaritmic complexity by distributing several subtrajectories over multiple cores and then stitch together the results by means of an associative scan. Existing exact formulations condition each subtrajectory on its terminal state. Each subproblem then carries the reachability to that terminal state explicitly as constraint rows. The associated reachability decision however is ill-conditioned for weakly actuated systems. In this work we condition each subtrajectory on the terminal costate instead. The resulting subproblems can now be computed by a free-end Riccati recursion without reachability carrying rows. This approach effectively compensates for the ill-conditioning of weakly actuated systems but requires additional bookkeeping with Lagrangian multipliers when stitching together the various subproblems. Numerically the method reproduces a direct solution of the primal-dual Newton-KKT system to $10^{-12}$ in relative terms, on a weakly controllable chain of masses, the accurracy rivals that of a sequential recursion, whereas terminal-state conditioning loses up to six digits or fails. Operation counts on a problem with 64 subtrajectories and a horizon of 4096 stages gives a speed-up of 26 compared with a sequential solve.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10286 ↗

We analyze adaptive sampling stochastic model-based trust-region methods that build their models in random subspaces and use common random numbers (CRN) within an iteration, and obtain, within a STORM-type analysis, the first $\tilde{\mathcal{O}}(\varepsilon^{-4})$ bound on the number of function evaluations needed to reach $\varepsilon$-stationarity, both almost surely and in expectation. The subspace model reduces the per-iteration computational cost, which allows scalability. The analysis relies on a general framework for the complexity of adaptive stochastic processes that carries the almost-sure analysis of ASTRO-DF into the STORM setting and adds expected bounds by a direct counting argument, without the renewal-reward argument of Blanchet et al. (2019). The bounds are obtained for two variants of a stochastic model-based trust-region method that differ in how the function evaluations used to measure progress are generated. The first algorithm, ASTRA-F, proceeds in a STORM-like manner: the trial point and the incumbent are re-evaluated on an independent set of replications, so that the estimates entering the acceptance test are independent of the model, as every existing STORM-type analysis requires their accuracy to be assessed conditionally on the model. The second, ASTRA-R, allows a practical approach: the trial point is evaluated on the replications already drawn to build the model, which avoids re-evaluating the incumbent, needs one adaptive sample size per iteration instead of two, and reduces the randomness entering the iteration. To our knowledge, no STORM-type analysis has been able to accommodate the latter approach as the accuracy of an estimate at a point chosen from the samples cannot be assessed conditionally on the model; we overcome this with a probabilistic chaining argument.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10296 ↗

An operator splitting method is developed for computing operating points of nonlinear resistive networks. Our behavioral formulation separates the device laws from Kirchhoff's laws and casts simulation as a zero-finding problem. Branch port resistances then provide a diagonal preconditioner for the relaxed Peaceman-Rachford iteration in scattering variables. Each iteration requires solving independent scalar equations and a linear system with a fixed weighted Laplacian matrix. Convergence is established for maximal monotone device laws when an operating point exists. Contractive branch reflections also yield a linear convergence bound independent of network topology. Numerical experiments on crossbar arrays illustrate the computational advantages.

comments
Submitted to European Control Conference 2027
fields
Optimization and Control
pdf ↗ page arXiv:2611.10361 ↗

We study a discrete-time two-player zero-sum stochastic game with control and stopping, where both players can stop the game, the discount factors depends on the states, and the running and terminal rewards may be unbounded. A contraction argument for the constrained Shapley equation establishes the existence of the value and a Nash equilibrium consisting of stationary controls and stopping times. We further provides algorithms for approximating the value and computing an $\varepsilon$-Nash equilibrium. A numerical example with state-dependent discount factors illustrates the results.

comments
29pages, 1figure
fields
Optimization and Control
pdf ↗ page arXiv:2611.10396 ↗

For deterministic online makespan minimization, $m = 4$ identical machines is the smallest case whose optimal competitive ratio is open: it is known only to lie between $\sqrt{3} \approx 1.73205$ and $26/15 \approx 1.73333$. We prove a lower bound of $14383/8304 \approx 1.73206$ using a single branching layer, and refine the construction with a second, mirrored branching layer to obtain $14350/8283 \approx 1.73246$, closing about a third of the gap. Our constructions are the first branching adversaries for $m = 4$ machines, and the first explicit lower bounds for online makespan minimization in which the adversary presents jobs in non-monotone order of size.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10440 ↗

Zeroth-order methods provide a way to optimize stochastic nonconvex objectives using only noisy function evaluations. However, the smoothing inherent in their gradient estimators effectively modifies the objective being optimized. In particular, Gaussian smoothing with smoothing parameter $η>0$ induces, to leading order, an implicit Hessian-trace regularization, which motivates the study of the curvature-regularized objective of the form $f(x)+(η^2/2) tr(\nabla^2 f(x))$. We develop a non-asymptotic theory in the nonconvex setting for a class of algorithms called stochastic zeroth-order Langevin dynamics (ZOLD), which use only noisy function evaluations and do not have access to first- or higher-order derivative information, and derive excess-risk guarantees for the curvature-regularized objective. We first control the finite-time distribution of the ZOLD iterates in Wasserstein distance with respect to the Gibbs measure associated with the Gaussian-smoothed objective. An explicit coupling between the smoothing and inverse temperature parameters then quantifies the proximity of this measure to the Gibbs measure associated with the corresponding Hessian-trace-regularized objective. These distributional estimates in Wasserstein distance lead to excess-risk bounds for the curvature-regularized objective. Our analysis accommodates assumptions under which the stochastic function evaluations are allowed to have non-uniform dependence on the data stream. In addition, the constants in the non-asymptotic bounds do not rely on log-Sobolev or Poincaré inequalities as in prior zeroth-order Langevin analyses. To the best of our knowledge, this is the first non-asymptotic analysis of a zeroth-order Langevin method that simultaneously establishes excess-risk guarantees for a curvature-regularized objective and Wasserstein guarantees for the associated Gibbs measure in the nonconvex setting.

fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.10461 ↗

We present a novel GPU-accelerated global solver for constrained nonlinear programming (NLP) inspired by the efficient linear bound propagation framework in neural network (NN) verification. Existing work on NN verification, a problem that can be cast as feasibility detection for a nonlinear objective, demonstrated orders-of-magnitude speedups with the linear bound propagation-based framework when compared to traditional solvers. Extending this paradigm to global nonlinear programming requires addressing many challenges: a global constrained NLP solver must effectively exploit all, possibly unstructured, nonlinear constraints to improve the objective, whereas NN verification typically handles simple input box constraints over a well-structured NN and does not directly optimize an objective function. We address these challenges by fully exploiting the linear bounds produced by bound propagation: these linear bounds can be viewed as relaxations of nonlinear constraints and used to provide lower bounds, check infeasibility, and guide the search for a primal solution. In addition, we propose tighter linear relaxations for bilinear, quotient, and other commonly used nonlinear functions in NLP problems, and a projected augmented Lagrangian method tightly coupled to our dual solving procedure to produce primal solutions. Our method solves 421 of 505 bounded and continuous NLP problems in the GAMS and MINLPLib benchmarks under a 180-second limit, more than each of the six global solvers we compare with, including Gurobi and BARON (commercial), and SCIP (open-source). Sixteen of these problems are certified by none of the six global solvers; all of them contain exponential, logarithmic, or trigonometric terms, which are often challenging for traditional approaches. Project webpage is at https://verified-intelligence.github.io/GEAR.

comments
Accepted by NeurIPS 2026
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2611.10487 ↗

This paper develops a geometric (coordinate-free) stochastic model of a controlled point mass evolving on the unit two-sphere $\mathbb S^2$, together with the Fokker-Planck equation governing the probability density of the resulting stochastic process. The state manifold is the tangent bundle $\mathsf{T}\mathbb S^2$. The Levi-Civita connection of the round metric is used to construct the horizontal-vertical splitting of $\mathsf{T}(\mathsf{T}\mathbb S^2)$ and to convert the intrinsic second-order dynamics of the system into a first-order controlled vector field on $\mathsf{T}\mathbb S^2$. Endowing the tangent bundle with the Sasaki metric then permits stochastic perturbations to be introduced intrinsically and independently in horizontal, i.e., position, and vertical, i.e., velocity, directions. The corresponding infinitesimal generator is obtained in horizontal-vertical Hessian form. The probability density is defined with respect to the Sasaki Riemannian volume measure. The Fokker-Planck equation is derived intrinsically in both Stratonovich and Itô forms. In the Itô representation, a globally defined horizontal-vertical diffusion tensor yields a compact double-divergence Fokker-Planck PDE. No coordinates or embedded Euclidean representation of the sphere dynamics are used in the development. Numerical simulations illustrate the stochastic motion of a controlled particle ensemble on $\mathbb S^2$ toward an antipodal target configuration.

comments
15 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.10493 ↗

The port-Hamiltonian framework was built for mechanical and electrical systems, where the Hamiltonian is stored energy and the ports carry power. Over the past fifteen years it has spread to chemistry, cell biology, fusion plasmas, musical instruments, district heating, electricity markets, macroeconomics, predator-prey ecology, optimization algorithms and neural-network training. This review maps that spread. We classify each application by what its Hamiltonian really is: physical energy, a thermodynamic potential such as free energy or exergy, or an abstract storage function with no energetic meaning. The review keeps only sources whose bibliographic record we checked against Crossref. The picture that emerges is a continuum. Where a genuine thermodynamic potential exists, the theory is deep and constructive. Where the energy is borrowed, the framework still pays off through compositional interconnection and dissipation inequalities, but the work is younger and scattered. We close with a set of deliberately speculative research directions, including open port-Hamiltonian models of epidemics, opinion dynamics and supply chains, and learned port-Hamiltonian digital twins for structural health monitoring.

comments
9 pages, 1 figure, 1 table
fields
Optimization and Control
pdf ↗ page arXiv:2611.10695 ↗

We propose a new reinforcement learning (RL) framework for the continuous-time mean-variance portfolio optimization with unknown market parameters. To better reflect the impact of improved information of the unknown drift on the degree of exploration, we consider a novel randomization based on continuous-time stochastic filtering. Specifically, we construct a continuous-time analog to Thompson Sampling by treating the unknown drift as a random draw from a generalized sampling distribution parameterized by the filter's posterior mean and variance. The new learning objective measures the tradeoff between the wealth performance and the weighted KL divergence between the policy and the true Bayesian posterior, which transforms the classical feedback control into an information guided stochastic policy. As a result, the degree of exploration endogenously depends on the Reward-Biased Maximum Likelihood Estimation that decays with the shrinking filter's variance. This allows us to devise an efficient model-based learning algorithm in the mean-variance portfolio optimization with theoretical guarantee and superior learning performance.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10759 ↗

This paper investigates the discrete-time control problem of driving an agent to localize and circumnavigate an unknown target at a prescribed radius using bearing measurements. Discretizing existing continuous-time circumnavigation controllers can introduce steady-state orbit bias, even at sampling rates that preserve stability. To eliminate the sampling-induced orbit bias, we propose an adaptive compensator for a circumnavigation controller formulated directly in discrete time. Driven by the estimated agent-to-target distance, the proposed compensator dynamically learns the geometric correction required to achieve the desired circumnavigation radius. Unlike existing static correction methods, neither the proposed controller nor the compensator update explicitly uses the sampling interval. Exponential convergence is rigorously established using Lyapunov-based analysis. Simulation results illustrate the performance of the proposed algorithms.

comments
Submitted to the 2027 European Control Conference (ECC 2027)
fields
Optimization and Control
pdf ↗ page arXiv:2611.10762 ↗

Zeroth-order (ZO) optimization estimates descent directions from function values alone, which removes the activation storage required by backpropagation and makes it attractive for memory-efficient fine-tuning of large language models (LLMs). Existing low-rank ZO methods either parameterize the additive update through Euclidean factors with a non-unique representation, or restrict each finite-difference direction to be low-rank. In this work, we propose to constrain each additive update block to a fixed-rank matrix manifold while keeping the pretrained weights frozen, so the learned update remains rank-constrained throughout fine-tuning. On this geometry, we build a Riemannian ZO gradient estimator that projects a random matrix onto the tangent space, normalizes it to correct the scale mismatch induced by projection, and further propose Zeroth-order Riemannian Gradient Descent (ZO-RGD) and its smoothed variant, ZO-RGD-S. We show that the ambient finite difference matches its retracted counterpart, the normalized estimator recovers the Riemannian gradient in expectation, and ZO-RGD converges under trajectory-regularity conditions. Experiments on LLM fine-tuning tasks show that the proposed algorithms are competitive with strong forward-only baselines across model families and tasks, with gains in several settings.

comments
32 pages, 2 figures, 23 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.10792 ↗

Large language models (LLMs) are increasingly embedded in operational simulators to represent context-dependent human decisions, which opens new possibilities for simulation optimization. However, the LLM acts as a black box, so derivatives through its decisions are unavailable for gradient-based policy search. Finite difference estimation can avoid this requirement, but the required paired simulations that sample LLM actions independently often disagree, and such action switches persist under small perturbations, which inflates the gradient variance to order $c^{-2}$ for perturbation radius $c$. To control this variance, we develop a behavioral common random number framework. It first applies maximal coupling to the LLM's action distributions, preserving each simulation's behavioral law while making action switches as rare as possible, which reduces the variance bound to $O(c^{-1})$. It then applies first-switch conditioning, which averages over whether a switch occurs, together with an impact-aware extension that prioritizes influential switches. Under suitable stability conditions, both keep the variance bounded as $c$ shrinks. We further establish improved complexity bounds for projected stochastic approximation. Experiments on synthesized and LLM-embedded simulators confirm the theory and show substantial performance gains.

comments
31 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.10809 ↗

In contrast to HALLaR (Monteiro et al. 2026), which is designed for solving problems with a trace-bounding constraint, this work develops a new augmented Lagrangian (AL) method, HALLaR+, for solving large-scale semidefinite programming problems without such constraint. Even though a trace constraint which preserves an optimal solution can always be added, choosing its bound is challenging: a value that is too small may exclude all optimal solutions, whereas one that is too large may substantially increase the computational effort. HALLaR+ is also a low-rank inexact AL method but, in contrast to HALLaR, it doubles the penalty parameter at every AL iteration and its AL subproblems have unbounded feasible regions that are approximately solved by a relaxed unbounded Frank–Wolfe (RUFW) variant. Its analysis relies on a uniform bound on the diameters of the sublevel sets of all generated AL subproblems instead of a bounded feasible set. Assuming that a primal–dual KKT pair exists and the primal optimal set is nonempty and bounded, it is shown that HALLaR+ returns a $\varepsilon$-primal-dual feasible solution in $\tilde {\mathcal O}(\varepsilon^{-2})$ total RUFW iterations. Numerical results suggest that HALLaR+ has very promising competitive performance against current state-of-the-art solvers.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10812 ↗

We study the problem of controlling instability in the Vlasov–Poisson plasma systems, a fundamental challenge for nuclear fusion control. Motivated by the partial observability of plasma states in practice, we investigate imitation learning algorithms that learn from a fully-observable expert controller, but operate under macroscopic measurements. We theoretically establish a separation between online and offline imitation learning --- even a small behavior cloning error leads to error compounding that exponentially amplifies instability over time. By way of contrast, the online imitation learning loss can polynomially control the stability of rollout trajectories. We then propose a DAgger-style algorithm that learns the stabilizing controller under partial observability. Simulation results on a 1D Vlasov–Poisson system demonstrate that our algorithm can effectively stabilize plasma instabilities over longer time horizons than behavior cloning.

comments
Accepted at NeurIPS 2026. 43 pages, 9 figures, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.10870 ↗

Extending column-and-constraint generation (C&CG) for two-stage robust mixed-integer programs from the single-objective to the bi-objective setting is challenging: for a fixed first-stage decision and scenario, the second stage yields an entire nondominated set rather than a single objective value. We develop a C&CG algorithm that uses the hypervolume indicator - one of the most widely studied quality indicators in multi-objective optimization - to evaluate these sets and seeks a first-stage decision maximizing the worst-case hypervolume over a finite set of scenarios. To avoid the nonlinearities of an exact hypervolume formulation, we introduce a slab decomposition of the objective space that yields a linear mixed-integer master problem with an explicit bound on the discretization error. This bound enables a computable optimality-gap certificate and supports an adaptive algorithm that alternates between adding scenarios and refining the decomposition. We prove the correctness of the algorithm and establish sufficient conditions for its finite termination. Computational experiments on two-stage robust selection and assignment problems show that only a small number of scenarios need to be included in the master problem, even when the full scenario set contains 128 scenarios. Moreover, we identify the number of initial slabs as a key factor influencing the running time and develop a simple, instance-dependent rule for choosing the initial slab width that outperforms fixed choices on average for the selection problem and remains competitive for the assignment problem.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10892 ↗

Real-world deployment of federated learning (FL) requires resilience against adversarial clients and data privacy. Byzantine fault captures the worst-case behavior of adversarial clients, while differential privacy (DP) provides statistical guarantees against privacy loss. In particular, user-level DP guards a client's entire contribution and provides more realistic protection against information leakage. Despite intensive efforts, the minimax-optimal convergence bound of Byzantine-resilient FL with user-level DP remains open. We establish an information-theoretic lower bound for any Byzantine-resilient empirical risk minimization problem under user-level DP and heterogeneous clients. We propose ByzULDP, a central DP algorithm featuring a two-level momentum across the client and server. Client-side momentum mitigates stochastic gradient variance during robust aggregation. Unlike the fault-free case, naively combining non-linear Byzantine-resilient aggregation with central DP noise can be insufficient to guarantee convergence to a bounded neighborhood of a stationary point. Our key contribution is a server-side momentum that leverages a property specific to user-level DP, where privacy sensitivity depends on how client updates are constructed, to empower convergence. ByzULDP achieves the order-optimal convergence bound for strongly-convex objectives, with vanishing error terms decaying at the optimal $O(1/T)$ and $O(1/\sqrt{T})$ rates for strongly-convex and non-convex objectives, respectively. We corroborate our analysis with numerical experiments on real-world datasets across diverse privacy budgets.

comments
NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.10898 ↗

We consider the problem (P): ${\min}_{x\in \mathbb{R}^n}\, f(x)+g(x)$ under the Euclidean geometry, where $f$ is convex and $(M,ν)$-Hölder smooth on $\mathbb{R}^n$, and $g$ is proper, closed and convex on $\mathbb{R}^n$, admits a generalized linear minimization oracle (GLMO), and has bounded domain with diameter $D$. An first-order active-hull (AH) method has access to both the first-order oracle (FO) of $f$ and the GLMO of $g$, and outputs a point that lies in the convex hull of all the past GLMO returns. We propose a new first-order AH method for solving (P), which is based on our newly developed ``recentered homotopy smoothing framework''. We show that in the high-dimensional regime, this method achieves the optimal FO and GLMO complexties simultaneously for all $ν\in[0,1]$.

comments
17 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.10916 ↗

We study the standard form Integer Programming problem (IP) parametrized by the imbalanced circuit packing number. This number is $0$ if and only if $A$ can be transformed to a totally unimodular matrix by row operations, in which case (IP) is solvable in polynomial time. We show that if the constraint matrix represents a graphic matroid, (IP) is fixed-parameter tractable when parametrized by the imbalanced circuit packing number of the matrix. The proof combines an Erdős-Pósa property for edge-colored non-monochromatic cycles with a reduction to mixed-integer programming using few integer variables. In contrast, by a reduction from the parity potential problem, we show NP-completeness of feasibility of (IP) when the constraint matrix represents a cographic matroid, even if kernel of the constraint matrix is $2$-regular and imbalanced circuits pairwise intersect.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11046 ↗

In this paper, we develop a line-search quasi-Newton (LSQN) method for discounted Markov decision processes (MDPs). The method maintains an inverse model to approximate the inverse of the current policy Jacobian and refines it through an inner learning procedure that preserves existing secant conditions and achieves the prescribed accuracy in at most $n$ queries in exact arithmetic for an MDP with $n$ states, even when the initial inverse model is singular. A sign-based direction correction combined with an Armijo line search ensures monotonic decrease of the Bellman residual norm across policy changes without requiring a value-iteration fallback. We prove global Q-linear residual convergence and local Q-superlinear convergence of the value iterates from arbitrary finite initial value vectors and inverse models, without requiring a unique optimal policy. Numerical experiments show competitive performance against nine baselines, while public benchmarks demonstrate that the inner learning procedure typically requires far fewer than $n$ learning queries.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11073 ↗

We propose a sampling-based dual model predictive control (MPC) approach that combines belief propagation with parameterized feedback policy optimization. By sampling uncertain dynamics and process noise, we approximate the evolution of the hyperstate over the prediction horizon, allowing future control decisions to adapt to anticipated observations and belief updates. This enables the controller to account for the future value of information without explicit exploration incentives. We establish almost-sure uniform convergence of the sample-average objective to the finite-horizon expected objective over a compact policy class. The approach is specialized to Bayesian linear regression and evaluated on stochastic systems with constant and time-varying uncertain dynamics. We compare our approach to certainty equivalent control, and an MPC that optimizes over open-loop control sequences rather than feedback policies, demonstrating the benefits of our method in terms of both control performance and information gain.

comments
6 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.11088 ↗

Sparse hierarchical nonlinear programming (SH-NLP) based on the $\ell_0$-norm provides a powerful framework for integrated, efficient hierarchical decision-making in robot kinematic control, for example in the presence of a large set of possible end-effector candidate locations. While Sequential Sparse Hierarchical Quadratic Programming (S-SHQP) with interior-point method based SHQP sub-problem solvers exploit the hierarchical, sparse structure of such problems, they are less amenable to effective warm-starting between subsequent, coherent control steps. In this work, we formulate an Alternating Direction Method of Multipliers (ADMM) to efficiently solve related SHQP sub-problems. We introduce efficient substitutions for auxiliary variables representing $\ell_0$-norm surrogates. The solver efficiently handles separable decision functions by evaluating linear algebra expressions in the appropriate order. Results in large-scale kinematic and dynamic control show reduced computation times of up to 23.5% compared with a structure-exploiting interior-point method in low- to moderate-accuracy regimes. Furthermore, hierarchical decision-making is extended to whole-body dynamic control for humanoid walking, where the need for high-accuracy solutions is highlighted.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11090 ↗

In this paper, we are concerned with the local exact boundary controllability for the full compressible magnetohydrodynamic equations in a bounded domain in two and three space dimensions. We establish the local exact controllability around a constant equilibrium state. Our proof relies on the observability and controllability analysis of a suitably reformulated linearized system, together with a fixed point argument in weighted Sobolev spaces. The main novelty of this paper is to overcome the structural difficulties arising from the divergence free constraint and the strong coupling between the fluid and magnetic variables. To accommodate the solenoidal constraint, we introduce a magnetic potential formulation and develop a mixed coordinate approach.

fields
Optimization and Control, Analysis of PDEs
pdf ↗ page arXiv:2611.11105 ↗

Learning-based safety certification offers a promising route for verifying complex dynamical systems when explicit models are unavailable, but existing data-driven methods often scale poorly: they treat the system as a black box, rely on dense discretizations or Lipschitz bounds, and consequently suffer from sample complexity that grows exponentially with dimension. This paper shows that a common structural property of dynamical systems–monotonicity–can be used to break this curse of dimensionality. We develop a data-driven framework for robust safety verification and safe controller synthesis for unknown monotone systems using only simulator queries. Our main theoretical result proves that, for monotone systems with upper-closed unsafe sets, safety is completely characterized by the existence of monotone inductive barrier certificates. This structure reduces certificate verification over continuous state spaces to localized boundary checks over finitely many cells. To learn such certificates, we introduce Max-Monotone Networks, a monotone neural architecture with universal approximation guarantees for monotone functions. We then propose a training and refinement algorithm that, upon successful termination, returns formally valid neural barrier certificates and, under mild partition assumptions, requires only $O(n)$ simulator queries. Across high-dimensional benchmarks, including oscillator networks with up to $13{,}659$ states and traffic networks with $1{,}000$ states, our method certifies safety in regimes where prior approaches either do not converge or exceed memory limits. These results demonstrate that exploiting order structure can make neural safety certification both scalable and formally sound.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11119 ↗

Elements arrive one at a time, and after each arrival an algorithm holds a set of at most $k$ arrived elements. Its goal is a held set whose value under a monotone submodular function is close to the best value that $k$ arrived elements can achieve. The recourse of an update is the number of elements inserted into or removed from the held set, and we require it to be bounded independently of $k$ and of the number $n$ of arrivals. With evaluations only on sets of arrived elements and polynomially many of them, the best ratio a randomized algorithm can achieve is $2-\sqrt{2}\approx0.5858$. We show that seeing future arrivals raises the best ratio for polynomially many evaluations to $1-1/e\approx0.6321$, for deterministic and for randomized algorithms; no algorithm with polynomially many evaluations exceeds $1-1/e$, even when all elements are available at once. For every $\varepsilon>0$, a deterministic algorithm that sees the next $\lceil\varepsilon k/3\rceil$ arrivals keeps a set of value at least $1-1/e-\varepsilon$ times the optimum at every time, changes $O(\varepsilon^{-3})$ elements per arrival and makes $(n+1)^{O(\varepsilon^{-2})}$ evaluations. With the whole arrival sequence known in advance, a deterministic algorithm attains the same ratio with $O(\varepsilon^{-2})$ changes per arrival. A randomized algorithm with the same short lookahead makes $O(n^2k)$ evaluations, changes $O(\varepsilon^{-2})$ elements per arrival, and attains the same ratio in expectation at each fixed time. The main tool is a greedy algorithm with an explicit guarantee for each of its partial solutions combined with each initial segment of the known future arrivals. A second tool moves between two such solutions one element at a time while keeping the value high, and the deterministic algorithm times each move using upper bounds on the optimum from failed searches.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11124 ↗

Data centers can provide power flexibility through the scheduling of computing workloads, cooling systems, and batteries. Characterizing this flexibility online is useful but challenging because of the complex coupling among these resources. To address this challenge, this paper proposes a role-conditioned cross-head DeepSets reinforcement learning approach to characterize the power flexibility interval of a data center at each time step. First, we formulate the flexibility characterization problem as a Markov decision process that jointly models the three resources under a carbon budget, with actions specifying the upper and lower endpoints of the power flexibility interval. We then design DeepSets actor and critic that represent delay-tolerant workloads as an unordered set, enabling the proposed approach to accommodate varying numbers of workloads with a fixed number of trainable parameters. Finally, because maximizing the width of the flexibility interval requires moving its endpoints in opposite directions, we develop a role-conditioned cross-head decoder that distinguishes their respective roles while keeping them coordinated. Case studies on the Google Cluster Data show that the proposed approach provides more than twice the daily flexibility of the standard soft actor-critic method with nearly zero carbon overshoot while using 87.7% fewer trainable parameters.

comments
11 pages, 10 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.11155 ↗

We study a multistage scalar extension of Witsenhausen's counterexample in which controller 1 observes the initial state exactly, whereas every subsequent controller observes only a local noise-corrupted state and does not inherit its predecessors' observations, so that every nonterminal action both regulates the state and shapes the signal available to the next controller. Restricting the signaling controllers to linear policies while leaving the terminal controller unrestricted, we compute the exact value within this class and reduce the optimization to a deterministic dynamic program in a single propagated variance. The optimal intermediate gains are shown to have a shrinkage form, and the value functions of that program are concave. For two stages, the benchmark admits a closed form on a matching locus, where for small effort weights it has two distinct minimizers, and at the standard parameter instance on that locus a two-point nonlinear policy strictly improves upon it. For three stages, numerical continuation at a reference instance reveals three distinct local minima, and two values of the initial variance at which the lowest of the three changes abruptly. Under the terminal-cost normalization we further prove, for every finite horizon, that the optimal linear value becomes asymptotically equal to the signaling-idle benchmark as the initial variance tends to infinity.

comments
8 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.11181 ↗

We study a joint optimal dividend and voluntary liquidation problem for a company whose surplus follows a spectrally negative Lévy process and is subject to Omega-type regulatory termination. Dividend payments are modeled as a singular control, while voluntary liquidation is an optimal stopping decision with a state-dependent liquidation payoff. When the surplus falls below a regulatory solvency threshold, an Omega clock accumulates the time spent in distress and may terminate the firm before voluntary liquidation occurs. Under dynamic programming and continuity assumptions for an auxiliary Markov subproblem, we characterize its value as the smallest controlled stochastic supersolution of the associated quasi-variational inequality. We prove that any regular stochastic solution with a dividend barrier coincides with the value function over all admissible dividend and liquidation policies, and hence is unique within this class. Using $ω$-scale functions, we construct single-band, singleton, and no-liquidation candidates, establish sufficient conditions for global optimality, and give conditions under which these candidates supply the unique regular barrier stochastic solution. Brownian and Cramér–Lundberg examples illustrate how regulatory parameters affect dividend and liquidation boundaries and generate transitions between policy regimes.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11196 ↗

LLMs are powerful but incur substantial inference cost, which can be exploited by malicious users to induce overly long outputs, increasing latency and operational expense. Prior resource consumption attacks either coerce repetition or suppress the end-of-sequence token by lowering its logit value. However, with autoregressive, sampling-based generation, the search space grows exponentially with length and small deviations or unstable trajectories can derail optimization, limiting attack effectiveness and stability. To address this issue, we introduce Chatter Attack, a novel class of resource consumption attacks that optimize adversarial prompts to induce predefined short target phrases, thereby avoiding search-space explosion while still eliciting long responses. Specifically, Chatter Attack triggers self-doubt using short doubt-inducing phrases as the target, and sustains this state throughout generation via inference attention loss and global entropy loss. To extend to black-box settings, we further propose a novel Bayesian Prompt Optimization (BPO) method, which models the objective function globally by constructing a discrete token kernel, efficiently exploring the entire search space using prior information. Extensive experiments across multiple models and datasets show that our method outperforms baselines, with maximum response length increases to 31.5$\times$, and revealing practical resource-depletion risks for real-world LLM inference services.

comments
NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.11261 ↗

Stochastic first-order methods use sampled gradients to reduce per-iteration costs, but estimation errors can slow convergence and, in some settings, cause divergence. To improve gradient accuracy while retaining acceleration, we develop scalar and diagonal versions of VR-Adam-SHANG for smooth stochastic convex optimization. The methods combine STORM-type recursive estimation, Adam-style preconditioning, and SHANG's accelerated interpolation and correction, using at most two stochastic gradient evaluations per iteration without full-gradient refreshes. Under unbiased sampling, bounded variance, and mean-square smoothness of gradient noise, polynomial steps with prescribed initialization yield $O(1/K)$ mean-square gradient-estimation error and expected objective-gap bounds combining $O(1/K^2)$ initial-energy decay with an $O(1/\sqrt K)$ stochastic term after $K$ iterations. These guarantees require neither monotonicity of the preconditioner nor a uniform positive lower bound on its eigenvalues. The analysis also establishes polynomial-step convergence of projected nonrecursive Adam-SHANG-s, filling a gap in its original theory. Experiments compare the methods at matched sample-gradient budgets. In every tested setting, at least one of the two versions achieves the lowest mean terminal objective gap among all compared methods.

comments
27 pages, 5 figures
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2611.11277 ↗

We study optimal batching in a discrete-time Markovian system with Bernoulli arrivals and independent item abandonment. Each batch earns a per-item processing reward and incurs holding, abandonment, and fixed stopping costs. We formulate the batching decision as an optimal stopping problem and characterize optimal threshold policies under risk-neutral, risk-seeking, and risk-averse criteria. Under risk neutrality and the entropic risk-seeking criterion, the value function admits a forward-recursion representation, and the resulting reduced objectives are strictly unimodal. In the risk-seeking case, the objective is strictly discretely concave, yielding an explicit marginal-cost condition. For risk aversion, the unregularized entropic continuation branch may diverge, precluding standard fixed-point arguments. We therefore study a regularized robust surrogate formulated as a minimax problem with a relative-entropy penalty and capped likelihood ratio. We establish the existence of an optimal threshold policy and derive an explicit truncated-Gibbs worst-case distribution. We also study repeated batch clearing under both the long-run average and discounted criteria, for which the threshold objectives remain strictly unimodal. Numerical experiments examine threshold sensitivity to system parameters, costs, and risk preferences.

comments
59 pages, 6 figures. Submitted to Operations Research
fields
Optimization and Control
pdf ↗ page arXiv:2611.11281 ↗

Risk-sensitive optimal stopping is useful when poor stopping outcomes carry substantial costs, as in option exercise, sequential medical treatment, and safety-critical control. A natural objective is Conditional Value at Risk (CVaR) of the stopped reward. We develop a theoretical framework and algorithm for CVaR deep optimal stopping. The framework and algorithm address four difficulties in applying risk-sensitive reinforcement learning to optimal stopping: state augmentation, score-function pathology, blindness to success, and dependence on auxiliary networks. We isolate three structural properties of optimal stopping: single-point reward, action-independent dynamics, and sum-zero gradient. We exploit these properties to establish Markov optimality without state augmentation and derive a pathwise gradient estimator. Under bounded policy derivatives, the pathwise estimator has bounded second moments near deterministic policies, avoiding the divergence that can occur with score-function estimators. Building on this framework, we propose DIOS (Distribution-Informed Optimal Stopping) to address the remaining two difficulties. A per-time-step soft penalty combined with tail-level annealing mitigates blindness to success. Estimating the reward quantile directly from each batch removes the need for an auxiliary critic. For a fixed tail level, we establish a finite-time stationarity guarantee under regularity assumptions along the training iterates. Across the 24 main Bermudan max-call configurations, DIOS achieves the highest mean CVaR and the shortest recorded training time among the tested CVaR baselines.

comments
Neurips 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.11332 ↗

Broximal Gradient Descent (BroxGD), recently analyzed by Richtárik et al. (arXiv:2605.08850v1), is a projection-free sister method to Projected Gradient Descent (ProjGD) for solving $\min_{x\in\mathcal X}f(x)$, where $f:\mathbb R^d\to\mathbb R$ and $\mathcal X\subseteq\mathbb R^d$ is nonempty, closed and convex. The method performs local linear minimization over the feasible set intersected with a Euclidean ball and carefully prescribed radius. Like ProjGD, BroxGD enjoys linear convergence in the smooth strongly convex setting, with the same condition-number dependence. However, the known radius rule leading to linear convergence requires unavailable information and is therefore impractical. We develop an adaptive short-step variant of BroxGD which converges linearly for smooth convex functions under quadratic growth (generalizing strong convexity), without requiring unavailable information. We use $$z_k\in\arg\min_{z\in\mathcal X\cap\mathbb B(x_k,t_k)}\langle\nabla f(x_k),z\rangle,\quad x_{k+1}=\mathrm{Proj}_{S_k}(x_k-\nabla f(x_k)/L),$$ where $L$ is the smoothness constant of $f$, $\mathbb B(x,t)$ is the Euclidean ball centered at $x$ of radius $t$, and $S_k$ is the line segment connecting $x_k$ and $z_k$. The radius is updated by $t_{k+1}=\max\{\|x_{k+1}-x_k\|,t_k/2\}$. Projection onto $S_k$ requires only scalar clipping. Assuming an exact local linear minimization oracle, each update uses one oracle call. For any positive initial radius, we bound all oracle calls to reach objective error at most $\varepsilon$ and obtain $O((L/α)\log(1/\varepsilon))$ for fixed initialization, where $α=\min\{α_0,L\}$ and $α_0>0$ is the quadratic-growth constant.

comments
37 pages, 1 figure, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.11354 ↗

Single-loop minimax methods are appealing for modern machine learning, but standard stochastic gradient updates can be unstable and oscillatory under tightly coupled primal-dual dynamics, making performance notoriously sensitive to stepsizes. To fundamentally improve stability, we develop an orthogonal update framework tailored to minimax optimization, which applies updates along orthogonalized directions to reduce update anisotropy. However, orthogonalization reshapes the optimization geometry and makes coordinating primal-dual stepsizes even more delicate. To overcome this challenge, we develop AdaSGDA, which equips orthogonal updates with an adaptive stepsize rule driven by accumulated gradient norms. This mechanism automatically balances coupled primal-dual progress under orthogonalization, yielding an effectively parameter-free method for nonconvex-strongly-concave minimax optimization. We prove that AdaSGDA avoids problem-dependent tuning while attaining the state-of-the-art $\mathcal{O}\left(T^{-1/4}\right)$ convergence rate. We further propose AdaSGDA-VR, which incorporates a carefully designed variance reduction scheme and achieves the faster $\mathcal{O}\left(T^{-1/3}\right)$ rate. Extensive experiments demonstrate that our methods deliver competitive performance compared to existing minimax optimization methods.

comments
Accepted by NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.11387 ↗

Iterative refinement is a technique used to exponentially boost the precision of the solution to certain problems by solving a sequence of related problem instances. We study the size of the solutions arising from the sequence of problems produced by the iterative refinement algorithm when applied to linear optimization problems (LPs). We introduce a class of problems for which the size of such solutions can grow exponentially with the number of refinement iterations, and we show evidence that to avoid this undesirable behavior, a black-box LP solver would have to be \emph{lucky}---a concept introduced formally in this paper, by which we mean that the solver would have to return a solution of better quality than what is required by its termination tolerances. Furthermore, we show that the exponential scaling occurs if one uses a natural instantiation of the simplex algorithm using Bland's pivoting rule. We discuss the implications of our lower bound on the solution size for optimization algorithms whose running time depends polynomially on the solution size, such as quantum multiplicative weights update algorithms and quantum matrix games algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11419 ↗

Stochastic optimization relies on information whose statistical quality, availability, and computational cost can vary substantially. Heavy-tailed observations challenge concentration, compression distorts communicated vectors, and generalized smoothness changes how far an algorithm can move. This dissertation studies these difficulties through two linked design decisions: how to construct an informative search vector and how to convert it into a controlled step. We first develop high-probability methods under bounded central $p$-th moments, $p\in(1,2]$, allowing infinite variance when $p<2$. Clipped gradient, accelerated, extragradient, and gradient descent-ascent methods come with guarantees for stochastic minimization and variational inequalities, with smoothness and moment conditions needed only where the iterates lie with high probability. For composite and distributed problems, shifted and innovation clipping preserve the fixed point that direct clipping can disturb, while retaining linear speedup. We then characterize the value of richer stochastic information: lower complexity bounds quantify when same-sample gradient differences and stochastic Hessian information improve heavy-tailed nonconvex optimization, and normalized momentum variance reduction and Hessian-corrected momentum attain matching or near-matching in-expectation bounds. Separately clipping gradients and their correction terms yields batch-free high-probability methods. For compressed distributed optimization, we prove convergence of normalized error-feedback methods under generalized smoothness without a uniform gradient-dissimilarity assumption, and develop parameter-agnostic variants with five momentum estimators. Finally, we extend the estimator hierarchy to linear minimization oracles over arbitrary norm balls, recovering the Euclidean rates under estimator-specific generalized smoothness.

comments
PhD dissertation, King Abdullah University of Science and Technology (KAUST), 2026. 698 pages, 26 figures, 15 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.11459 ↗

We study how to adapt an existing distributed recommendation controller when local dynamics or objective weights change. Starting from a quadratic stability and cost certificate, we construct positive semidefinite corrections with finite spatial support and an explicit residual. A joint admission test allocates the available dissipation margin to these residuals and to interactions among changes and corrections, including pending updates. The test covers complete declared parameter ranges, allowing different operators to progress independently. For a fixed compatible batch, the corrections define a common storage that guarantees exponential stability and bounds the cost accumulated throughout deployment. When the admitted collection evolves, a reservation protocol preserves the certificate and a rate bound on storage increases ensures exponential convergence. Regional linear-quadratic regulator (LQR) design proposes new gain rows for the operators' own users, and a separate residual-based calculation can certify that the final gain lowers the expected cost. A recommendation-network example illustrates the tradeoff between repair depth, data access, and the benefits of deploying an update.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11462 ↗

AdamW is ubiquitous in deep learning, yet its behavior remains poorly understood. We analyze its dynamics through the lens of dynamical systems and show that AdamW admits an implicit fixed-point objective: its fixed points coincide with the stationary points of a constrained and regularized optimization problem. However, not all of these fixed points are stable under AdamW's dynamics, and stability depends sensitively on curvature, weight decay, and momentum parameters. Even in one-dimensional settings, equilibria may be unstable, and trajectories can exhibit persistent oscillations rather than convergence to them. We further extend the analysis to higher dimensions, deriving sufficient conditions for local stability of the continuous-time dynamics, and propose a convergent modification that preserves AdamW's fixed points. These results clarify what optimization problem AdamW is associated with, when its convergence can be expected, and how its dynamics could inspire more reliable optimizers.

comments
Accepted by NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.11526 ↗

Solving optimal classification tree (OCT) problems is computationally challenging because branching, routing, and leaf-assignment decisions must be optimized jointly. We develop an incumbent subtree column generation algorithm (ISCG-OCT) that exploits the recursive structure of classification trees. We first introduce a mixed set-packing and set-partitioning formulation (MSSF). We then construct a restricted master problem whose columns represent feasible subtree patterns. Unlike conventional dual-based column generation, our incumbent-centered pricing evaluates objective improvements relative to the current solution. We establish a recursive decomposition in which fixing a branching decision separates the remaining pricing problem into independent subtree subproblems, enabling exact dynamic programming. We also develop threshold-based variants that trade optimality guarantees for computational efficiency. Computational experiments on 27 benchmark datasets demonstrate competitive training and testing accuracy and substantial reductions in solution time on many instances. When initialized with a CART solution, ISCG-OCT can certify global optimality faster than warm-started mixed-integer programming solvers on selected instances. These results demonstrate how recursive pricing and structured subtree optimization can improve the computational efficiency of exact classification tree methods.

comments
48 pages, 6 figures, 10 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.11578 ↗

This paper analyzes methods for solving optimal resource/weapon allocation problems for the protection of critical infrastructure. It examines nonlinear discrete "Attacker-Defender" and "Weapon-Target Allocation" models, incorporating criteria based on the difference in expected losses and risk-related constraints. Methods are proposed for solving these problems by reformulating them as mixed-integer linear programming problems.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11585 ↗

This paper develops and analyzes a receding horizon control (RHC) framework for the stabilization of infinite-dimensional nonautonomous continuous-time systems with an infinite-horizon control objective. The considered stage costs penalize only a finite-dimensional component of the state and are therefore positive semidefinite with respect to the full state. Without imposing terminal costs or terminal constraints, we establish exponential stability and derive suboptimality estimates under suitable stabilizability and detectability-type assumptions, together with an online selection of the sampling times. In the linear case, we extend the framework to output-feedback RHC by combining it with a Luenberger-type state estimator based on finitely many sensors, and establish closed-loop stability using an augmented Lyapunov functional. The abstract state-feedback results are verified for a nonlinear Schlögl parabolic equation around an unstable steady state and, in the output-feedback setting, for nonautonomous linear parabolic equations. The control and observation realizations involve finite-dimensional actuation and sensing, including localized boundary controls and spatially localized state-penalization operators. Numerical experiments support the theoretical findings and illustrate the performance of the proposed RHC schemes.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11599 ↗

A complete canonical family of uniquely normalized, row-equivalent representatives of an $m\times n$ matrix is introduced and termed the family of Reduced Row Pivot Echelon Forms (RRPEFs). All RRPEFs represent the same row space, with the standard reduced row echelon form, renamed the Upper RREF (URREF), and the Lower RREF (LRREF) as its extreme members. A reformulation of Noether's Complementary Subspace Basis Theorem yields normalized bases of the row space that coincide with the nonzero rows of the corresponding RRPEFs. Constructively, each RRPEF is obtained by multi-index Gauss–Jordan reduction of a nonsingular transition submatrix. Factoring the admissible pivot-index sets by equality of their associated RRPEFs yields a quotient set in canonical bijection with the set of distinct RRPEFs. This bijection transfers the strict lexicographic order to the distinct RRPEFs and induces a finite chain from the URREF to the LRREF. The resulting structure gives rise to the Induced Lexicographic Canonical Algorithm (ILCA). Lexicographic confinement and singular-transition skipping restrict the candidate domain, whereas RRPEF reuse and scalar-equivalent transition bypassing avoid redundant Gauss–Jordan reductions while retaining the corresponding basic-solution tableaux. Strict lexicographic progression prevents cycling, while the traversal proceeds independently of objective improvement under degeneracy-induced stalling. ILCA terminates when a feasible tableau satisfies the standard optimality conditions and otherwise completes the finite traversal, including for Tucker- and Cunningham-type totally degenerate configurations.

comments
43 pages, one figure
fields
Optimization and Control, Functional Analysis
pdf ↗ page arXiv:2611.11608 ↗

Organizing control around events can reduce sensing and actuation demands while directly linking control decisions to the occurrence and timing of desired system behaviors. This paper proposes a novel event-centric model predictive control (MPC) framework that unifies event sensing, event prediction, and event regulation. Events define the feedback information, prediction horizon, and event-timing objectives, placing them at the center of predictive control design. The framework is developed for a scanning mirror system equipped with a baseline neuromorphic controller composed of spiking neurons that supports sparse actuation. The control objective is to achieve prescribed zero-crossing times and a desired scanning range while minimizing the mechanical energy transferred between the actuator and the mirror. A sampling-based algorithm is presented to obtain suboptimal solutions of the event-centric MPC optimization problem without requiring an explicit event-to-event prediction model. By grounding predictive optimization in events, the proposed framework opens a new direction for MPC design and its integration with neuromorphic control.

comments
8 pages, submitted to ECC27, this work is the first, foundational work that proposes Event-Centric Model Predictive Control (EC-MPC), a framework that combines model predictive control and neuromorphic control. Philosophy: predicting events but not trajectories; regulation without calibration
fields
Optimization and Control
pdf ↗ page arXiv:2611.11634 ↗

We study Minty set inclusion on a compact convex set $\mathcal{X} \subseteq \mathbb{R}^d$ with a set-valued operator $A : \mathcal{X} \rightrightarrows \mathbb{R}^d$. Under the Minty promise, the goal is to compute $x \in \mathcal{X}$ and $u \in A(x)$ such that $\sup_{y \in \mathcal{X}} \langle u, x - y \rangle \le \varepsilon$. Our approach is geometric and we work in the fixed-scale constrained-resolvent oracle model, where a query at anchor $a$ is assumed to return a resolvent point $x^+$ together with the Yosida vector $g_η(a) = (a - x^+)/η$. We prove that each oracle response yields a sharp dichotomy: either the returned point provides an $\varepsilon$-SVI certificate, or the Yosida vector defines a strict separating normal for the Minty set. Thus, a single black-box resolvent query supplies either a certified candidate solution or a valid geometric cut. Combining this separation principle with the ellipsoid method, we obtain RESOLVENT-ELLIPSOID, an algorithm that computes an $\varepsilon$-SVI in $\mathcal{O}\!\left(\operatorname{poly}(d, \log(1/\varepsilon))\right)$ black-box oracle calls to the fixed-scale constrained resolvent. For monotone inclusions, our algorithm gives, to our knowledge, the first $\mathcal{O}\!\left(\mathrm{poly}(d, \log(1/\varepsilon))\right)$ black-box guarantee in the fixed-scale resolvent model.

comments
The Fortieth Annual Conference on Neural Information Processing Systems (NeurIPS) 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.11691 ↗

We propose a level-set method for shape and topology optimization of Stokes–Darcy flows with Beavers–Joseph–Saffman interface coupling. We formulate the Stokes–Darcy system with BJS interface conditions using a level-set representation and establish existence and uniqueness of its solution. We further prove existence of minimizers for the viscous-energy minimization and least-squares inverse problems within this framework. Continuous Fréchet differentiability of the control-to-state map is proved, and objective derivatives are derived using an adjoint approach. A reaction–diffusion evolution scheme combined with mixed finite elements is developed to find the optimized interface and accommodate topology changes. Two- and three-dimensional numerical experiments verify the derived sensitivities and demonstrate the effectiveness of the method in minimizing viscous energy dissipation and reconstructing interfaces from partial and noisy velocity observations.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11769 ↗

We study how to combine a human binary call (a referee's offside or onside decision) with an AI numerical measurement (VAR's estimate of an attacker's position relative to the offside line). We derive an explicit maximum-likelihood rule that determines when the referee's call should stand and when a conflicting VAR measurement should overturn it. Our model treats the true offside margin as fixed and unknown and assumes independent additive Gaussian errors in the human's perception and the AI measurement. When both errors have zero means and known standard deviations $σ_H$ and $σ_{AI}$, respectively, the reversal threshold is $\sqrt{2/π}\,σ^2_{AI}/σ_H$. An onside call is overturned precisely when VAR's measured offside margin exceeds this threshold—not merely because VAR places the attacker beyond the offside line. We also derive the rule when either source has a systematic bias. We prove that the maximum-likelihood estimate of the true margin exists and is unique, while the final binary decision requires only a threshold comparison, without computing that estimate numerically. We illustrate the rule through numerical examples and show how to estimate the error parameters from calibration data. The same analysis applies beyond soccer to binary classification problems in which a human call and an AI measurement satisfy the stated model. This paper is intended for educational purposes: we aim to illustrate how undergraduate students and advanced high school students familiar with basic probability and calculus can investigate research questions in AI and its applications.

comments
This paper is intended for educational purposes
fields
Optimization and Control
pdf ↗ page arXiv:2611.11819 ↗

This paper studies the problem of guiding an agent to localize and circumnavigate a stationary target at a prescribed radius using bearing measurements. Direct implementation of a classical scalar signed-distance estimator requires explicit evaluation of bearing rate signals that can be difficult to obtain in practice. To eliminate this dependence, we propose a bearing-rate-free (BRF) realization of the scalar estimator that recovers the signed-distance estimate algebraically, without numerical differentiation or a separate filter for estimating the bearing rate. We prove, under consistent initialization, that the proposed BRF realization inherits the guarantees previously established for the classical realization, including exponential convergence of both the target estimation error and radial tracking error, as well as the agent-target collision avoidance. Simulations show that, with noise-free bearings, the BRF realization achieves numerical accuracy comparable to that of an exact-bearing-rate benchmark and, at the higher noise levels tested, exhibits smaller radial tracking oscillations than the backward difference implementation of the classical estimator.

comments
Submitted to the 2027 European Control Conference (ECC 2027)
fields
Optimization and Control
pdf ↗ page arXiv:2611.11948 ↗

We study the projected decentralized stochastic subgradient (PDSG) method for minimizing the average of convex, possibly nonsmooth local objectives over a common closed convex constraint set and a fixed connected undirected network. We focus on the finite-time expected suboptimality of the last local iterate generated at each node, which is the actual output locally available without time averaging or network averaging. Under the standard stepsizes $α_t=α/\sqrt{t}$ and $α_t=2/(μt)$, we establish $\mathcal{O}(\log T/\sqrt{T})$ and $\mathcal{O}(\log T/T)$ last-local-iterate rates for PDSG when each local objective is convex and the aggregate objective is strongly convex, respectively. To eliminate the logarithmic loss, we introduce a general horizon-dependent stepsize framework, termed cooldown stepsize, that combines a base stepsize with segmentwise scaling over a multistage partition and includes the dyadic construction (Jain et al, SIAM J. Optim., 2021) as a special case. For adapting to decentralized settings, we propose a long-range variation condition to make the stepsize schedule compatible with network contraction. Under this cooldown stepsize, we obtain $\mathcal{O}(1/\sqrt{T})$ and $\mathcal{O}(1/T)$ last-local-iterate rates for PDSG in both problem classes, matching the optimal centralized dependence on $T$. Experiments on a lower-bound instance and constrained hinge-loss problems illustrate the predicted terminal behavior of local iterates and the control of consensus error under the cooldown stepsize.

comments
25 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.11992 ↗

The online assimilation of data and the application of controls are essential ingredients of the digital twin paradigm. In this paper, we formalize the online interaction between the physical process and its virtual digital representation in the setting of continuously arriving data from the physical process and a receding horizon virtual planning process, which provides the control for the physical process. Our mathematical formulation relies on a mean field representation of the data assimilation process as well as a mean field Pontryagin minimum principle for the optimal control problem. Such mean field formulations are computationally attractive because they allow for simultaneous implementation in terms of Hamiltonian interacting particle systems. A more detailed discussion is included for the ensemble Kalman-Bucy filter in combination with affine approximations of the receding horizon control laws. This paper sets out the mathematical framework, while a computational study is left for future research.

fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2611.12001 ↗

Controllability allocation scores (CASs) assign weights to virtual input channels without specifying how interventions should be implemented. This paper provides an operational interpretation through randomized finite-duration interventions with prescribed, possibly candidate-dependent waveforms. Selection probabilities are fixed before a mean-output target is specified, while waveform amplitudes are optimized after the target is revealed. We derive the unique minimum expected-energy amplitude policy and formulate volumetric and weighted average-energy allocation criteria. We also establish a finite-trial mean-output error bound and show that waveform-based weighted AE-CAS minimizes an upper bound on the target-averaged mean-square error. We establish uniform convergence of normalized waveform-response Gramians and show that accumulation points of optimal allocations solve the limiting problem. With uniform timing, equal positive waveform efficiencies recover the original CAS in the short-duration limit, whereas unequal efficiencies yield waveform-weighted limits. Under the former conditions, the limiting error bound is proportional to the original weighted AE-CAS objective. For common waveforms, we further establish an exact finite-duration correspondence with the original full-state V-CAS under uniform timing.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12089 ↗

The paper investigates the model structure of the event-based mixed-integer programming formulation of the Dial-a-Ride Problem. We find that the design of events allows introducing new valid inequalities on the ride times. Time progression is modelled using Big M constraints which lead to a weak LP relaxation and deteriorate the solution process. The newly introduced valid inequalities deal with this issue and allow reducing the computation times by up to 99% for benchmark instances (a-X* instances) in comparison to the state-of-the-art event-based model formulation. To evaluate the potential of the new valid inequalities, we increase the time windows on the benchmark set by another 15 minutes and evaluate the model on the same instances with a time-related objective function where the Big-M-influenced time variables directly occur in the objective function. Even for the large time windows only two instances could not be solved to optimality within two hours (final gaps of at most 0.8%). With the time-oriented objective the largest average computation time with our valid inequalities was 74 seconds.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12134 ↗

Within control theory, a question of great interest is to understand when a stabilizing feedback exists. Building upon Krasnosel'skiĭ and co-workers, necessary conditions for the existence of a continuous stabilizing feedback have been pioneered by Brockett and Coron, providing so-called adversarial and homological conditions, respectively. Kvalheim recently generalized their conditions from equilibria to compact attractors and—in line with earlier work by Coron—showed that when a control system can be identified with a vector bundle, the homology condition is stronger, that is, the homology condition implies the adversary condition. Kvalheim also showed that this comparison breaks when extending the case of vector bundles to fiber bundles. In this work, we propose and characterize an appropriate adversarial condition for control systems represented by fiber bundles. The homology condition, on the other hand, is already well-defined, showcasing its general applicability. With the generalized conditions at hand, we show that by appropriately relaxing the regularity of the feedback under consideration, that is, by allowing for mild discontinuities, the homology condition implies the adversarial condition for fiber bundles. Thereby, in this work, we extend these earlier comparative results.

comments
18 pages, 1 figure. Submitted
fields
Optimization and Control
pdf ↗ page arXiv:2611.12143 ↗

A port-Hamiltonian system with energy dissipation can be modelled by connecting a larger, non-dissipative system with a so-called closure relation. We study whether approximative controllability of the dissipative system is characterised by the same property of the larger system. The answer is negative in general, but positive for sufficiently well-structured systems - this is our main result. As a simple illustration, we show how approximate controllability of a wave equation implies approximate controllability of a heat equation.

fields
Optimization and Control, Functional Analysis
pdf ↗ page arXiv:2611.12145 ↗

We study the geometric meaning of relative smoothness on dually flat manifolds and its implications for the convergence analysis of mirror descent. Our main result yields one-sided counterparts of the classical Levi–Civita characterizations of Lipschitz Riemannian gradients, each equivalent to relative smoothness. We further investigate the stationarity of mirror descent iterates for possibly nonconvex objectives and show that relative smoothness alone does not guarantee convergence of the Riemannian gradient norm to zero. We identify a one-sided condition on the cubic tensor that ensures such convergence and yields an $O(1/N)$ stationarity bound. Examples based on the negative entropy potential illustrate the role of metric variation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12182 ↗

Cooperative tracking of multiple moving targets requires a swarm to continually adjust its deployment. Existing methods often rely on repeated agent-target reassignment or updates to position-dependent partitions, which can complicate coordination as swarms grow. This motivates us to seek an approach with a lighter coordination burden. Specifically, we formulate multi-target tracking as a time-varying density-tracking problem, with the targets' tracking and sensing demands encoded in a task-demand density. From an Onsager-type variational formulation, a closed-form mean-field feedback law is derived to make the swarm density track this evolving density, and the resulting closed-loop system is shown to be well posed. Under the stated assumptions, a Kullback–Leibler (KL) divergence analysis establishes exponential KL convergence under ideal feedback and conditional robustness to feedback mismatch under estimated. Numerical experiments demonstrate effective tracking of multiple moving targets and show smaller density errors at comparable applied control energy compared with an existing density-tracking feedback method.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12230 ↗

The heavy-ball method with a constant step size and a constant momentum parameter accelerates gradient descent on quadratics, but no choice of the two parameters does so on the class of smooth strongly convex functions. We determine how much faster than gradient descent it can be made on this class. Writing the best worst-case rate over all tunings as $1-c(κ)/κ$, where $κ$ is the condition number, we prove that $c(κ)$ tends to $8$ in every dimension of two or more. The lower bound on the rate holds for every tuning, because a tuning that is faster than $1-8/κ$ on quadratics follows a slowly decaying spiral on some function of two variables. The matching upper bound comes from an explicit tuning, with nearly the momentum of Polyak's tuning and a step size about $\sqrtκ/8$ times smaller, and from a Lyapunov function whose positivity is verified in exact arithmetic. Optimally tuned heavy-ball is therefore asymptotically four times faster than gradient descent on this class.

comments
41 pages, 1 figure. Code and exact certificates: https://github.com/marcoshernanz/heavy-ball-optimal-rate
fields
Optimization and Control
pdf ↗ page arXiv:2611.12310 ↗

Over the past ten years Tensor Network Kernel Machines have enabled efficient nonlinear system identification through the use of low-rank tensor networks. The goal of this article is to provide the reader with a basic understanding of this model class in terms of its two defining properties. Furthermore, both the optimization and regularization of such models are discussed, together with recent developments and starting points for further exploration.

comments
This work has been submitted to IFAC for possible publication
fields
Optimization and Control
pdf ↗ page arXiv:2611.12326 ↗

In this paper, we show how the recent analysis of (sharp) strong convexity properties of the Kantorovich functional by the third author can be used to establish new global quantitative stability estimates for Wasserstein barycenters and their entropic regularizations with respect to perturbations of the population distribution. For classical Wasserstein barycenters, we improve the state-of-the-art Hölder continuity exponent with respect to the $\mathcal{W}_1$ metric from $1/6$ to $1/4$, while drastically weakening the assumptions on the population distribution. We also provide an example which shows that the exponent $1/4$ cannot be improved. Motivated by computational considerations, we also analyze regularizations of Wasserstein barycenters with \emph{outer} and \emph{inner} entropic penalizations. For outer entropic barycenters, we establish novel higher-order stability results and in particular give a quantitative bound on relative Fisher information. Another contribution of our paper is a strong convexity estimate for an entropic version of the Kantorovich functional via soft Legendre transforms, enabling us to extend our stability results to \emph{doubly} entropic barycenters, as introduced by Chizat.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12497 ↗

This paper investigates the asymptotic behavior, as the Hilbert space dimension tends to infinity, of the state-to-state control time of single-input bilinear quantum systems whose control operator is drawn from an isotropic (unitarily invariant) random ensemble. Relying on deterministic graph-theoretic bounds, namely star cuts of the interaction graph for the lower bound and spanning trees for the upper bound, and on integration over the Haar measure, we derive high-probability lower and upper bounds on the control time, expressed in terms of the empirical spectral variance and of the relative concentration of the drift spectrum. Whenever the spectrum grows fast enough (for instance polynomially with an exponent larger than 3/2, geometrically, or super-exponentially), the upper bound vanishes and the control time tends to zero in probability: in these cases, enlarging the Hilbert space constructively speeds up control.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12502 ↗

Multi-objective design-decision optimisation (MODO) problems contain negotiable acceptability limits and non-negotiable feasibility constraints. Hard constraints define the feasible design space, whereas actors may reconsider acceptability limits through deliberation and compromise. Relaxing such limits is a preference judgement: penalties or violation measures do not necessarily represent how actors value departures from initial requirements. This paper introduces a preference-based constraint-handling framework. For negotiable limits, preference functions model how actor preference changes with relaxation, allowing the preferred design and acceptable degree of relaxation to be determined through the same aggregation process. Approach 1 represents relaxation as an additional objective and search variable; Approach 2 incorporates it into the preference function of the affected criterion. When constructed consistently, both yield the same best-fit-for-common-purpose solution but differ in complexity and computational effort. The framework addresses stalemate problems, where relaxation is required to recover an acceptable solution, and non-stalemate problems, where modest relaxation may reveal a better design. Hard feasibility constraints remain fixed, and infeasible designs remain inadmissible. A feasibility-guidance function supplies IMAP-IGS with graded information on scaled violations, guiding the search towards difficult-to-reach feasible regions. Every feasible design takes precedence over every infeasible design, and the final recommendation is selected exclusively from the feasible set through A-FINE preference aggregation. The framework integrates acceptability negotiation, feasibility guidance, and design optimisation without conflating their meanings, while preserving preference consistency and decision validity.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12503 ↗

Alternating minimization is a standard tool for optimization problems with two coupled variable blocks. Its cost is dominated by the inner subproblem solvers, which rarely have a closed-form solution. In this paper, we propose to learn an inexact alternating scheme in which neural networks approximate the subproblem solution at each iteration. For convex problems with quadratic couplings between the variable blocks that satisfy a quadratic growth condition, we derive a worst-case bound on the optimality gap that exposes the per-iteration error that each network is trained to minimize in a greedy fashion. Combining the bound with a PAC-Bayes argument, we obtain a fixed-horizon, high-probability bound on the expected optimality gap over the distribution of problem instances. We apply the learned scheme to robust matrix completion and low-dose CT reconstruction with dictionary regularization where we achieve a 5x-13x speedup over the inexact first-order baseline at matched accuracy. A brief end-to-end fine-tuning stage extends this up to 30x and outperforms other learned schemes. The code is available at https://github.com/paulhausner/learned-alternating-minimization.

comments
Accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.12544 ↗

We study an optimal actuator design problem for infinite-horizon LQ control problems governed by parabolic equations. The control acts only on a small measurable subregion of the spatial domain, and the objective combines the infinite-horizon control value with a cost for the actuator region. Using the Riccati representation of the value function, we derive a comparison identity for two actuator supports and obtain an exact expansion of the objective. This leads to a topological derivative with respect to local changes in the support. We prove a localized Riccati sensitivity estimate to control the remainder and show that the infinite-horizon term in the derivative can be computed by solving a Lyapunov equation. This yields a computable support-update algorithm with a measure-controlled Armijo search. Under explicit uniform remainder and admissibility assumptions, its first-order stationarity defect tends to zero. Numerical experiments illustrate these results.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12553 ↗

As data centers make the load on the power grid fluctuate faster, frequency regulation grows more valuable. Battery energy storage systems (BESSs) are well suited to provide frequency regulation, but providing this service speeds up aging, especially during operation at extreme state of charge (SoC). In the PJM interconnection, the grid operator supplies a regulation signal that a participating BESS is expected to follow, within a capacity that it must bid before the signal is known. Accordingly, we decompose the degradation-aware frequency regulation problem into a bidding layer and an operations layer. For bidding, we propose an adaptive strategy, assuming perfect tracking in which the bid depends on the SoC expected at the start of the bid period by means of choosing basepoints. For operation, the BESS further protects its battery by deliberately giving up a perfect performance score, to keep its SoC away from the extremes. On the PJM regulation signal and prices of 2023, adaptive bids lengthen the battery life by $31\%$ against bidding full capacity, for $2.2\%$ of the revenue. Giving up a perfect score in operation lengthens the battery life of constant bids by $10\%$ to $27\%$, at a change in revenue of at most $0.2\%$.

comments
Extended version of IEEE PESGM submission
fields
Optimization and Control
pdf ↗ page arXiv:2611.12555 ↗

Linear time-invariant (LTI) relaxation systems are characterized by a completely monotone impulse response. This paper proposes an extension of this property to nonlinear systems: a system is said to have completely monotone memory if a positive increment in the past input leads to a completely monotone increment in the future output. We show that this property constitutes a strong form of monotonicity, while also imposing stability constraints that closely resemble fading memory, contraction, and incremental stability. We also show that completely monotone memory is equivalent to classical relaxation for LTI systems and to a combination of monotonicity and stability for a class of scalar state-affine systems. Finally, we illustrate the relevance of our framework to the gating dynamics of conductance-based models.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12559 ↗

We study the property of differential flatness for networks of identical flat agents coupled through a consensus protocol, where a single exogenous input acts on one agent and the output of another agent is measured. We distinguish whether the network admits a flat output at all from whether the measured task output is a flat output. For the former, we show that flatness at a synchronized equilibrium requires controllability of the Laplacian leader–follower pair, which is also sufficient for linear agents but not for nonlinear ones. For the latter, we show that the relative degree of the task output is determined by its graph distance to the input node, so that it is a flat output if and only if the graph is a path with the input and output nodes at its ends. Numerical examples illustrate how flatness enables finite-time transitions between consensus configurations through a single input.

comments
Submitted to the European Control Conference (ECC) 2027
fields
Optimization and Control
pdf ↗ page arXiv:2611.12562 ↗

Monetary quantities are not preferences. Cost is an object-related system performance; value-for-money is an actor's subjective evaluation of it. Monetisation embeds trade-off information: its conversion coefficients express valuations and determine how heterogeneous performances compensate one another. Cost-benefit analysis, even net present value, yields quantities of money, not the preference value actors attribute to them. This creates a monetisation paradox. Cost enters a multi-criteria problem as one performance among several, but money is then elevated into the universal representation of all others, creating representational dominance. The problem collapses into a single-criterion one in which every performance acts only through its imposed monetary equivalent. Cost-function scalarisation does not resolve this by substituting points, normalised scores, losses, or penalties: these transformations and their weights fix preference directions, intensities, and trade-offs, so they are implicit preference models, yet are treated as technical constructs rather than measured and validated. A well-defined scalar optimum is therefore not necessarily a decision-valid multi-criteria outcome. Numerical commensurability does not establish preference commensurability. Decision validity requires heterogeneous performances to be transformed into actor preferences in a unified preference domain. Preference is relational and contextual, yet can be represented on an affine scale. Preference Function Modelling and the Linear Preference Space provide the commensurability required for valid aggregation. The decision criterion should thus maximise aggregated actor preference over the feasible and acceptable design-decision space, not monetised quantities or scalarised scores.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12577 ↗

We study projection-based reduced-order models that exactly retain specified input and output interfaces. Admissible projections are characterized geometrically: the retained subspace must contain every input and output direction, which fixes the minimum order. The reduction error factors into input-coupling, internal-dynamics, and output-coupling systems, giving a submultiplicative ${H}_\infty$ bound; for positively dominated factors the ${H}_\infty$ error equals a dc gain computable from linear solves. Strict dissipativity certifies the stability of every orthogonal reduction, and a Hankel singular value bounds the optimum a posteriori. These results motivate sequential graph-coarsening heuristics for networks. On a 65,566-state chip thermal network, interface-preserving coarsening yields sparse, positive lumped models that are more accurate than Kron reduction of the same interface at every order, with far fewer edges; balanced truncation is more accurate but destroys the network structure.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12583 ↗

Explicit multiparametric solutions provide analytical feasibility and design-space descriptions after elimination of adjustable variables. R-functions convert these descriptions into fields whose nonnegative regions represent feasible or robust designs. The principal contribution is the analytical composition of independently derived design spaces through union, intersection with engineering restrictions, and exclusion of prohibited regions, without repeating the underlying multiparametric elimination. A support-function construction supplies the robust design fields used in this composition. A two-parameter example demonstrates how alternative configurations, a manufacturing restriction and an exclusion combine into one admissible field. The resulting representations also support geometric interrogation of external boundaries, internal interfaces and limiting uncertainty contact, illustrated by a four-parameter heat-exchanger network. Explicit MPC offers a potential further application.

comments
8 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.12596 ↗

We prove converse Lyapunov theorems for input-to-state stability (ISS) of a broad class of infinite-dimensional systems applicable to evolution equations in Banach spaces, boundary control systems, and delay systems. To this end, we employ a novel method that does not require constructing auxiliary closed-loop systems. We start by showing that ISS of a control system implies uniform global asymptotic stability of the same system with respect to trajectory-dominated inputs. Then, under an additional regularity requirement, we prove that an ISS Lyapunov function can be constructed. Based on our general result, we prove that for linear systems with unbounded $\infty$-admissible operators, ISS is equivalent to the existence of a Lipschitz continuous coercive ISS Lyapunov function.

fields
Optimization and Control, Dynamical Systems
pdf ↗ page arXiv:2611.12601 ↗

Metaheuristic algorithms (MAs) are widely used to solve complex optimization problems, but their computational costs can become substantial as population size and problem dimensionality increase. This paper presents FEALPy.OPT, an open-source Python framework for metaheuristic optimization built on the FEALPy computational infrastructure. It integrates a unified optimizer abstraction with multi-backend tensor computation, supporting NumPy and PyTorch backends on CPU and GPU platforms. To evaluate its computational performance, five metaheuristic algorithms are tested on ten benchmark functions under three problem scales, with population sizes ranging from 100 to 10,000 and dimensions from 30 to 100. The results show that NumPy/CPU achieves the shortest average runtime for small-scale problems, whereas PyTorch/GPU becomes increasingly advantageous as the problem scale grows. For large-scale problems, PyTorch/GPU is approximately 9.50 times faster than PyTorch/CPU and 32.96 times faster than NumPy/CPU. These findings demonstrate the value of multi-backend and multi-platform support for improving the computational flexibility and efficiency of metaheuristic optimization.

comments
15 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.12610 ↗

We study infinite-horizon discounted Markov decision processes with multiple cost objectives and finite state and action spaces. We consider the set of value functions generated by randomized Markov policies, where each function describes the expected discounted costs from all initial states under a single policy. We establish a set-valued Bellman equation and characterize this set as the greatest fixed point of the associated Bellman operator. We also show that choosing an attainable cost vector separately for each initial state can produce a function that no single Markov policy realizes. Nevertheless, the attainable costs at individual states satisfy their own Bellman recursion. These results provide a dynamic programming and fixed point framework for multi-objective Markov decision processes.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12663 ↗

Wolfe's method computes the point of minimum Euclidean norm in the convex hull of finitely many points. The method is parameterized by an insertion rule and it has been an open problem whether Wolfe's original rule guarantees a polynomial number of iterations (De Loera, Haddock, and Rademacher; STOC'18). We resolve this question by proving an exponential lower bound. In fact, we establish a tight connection to the simplex method for linear programming that allows us to transfer many lower bounds for simplex pivot rules to corresponding insertion rules of Wolfe's method. These include not only Wolfe's linopt rule via Dantzig's pivot rule, but also many other classical, randomized and history-based rules. As a corollary, we obtain the first exponential example for the Lawson-Hanson algorithm for nonnegative least squares, as well as PSPACE-hardness of deciding whether the linopt rule ever uses a given point.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12680 ↗

Global minimization of multivariate polynomials is computationally difficult in general, and nonnegativity does not necessarily imply a sum-of-squares (SoS) representation. We show that adding sufficiently strong Euclidean regularization to a polynomial provides a general mechanism for overcoming such challenges. Namely, for any multivariate polynomial $P$ of degree at most $p$ with a nonzero linear coefficient, and any even integer $2d>p$, we prove that $m_σ(s)=P(s)+\fracσ{2d}\|s\|_2^{2d}$ is SoS exact for all sufficiently large $σ$. Furthermore, the shifted polynomial $m_σ-\min m_σ$ admits a positive-definite Gram representation on appropriately-shifted nonconstant monomials. Consequently, the global minimum and minimizer can be recovered exactly by a single degree-$d$ semidefinite programming (SDP) representation, whose size is polynomial in the dimension for fixed $d$, without requiring higher levels of the SoS hierarchy. The proof develops a degree-independent mechanism based on the Bregman remainder of the regularizer: its strict Gram margin absorbs the lower-degree polynomial perturbations. We further establish an analogous exact SDP regime for polynomial optimization over sufficiently small Euclidean balls, connecting large regularization with small-radius trust-region problems. Finally, we investigate how the algebraic structure of the regularizer governs the existence of a strict Gram margin, extending the mechanism beyond Euclidean norms while identifying limitations of coordinate-separable regularization.

comments
33 pages, 1 figure
fields
Optimization and Control, Algebraic Geometry, Numerical Analysis
pdf ↗ page arXiv:2611.12697 ↗

Policy-gradient methods for adaptive linear quadratic control improve the feedback gain of an unknown plant online by gradient-type steps computed from closed-loop data. A recent framework of such methods, policy-gradient adaptive control (PGAC), takes one gradient-type step per sample, which its indirect form computes from an estimated model and its direct form directly from the data. Because data generated by a fixed linear feedback cannot identify the plant, PGAC adds a probing perturbation to the input and leaves its covariance as a design parameter. We study the adaptive LQR problem through a KL-regularized formulation, in which the probing is the randomness of a Gaussian policy kept close to a Gaussian reference policy, so that the cost of the probing is part of the objective. One policy improvement of this formulation gives a gain update together with a probing covariance. We show that, for suitable references centred at the current gain, this gain update is exactly PGAC's Gauss-Newton or natural-gradient update with any step size below a bound. We repeat this policy improvement, each time against a tempered copy of the current policy, and refer to this scheme as KL-regularized policy iteration (KLPI). On a known plant and with tempering, the cost of KLPI's gains converges linearly to the optimal cost, and the probing covariance keeps a floor proportional to the regularization weight. On an estimated plant, under conditions like PGAC's (small updates and sufficiently informative data), the closed loop stays stable, the cost of the gains converges linearly up to a bias, and the probing covariance again keeps this floor. In simulations at equal probing cost, the shape of KLPI's probing covariance, which PGAC can adopt, lowers the extra cost caused by suboptimal gains on nearly all tested plants, whereas KLPI's use of past iterations in its gain update changes this cost little.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12741 ↗

Exact score-based causal structure learning supports explicit structural constraints and optimisation certificates, but its branch-and-cut search can be computationally demanding. We augment exact causal structure learning methods with an upper bound on the maximum clique size of the learned undirected skeleton, enforced at integer candidates through lazy cycle and clique constraints. On static linear-Gaussian Erdős-Rényi and scale-free DAGs, we evaluate callback order, alternative clique-cut policies, incumbent repair, fractional separation, and Big-M bounds. We report causal-recovery metrics jointly with optimality gaps, primal and dual bounds, node throughput, MIPSOL events, and callback cost. Two variants receive particular attention: B3 selects the most violated minimal (k+1)-clique inequality at each callback, whereas C3 repairs an infeasible integer candidate by deleting violating edges and refitting affected regression columns using QR-based least squares. The results do not indicate that clique constraints uniformly accelerate optimisation. However, their benefit depends on graph density, sample size, and cut-management policy, while large collections of correlated constraints can reduce node throughput. Tighter valid Big-M bounds reduced the fixed-budget optimality gap in most tested settings, without necessarily changing SHD or F1 at a fixed time limit. These findings characterize the computational trade-offs of clique-constrained exact causal learning, and identify selective separation and incumbent repair as promising directions.

comments
18 pages, 8 figures, 8 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.12747 ↗

Maximum-entropy inference under Wasserstein constraints can be computationally challenging due to the underlying optimization over transport couplings. We investigate a tractable alternative based on maximizing conditional entropy under an average transport constraint. On Euclidean spaces, this formulation admits an explicit generalized-Gaussian additive-noise solution, providing a feasible approximation to the Wasserstein-constrained problem without solving an optimal transport problem. We establish quantitative bounds on the resulting optimality gap by showing that the two formulations admit a common feasible-marginal representation, with their discrepancy characterized by the mutual information retained between the nominal and perturbed variables. For discretely supported nominal distributions, we further obtain an exact decomposition of the gap into a marginal-entropy gain and a weighted Jensen-Shannon divergence.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12752 ↗

Fundamental tasks in linear systems analysis and control require evaluating infinite-horizon output energies for autonomous systems and optimal value functions for controlled systems. These quantities are characterized by Lyapunov and algebraic Riccati equations, respectively. In this work, we study promise problems for their evaluation when the system matrices are sparse and represented succinctly by Boolean circuits specifying their nonzero entries, with input length polynomial in the logarithm of the system dimension. For dissipative autonomous systems with coordinate-vector initial states, we define the succinct Lyapunov value problem (SLV). Its extension to linear-quadratic optimal control is the succinct LQR value problem (SLQRV). We prove that SLV is $\BQP$-hard: every problem in bounded-error quantum polynomial time ($\BQP$) reduces to it in polynomial time. We then establish that the more general SLQRV problem admits a quantum algorithm running in time polynomial in the succinct input length. Since SLV is a special case of SLQRV, both problems are $\BQP$-complete. Consequently, unless bounded-error probabilistic polynomial time coincides with $\BQP$, no classical randomized algorithm can solve either problem on all promised instances in time polynomial in the succinct input length.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12757 ↗

Robot optimal control often combines Euclidean states with configurations on Lie groups and other smooth manifolds. This paper develops a parametric Riemannian Newton pathfollowing method based on homotopy quadratic programs and parallel strict-working-set tasks. It specifies the event handling, working-set exchanges, matrix factor updates, synchronization, and residual checks used by the algorithm. Tracking guarantees are given under mildly degenerate regularity conditions and the Riemannian strong second-order sufficient condition. Drone navigation and arm manipulation are formulated as geometric optimal-control problems, including finite-force grasp acquisition, transport and supported release. Numerical examples illustrate drone navigation and arm pick-and-place through KKT-residual histories and MuJoCo simulations, together with preliminary initialization results for the full-horizon optimal-control problems.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12766 ↗

This paper addresses error-feedback output regulation for known multivariable linear plants subject to an unknown exosystem and additive Gaussian process and measurement noise. The exosystem generates constant and sinusoidal signals, but its dimension, frequencies, and coupling matrices are unavailable. An output-injection transformation represents the external action through known channels. A causal observer then produces a residual independent of the applied input, whose filtered output separates into a harmonic signal, stationary colored Gaussian noise, and a decaying transient. Using this observation model, a Fourier procedure consistently identifies the number and values of the active positive frequencies in the presence of noise. The identified frequencies determine a regulator through interpolation with stable residual filters. A contractive filter realization, nonexpansive state resizing, and bounded gain updates ensure closed-loop moment bounds uniformly over the selected filter orders. If the gain bound contains the ideal interpolation gain, the adaptive plant response and tracking error converge in mean square to those of the corresponding known-frequency regulator. The limiting mean-square tracking error is a linear function of the process- and measurement-noise covariances. In the absence of both noises, the tracking error converges to zero.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12768 ↗

Stochastic Gradient Descent (SGD) is a workhorse algorithm for continuous optimization. It is a folk belief among deep learning practitioners that learning rate decay in SGD substantially improves performance. However, it has remained unclear whether learning rate decay offers an asymptotic advantage for global nonconvex optimization. We answer this question in the affirmative by demonstrating a natural class of nonconvex functions for which, we prove that SGD with learning rate decay requires exponentially fewer gradient queries for global optimization than SGD with any fixed learning rate in the small-step size regime. To the best of our knowledge, this is the first exponential advantage that has been demonstrated for learning rate decay. The class of functions we consider includes many popular benchmark nonconvex functions. Our results provide a robust explanatory theory for the empirically observed benefits of learning rate decay for global optimization. We show that annealing performs the non-logconcave sampling task associated to the optimization problem in polynomial time, via a novel application of weak Poincaré inequalities.

fields
Optimization and Control
pdf ↗ page arXiv:2611.12769 ↗

Soft powered descent landings are becoming evermore important in the field of space exploration and scientific advancement, because of their ability to deliver mission critical payloads, both highly accurately and safely. The high efficiency restriction on planetary landings due to the severely limited fuel supply results in the need for optimal guidance trajectories and control. Model based reinforcement learning is proving to be an important tool in simplifying the highly complex process of generating optimal guidance trajectories and control. In this work, we present DreamLander, a state of the art model based reinforcement learning algorithm based on DreamerV3, to generate optimal guidance and control for a realistic 6 degree of freedom entry descent landing problem. The model based approach creates a sample efficient and highly generalizable model that can be applied to a variety of scenarios whilst maintaining a high degree of accuracy, landing within 2 meters of the designated landing zone, and with velocity norm less than 0.3 meters per second. DreamLander makes use of state sensor observations, making progress toward End-to-End solutions of the Entry Descent Landing problem.

journal
Nehma, G.M., Quinn, P., Tiwari, M., & Riano-Rios, C. (2026). DreamLander: A 6-DOF World Model Based Reinforcement Learning Planetary Lander. AIAA SCITECH 2026 Forum
fields
Optimization and Control
pdf ↗ page arXiv:2611.12824 ↗

Analysis of PDEs75

This paper and its companion Part I prove that the incompressible Euler equations in the plane, without external force, admit two distinct renormalized weak solutions with the same initial vorticity $f$, where $f$ is radial and nonnegative and lies in $(L^1\cap L^q)(\mathbb{R}^2)$ for every $q<\infty$ but is not bounded. One solution is radially symmetric and stationary. The other is $3$-fold rotationally symmetric, is equimeasurable with $f$ at every time, and departs from $f$ in finite time; the two solutions are distinct in $L^\infty_t(L^1\cap L^q)_x$ on $[0,T]\times\mathbb{R}^2$ for every $q\in(4/3,\infty)$ and every sufficiently large $T$. The nonstationary solution belongs to $C([0,\infty);L^q(\mathbb{R}^2))$ for every $q\in[1,\infty)$. Part I establishes a compactness criterion for non-uniqueness and conditional linear instability results for a vortex ring. Part II establishes the hypotheses of those results and proves the nonlinear non-uniqueness theorem.

code
github.com/mcoiculescu/NonUniqueEuler ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) builds, no sorry at 1df5e79, checked 2026-10-27 build details
comments
103 pages, 2 figures, 1 table. Part II of two. LLM-assisted. The full proof, including its computer-assisted part (rigorous interval arithmetic), is formalized in Lean 4. Lean code and interval-arithmetic code are available at https://github.com/mcoiculescu/NonUniqueEuler
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10211 ↗

Let $\mathbb{G}$ be a Carnot group, let $E \subset \mathbb{G}$ be compact, and suppose we are given a function $f: E \to \mathbb{R}$. The $C^1_H$ {\em Whitney Extension Problem} asks the following: what must be true about $f$ to guarantee that there exists a smooth, horizontal function $F \in C^1_H(\mathbb{G})$ extending $f$, i.e., there is some $F:\mathbb{G} \to \mathbb{R}$ such that $F|_E = f|_E$ and $XF$ is continuous for every horizontal left invariant vector field $X$? We adapt the method of G. Glaeser and C. Fefferman to answer this question in this non-commutative setting. Moreover, we provide an alternative solution to the $C^1$ Whitney Extension Problem for horizontal curves in the Heisenberg group.

comments
15 pages
fields
Analysis of PDEs, Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2611.10216 ↗

We study anchor reconstruction stability in return-map inverse problems for class $\mathcal O_C$. Local identifiability is governed by the first nonvanishing derivative of the holonomy map $H = T_γ- \text{Id}$. In the non-neutral case, we prove local Lipschitz stability and multiplier estimates. In the neutral regime, using Faà di Bruno equations and Malgrange preparation, we derive quantitative $1/k$-Hölder estimates for order-$k$ anchor perturbations. We also establish finite jet stability, real-analytic dependence, and global $C^0$-stability of order $O(\varepsilon_F^{1/k})$. Numerical benchmarks on circular-core return geometries validate these theoretical convergence rates and square-root laws.

fields
Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2611.10250 ↗

In this paper, we present adaptations of the classical strong maximum principle for a certain class of equations, with particular emphasis on linear operators in non-divergence form and a new strategy to prove it. The novelty of our approach lies in the setting of the problem: the coefficients of the operators are unbounded, assumed to be merely integrable in the $L^{p,q}$-sense, and the source term $f$ on the right-hand side of the equation is treated under optimal integrability assumptions.

comments
16 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10332 ↗

In this paper, we present adaptations of the classical strong maximum principle and the compact support principle for a certain class of equations, with particular emphasis on the degeneracy of fully nonlinear operators and a new Vázquez-type condition on the nonhomogeneous term. The novelty of our approach lies in the framework of the problem: the coefficients of the operators are bounded, but we introduce a degeneracy depending on the power of the gradient of the solution. Moreover, the source term $f$ on the right-hand side of the equation is treated under a adapted and optimal integrability assumptions.

comments
19 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10336 ↗

We prove that, in every dimension and for all positive exponents, the Lane–Emden system in a half-space with homogeneous Dirichlet boundary conditions admits no positive classical solution stable outside a compact set.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10421 ↗

We prove local Lipschitz regularity for locally bounded $BV$ solutions of the calibration equations for inverse mean curvature flow. We also approximate every prescribed variational weak flow locally by Moser's logarithmic transforms of positive $p$-harmonic functions. On a fixed smooth domain, with the trace of a calibrated Lipschitz solution prescribed, both the uniform error and the absolute difference of total variations are $O((p-1)^{1/3})$ as $p\downarrow1$. In particular, the approximations converge strictly in $BV$.

comments
19 pages
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2611.10533 ↗

We announce a Lean~4 formal proof of a special case of the smooth anisotropic Calderón uniqueness theorem released by OpenAI on October 6, 2026. We consider smooth Riemannian metrics on the three-dimensional unit ball, with full boundary measurements and Euclidean extensions outside the ball. OpenAI's release did not include a Lean proof of their uniqueness result. Our formalization uses results from Mathlib and Tau Ceti, and it is given as a solution to a Lean comparator challenge whose check permits only the standard axioms of Lean. The Lean proof is not a line-by-line translation of the OpenAI manuscript.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10537 ↗

We study the rate of convergence to Barenblatt profiles of the solutions to porous medium equations in $\R^n, n \ge 1$, by means of a certain class of Energy distances, a class of discrepancies between probability measures which have been recently widely used in problems related to AI, in particular for tasks related to machine learning. If $n \ge 3$, it is shown both that the rate of decay in Energy distance is improved with respect to known results which are based on the decay of relative entropy, and that, with respect to this distance, any initial value of bounded mass belongs to the domain of attraction of the source–type solution. Similar results are shown to hold for the fast diffusion case.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10549 ↗

We propose a deep backward multistep high-order regression (MHDBR) method for semilinear parabolic partial differential equations through their backward stochastic differential equation representations. The method combines multistep time discretization with regression targets formed by conditional expectations. Under explicit regularity, starting-value, forward-approximation and network-moment assumptions, we prove an error bound separating time discretization, conditional Monte Carlo sampling and neural-network approximation. The analysis assumes exact population minimization; finite-training-sample generalization and optimization errors are not included. For generators independent of the gradient variable, suitably constrained GroupSort networks and sufficiently large conditional sample sizes give order $J$ in the stated nodal $L^2$ error norm. The required network sizes depend on dimension, so this result does not establish dimension-independent complexity. We present a reproducible time-discretization test satisfying the analytical assumptions and three broader neural-network benchmarks, whose relation to the assumptions is discussed explicitly.

comments
41 pages, 16 figures, 6 tables
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10570 ↗

We analyse the combined mean-field and semiclassical limit from the time-dependent Schrödinger dynamics of $N$ spinless fermions in a non-constant magnetic field to the magnetic Vlasov equation with scaling $\hbar = N^{-1/3}$. With the velocity-shifted coherent states and the induced magnetic Husimi measure, we derive an exact BBGKY hierarchy with a remainder of order $\hbar^{1/2-}$. The main result is the weak $L^1$ convergence of the $k$-particle magnetic Husimi measures to the $k$-copies of the solution to the magnetic Vlasov equation. Furthermore, the convergence holds in the Wasserstein distance $\mathbb{W}_2$ when the second moment of initial Husimi measure correspondingly converges.

comments
39 pages, 4 figures, 1 table
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.10583 ↗

A one-particle effective kinetic equation with repulsive Dirac-Delta potential in one dimension is rigorously derived from a moderate interacting second order particle system. It is proved that the Wasserstein distance between the empirical measure and the solution of Vlasov equation converges to zero. A convergence rate is obtained by a combination of the estimates for particle trajectory and a smoothed version of modulated energy.

fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.10603 ↗

We study total variation regularization of Wasserstein barycenters on bounded connected Lipschitz domains. We prove existence for arbitrary prescribed probability measures and uniqueness when at least one is absolutely continuous. Our main results are attained dual formulations in terms of relative perimeters and vector fields with zero normal trace. These yield necessary and sufficient optimality conditions and a variational characterization of superlevel sets. We also establish a maximum principle on convex domains, stability of minimizers, and an exact reduction to a single TV-JKO step in one dimension. The existence, uniqueness, and perimeter duality results extend to costs $|x-y|^p$, $p>1$, under the same assumptions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10639 ↗

Solutions of the Dirichlet problem on a finite part of a weighted graph are extended by zero, together with their source, to a larger connected part. A necessary and sufficient condition is proved for the extended function to remain a solution of the corresponding Dirichlet problem on the enlarged domain: at every newly included vertex adjacent to the original part, the weighted sum of the solution over its neighbors in that part must vanish. The admissible sources are characterized as the orthogonal complement of the harmonic extensions from the enlarged domain to the original part, their space has dimension equal to the number of vertices of the original part minus the rank of the interface coupling, and an exact energy identity for the extension error follows from a Schur complement of the graph Laplacian. The same reduction covers other boundary conditions, including the Neumann problem, and extends to higher powers of the Laplacian, where the boundary data must be compatible with the lower-order interface traces. The discrete criterion is compared with its continuous counterpart, and no result in this form has been reported on Riemannian manifolds.

journal
S. Xu, C. Yu, Zero extension for the Dirichlet problem of the biharmonic equation, Mathematics 13 (2025) 1774
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10692 ↗

We prove the global-in-time nonlinear stability and establish explicit algebraic time-decay rates of planar rarefaction waves for the three-dimensional full compressible Navier–Stokes–Fourier system of an ideal polytropic gas in $\mathbb{R}^3$. Given a smooth initial rarefaction profile of small wave strength \(δ>0\), we first construct the corresponding global one-dimensional Navier-Stokes-Fourier solution \(U_b(t,x_1)\) and show that it converges toward the self-similar Euler rarefaction fan in \(L^\infty(\mathbb{R})\) at rate \((1+t)^{-12/25}\). For the three-dimensional Cauchy problem under small weighted $H^3(\mathbb{R}^3)$ perturbations with zero integral of mass, momentum, and total energy, we prove that there exists a unique global strong solution $U(t,x)$ converging toward $U_b(t,x_1)$ in $L^\infty(\mathbb{R}^3)$ at rate $(1+t)^{-11/25}$, with $\nabla(U-U_b)$ decaying in $H^2(\mathbb{R}^3)$ at rate $(1+t)^{-11/25}$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10749 ↗

In this paper, we provide further insight into potential spaces within the nonstandard framework of Orlicz functions. More precisely, we establish continuous and compact embeddings of potential spaces in $\mathbb{R}^n$ into both unweighted and weighted Orlicz spaces. Special attention is devoted to the radial setting, for which compactness results are obtained through Strauss- and Ni-type inequalities. As an application, we prove the existence of positive radial solutions to a class of Henon-type problems involving both local and nonlocal contributions in the Orlicz framework.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10755 ↗

We study a three-component mean field game system arising from a resource harvesting model. It couples Hamilton–Jacobi and Fokker–Planck equations for the harvesters with a reaction-diffusion equation for the resource. The coupling is nonlocal in space and time. For standard second-order mean field game systems, exponential turnpike estimates are known under assumptions such as monotonicity of the coupling. For the present system, Kobeissi, Mazari-Fouquer, and Ruiz-Balet proved algebraic convergence to a stationary solution in a space–time averaged sense, but no exponential turnpike estimate has been obtained. We prove such an estimate near a stationary solution with strictly positive density components. Inspired by the relative entropy method, we add the relative entropy of the resource density to the standard energy for local turnpike estimates. In the time derivative of this modified energy, the nonlocal coupling terms cancel. The two key assumptions are coercivity of a quadratic form determined by the stationary resource density and smallness of the relative density perturbations in $L^\infty$. Under these assumptions, we bound the absolute value of the modified energy by two terms that decay exponentially away from the initial and terminal times. We derive weighted $L^2$ exponential turnpike estimates for the harvester density, the resource density, and the gradient of the value function. We give sufficient conditions for coercivity. For each fixed $T>0$, classical solutions satisfying these assumptions exist for initial and terminal data sufficiently close to the stationary solution. We extend the modified energy estimate to a more general reaction term under the corresponding assumptions.

comments
46 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10763 ↗

We consider entire solutions $u$: $\mathbb{R}^{n}\rightarrow\mathbb{R}$ of the Euler-Lagrange equation $\operatorname{div}(\nabla f(\nabla u))=0$ with convex density $f$: $\mathbb{R}^{n}\rightarrow\mathbb{R}$ of nonstandard growth and nonuniform ellipticity. It turns out that the Liouville property can be characterized through the behavior of $D^{2}f(p)$ for points $p\in\mathbb{R}^{n}$ close to the origin: if, for example, $D^{2}f(p)$ behaves as $|p|^{ρ-2}\mathbf{1}$, $\mathbf{1}=\text{unit matrix}$, with exponent $ρ\ge2$ and for $|p|\le1$ then the validity of $n\leρ+2$ together with the boundedness of $u$ implies its constancy.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10784 ↗

This paper is concerned with propagation phenomena for a spatially periodic bistable reaction–diffusion equation around an obstacle. It is known that an entire solution emanating from a pulsating front converges to the same front as \(t\rightaroow+\infty\) under complete propagation and an additional technical assumption. We remove the technical assumption and prove that the entire solution coming from a pulsating front converges to the same pulsating front as \(t\rightarrow+\infty\) under the complete propagation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10820 ↗

We study Fully Nonlinear uniformly elliptic equations with a higher differential term degenerate or singular, coupled with a zero order term singular at the point $0$, and an absorbing super-linear term of $p$ power type. We will limitate to punctured balls and positive radial solutions. In the continuity of two previous works in \cite {BDL1}, \cite{BDL2}, we will provide a complete classification depending on $p$ of the asymptotic behaviour of the solutions near the singular point $0$.

comments
24 pages , no figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10874 ↗

This article concerns Moser-Trudinger inequalities on the entire Heisenberg group, focusing on sharp constants, maximizers, and applications to subelliptic PDEs. We address several questions on the existence of maximizers in the singular case $0<β<Q$, where the singular weight yields compactness. We first establish an Adimurthi-Druet-type weighted Moser-Trudinger inequality without blow-up analysis and determine its sharp constant. We also prove its equivalence with the critical weighted Moser-Trudinger inequality. For the subcritical inequality of Lam, Lu and Tang \cite{Lam-Lu-Tang-2014}, we obtain two-sided asymptotic bounds near the sharp threshold and prove existence of maximizers in a suitable regime. This inequality also yields insight into borderline Sobolev theory and an asymptotic Caffarelli-Kohn-Nirenberg interpolation-type inequality. We further establish a weighted Moser-Trudinger inequality under inhomogeneous norm constraints and prove its equivalence with the subcritical inequality, thereby characterizing the associated supremum and its maximizers. An improved subcritical weighted inequality is also derived, and its maximization problem is shown to admit a maximizer. Finally, these inequalities are applied to normalized subelliptic equations driven by the $Q$-sub-Laplacian with nonlinearities having singular critical exponential growth at infinity. We prove the existence of nontrivial ground states for every prescribed mass $a>0$, provided the nonlinearity is sufficiently large in a suitable sense depending on $a$.

comments
51 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10900 ↗

We study the stability and temporal decay of solutions to the two-dimensional tropical climate model with Laplacian dissipation in both velocity equations and no thermal diffusion. For initial data in $H^s (\mathbb{R}^2)$ ($s \geq 1$) with sufficiently small $H^1$ norm, we establish a unique global solution satisfying uniform $H^s$ bounds and time-integrated estimates for the velocity and temperature. The smallness is independent of $s$, and the higher Sobolev norms of the initial data need not be small. Furthermore, without additional spatial integrability or negative-order regularity of the initial data, we prove that the $\dot H^s (\mathbb{R}^2)$ norms of the solutions are $o(t^{- s / 2})$ as $t \to \infty$. We also show that this decay rate is sharp: no additional decay factor tending to zero works for all such initial data.

comments
25pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.10989 ↗

Let $B$ be the unit ball of $\mathbb{R}^N$, $N\ge2$, and let $\mathrm{MT}_N(α_{N,β},β)$ denote the critical Trudinger-Moser supremum of Calanchi and Ruf for radial functions in the Sobolev space with logarithmic weight $(-\log|x|)^{β(N-1)}$, $0\leβ<1$. We prove that $\mathrm{MT}_N(α_{N,β},β)>(2N-\frac25)|B|$ for every $β\in[0,1)$ and $N\ge 3$. This lower bound is uniform in $β$ and lies strictly above the upper bound $|B|\big(1+e^{1+\frac12+\cdots+\frac1{N-1}}\big)$ for the concentration level obtained by Carleson-Chang for $β=0$ and, for $β>0$, by Roy for $N=2$ and by Roy and Nguyen for $N\ge 3$. As a consequence, we prove that $\mathrm{MT}_N(α_{N,β},β)$ is attained for every $β\in[0,1)$ and $N\ge3$, which was previously known only for $β>0$ small enough. For $N=2$, the existence of extremals for every $β\in [0, 1)$ was recently obtained by de Oliveira.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11022 ↗

We study the Zakharov system on an arbitrary fixed rectangular two-dimensional torus with initial data in $H^s\times L^2\times H^{-1}$. For the Schrödinger regularity $s$, Kishimoto proved local well-posedness for $1/2\leq s\leq1$ and global well-posedness for $9/14<s<1$ below the Euclidean cubic ground-state mass. Under the same mass condition, we prove global well-posedness for every $1/2<s<1$, with polynomial bounds for the Sobolev norms. We add quartic and quintic corrections to Kishimoto's resonantly modified energy. The main difficulty is to cancel the interactions obstructing the global iteration without introducing singular coefficients near resonance or losing control of the higher-order terms generated by differentiation. The coefficients exploit cancellations between successive nonlinear interactions. Away from resonance, they cancel the problematic terms; near resonance, algebraic rearrangements avoid division by small phases and preserve sufficient frequency decay. For every $s<1/2$, we also construct solutions with arbitrarily small initial data in $H^s\times L^2\times H^{-1}$ whose wave component blows up in finite time while the Schrödinger component remains bounded in $H^s$. We combine explicit approximate solutions supported on three Fourier modes with stability at $H^{1/2}\times L^2$. Choosing successively larger frequencies controls the nonlinear interactions among infinitely many approximate solutions and makes the accumulated errors summable, while their wave amplitudes produce blow-up. These results identify $s=1/2$ as the threshold between global well-posedness and the existence of such blow-up solutions, with the endpoint unresolved.

comments
71 pages, 0 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11048 ↗

We establish finite-time relative entropy estimates for axisymmetric finite-energy entropy solutions of the three-dimensional attractive compressible Euler-Riesz equations near a prescribed compactly supported rotating star. The entropy solutions are assumed to have the same total mass as the steady state and to satisfy the prescribed angular momentum relation. For general pressure laws, the compatibility with the angular momentum constraint, together with the nonnegative rotational remainder, yields a cancellation of the centrifugal terms. For axisymmetric perturbations, the gradient of the perturbed Riesz potential has no azimuthal component and therefore couples only to those momentum components controlled by the modulated kinetic energy. The density-weighted estimates for the Riesz potential then allow us to close the relative entropy inequality. Under an additional higher-integrability assumption on the density, the result extends to the Chandrasekhar pressure law, yielding a corresponding stability estimate for rotating white dwarf stars.

comments
32 pages
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.11059 ↗

The full strong Fourier extension estimate for the unit sphere is established in every ambient dimension at least three. The finite Knapp boundary is obtained by combining a uniform diagonal estimate on rescaled spherical graphs with a transverse product bound. A Whitney decomposition and a dyadic dual pairing yield strong type at the exact scaling exponents. The critical local estimate and the strict mixed range come from the recent work on Euclidean local smoothing.

comments
28 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11060 ↗

We study the weakly damped semilinear wave equation on $\mathbb{R}^3$ with a sub-quintic nonlinearity $f(u)$ and a forcing term of low regularity, $g\in H^{-1}(\mathbb{R}^3)$. By absorbing the forcing term into a stationary solution $h$ and then expanding the solution around $h$, we reduce the problem to a wave equation with potentials. Relying on Strichartz estimates for this equation, obtained through the Besov spaces associated with the Schrödinger operator, we establish the global well-posedness of weak solutions by an iteration argument on the Besov scale. In particular, uniqueness holds unconditionally in the energy class for $3<p<5$. Combining a refined decomposition of the solution with uniform tail estimates for trajectories starting from bounded sets, we then prove that the associated solution semigroup is asymptotically compact and, consequently, possesses a compact global attractor in the energy space $H^1(\mathbb{R}^3)\times L^2(\mathbb{R}R^3)$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11146 ↗

We study the Dirichlet problem for the complex Monge–Ampère equation on bounded strongly pseudoconvex domains with $C^3$ boundary and $C^3$ boundary values. For every $n\ge2$ and $0<α<1$, each continuous Bedford–Taylor solution with a strictly positive $C^α$ right-hand side satisfies a global $C^{2,α}$ estimate. There is a unique such solution, which is strictly plurisubharmonic up to the boundary. Combining new boundary estimates with weighted integral estimates for the trace of the complex Hessian along an auxiliary parabolic flow, we obtain global $C^{1,β}$ bounds for every fixed $0<β<1$ in every dimension. Green function estimates and comparison arguments near the boundary give the boundary Hessian bound. Solutions of auxiliary Dirichlet problems with locally constant right-hand sides have uniform $W^{2,2n^2}$ bounds. Rescaling and interpolation then reduce the global Hessian estimate to interior regularity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11173 ↗

We identify $p_*(n)=(n-1)/(n-3)$, $n\geq 5$, as the sharp exponent for Liouville theorems concerning a two-component elliptic Schrödinger system with self-focusing interactions and repulsive intercomponent coupling. We consider the strictly copositive regime, in which the repulsion strength is smaller than the geometric mean of the two self-interaction strengths. Quittner and Souplet (Comm. Math. Phys. 2012: 1–19) established a Liouville-type nonexistence result in the range $1<p<p_*(n)$. For every $p_*(n)<p<(n+2)/(n-2)$, we construct bounded, nontrivial, nonnegative entire solutions whenever the repulsion strength approaches the copositivity threshold from below. The construction combines a compact variational functional, a periodic spectral gap, and uniform exterior estimates that remove a truncation. Our result gives a negative answer to the open question posed by Quittner and Souplet (Comm. Math. Phys. 2012: 1–19) of whether strict copositivity implies nonexistence of nontrivial nonnegative entire solutions throughout the Sobolev subcritical range when $n\geq 5$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11198 ↗

We study the spatial support of stochastic porous medium equations on bounded domains. Under a local nondegeneracy condition, additive noise gives full distributional support at every fixed positive time. For the Dirichlet problem with nonlocal multiplicative noise, we prove that the solution is either identically zero or has full support; excluding the zero state requires a separate non-hitting assumption. For a Neumann model, nonzero initial mass excludes the zero state and yields full support. The proofs combine Galerkin approximation with terminal Malliavin estimates. Numerical results illustrate the propagation mechanisms.

comments
37 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11222 ↗

We present an infinite set of explicit solutions of the integrable focusing NLS equation on the half-line that are rapidly decaying and satisfy a homogeneous Robin condition but have very different behaviors on the wall $x=0$. We then argue that a similar phenomenon exists for a small non-homogeneous perturbation of the Robin problem. This renders a potential application of the unified transform method to non-linearizable Robin problems impossible.

comments
5 pages
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.11230 ↗

We establish an explicit modulus of continuity for locally bounded weak solutions to nonlocal porous medium type equations with measurable kernels. The nonlocal tail is only assumed to be integrable in time. The result lays a solid foundation for the intrinsic Harnack estimates of these equations.

comments
32 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11235 ↗

We study the propagation geometry of multidimensional reaction-diffusion equations in shifting habitats. Using geometric optics techniques and viscosity solution theory, we prove that the associated rate functions converge locally uniformly to the unique viscosity solution of a variational inequality with singular initial data. We identify this limit as the value of a zero-sum stopping game whose zero set determines the Wulff shape. This zero set coincides with that of the positive part of the value function of an unconstrained optimal control problem if and only if Freidlin's condition holds. When Freidlin's condition fails, we derive a pointwise characterization of the stopping-game zero set, yielding a convex hull representation. These results then yield explicit Wulff shapes and directional spreading speeds for all habitat speed. As the habitat speed increases, the Wulff shape evolves from a large ball to a truncated ball. It then develops conical, cylindrical, and paraboloidal boundary components attached to spherical parts, before eventually becoming a smaller ball. Some of these geometric transitions occur while both axial spreading speeds remain unchanged. Moreover, by characterizing the optimal trajectories, we distinguish two mechanisms of nonlocal speed selection and show that such selection can occur in oblique directions even when it is absent in both axial directions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11264 ↗

Burgers vortices are stationary solutions of the Navier–Stokes equations in a background straining flow and serve as a model for vortex tubes in three-dimensional turbulence. In this paper, we consider weakly asymmetric strains and establish the local nonlinear asymptotic stability of the corresponding Burgers vortices against small three-dimensional perturbations for arbitrary circulation. Our proof exploits the specific axial structure of the linearized operator, combining a two-dimensional resolvent analysis with decay estimates for axial derivatives to control the full three-dimensional evolution. A first-moment decomposition isolates the slow modes, and Gaussian resolvent bounds are transferred to polynomially weighted spaces. This yields nonlinear stability with the endpoint exponential decay rate $(1-λ)/2$, where $λ$ denotes the strain asymmetry, without any additional polynomial factor in time. An exact nonlinear first-moment law demonstrates that this rate is optimal over the full admissible perturbation class, including at zero circulation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11271 ↗

We compare two heat flows for the same corotational map of a disk into a warped product of two spheres, with the same fixed boundary values. The ordinary harmonic map heat flow develops a singularity in finite time. When the domain metric is instead determined by the critically normalized Green potential of the current energy distribution, the solution exists for all time. Two harmonic spheres of energy $4π$ form at separated scales, in addition to a nonconstant harmonic root. The energy and the image diameter of the necks tend to zero without restriction to a sequence of times. The main estimate controls the difference between the inner source mass and its critical value by the weighted tension. This is necessary because that difference is integrated over a neck of unbounded logarithmic length. Along a sequence of times the Green metric on the middle neck is asymptotically cylindrical after a spatially constant normalization.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11290 ↗

We study the regularity and the long-time asymptotics of the solution to the following mixed local-nonlocal parabolic problem \[ \left\{ \begin{alignedat}{2} \partial_t u - Δu + (-Δ)^s u &= f \qquad &&\text{in }Ω\times(0, T), u&=0 \qquad &&\text{in }\bigl(\mathbb{R}^{n}\setminusΩ\bigr)\times[0, T), u(\,\cdot\,,0)&=u_{0} \qquad &&\text{in }Ω, \end{alignedat} \right. \] where $Ω\subset\mathbb R^n$ is a bounded domain, $s\in(0,1)$ and $(-Δ)^s$ denotes the fractional Laplacian. We first develop the well-posedness theory for the problem on finite time intervals ($0<T<+\infty$). Existence and uniqueness of weak solutions are established in the natural energy space, followed by interior $H^{2,1}$-regularity and global $L^\infty$-bounds. Then, under the restriction $s\in(0,1/2)$ and $0<α\le 1-2s$, we prove that weak solutions become classical ones, obtaining $C^{2+α,1+α/2}$-regularity up to the boundary via the method of continuity and a perturbation argument. The accompanying a priori estimate guarantees that these classical solutions can be extended globally in time, thereby allowing us to consider the parabolic problem on the whole half-line ($T=+\infty$). Finally, for the special case $Ω=B_1(0)$ and $f=0$, we employ the moving-plane method together with the previously established boundary regularity to show that every positive classical solution is attracted, as $t\to +\infty$, by a steady state that is radially symmetric and strictly decreasing.

comments
25 pages. This version was submitted for publication in March 2026. The revised version will appear soon
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11297 ↗

We study vortex solutions of the magnetic Ginzburg-Landau model (or the Abelian-Higgs model). We establish uniqueness of axisymmetric vortex solutions for every winding number $n\geq1$ and coupling constant $λ>0$. Our proof uses a lattice inequality and constrained minimization to construct a positive radial solution lying above any two given radial solutions. A comparison argument based on the virial identity then establishes uniqueness. We further prove that the unique radial solution depends real analytically on $λ$ and that both radial profiles are strictly increasing with respect to $λ$.

comments
31 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11360 ↗

In this paper, we investigate the global nonlinear stability and large-time decay rates of small-amplitude planar viscous shock waves for the three-dimensional (3-D) full compressible Navier–Stokes–Fourier equations in the whole space $\R^3$. {We prove that if the initial perturbation is sufficiently small in $H^3(\R^3)\cap\Hm(\R^3)$, then the Cauchy problem admits a unique global strong solution that converges to the planar shock profile without any phase shift. In the moving shock frame, both the conservative and primitive perturbations decay at the rate $(1+t)^{-1/4}$ in $H^3(\R^3)$. Their time and transverse spatial derivatives decay at the rate $(1+t)^{-1/2}$, measured in $\Hm(\R^3)$ for the conservative perturbation and in $H^1(\R^3)$ for the primitive perturbation.} No zero-mass condition or spectral stability assumption is imposed. On the whole space $\R^3$, the main analytical difficulties stem from the continuous transverse low frequencies, the opposite signs of shock compression in $L^2(\R^3)$ and unweighted $\Hm(\R^3)$, and the absence of density dissipation in the continuity equation coupled with temperature variations. To overcome these difficulties, we introduce a density-weighted $\Hm(\R^3)$ multiplier built from the inverse entropy Hessian and a modified curl operator. Through entropy symmetrization and the curl projection, all second-order acoustic derivatives of the potential cancel out and the transverse acoustic modes are controlled, so that the normal Euler drift is governed by the compressive derivative of the characteristic speed. Combined with an effective momentum variable and a momentum–density cross estimate, this negative-order energy absorbs the unfavorable compression term in the $L^2$ energy and closes the $H^3(\R^3)$ a priori estimates without loss of derivatives.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11383 ↗

We consider the pure traction problem for linear elasticity in a bounded domain containing an $\varepsilon$-periodic array of perfectly rigid inclusions. For compatible $L^2$ boundary tractions on a Lipschitz domain, we prove an $O(\varepsilon^{1/2})$ error estimate in $H^1$ for a smoothed first-order two-scale expansion. If the exterior and inclusion boundaries are $C^{2,β}$, we also obtain a global Lipschitz estimate, uniform in $\varepsilon$, for compatible $C^{0,σ}$ tractions, where $0<σ<β$. The displacement is normalized modulo rigid motions, and the estimate controls the full gradient in the matrix and the inclusions. The boundary argument uses a local Neumann comparison estimate whose constant is independent of the choice of inclusions retained in cells cut by an artificial localization boundary. We prove this estimate by combining cellwise rigidification, divergence-free stress extensions, and duality, and then apply a boundary Campanato iteration and local estimates at the microscopic scale.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11390 ↗

This article deals with quantitative unique continuation results up to and from the boundary for second-order elliptic equations with variable coefficients via $L^p$ Carleman estimates. The coefficients in the leading part are assumed to be Lipschitz continuous, and the potentials in the lower order term are allowed to belong to almost scale-invariant $L^q$ spaces. As applications, following the method of Lebeau and Robbiano, we obtain a spectral estimate which yields the interior null controllability of the associated parabolic equation, with an explicit dependence of the control cost on the potential. We also prove the logarithmic decay of the energy for damped wave equations with unbounded dampings and potentials.

comments
Comments welcome
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.11410 ↗

In this paper we investigate how the coercivity of the Hessian of the Ginzburg-Landau energy at local minimizers $u$ depends on the Ginzburg-Landau parameter $κ$ in the regime of large $κ$. This question is motivated by its crucial role in the numerical approximation of energy minimizers. Accounting for the degeneracy that is induced by phase invariance and possible additional neutral directions, we establish a universal lower bound of order $κ^2$ for the inverse coercivity constant $ρ_u(κ)$ of local minimizers with uniformly bounded Hessian kernel dimension. For nonvanishing states that satisfy a quantitative subcriticality condition, we prove a matching upper bound, showing that the quadratic scaling is sharp. On a fixed annulus with a fixed smooth magnetic potential, we then construct nonvanishing local minimizers for which $ρ_u(κ)\simeqκ^4$. Moreover, we exhibit branches of strictly stable local minimizers along which the inverse coercivity constant diverges as stability is lost. Consequently, no locally bounded upper estimate depending only on $κ$ can hold uniformly over all phase-nondegenerate local minimizers, even for a fixed domain and magnetic potential.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11429 ↗

The stability of viscous contact waves is established for the one-dimensional full compressible Navier–Stokes equations under large integrable perturbations. A unique global positive solution is obtained, which converges uniformly to a fixed Eulerian contact profile at the optimal inverse square-root rate in time. The wave-strength threshold depends only on bounds for the initial density perturbation in the first-order Sobolev norm, the energy of the initial velocity perturbation, the thermal relative entropy and the total conserved excess, together with positive lower bounds for the initial density and temperature. It is independent of higher Sobolev norms and the common far-field velocity. No square-integrability condition is imposed on the initial anti-derivatives. Derivative and pressure decomposition estimates are also established for the evolving solution.

comments
122 pages. Companion paper to "Asymptotic Stability of Planar Viscous Contact Waves for the Three-Dimensional Full Compressible Navier-Stokes Equations in the Whole Space"
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11528 ↗

The asymptotic stability of planar viscous contact waves is established for the three-dimensional full compressible Navier–Stokes equations in the whole space. The exact evolving planar background is constructed in a companion one-dimensional paper and may arise from a large integrable perturbation. The three-dimensional remainder has small energy, prescribed second-derivative bounds for density and velocity, and a prescribed first-derivative bound for temperature. Its initial temperature lies in a fixed positive interval; its second derivatives need only be finite. A unique global positive strong solution and algebraic decay in the uniform norm are obtained. The wave-strength threshold depends on lower-order planar bounds, while the allowed remainder size may depend on the complete planar datum.

comments
105 pages. Companion paper to "Stability and Optimal Decay of Viscous Contact Waves under Large Perturbations"
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11530 ↗

This paper investigates quadratic forms $\mathcal{E}^Γ$ generated by configurations $Γ$ and families of measures that are parametrized in the space variable and singular with respect to the Lebesgue measure. A first basic result is the construction of corresponding integro-differential operators in divergence form. These operators are obtained by symmetrizing the family of singular measures. The main result is the comparability of the quadratic form $\mathcal{E}^Γ$ with the quadratic form $\mathcal{E}^s$ which is associated with the fractional Laplacian $(-Δ)^s$. Comparability of $\mathcal{E}^Γ$ and $\mathcal{E}^s$ implies Hölder regularity and a weak Harnack inequality for solutions to integro-differential equations involving these operators.

fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.11553 ↗

Schiffer's conjecture asserts that the ball is the only bounded simply connected domain carrying a Neumann eigenfunction of the Laplacian that is constant on the boundary; it is equivalent to the Pompeiu problem. In August 2026 it was disproved in the plane by computer-assisted constructions. We revisit the shape-optimization approach of~\cite{Se24} in the light of these counterexamples. We first show that the vanishing of the material derivative on the boundary, assumed in~\cite{Se24}, never holds, and we compute the correct optimality condition, involving an adjoint state, for the associated functional $J_2$. We prove that every planar Schiffer domain satisfies $\max|u| > \sqrt{2}|c|.$ Our main result is a Talenti-type theorem: if $u < c$ in $Ω$ , then $kR^* \geq j_{1,1},$ where $R^*$ is the radius of the disc of equal area, and equality holds only for the disc. Finally, using Siegel's transcendence theorem, we prove the infinitesimal rigidity of the disc for the Berenstein problem.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11615 ↗

Schiffer's conjecture asserts that the ball is the only bounded domain, with boundary homeomorphic to a sphere, carrying a nonconstant Neumann eigenfunction of the Laplacian that is constant on the boundary; for such domains it is equivalent to the Pompeiu problem. In 2026 it was disproved in the plane and in many higher dimensions by computer-assisted and analytic constructions. We study what survives. Our main result is a Talenti-type theorem valid in every dimension $N\ge2$: if the eigenfunction $u$ stays strictly below its boundary value $c>0$, then $kR^*\ge j_{N/2,1}$, where $k^2$ is the eigenvalue, $R^*$ the radius of the ball of equal volume and $j_{N/2,1}$ the first positive zero of $J_{N/2}$; equality holds only for the ball. We compare this threshold with the unconditional bound $kR^*\ge 2^{1/N}j_{N/2-1,1}$ given by the Krahn–Szegő inequality. Using Payne's P-function $P=|\nabla u|^2+λu^2$ we prove that every Schiffer domain satisfies $\max|u|>\sqrt N\,|c|$, together with pointwise and distance bounds. We correct the shape-optimization approach of an earlier work by computing the optimality condition of the associated boundary functional with an adjoint state. Using the transcendence of the zeros of Bessel functions of integer and half-integer order, we prove the infinitesimal rigidity of the ball, in every dimension, both for the Schiffer problem and for the Berenstein problem. Finally, we reconstruct numerically the convex four-dimensional counterexample of Guo and check the above statements on it.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11620 ↗

In this paper, we investigate the internal stabilization of a closed-loop system which consists of an Euler–Bernoulli beam subjected to a structural damping mechanism with a distributed delay into the domain. Under appropriate assumptions on the weights of the delay term and internal damping, we first prove the well-posedness of the system by a semigroup approach. Then, by constructing an appropriate Lyapunov functional and utilizing the multiplier method, we establish the exponential decay of the system energy.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11637 ↗

In this paper, we investigate the effect of a fixed time delay on the internal stabilization of an Euler–Bernoulli beam clamped at one end with distributed damping. Under appropriate assumptions on the feedback weights, we first establish that the problem is well-posed using semigroup theory. Furthermore, using the multiplier method combined with a suitable Lyapunov functional, we prove the exponential stability of the system.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11639 ↗

In this paper, we consider the Navier-Stokes-Fourier system in space dimension $d\geq2$. We prove local well-posedness of solutions having density only in $L^p\cap L^\infty$, for suitable $p\in\,]1,+\infty[\,$, with no further regularity requirements. In particular, our result yields existence and uniqueness of solutions in the case of discontinuous densities presenting a jump across a smooth interface. The existence proof is based on the use of the Hoff effective viscous flux and on a combination of both maximal regularity and Chemin's striated regularity arguments. Uniqueness, under the assumption of slightly more regular initial velocity fields and temperatures, relies on a Lagrangian approach, supplemented with an original bootstrap argument which shows improved time integrability properties of the solution.

comments
Submitted. No use of AI in any sense, at any level
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11661 ↗

We consider the incompressible Euler equation on the whole plane $\R^2$, without boundary and without forcing, and we construct two smooth solutions whose vorticity gradient grows fast for all large times. The first solution has finite energy, integrable vorticity and initial data in every Sobolev space. Given any function $Γ(t)$ with $Γ(t)/t\to 0$, the logarithm of its vorticity gradient is not bounded by any multiple of $Γ(t)$, and, at every sufficiently large time $t$, it is larger than any multiple of $t/\log_*t$, where $\log_*$ is the iterated logarithm. The second solution has bounded vorticity, bounded vorticity derivatives on every finite time interval, and a velocity given by the absolutely convergent Biot–Savart integral which grows at most logarithmically in space. Its vorticity gradient grows double exponentially in time for all large times. Its initial vorticity is neither integrable nor square integrable, and its initial velocity and strain are unbounded. Both constructions place infinitely many localized amplification mechanisms far apart from each other in one initial datum. The first one is based on the hyperbolic stagnation point behind a smooth traveling dipole, controlled for long times by an energy–Casimir argument. The second one is based on the hyperbolic point of the Bahouri–Chemin cross on the torus, transported to the plane by spatial dilations and by the uniqueness theory of Serfati solutions.

comments
53 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11705 ↗

Motivated by diffusion–reaction processes in porous catalysts, we study an Alt–Phillips model for ordered membranes with weighted gap interactions. The model connects adhesive harmonic junctions \cite{DSS24} and forced multiple membranes \cite{SY19} through the exponent $0<γ<1$. For arbitrary positive weights, we prove optimal $C^{1,β-1}$ regularity, where $β=2/(2-γ)$, and obtain nontrivial $β$-homogeneous blowup limits through Weiss almost monotonicity. Under strict discrete concavity of the weights, we establish a gluing principle, minimality of flat single-gap cones, and $C^{1,α}$ free boundary regularity at points admitting such blowups. We also classify all one-dimensional vertically critical cones. For three membranes, we identify cone families that are non-minimizing for small $γ$ and minimizing near $γ=1$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11736 ↗

In this paper we revisit the geometric approach developed by Vărvărucă and Weiss for the Stokes conjecture for gravity water waves near stagnation points, in both the irrotational and rotational settings. They introduced monotonicity formulas and frequency formulas to classify all possible singularities of solutions at stagnation points. Two questions were left open: 1. whether cusp singularities can be excluded in higher dimensions $n\geq 3$ [Acta Math. 206 (2011)]; 2. whether cusp singularities for rotational waves can be excluded under the Rayleigh-Taylor condition [Ann. Inst. H. Poincaré C Anal. Non Linéaire 29 (2012)]. We answer both questions in the affirmative. Our main results show that cusp singularities do not exist in higher dimensions and cannot occur for rotational waves even without assuming the Rayleigh-Taylor condition. Our argument combines a delicate analysis of the weighted volume arising from the corresponding free boundary problem with a weighted isoperimetric inequality.

comments
21 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11776 ↗

We prove that the weak-type $(1,1)$ norm of each classical Riesz transform $R_j$, $j=1,\dots,n$, on real-valued inputs on $\R^n$ and $\T^n$ is $\KD$. The constant $\KD=π^2/(8\Gcat)$, where $\Gcat$ is Catalan's constant, was obtained by Davis \cite{Davis1974} for the Hilbert transform on $\R$ and the conjugate-function operator on the circle $\T$. The Burkholder–Bellman function argument also applies to coordinate Riesz transforms of product generators. If $-L$ generates a symmetric sub-Markov semigroup on a nonzero standard $σ$-finite measure space $Y$, then $-\partial_x(-\partial_x^2+L)^{-1/2}$ has the same exact norm on both $\mathbb R\times Y$ and $\mathbb T\times Y$. The derivative acts in the ordinary line or circle factor, while $L$ governs the independent transverse variables. An explicit integral inequality strengthens the weak-type estimate and bounds the truncated second moment of the transform. The general theorem applies to Gaussian, Dunkl, Laguerre, Jacobi, Schrödinger, and Laplace–Beltrami transverse generators, finite reversible chains, and subordinated semigroups.

comments
37 pages
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.11788 ↗

We study the free-boundary incompressible porous media equations with surface tension in dimension $1+d$. For fixed positive surface tension, we establish local well-posedness for arbitrary initial interfaces in $H^{s+1}$ and density perturbations in $H^s$, with $s>(d+3)/2$. When $s>(d+5)/2$, we justify the local vanishing-surface-tension limit for stable interfaces and sufficiently small density perturbations. In a finite-depth strip over $\mathbb{R}^d$ with a flat bottom and fixed positive surface tension, we prove global well-posedness and uniform anisotropic energy bounds for small compatible perturbations of an equilibrium with strictly stable stratification, under a horizontal low-frequency condition.

comments
59 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11818 ↗

This paper is concerned with the Neumann problem for the porous medium equation, \[ u_t - Δa(u) = f \quad \mbox{in}\ Ω\times (0, T), \qquad \nabla a(u) \cdot ν=0 \quad \mbox{on}\ \partial Ω\times (0, T), \qquad u(\cdot, 0) = u_0 \quad \mbox{in}\ Ω\] in a smoothly bounded domain $Ω\subset \mathbb{R}^N$ $(N \in \mathbb{N})$, where $T \in (0,\infty)$, $ν$ is the outward unit normal vector to $\partial Ω$, and where $f$ and $u_0$ are given. A typical example in mind is $a(u)=|u|^{p-2}u$ with $p \in [2, \infty)$. The main interest is weak solvability of the problem in the case that $u_0 \in H^1(Ω)^*$, $f \in L^2(0,T; H^1(Ω)^*)$. Under the condition that the mean value of $f(t)$ vanishes for almost all $t \in (0,T)$, existence of weak solutions is established by an application of abstract results from operator theory, for instance, properties of Gâteaux derivative. The key of the proof lies in the approximate equation \[ [(\varepsilon I - Δ)^{-1} u_\varepsilon]_t + a(u_\varepsilon) = (\varepsilon I - Δ)^{-1} f, \quad \varepsilon \in (0,1), \] where the map $\varepsilon I - Δ$ from $H^1(Ω)$ onto its dual space is regarded as the Riesz isomorphism of $H^1(Ω)$ equipped with an appropriate topology.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11851 ↗

In this paper, we study the Schrödinger-Maxwell equation with critical growth and mass subcritical perturbation \begin{align*} \begin{cases} \displaystyle - Δu+λu+ \left(|x|^{-1}\ast| u|^2\right) u =|u|^{4}u +|u|^{p-2}u\quad\quad \text{in} \ \mathbb{ R}^3, \displaystyle \int_{\mathbb{R}^3}|u|^2dx=a^2, \end{cases} \end{align*} where $a>0$ is prescribed, $3<p<\frac{10}{3}$, $\ast$ denotes the convolution and $λ\in \mathbb{R}$ appears as a Lagrange multiplier. When the nonlocal convolution term is absent, the above equation can be reduced to the Schrödinger equation. In this case, the previous works showed that it admits a local minimizer (ground-state) and a mountain-pass type solution. By contrast, we surprisingly find that the above equation has no solutions with negative energy provided $a>0$ is sufficiently small. More precisely, we rigorously prove that the above equation possesses a mountain-pass type solution with positive energy for sufficiently small $a>0$, which reveals an essential difference in solution structure between the Schrödinger-Maxwell equation and the classical Schrödinger equation in the parameter range $3<p<\frac{10}{3}$. The main difficulty encountered in this work is the loss of compactness arising from the Sobolev critical term. Furthermore, we explore the dynamical properties of the corresponding time-dependent problem and establish the strong instability of its standing wave solutions. It is worth pointing out that this work refines and extends the existing literature by covering the unexplored parameter regime $p\in(3,\frac{10}{3})$.

comments
29 pages, no figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11908 ↗

For the two dimensional incompressible Euler equation, Yudovich, and independently Serfati, extended the classical existence and uniqueness class to include vorticity with mild singularity. This class is sometimes called the generalized Yudovich class. Then, Vishik extended the uniqueness class to include vorticity in BMO, allowing for stronger singularities than the generalized Yudovich class. In this work, we prove strong ill-posedness of vorticity in BMO.

comments
21 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.11950 ↗

We establish the uniqueness and nondegeneracy for positive finite-energy solutions of the following one-dimensional mixed Schrödinger equation \begin{equation} -Q'' + (-Δ)^s Q + Q = |Q|^p Q \quad \text{in } \mathbb R, \end{equation} where $0<s<1$ and $p>0$. For every $0<s<1, p>0$, we obtain the corresponding results for positive solutions whose linearized operators have Morse index equal to one. We extend the nodal analysis developed by Frank-Lenzmann-Silvestre to the mixed operator establishing the monotonicity of the quotient of a hypothetical nontrivial even kernel element by $-Q'$. We then combine this monotonicity with oscillation estimates to prove nondegeneracy, and uniqueness follows by continuation. Moreover, for every $1/2\le s<1,p>0$, both uniqueness and nondegeneracy hold for positive solutions. Our novelty is to use the properties of Green kernel of the mixed operator to derive the upper bound and lower bound on the maximum of each solution. This peak estimate allows us to prove uniqueness by direct comparison and to establish nondegeneracy.

comments
54 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12035 ↗

We construct blow up solutions to the scalar Zakharov system in dimension $3$. More precisely, we construct the solutions $(ψ,n)$ defined for $t\in[0,T)$, blowing up at $t=T$ and taking the form \begin{align} ψ(t,x) \sim\frac{1}{T-t}P\left(\frac{|x|}{\sqrt{3}(T-t)^{\frac{2}{3}}}\right)e^{i(T-t)^{-1/3}}, n(t,x) \sim\frac{1}{3(T-t)^{4/3}}N\left(\frac{|x|}{\sqrt{3}(T-t)^{\frac{2}{3}}}\right) \end{align} in the region $|x|\ll 1$. Here $(P,N)$ is the solution to a specified ODE system related to Zakharov system. The solutions we construct are smooth for $0\leq t<T$. Moreover, there exist $n_0,n_1\in C^{\infty}(\mathbb{R}^3\backslash\{0\})$ with bounded support such that for any $r>0$, $(ψ,n,\partial_t n)$ converge to $(0,n_0,n_1)$ in $C^{\infty}(|x|>r)$. We correct the profile $(P,N)$ and obtain a sequence of approximate solutions that coincide in the region $|x|\gtrsim 1$ with higher and higher accuracy. Then we apply perturbative analysis to construct solutions with arbitrarily high finite regularity. The fixed point argument in this procedure actually yields that these solutions are the same for $t$ sufficiently close to $T$, which combined with the persistence of high regularity gives the existence of smooth asymptotically self-similar blow up solutions.

comments
44 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12052 ↗

We study nonlocal vector fields on the space of probability measures with finite second moment. Using Lions derivatives, we define their Lie-Lions bracket, which adds to the spatial Lie bracket a correction due to the evolution of the law, and prove that its vanishing is equivalent to commutation of the global flows, under first-order regularity and linear growth assumptions. We then construct a Lie algebra of complete polynomial nonlocal fields. For this class, we establish commutator and second-order Baker-Campbell-Hausdorff formulas with cubic remainders in the Wasserstein distance $W_2$, controlled by the second moment and uniform in the number of particles. The proofs rely on finite-particle realizations, which preserve the bracket and jointly determine the nonlocal field. We also obtain uniform estimates for smooth bounded kernels and a Leibniz rule for the action of polynomial fields on polynomial observables. Examples from collective dynamics show that the vanishing of the spatial bracket at a fixed law is neither necessary nor sufficient for commutation. They concern symmetries, aggregation-dependent rotation, synchronization, the transmission of a turn along a hierarchy, effective three-body interactions and occupancy-dependent circulation.

fields
Analysis of PDEs, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.12108 ↗

We consider toroidal pseudodifferential operators with spatially dependent, operator-valued symbols of positive order and finite regularity. For an arbitrary complex Banach space $E$, we prove that the negative of the closure of a parabolic operator on $C^\infty(\mathbb T^n,E)$ generates an analytic semigroup on $W_p^k(\mathbb T^n,E)$, where $1\le p<\infty$ and $k\in\mathbb N_0$, provided the symbol has sufficiently many spatial derivatives and discrete differences. The proof combines uniform estimates for parameter-dependent kernels with right and left parametrices. It does not require the UMD property of $E$. Real interpolation gives corresponding resolvent estimates on $B_{pq}^s(\mathbb T^n,E)$ for $0<s<k$ and $1\le q\le\infty$. The induced semigroups are strongly continuous for $q<\infty$ and on the little Besov spaces when $q=\infty$.

comments
34 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12221 ↗

We study the subellipticity of the analytically deformed Kramers-Fokker-Planck operator and give two definitions of resonances, one based on analytic dilation and the other on analytic distortion in the $x$-variables. Due to the failure of global subellipticity of the distorted operator in dimensions $n \geq 2$, the second method can only be used in dimension one. We show that, whenever both methods are applicable, they give rise to the same set of resonances. We also prove that, when $|\na V(x)| = O(\w x^{-ρ})$ with $ρ>1$, positive resonances are embedded eigenvalues and/or scattering resonances whose resonant states belong to weighted $L^2$-spaces and satisfy an outgoing radiation condition.

fields
Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2611.12272 ↗

In this paper, we study the rightward spreading speed of solutions for Fisher-KPP equations in shifting environments. The linear growth rate has time periodic limits at the two ends of the moving frame. Each limit has a positive average and may be negative during a period. When the growth rate lies between the two limits at each time, we show that the spreading speed depends only on their averages and the asymptotic shift speed. For intermediate shift speeds, the formulas give nonlocal pulling if the right end has the larger average and speed locking if the left end has the larger average. The interior growth profile may be nonmonotone in space and aperiodic in time. We prove the formulas by constructing upper and lower solutions for a stepwise profile and then comparing with shifted stepwise problems.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12274 ↗

Instability phenomena are ubiquitous in multi-fluid flows. For binary fluid mixtures, phase separation may occur under specific conditions, in which a homogeneous state becomes unstable and spontaneously segregates into different phases, leading to the formation of distinct patterns. Furthermore, when a heavier fluid is superposed over a lighter one in a gravitational field, the fluid interface can be sensitive to perturbations that trigger the Rayleigh–Taylor (RT) instability, i.e., the lighter fluid penetrates upward into the heavier fluid against gravity. We investigate such instability phenomena and the inhibiting conditions for incompressible, immiscible two-phase flows with unmatched densities, within the framework of a diffuse-interface model, which is called the Abels–Garcke–Grün (AGG) model. More precisely, we adopt energy methods to establish several stability/instability conditions for the perturbed system of the AGG model, which is obtained by slightly perturbing the equilibrium profile $(\mathbf{0},\overline{\varphi})$, where $\overline{\varphi}=\overline{\varphi}(x_3)$ depends solely on the vertical coordinate $x_3$. Notably, for a constant equilibrium profile $\overline{\varphi}=α\in(-1,1)$ satisfying $Ψ''(α)<0$, we establish a threshold for stability and instability of the phase-separation problem.Similar stability results are also established for the perturbed system with $\overline{\varphi}$ satisfying the RT instability condition in the presence of gravity. In particular, if the phase-separation condition fails and $\partial_{x_3}\overline{\varphi}$ is a constant, a larger value of $\partial_{x_3}\overline{\varphi}$, a greater interfacial thickness and a higher surface energy density contribute to inhibiting RT instability.

comments
43 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12298 ↗

This paper is devoted to the study of invariant weighted Sobolev spaces for the Calogero–Moser derivative nonlinear Schrödinger (CMDNLS) equation on the real line. For \(s\geq 1\) and \(0\leq r\leq s\), we first prove that the \(H^s(\mathbb R)\) flow preserves the condition \((1+x^2)^{r/2}u\in L^2(\mathbb R)\). The proof uses truncated weighted energy estimates and weighted interpolation. We then establish the persistence of weighted regularity for spatial derivatives. For integers \(p\geq 3\) and \(1\leq m\leq p-2\), and for \(0\leq r\leq p-m \), the \(H^p(\mathbb R)\) flow preserves the conditions \((1+x^2)^{r/2}\partial_x^j u\in L^2(\mathbb R)\) for \(0\leq j\leq m\). This result combines weighted energy estimates, the unitary equivalence and the integrable structure of the CMDNLS equation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12331 ↗

This paper is devoted to a uniform spectral Silverman-Meadows rank condition for the nullcontrollability of coupled systems of heat equations with time-dependent diffusion, coupling and control matrices. The proof relies on an adaptation of the Lebeau-Robbiano strategy combined with uniform finite-dimensional observability estimates associated with each Laplace eigenmode.

fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.12336 ↗

We study positive solutions of $Δu=λu^k$ on bounded planar corner domains with zero boundary values away from the vertex. For negative-power absorption we identify the admissible interval of Martin masses and prove uniqueness at the minimum mass. Along the ordinary boundary, we identify the weak Hessian endpoint and its sharp tail when the set of zero inward derivative has positive length. For superlinear sources we prove attainment of the largest positive Martin mass in the subcritical range. At criticality we construct a family of singular solutions with zero Martin mass and distinguish its members by their second logarithmic coefficient and the endpoint integrability of their Hessian differences. Above criticality an angular eigenvalue governs the Morse index away from its zero threshold. We also give sharp physical-Hessian asymptotics for finite-mass remainders and joint corner and side estimates for negative-power sources.

comments
54 pages, no figures,
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12421 ↗

We study a logarithmic Gauss curvature flow of strictly convex capillary hypersurfaces in the Euclidean half-space. For an acute contact angle and an arbitrary positive smooth prescribed function, we prove that a suitable initial dilation yields a global solution which converges smoothly after a horizontal translation with a uniquely determined constant velocity. As an application, we provide a logarithmic flow proof of the capillary Minkowski problem, previously established by Mei-Wang-Weng [Adv. Math. 469, 110230 (2025)].

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12455 ↗

Let $d\geq 2$. For each $j\in \{1,\dots,d\}$, let ${\ell}_{j}\geq 1$ and $m_{j}\geq 2$ be integers, and let $a_{j}$ be a nonzero real number. We prove that the oscillatory integral operator \begin{equation*} T_{{\ell}_{1},\dots,{\ell}_{d},m_{1},\dots,m_{d}}f(x):=\int_{\mathbb{R}^{d}} e^{\dot{\imath} \left(a_{1}x^{{\ell}_{1}}_{1}y^{m_{1}}_{1}+\dots +a_{d}x^{{\ell}_{d}}_{d}y^{m_{d}}_{d} \right)}f(y)dy,\;\;\; x\in \mathbb{R}^{d}, \end{equation*} satisfies the restriction estimate \begin{equation*} \|T_{{\ell}_{1},\dots,{\ell}_{d},m_{1},\dots,m_{d}}f\|_{L^{2}(\mathbb{S}^{d-1})}\lesssim \|f\|_{L^{p}(\mathbb{R}^{d})}, \end{equation*} for each $1\leq p\leq 2$, whenever $(\frac{\ell_{j}}{m_{j}}-\frac{1}{m_{j}}+1)\frac{2}{p^{\prime}}\geq 1$, for every $j\in Γ$, and \begin{equation*} \mathcal{E}:=\min{\left\{\min_{1\leq j\leq d}{\frac{m_{j}}{{\ell}_{j}}},\,\min_{1\leq k\leq d}{\frac{d-1}{\sum_{j\neq k} \frac{\ell_{j}}{m_{j}}+\frac{2}{m_{k}}}}\right\}}> \frac{2}{p^{\prime}}. \end{equation*} We also give counterexamples that show that the condition $\mathcal{E}\geq 2/p^{\prime}$ is necessary for this restriction inequality.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.12463 ↗

We develop the microlocal analysis of the Cauchy evolution for wave-type equations on the infinite-dimensional space of Lorentzian metrics. We regard the Cauchy evolution operator as a distributional function of the metric, and give this notion a precise meaning through restrictions to finite-dimensional families of metrics. We study the singularities of this metric dependence. For normally hyperbolic operators on vector bundles, we determine the resulting operator-valued wavefront sets. Their parameter covectors are given by integrals of metric variations along individual null geodesics. At ultrastatic ends, metric dependence also determines the time-translation generators and their positive- and negative-energy splitting. More generally, the parameter singularities distinguish the two characteristic sheets and can be used to reconstruct the ordinary Cauchy propagation relation, which describes propagation of singularities. Consequences include smoothing under parameter averaging and polar-cone bounds associated with averaged null-positive variations, linking the result to averaged null energy conditions. The analysis also covers the Cauchy evolution of the Dirac equation.

comments
29 pages, 1 Figure
fields
Analysis of PDEs, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.12488 ↗

From plasmid dynamics and efflux pump expression in bacteria to risk-taking behaviour in human groups, horizontal interactions can drive the transmission of deleterious traits that spread despite carrying no selective advantage, thereby burdening the population. How can such detrimental traits persist, and under what conditions can the population avoid extinction? To address these questions, we model a population structured by a continuous trait representing individual burden within a non-linear, non-local integro-differential framework. From an analytical perspective, mutations are modeled via a jump operator rather than a diffusion term; consequently, the mutation operator lacks regularizing properties and is generally non-self-adjoint. Moreover, working in a weighted L 1 setting precludes the direct application of standard Krein-Rutman theory. To overcome these hurdles, we construct a custom fixed-point operator by first freezing the non-linearities to solve an auxiliary eigenvalue problem, and then tuning the resulting principal eigenvalue. Applying the Leray-Schauder fixed-point theorem to this operator rigorously yields the existence of a non-trivial steady state. Finally, numerical simulations illustrate the qualitative dynamics of the model and delineate the parameter regimes governing population persistence and extinction.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12523 ↗

In this paper, we study the inverse problem of determining the coefficient $q$ and the nonlinearity $F$ in the semilinear biharmonic equation $Δ^2 u+q(x)u=F(x,u)$ with Navier boundary data. The measurement consists of $\partial_νu(x_0)$ at a fixed boundary point $x_0$. We apply the mixed variation approach to linearize the nonlinear problem and construct semiclassical boundary-localized solutions for the linearized equation. Under suitable analyticity, nonresonance, and nondegeneracy assumptions on $q$ and $F$, we prove that this boundary point measurement uniquely determines both $q$ and $F$. We also establish boundary determination of all normal derivatives of $q$ and of the first nonzero Taylor coefficient of $F$ on a nonempty relatively open subset of the boundary. When the linear potential $q$ is known, we prove that either component of the Navier boundary input alone suffices to determine $F$, and that the polynomial nonlinearity can be uniquely determined without requiring any analyticity conditions. For suitable finite-dimensional classes of nonanalytic potentials, we also obtain, for fixed $F$, the stable determination of $q$ from finitely many boundary inputs and the associated point measurements. In addition, as an important supplement, we provide nontrivial examples verifying the main assumptions, as well as counterexamples concerning the recovery of the linear coefficient. Finally, we present numerical experiments that demonstrate the theoretical results.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12551 ↗

For the initial and initial-boundary value problems of the two-dimensional (2D) incompressible Navier-Stokes equations with density-dependent viscosity and vacuum, Lions' global weak solutions are shown to possess additional regularity, via establishing some key a priori decay-in-time rates for the approximate problem, under suitable smallness condition on the density-dependent viscosity. In addition, large-time decay rates of the pressure and gradient of velocity are obtained, which are even exponential in time for bounded domains or the periodic case. Note that these results hold without any smallness conditions on the initial data, even for initially vanishing density.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12759 ↗

In variational models of pattern formation, periodic solutions are never isolated: since the energy does not change under translations, every shifted copy of a pattern is again a solution. This is an obstacle for computer-assisted proofs, which need isolated solutions. Imposing discrete symmetries removes the obstacle, but restricts the patterns that can be studied and only gives stability against symmetric perturbations. We develop a computer-assisted method that deals with the translations directly. We fix the position of the pattern with phase conditions and add unfolding parameters. They act as Lagrange multipliers, and translation invariance of the energy ensures that they vanish at a solution, under a condition that is verified rigorously by the computer. We then derive the stability of the pattern from the computer-assisted proof. We obtain the number of unstable directions and show that the only neutral directions are the translations. We apply the method to the Swift-Hohenberg equation in two dimensions and prove the existence of stable and unstable patterns without imposed symmetry. Since the linear algebra does not depend on the number of translation directions, the approach extends to higher dimensions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12826 ↗

We study the three-dimensional incompressible Navier–Stokes equation on the cubic torus with a constant odd-viscosity operator given by the vertical derivative of the curl. Arbitrary real, mean-zero, divergence-free initial data and an independent steady force, both in the second-order Sobolev space, admit a unique global strong solution when the magnitude of one fixed odd-viscosity coefficient is at least a norm-uniform sufficient threshold. In the unforced case the solution is smooth at positive times. The qualitative argument adapts the resonant-averaging framework for rapidly rotating fluids to the different odd-viscous dispersion. Weighted lattice counts and signed corrected-energy estimates yield a sufficient bound for the odd-to-ordinary viscosity ratio that is polynomial in the normalized initial-data radius at each fixed normalized force radius, together with a separate bound in a specified force-dominated regime. No optimality is claimed for the polynomial exponents or prefactors; determining the sharp viscosity threshold for the original equation remains open. Direct kinetic and weighted enstrophy barriers also give regularity for every coefficient on explicit bounded data and force regions, including the closed unforced ball of homogeneous second-order Fourier Sobolev radius ninety-seven fortieths times the viscosity and seven closed forced rectangles. We specify how finite certificates enter the analytic argument and distinguish minimization of a sufficient formula from sharpness for the original equation. All three main theorems are formally verified in Lean 4 with Mathlib.

comments
79 pages
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.12862 ↗

Combinatorics74

Tight gradings, which are certain integer gradings on maximal Dyck paths, provide a combinatorial framework for computing all coefficients of wall-functions in rank-$2$ cluster scattering diagrams. We construct a bijection between a special subset of tight gradings and the intervals of the $m$-Tamari lattice, providing a new combinatorial proof of the central wall-function formula proved by Reineke. Inspired by the structure of these gradings, we introduce a class of plane trees called $m$-leafy trees that give a new model for $m$-Tamari intervals. The defining condition of an $m$-leafy tree is simple: in every full subtree, the number of leaves is greater than $m$ times the number of internal vertices. The leafy tree perspective gives rise to a quadratic functional equation with a catalytic parameter, providing an alternative way to enumerate $m$-Tamari intervals.

comments
13 pages, this is an extended abstract with a full paper coming soon. Comments welcome
fields
Combinatorics
pdf ↗ page arXiv:2611.10154 ↗

Difference distance magic oriented graphs (DDMOGs) are oriented graphs whose vertices admit a bijective labeling by consecutive positive integers such that every vertex has weight zero, where the weight is the sum of the labels of its in-neighbors minus the sum of the labels of its out-neighbors. We investigate minimality and sparsity questions for DDMOGs and their ornaments. First, we develop new constructions of cycle-based ornaments that reduce the number of cycles required for a given number of attachment nodes and identify minimal cycle lengths in several cases. Second, we determine the minimum number of arcs in a nontrivial DDMOG of order $n$, combining computational enumeration for small orders with theoretical lower bounds and constructions. Langford sequences provide a key tool in these constructions, enabling us to partition consecutive labels into difference triples and thereby construct sparse DDMOGs. Finally, we use related constructions to obtain generalized ornaments with no internal arcs. These results advance the study of minimal constructions in difference distance magic labeling and provide new methods for building sparse DDMOGs.

comments
22 pages, 18 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.10196 ↗

We determine the exact completeness threshold for standard positive linear recurrence sequences whose coefficient lists consist of leading units, followed by zeros and a final positive coefficient. Using the generating function of Brown's gaps, we prove a necessary and sufficient condition for completeness, including the boundary case in which the critical gap vanishes. We further establish strict monotonicity of the unrounded threshold in the number of leading units, thereby resolving the corresponding leading-unit monotonicity conjecture.

comments
7 pages, 2 figures
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.10200 ↗

List replicability measures how many accurate hypotheses suffice to contain the output of a learning rule with arbitrarily high confidence. We prove that every nonempty class of $m$ binary concepts on $n$ domain points has list replicability at most $805\ln(2m)\ln(2n)$. This resolves the logarithmic-product conjecture of Blondal, Hatami, Hatami, Lalov, and Tretiak. Hanner matrices give lower bounds of the same order, for square matrices and for explicit families with unequal logarithmic aspect ratios. The upper bound is obtained by constructing nested acyclic sets in the faces of a cube. A critical-point estimate supplies highly connected regions, weighted cell attachments keep the sets compatible across faces, and a cubical carrier theorem converts them into accurate finite covers and learning rules. Appending one constant coordinate turns list replicability into an exact geometric quantity, the face width, and graph-orientation classes satisfy exact product formulas. In particular, there are explicit classes with list replicability $4k+1$ and equivariant index $3k$, so the additive gap between the two is unbounded. We also develop entropy-tilting and two-sided Gibbs constructions, give combinatorial upper bounds adapted to structured matrices, compute exact values on classical families, and study the index of Paley matrices.

comments
292 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.10408 ↗

Classical Bulgarian solitaire tracks only the sizes of the stacks. We ask how the lengths of its periodic orbits change when individual cards are distinguished. To study this question, we introduce four actions $T_1,T_2,T_3,T_4$ on partitions with labeled cells. The actions differ in whether the top or bottom cell is removed from each column and in the order in which the removed cells are arranged to form a new column. We determine the exact sizes of the periodic orbits for all four actions. The main work lies in the analysis of $T_2$, for which we develop a coloring algorithm on Ferrers diagrams. The coloring encodes the cycle structure of the permutation of the labels induced by one full period of the underlying partition.

fields
Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2611.10437 ↗

Nayak et al. (2025) introduced the concept of convex subhyperlattices of a strong join hyperlattice $\mathfrak{L}$ and demonstrated that the collection of all convex subhyperlattices, $\operatorname{CS}(\mathfrak{L})$, together with empty set, forms a lattice. In particular, for $P$-hyperlattices and Nakano hyperlattices, they obtained a unique representation of convex subhyperlattices in terms of hyperideals and hyperfilters. In the present work, we extend these studies by proving that $\operatorname{CS}(\mathfrak{L}) \cup \{\emptyset\}$, under set inclusion, forms an algebraic lattice. Moreover, we introduce two new orders on $\operatorname{CS}(\mathfrak{L})$ and examine their properties, including conditions for equivalence of these orders. In the class of $P$-hyperlattices, we characterize convex subhyperlattices in terms of initial and final segments, providing a structural insight into their formation. When convexity is extended to arbitrary join hyperlattices, many results known for $P$-hyperlattices and Nakano hyperlattices fail to hold. To address these limitations of convexity in arbitrary hyperlattices, we introduce the notion of strongly convex sets, denoted $\operatorname{SC}(\mathfrak{L})$, which naturally generalizes the concept while preserving its fundamental properties and extends the applicability of results to a wider setting. We establish several results for $\operatorname{SC}(\mathfrak{L})$ that do not hold for $\operatorname{CS}(\mathfrak{L})$.

fields
Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2611.10526 ↗

For a connected graph $F$, a graph $G$ is $F$-irregular if the numbers of copies of $F$ containing its vertices are pairwise distinct. We characterize which connected patterns admit regular $F$-irregular hosts of every sufficiently large degree. Stars admit no regular $F$-irregular host; for every other $F$, every sufficiently large integer $r$ is realized by a connected $r$-regular $F$-irregular graph of diameter two and order $r+o(r)$, optimal to first order. For triangles, and equivalently four-vertex paths in regular graphs, we construct such hosts of order less than $r+73r^{\log29/\log58}$ above an explicit threshold, with the constant reduced to $44$ for even $r$. Lexicographic words encode distinct rooted subgraph counts, while layered connections allow the common degree to be prescribed. Rooted-homomorphism expansions and spectral amplification establish separation for general patterns; an exact uniform-increment identity gives the quantitative triangle construction. The finite seed graphs are explicitly constructed, and their required rooted-count distinctions are verified by exact-arithmetic certificates.

comments
37 pages, 2 ancillary Python verification scripts
fields
Combinatorics
pdf ↗ page arXiv:2611.10557 ↗

In pinwheel scheduling with real periods, an instance consists of $n$ tasks with real periods $1\le a_1\le a_2\le\cdots\le a_n$. The goal is to find a schedule that assigns one task to each day indefinitely such that, for every task $i\in\{1,\dots,n\}$ and every positive integer $\ell$, task $i$ occurs at least $\ell$ times in every block of $\lceil\ell a_i\rceil$ consecutive days. Given an instance $(a_1,a_2,\dots,a_n)$, its dimension is $n$, its density is $\sum_{i=1}^n1/a_i$, and its potential is $\sum_{i=1}^{n-1}1/a_i$. We prove that every real-valued instance of density at most 5/6 admits a periodic schedule of period length less than $4\cdot2^n$. For integer periods, the 5/6 density bound was a long-standing conjecture settled by Kawamura using a computer-assisted proof [STOC 2024, PNAS 2026]. Our result confirms the real-period conjecture of Fujiwara, Miyagi, and Ouchi [DMTCS 2026]. Our computer-assisted proof builds on Kawamura's ideas while using fewer explicit schedules. It combines dimension reduction by folding with nine satisfiability modulo theories (SMT) checks over linear real arithmetic. A set of 14287 explicit periodic schedules contains a schedule for every instance of dimension at most 8 and density at most 5/6, and for every instance of dimension 9 and potential at most 5/6. Folding is used to reduce every instance of larger dimension and potential at most 5/6 to an instance of dimension 9 and the same potential bound. We also prove that every real-valued instance with minimum period at least 4 and density at most 17/20=0.85 admits a periodic schedule of period length less than $19\cdot2^n$. The density bound 17/20 is tight and improves the 0.84-bound of Mishra, Rho, and Kleinberg [arXiv 2025] for integer periods. It also resolves the $a_1=4$ case of Kawamura's 2025 conjecture that integer-valued instances of density at most $1-(a_1-1)/(a_1(a_1+1))$ are schedulable.

fields
Combinatorics
pdf ↗ page arXiv:2611.10624 ↗

Capparelli, Meurman, Primc and Primc (CMPP) extended the frequency conditions in Gordon's partition theorem to paths in coloured arrays. Their conjecture for type $C_n^{(1)}$ identifies the generating function of admissible arrays with a principally specialized character. We prove this conjecture for arbitrary boundary data by constructing an ordered Poincaré–Birkhoff–Witt (PBW) basis of the corresponding integrable highest weight module. A decomposition of the admissible arrays and a tensor product argument establish linear independence of the corresponding monomial vectors. To prove spanning, we use relations from annihilating fields and PBW bases for modules over finite Levi subalgebras. Principal specialization then yields the conjectured product. The same basis identifies the number of parts with the degree in the associated graded module for the PBW filtration.

fields
Combinatorics
pdf ↗ page arXiv:2611.10654 ↗

We consider matroid intersection under the minimum rank oracle model, in which two matroids are accessible only through an oracle that returns the minimum of the ranks of a given set in the two matroids. By Edmonds' theorem, this oracle determines the matroid intersection polytope, although it does not reveal the exchangeability graphs on which classical algorithms rely. Recent work by Bárász, Bérczi, Király, Oki, Yamaguchi, and Yokoi (2025) showed that unweighted matroid intersection is polynomially solvable in this model. In this paper, we present a strongly polynomial-time algorithm for weighted matroid intersection in this model. The key to our algorithm is a polynomial-size extended formulation of tangent cones of common base polytopes that can be constructed using the minimum rank oracle. We also give min-max theorems in terms of the minimum rank function via 1/3-submodularity, and present a strongly polynomial-time algorithm to compute an optimal dual solution.

fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.10701 ↗

We prove that the poset of $s$-noncrossing partitions is isomorphic to the core label order of the $ν$-Tamari lattice introduced by Préville-Ratelle and Viennot.

comments
15 pages, 18 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.10716 ↗

We exhibit a set of 43 points in the Euclidean plane whose unit-distance graph has 83 edges, girth 5 and chromatic number 4. The smallest previously known 4-chromatic unit-distance graph of girth 5, due to Hochberg and O'Donnell (1996), has 45 vertices. The new graph is 4-critical, has trivial automorphism group, and has exactly 2n-3 edges; it is a Laman graph and its unit-distance realisation is infinitesimally rigid. The coordinates are algebraic numbers, specified as the unique real solution of an explicit system of 82 quadratic equations inside an explicit rational box. Every claim is certified by exact computation: existence and uniqueness of the realisation by a rational contraction-mapping certificate (independently re-checked with interval Krawczyk arithmetic), and non-3-colourability both by exhaustive search and by a DRAT proof verified with drat-trim.

comments
7 pages, 2 figures. Certificates, verification scripts and DRAT proof: https://doi.org/10.5281/zenodo.24036368
fields
Combinatorics
pdf ↗ page arXiv:2611.10735 ↗

We combine degree sequence bounds with a supporting tangent plane method to study maximum volume polytopes inscribed in the sphere $\mathbb S^2$. Building on the vertex-star estimates and combinatorial reductions in Wimmer's dissertation, we determine the exact maximum for ten vertices and the unique maximizing combinatorial type for eleven vertices. Moreover, using explicit computational certificates we identify a unique possible maximizing type for polytopes with thirteen and fifteen vertices, and two possible types for sixteen vertices; this approach also recovers Wimmer's fourteen-vertex combinatorial theorem. Finally, we derive a facial inequality which holds for every degree pattern, and prove that the maximum volume for polytopes with thirty-two vertices is $\frac{2}{3}\sqrt{10(5-\sqrt{5})}$, attained precisely by an inscribed realization of the pentakis dodecahedron, which is the convex hull of the regular icosahedron together with its normalized facet centers. Wimmer had already determined this configuration and its optimality within its own combinatorial type. We also obtain a global degree sequence envelope and a universal affine volume bound.

comments
69 pages, 7 figures
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.10777 ↗

We study the Hermitian adjacency matrix of the second kind for biased orientations of Erdos-Renyi random graphs. In the model $D(n,p,p')$, an edge is present with probability $p$ and, conditional on its presence, is directed from its smaller to its larger endpoint with probability $p'$. Both parameters may depend on $n$, and biased tournaments are the special case $D(n,1,p')$. We prove a global semicircle law whenever $n(p(1-p)+3p^2p'(1-p')) \to \infty$, for both the centered and the uncentered matrix, and also for the expected empirical spectral measure. Our second theorem gives the exact spectrum of the mean matrix and the limits of the extreme eigenvalues on the scale $np$, under a sufficient density assumption. The main difference from the unbiased random orientations (where $p'=1/2$) is emergence of multiple large eigenvalues. The proofs include the closed-walk counting, control of the moment variances, an explicit diagonalization of the deterministic bias, and the passage from centered to uncentered spectral measures.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.10862 ↗

Let $G$ be a bipartite graph with parts $A$ and $B$, and let $Δ_A$ and $Δ_B$ be the maximum degrees of the vertices in $A$ and in $B$, respectively. Brualdi and Quinn conjectured that the strong chromatic index of $G$ is at most $Δ_AΔ_B$. We prove that the fractional strong chromatic index of $G$ is at most $Δ_AΔ_B$, and that the conjecture holds asymptotically: $χ_s'(G)\le(1+o(1))Δ_AΔ_B$ as $\max\{Δ_A,Δ_B\}\to\infty$. The error term is $12(\lnΔ)^{1/2}Δ^{-1/4}$ with $Δ=\max\{Δ_A,Δ_B\}$. Both results rest on a smart partition of edges and Lovász Local Lemma.

comments
8 pages. Comments are welcome
fields
Combinatorics
pdf ↗ page arXiv:2611.10883 ↗

We prove Whiteley's conjecture that every nontrivial vertex split of a generically globally rigid graph preserves generic global rigidity in \(\mathbb{R}^d\), for all \(d\geq1\). We give two proofs of the stronger assertion that the split graph is infinitesimally rigid at every generic coincident realisation of the two split vertices. Both proofs use maximum-rank equilibrium stress matrices and then apply the coincident-rigidity criterion of Cruickshank, Jackson and Tanigawa. The second construction also shows that every generically globally rigid graph admits a nondegenerate equilibrium stress of maximum rank at every generic realisation, establishing a conjecture of Jordán and Tanigawa.

fields
Combinatorics
pdf ↗ page arXiv:2611.10919 ↗

We present new positive combinatorial formulas for triple Schubert coefficients in mixed-variable products of double Schubert polynomials, $\mathfrak{S}_u(x;y)\mathfrak{S}_v(x;z)$, expressed in the $\mathfrak{S}_w(x;y)$ basis, in the case where $u$ is dominant. This result complements earlier results where $v$ was assumed dominant. To generalize further, we introduce a relation on permutations that we call ``domination,'' under which dominant permutations dominate all others. When $u$ dominates $w$, we obtain an explicit positive formula for $c^w_{u,v}(y;z)$, which in particular yields positivity when $u$ and $v$ have separated descents. In addition to these new positivity results, we establish a product–splitting equivalence for double Schubert polynomials, relating triple Schubert coefficients to splitting coefficients. This equivalence highlights structural symmetries and provides reduction methods for computing coefficients that are otherwise difficult to access. Taken together, these results extend the range of double Schubert polynomial products for which positivity can be established combinatorially and yield explicit formulas that can be implemented computationally.

comments
28 pages, 8 figures
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.10953 ↗

Given a graph $Γ$ with vertex set $V(Γ)$ and a set of colored vertices S, the zero forcing rule is an iterative graph coloring process which states that a colored vertex with exactly one uncolored neighbor forces that neighbor to become colored. If repeated application of this rule eventually colors every vertex of $Γ$, the set $S$ is called a \emph{zero forcing set}. Now, if the induced subgraph $Γ\vert_S$ is connected, then $S$ is called a \textit{connected zero forcing set}. The minimum cardinality of such a set is the \emph{connected zero forcing number} $Z_C(Γ)$. A \emph{connected zero forcing polynomial} of a finite graph $Γ$ is a monic polynomial $Z_C^Γ(x) \;=\; \sum_{k} a_k x^k$, where $a_k$ counts the number of connected zero forcing sets of $Γ$ of size $k$, which we denote by $Z_C(Γ,k)$. In this paper, we find the connected zero forcing polynomial of any finite tree $T$. We then establish sharp lower bounds for each coefficient of the connected zero forcing polynomial, over all trees on $n$ vertices with $p$ many pendant vertices. We also identify a family of trees, which we call uniform trees, and we prove that for any tree on $n$ vertices and $p$ many pendant vertices, there exists a uniform tree on $n$ vertices and $p$ many pendant vertices, whose connected zero forcing polynomial bounds as an upper bound, the connected zero forcing polynomial of the tree coefficient wise. Again for $2\leq p\leq 4$, we establish a sharp upper bound for each coefficient of the connected zero forcing polynomial, over all trees on $n$ vertices with $p$ many pendant vertices.

fields
Combinatorics
pdf ↗ page arXiv:2611.10985 ↗

For any simple graph $G$ on $n$ vertices, write its chromatic polynomial in the rising factorial basis as $P(G,x)=\sum_{j=0}^{n}(-1)^{n-j}c_j x^{\langle j\rangle}$, where $x^{\langle j\rangle}=\prod_{i=0}^{j-1}(x+i)$ for any $j\ge 1$ and $x^{\langle0\rangle}=1$. Brenti (1992) introduced the $τ$-polynomial and its augmented version, defined by $$τ(G,x)=\sum_{j=0}^{n}c_jx^j, \qquad \overlineτ(G,x)=\sum_{j=0}^{n}j!c_jx^j.$$ He asked whether $τ(G,x)$ always has only real roots and whether $\overlineτ(G,x)$ always has a log-concave coefficient sequence. In this paper, we show that for any integer $d\ge 4$, there exists an integer $h_d$ such that, for every connected $d$-regular graph $G$ of girth at least $h_d$, the coefficient sequence of $τ(G,x)$ fails to be log-concave. This failure also occurs for $\overlineτ(G,x)$, and Newton's inequalities imply that $τ(G,x)$ has nonreal roots. Thus both questions have counterexamples among regular graphs of arbitrarily large girth.

fields
Combinatorics
pdf ↗ page arXiv:2611.11056 ↗

For even $t$ and an $n$-set $X$, an $(n,t)$-splitting system is a family ${\mathbb{B}} \subseteq 2^X$ with the property that for each subset $Y \in {X \choose t}$, there exists $B \in \mathbb{B}$ such that $|B \cap Y| = t/2$. The problem of interest is to determine the minimum size of such splitting systems. We show that any $(n,t)$-splitting system has size at least of order $t$, improving the previous lower bound of $\sqrt t$ while the best known upper bound is of order $t^{3/2}$.

comments
13 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.11126 ↗

For a finite simple graph $G$, let $ν(G)$ be the maximum number of edge-disjoint triangles and let $τ(G)$ be the minimum number of edges meeting every triangle. We prove $τ(G)\le2ν(G)$ when each edge belongs to at most four triangles, the edges belonging to four triangles form components with at most two edges, and the maximum average degree is at most $25/2$. No upper bound on maximum vertex degree is imposed. We also localize the density condition. Let $K$ be the Hifumi core, defined as the vertex set of the 4-core of the spanning subgraph formed by edges belonging to at least three triangles. It suffices to impose the density condition on $G[K]$, including all original edges between vertices of $K$. More generally, when the four-triangle edges have maximum degree at most two, reductions produce a subgraph $R\subseteq G[K]$ with $τ(G)-2ν(G)\leτ(R)-2ν(R)$. Consequently an empty core gives a density-free sufficient condition. For the first graph class, a quantitative surplus argument strengthens both the global and localized density conditions to the strict bound $25/2+2/56775$. The proof combines edge reductions, discharging, finite certificates and a weak König–Egerváry lemma for links of arbitrary order. The general conjecture and the removal of the density condition from the first graph class remain unresolved here.

comments
21 pages, 3 figures. Verification materials: reserved DOI 10.5281/zenodo.24047493; public release planned after arXiv announcement
fields
Combinatorics
pdf ↗ page arXiv:2611.11128 ↗

For integers $t\ge 2$ and $\ell\ge 3$, let $R^t_{t-1}(C_\ell)$ be the least integer $n$ such that every colouring of the edges of $K_n$ with $t$ colours contains a cycle of length $\ell$ whose edges use at most $t-1$ colours. Bucić and Khamseh determined the analogous number for paths and asked for its value for cycles. We answer this question for three colours: we show that $R^3_2(C_\ell)=\ell+\lfloor(\ell+1)/6\rfloor$ for every $\ell\ge 11$, and we determine the values for $3\le \ell\le 10$.

fields
Combinatorics
pdf ↗ page arXiv:2611.11187 ↗

The $k$-token graph $F_k(G)$ of a graph $G$ has as vertices the $k$-subsets of $V(G)$, two of them being adjacent when their symmetric difference is an edge of $G$. Let $S_n$ be the star with $n$ leaves. Since every edge of $S_n$ is incident with the center, $F_k(S_n)$ is the inclusion graph of the $(k-1)$- and the $k$-subsets of the leaves. We use this identification to determine its diameter, radius, girth, Wiener index and number of spanning trees, and to decompose $F_k(S_{n+1})$ into $F_k(S_n)$ and $F_{k-1}(S_n)$ joined by a matching; the parameters of $F_k(S_n)$ that are already known, such as its connectivity, independence number, automorphism group and spectrum, are collected in an appendix. The two parameters that the identification does not settle are the domination and the packing numbers. For the domination number we prove, for fixed $k \ge 3$, that $(1-\frac{k-2}{k-1}π_k-o(1))\binom{n}{k-1} \le γ(F_k(S_n)) \le (1-\frac{1}{2}(\frac{k-2}{k-1})^{k-2}+o(1))\binom{n}{k-1}$, where $π_k$ is the Turan density of the complete $(k-1)$-uniform hypergraph on $k$ vertices; for $k=3$ both constants are equal to $\frac{3}{4}$, so that $γ(F_3(S_n))=(\frac{3}{4}+o(1))\binom{n}{2}$, and the upper bound takes the exact form $γ(F_3(S_n)) \le \binom{n}{2}-\lfloor (n+1)^2/8 \rfloor$, which is attained for all $3 \le n \le 10$. For $k=4$ we improve the upper bound to $(\frac{17}{27}+o(1))\binom{n}{3}$, which matches the lower bound if Turan's conjecture $π_4=\frac{5}{9}$ holds. We show that the packing number of $F_k(S_n)$ equals the maximum size $A(n+1,4,k)$ of a binary constant-weight code, and we characterize when the packing and the domination numbers coincide, namely, for $2 \le k \le n-1$, exactly when $n=2k-1$ and a Steiner system $S(k-2,k-1,2k-1)$ exists; in that case both parameters equal the Catalan number $C_k$.

comments
42 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.11191 ↗

Suppose that $k$ of $n$ classrooms are to be dissolved and their students moved to the other classrooms so that the numbers of students in any two remaining classrooms differ by at most $d$. We give a necessary and sufficient condition on the numbers of students for this to be possible whichever $k$ classrooms are dissolved. Moreover, we determine how small the largest classroom can be when this is possible. In particular, when all classrooms have different sizes, the smallest possible size of the largest classroom is $d+\lceil (n-d-1)(n-d)/(2k)\rceil$ if $k<(n-d-1)/2$, and it is $n$ or $n+1$ otherwise. This extends the results of Siriseriwan and Sripatak, who studied the case $d=0$.

comments
9 pages, submitted
fields
Combinatorics
pdf ↗ page arXiv:2611.11203 ↗

A dominating $K_t$-model, introduced by Illingworth and Wood [J. Graph Theory, 2025], is a sequence $(T_1,\dots,T_t)$ of pairwise vertex-disjoint subtrees of $G$ such that every vertex of $T_j$ has a neighbour in $T_i$ for $1\leq i<j\leq t$. Let $\text{had}_{\text{d}}(G)$ denote the maximum order of such a model. We prove two dominating-model analogues of improvements to the classical Duchet-Meyniel bound [Ann. Discrete Math., 1982]. The first extends a result of Kawarabayashi, Plummer, and Toft [J. Combin. Theory Ser. B, 2005]. Every $n$-vertex graph $G$ with $α(G)\geq2$ satisfies $\text{had}_{\text{d}}(G)\geq(n+ω(G))/(2α(G)-1)$. Second, we prove a constant-factor improvement of the Duchet-Meyniel bound for dominating models: every graph $G$ satisfies $\text{had}_{\text{d}}(G)>0.51075n/α(G)$. This qualitatively extends the results of Fox [SIAM J. Discrete Math., 2010] and Balogh and Kostochka [Discrete Math., 2011]. An odd dominating $K_t$-model is a dominating $K_t$-model with an assignment of one of two colours to each vertex of $V(T_1)\cup\dots\cup V(T_t)$, such that every edge of each $T_i$ is bichromatic and, for $1\leq i<j\leq t$, some edge between $T_i$ and $T_j$ is monochromatic. Let $\text{had}_{\text{od}}(G)$ denote the maximum order of such a model. Our constant-factor improvement of the Duchet-Meyniel bound relies on our next result: every claw-free graph $G$ satisfies $\text{had}_{\text{od}}(G)\geq 2χ(G)/3$, generalising a result of Chudnovsky and Fradkin [J. Graph Theory, 2010]. The factor 2/3 is asymptotically best possible. For $t\geq2$, we prove that every $n$-vertex graph with no odd dominating $K_t$-model has independence number at least $(n+t-1)/(2t-2)$. For the stronger notion in which every vertex of $T_j$ has a neighbour of the same colour in $T_i$, we prove the analogous results with $(n+t-1)/(2t-2)$ replaced by $(n+t-1)/(3t-3)$.

comments
v1
fields
Combinatorics
pdf ↗ page arXiv:2611.11205 ↗

The famous Kőnig-Egerváry theorem is equivalent to the statement that a graph is bipartite if and only if the matching number equals the vertex cover number for every induced subgraph. Bessy, Ochem, and Rautenbach (J. Graph Theory 91 (2019) 73-87) generalized this theorem to $k$-paths by introducing the class $\mathcal{G}_k$ of graphs where, for every induced subgraph, the maximum number of disjoint paths of order $k$ equals the minimum number of vertices intersecting all such paths. They provided complete structural characterizations of graphs in $\mathcal{G}_k$ for $k \in \{3, 4\}$, and for odd $k$ when no cycle of order less than $k$ is present. Inspired by this nice work, we extend the Kőnig-Egerváry theorem to $k$-trees (i.e., trees with exactly $k$ vertices). We define the class $\mathcal{J}_k$ of graphs where, for every induced subgraph, the maximum number of disjoint trees of order $k$ equals the minimum number of vertices intersecting all such trees, and provide complete structural descriptions of graphs in $\mathcal{J}_k$ for all $k \ge 3$.

fields
Combinatorics
pdf ↗ page arXiv:2611.11207 ↗

We enumerate lattice points of preorder polytopes by support size for two-row Ferrers posets and recursively defined comb posets. For two-row posets, the order-ideal inequalities give a reflected-walk model in the nonnegative quadrant. Its transfer operators have a rank-one commutator, from which we derive an identity with five independent parameters. A matching-parameter specialization factors into the enumerators of a Motzkin excursion and a Motzkin bridge and proves the conjectured product of type~A and type~B Narayana polynomials for a two-row grid with its maximum removed. The general identity also records the two row supports separately. For combs, maximum ideal excess leads to a scalar recursion and a cubic generating function with independent spine and tooth weights. This proves a compositional-inverse conjecture of Athanasiadis and Chapoton and gives explicit $γ$-coefficients by Lagrange inversion. We prove $γ$-positivity for all two-row Ferrers cell posets and for the combs. The truncated-grid enumerators have simple negative zeros.

fields
Combinatorics
pdf ↗ page arXiv:2611.11259 ↗

We show that, for $p$ bounded away from $1$ and $np\to\infty$, the chromatic number of the binomial random graph $G_{n,p}$ is resilient to removal of a subgraph $H$ with $o(n \log(np))$ edges. It follows that the same assertion holds with $H$ being a subgraph of maximum degree $o(\log(np))$; and both these results are best possible up to a constant factor. We also prove corresponding results for the random $r$-regular graph $G_{n,r}$, when $r\to\infty$ and $r/n$ is bounded away from $1$, where $H$ has $o(n\log r)$ edges or maximum degree $o(\log r)$. Our results rely on a natural connection between chromatic resilience to edge removal and improper graph colouring. This work provides counterpoint to the work of Sudakov and Vu (2008) and Alon and Sudakov (2010), which treated chromatic resilience for $G_{n,p}$ subject to the addition, rather than removal, of edges.

comments
22 pages
fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.11280 ↗

This article gives Pieri rules for forest polynomials and Monk rule for double forest polynomials. We construct binary relations $\lessdot_i$ and $\prec_i$ based on the local Tamari moves on indexed forests. These relations are explicit and constructive. For ordinary forest polynomials, the $h$- and $e$-Pieri rules are given by all chains of a fixed length along the cover relations, with certain restriction on the left or right endpoints. For double forest polynomials, our Monk rule shows every off-diagonal degree-one structure coefficient is always a single positive root, whose weight is also controlled by Tamari moves. Additionally, we introduce an insertion algorithm on positive injective words that yields a Monk rule for the corresponding slide polynomials. Regrouping this rule along Sylvester classes gives an independent Monk rule for ordinary forest polynomials.

comments
33 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.11321 ↗

Let \(G\) be a finite simple graph without isolated vertices. Starting with every vertex uncovered, at each step sample a vertex uniformly and independently and cover one of its uncovered neighbors, chosen uniformly, if any. Let \(\cc(G)\) denote the expected number of steps required to cover all vertices. Alon conjectured that disjoint unions of \(K_{d+1}\) maximize \(\cc(G)\) among \(d\)-regular graphs of a prescribed order whenever such unions exist. In this paper, we disprove this conjecture for every fixed \(d\ge2\) and give a complete characterization of the extremal graphs for \(d=2\) at every order \(n\ge3\). In particular, all but at most six vertices of any such extremal graph lie in four-cycle components.

comments
15pages
fields
Combinatorics
pdf ↗ page arXiv:2611.11345 ↗

The zero forcing polynomial of a graph counts the number of distinct zero forcing sets of every possible size. In 2018, Boyer et al. asked whether the zero forcing polynomial is always unimodal, and provided some evidence that it is. We answer this question by constructing an infinite family of graphs whose zero forcing polynomials are not unimodal. Our construction also shows that the graph polynomials associated with connected forcing and total forcing are also not unimodal in general.

comments
Comments welcome!
fields
Combinatorics
pdf ↗ page arXiv:2611.11352 ↗

Tilings of a closed hyperbolic surface by congruent $n$-gons with $n\ge 7$ is a finite problem. One extreme of the finite problem is that the number of tiles is maximal. The problem is related to edge-to-edge tilings of the Poincaré disk ${\bb H}^2$ by congruent $n$-gons, such that all vertices have degree 3 and the vertex sets satisfy certain balance condition. For the special case $n=7$, we show that the heptagon in any such tiling belongs to one of the four families, and tilings of ${\bb H}^2$ by generic heptagons in each family is unique. As a consequence, for any closed hyperbolic surface of Euler characteristic $χ$, we may classify all tilings of the surface by maximal number $-6χ$ of congruent generic heptagons in the four families.

fields
Combinatorics
pdf ↗ page arXiv:2611.11369 ↗

Many bilevel and robust optimization problems are complete for the second level of the polynomial hierarchy, but such results are usually proven one problem at a time with problem-specific reductions. A recurring obstacle is that the lower level must select an optimal solution rather than merely a feasible one, whereas standard reductions preserve only whether a solution exists, not which solutions are optimal. We introduce linear objective problems (LOP), a framework for optimization problems whose solutions are explicit subsets of a ground set and whose objective is linear in these elements. We define tight solution-embedding reductions, which map the optimal solutions of one problem element by element onto the optimal solutions of another, without having to recognize optimal solutions, which is coNP-hard in general. This gives a notion of LOP-completeness, with Satisfiability as the canonical complete problem, even with unit weights. We show that many classical problems are LOP-complete, including Vertex Cover, Dominating Set, TSP, Knapsack, and Steiner Tree, and we introduce a duality that transfers LOP-completeness between minimization and maximization problems. As our main application, we prove a meta-theorem for min-max regret optimization under interval uncertainty: for every LOP-complete problem, the min-max regret version is $Σ_2^p$-complete. Instead of a separate proof for each nominal problem, it suffices to show that the nominal problem is LOP-complete. This recovers known results for the interval min-max regret versions of Knapsack and Maximum Benefit Set Cover and yields completeness for over 50 further problems.

fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.11375 ↗

We prove a weighted extension of Byun's snowflake-flipping theorem for cored hexagons with unit triangular holes along three crossing lines. The ratio of the tiling generating functions of two regions related by a snowflake flip is given by an explicit product. The result recovers Byun's theorem when all lozenge weights are 1 and resolves an open problem posed by the author in 2024. Our proof uses shuffling identities for semihexagons with dents on two sides.

fields
Combinatorics
pdf ↗ page arXiv:2611.11406 ↗

In this paper, we prove the strong cylinder conjecture, that is, for every prime $p$, a set of $p^2$ points in $\mathbb F_p^3$ that meets every affine plane in a multiple of $p$ points is a union of $p$ distinct parallel affine lines. We use this result to resolve Rédei's 1970 factorization conjecture in three dimensions: if $A,B\subseteq\mathbb F_p^3$ contain zero and every vector in $\mathbb F_p^3$ has a unique expression $a+b$ with $a\in A$ and $b\in B$, then one of the two sets is contained in a plane through zero.

comments
44 pages, comments are welcome
fields
Combinatorics
pdf ↗ page arXiv:2611.11414 ↗

Let $Q_n$ be the $n$-dimensional hypercube, and let $P\subseteq E(Q_n)$ be a set of prescribed edges. It is known that, for $n\ge 2$, every such set $P$ with $|P|\leq 2n-3$ whose edges form a linear forest is contained in a Hamiltonian cycle of $Q_n$. This bound is sharp for general linear forests. The computational complexity of deciding whether a prescribed edge set of a hypercube can be extended to a Hamiltonian cycle was posed as an open question by Dvořák [SIAM J. Discrete Math. 19 (2005) 135–144]. We prove that the problem is NP-complete even when the prescribed edges form a spanning linear forest with no isolated vertices. We give a polynomial-time reduction from a restricted 3-SAT problem, using local spanning path-forest gadgets for variables and clauses that are uniformly embedded in the hypercube. The same reduction therefore establishes NP-hardness of two versions of Hamiltonian-cycle extension problems for general prescribed edge sets.

fields
Combinatorics
pdf ↗ page arXiv:2611.11476 ↗

Given an $H$-induced-minor-free graph $G$ with $n$ vertices, we construct a balanced separator of $G$ consisting of $\tilde{O}(|V(H)|\sqrt{n})$ star subgraphs. Our result is an induced-minor-free analog of the famous separator theorem for $H$-minor-free graphs by Alon, Seymour, and Thomas [J. Amer. Math. Soc., 1990]. A key idea in our construction is a new decomposition of $H$-induced-minor-free graphs, analogous to the cop decomposition for $H$-minor-free graphs by Andreae [J. Combin. Theory Ser. B, 1986]. We also discuss several algorithmic applications of our result.

fields
Combinatorics
pdf ↗ page arXiv:2611.11513 ↗

A numerical semigroup is a subset of the nonnegative integers, closed under addition and with finite complement. The size of the complement is its genus. The problem of counting semigroups by the largest gap got very important through the so-called Frobenius problem, first documented in 1884. Accordingly, the largest gap is called the Frobenius number. In the last two decades, counting by the genus has become a subject of even more intense study, mostly because of the non-solved conjectures on its monotonic and super-Fibonacci growth. It is known that the number of semigroups of each genus grows asymptotically with the genus like the Fibonacci numbers and that the number of semigroups of each Frobenius number grows asymptotically in such a way that each number doubles the previous but one. We prove a formula for the number of numerical semigroups of each Frobenius number, genus, and multiplicity (first nonzero nongap), under the assumption that the multiplicity $m$ and the Frobenius number $F$ satisfy $m\geq\frac{F+1}{3}$. It has been proved that asymptotically almost all semigroups satisfy this condition. From this formula we prove multiparameter recurrence relations. They give, under the required restriction, a multiparameter exact version of the increasing behaviours previously mentioned. Indeed, we prove that the number $n_{F,m,g}$ of semigroups with Frobenius number $F$, multiplicity $m$ and genus $g$ satisfies $n_{F,m,g}=n_{F-2,m-1,g-1}+n_{F-2,m-1,g-2}$ and that the number $n_{F,m}$ of semigroups with Frobenius number $F$ and multiplicity $m$ satisfies $n_{F,m}=2n_{F-2,m-1}.$

comments
This work was previously integrated in a larger paper (arXiv:2607.23111) that has been now split into two parts, due to their different nature. This part constitutes the theoretical results on combinatorics and recurrences. The other part is more focused in the algorithms, tree constructions, and computational results
fields
Combinatorics
pdf ↗ page arXiv:2611.11559 ↗

We prove that Kronecker coefficients are uniformly asymptotic to $f^λf^μf^ν/n!$ when all three irreducible dimensions are at least $\sqrt{n!}\,e^{-A\sqrt n}$, for any fixed $A>0$. This strengthens a conjecture of Pak, Panova and Yeliussizov. For triple staircase and triple square partitions, we obtain relative asymptotics with respective limiting factors $e^{-1/24}$ and $e^{-1/3}$. For Littlewood-Richardson (LR) coefficients, we bound the sum of the three dimension deficits by the LR coefficient deficit times $O(\log n)$, proving their Conjecture 5.5 and extending it to arbitrary fixed size proportions. We also construct vanishing LR coefficients with three Plancherel dimension sequences and determine the exact stabilization threshold of the largest LR coefficient with one input size fixed.

comments
28 pages. Includes a Declaration of AI use
fields
Combinatorics
pdf ↗ page arXiv:2611.11593 ↗

We study infinite hat-guessing games indexed by linearly ordered sets $S\subseteq\mathbb R$, where players guess sequentially using information determined by the order. While well-ordered standing sets admit the naive, recursive definition of play, we found a surprising example showing that this approach fails for non-well-ordered ones, where local decision rules do not determine a unique global outcome. By requiring uniqueness of play, we aim to provide a natural framework for hat-guessing games on arbitrary standing sets. For the classical visibility model, it was previously known due to Glivický that at most one incorrect guess can be guaranteed when $S$ is well-ordered. We prove the same result for backwards well-ordered sets, even in the case when $S$ has no first element. In the full-visibility version of the game, Glivický proved that at most one incorrect guess can be guaranteed if the standing set has a first element. We extend this result to arbitrary nonempty standing sets.

comments
20 pages
fields
Combinatorics, Logic
pdf ↗ page arXiv:2611.11623 ↗

We study product-one invariants of finite metacyclic groups, with particular attention to metacyclic $p$-groups. For semidirect products $C_n\rtimes C_m$ such that $\operatorname{ord}_n(\ell)=m$ and $\operatorname{ord}_q(\ell)=m$ for every prime divisor $q$ of $n$, we give a short proof of the known formula for the small Davenport constant and determine the exact value of the $η$-constant. When $n=p$ is prime, we use Vosper's theorem to obtain a growth result for products of non-trivial conjugacy classes contained in $C_p$, from which we derive a block-saturation principle for product-one sequences. For split metacyclic $p$-groups, we determine the small Davenport constant in terms of the order and the exponent, and obtain bounds for the $η$-constant and the Erdős–Ginzburg–Ziv constant. The Davenport bound is also extended to finite nilpotent split metacyclic groups. Our approach relies in part on a general quotient-lifting principle for the three invariants $\mathsf d$, $η$, and $\mathsf s$. For non-cyclic metacyclic $p$-groups, this principle applies through the Frattini quotient, which is isomorphic to $C_p^2$. We further establish upper and lower bounds for the Erdős–Ginzburg–Ziv constant of arbitrary metacyclic $p$-groups, and show that both bounds are best possible within this class. The lifting method also provides a short proof of a known theorem of Han and Zhang for groups $C_m\ltimes C_n$ with $m\mid n$. Finally, we determine the Olson constant of the dihedral group $D_{2p}$, for every prime $p>3$, in terms of the Olson constant of $C_p$.

fields
Combinatorics
pdf ↗ page arXiv:2611.11628 ↗

For a pair of simply laced Dynking diagrams $X$ and $X'$, we prove Chin's homomesy conjecture on the number of red and blue mutations in a period of the tropical Zamolodchikov $T$-system associated to $(X, X')$ using Nakanishi's dilogarithm identity.

comments
14 pages. Comments are welcome!
fields
Combinatorics
pdf ↗ page arXiv:2611.11778 ↗

Let $G$ be a graph with a perfect matching. The minimum forcing number $f(G)$ of $G$ is the smallest size of a matching in $G$ that is contained in exactly one perfect matching. For the $d$-hypercube $Q_d$ ($d\geq 2$) Diwan (2019) determined $f(Q_d)=2^{d-2}$ by using a linear algebraic method, and Mohammadian (2022) generalized this method and showed that $f(G\square K_2)=n/2$ when a bipartite graph $G$ admits order $n$ and an involutory weighted adjacency matrix over a field $\mathbb F$, where $\square$ denotes the Cartesian product. In this paper, we further prove that if $\operatorname{char}\mathbb{F}\neq 2$, then $\frac{n}{2}\le f(G\mathbin{\square} P_k)\le \frac{n}{2}\lceil\frac{k}{2}\rceil$ for every $k\ge 2$, where $P_k$ is the $k$-vertex path; this recovers Mohammadian's result when $k=2$, and the lower bound is attained for $k=3$. Moreover, we extend this method to non-bipartite graphs. Recursively constructing the adjacency matrix of the folded hypercube $FQ_n$ over the binary field $\mathbb F_2$, we prove that $f(FQ_n\mathbin{\square} K_2)=2^{n-1}$ for every even $n$. Combined with Mohammadian's result for odd $n$, this establishes the same formula for all $n\geq 1$.

comments
19 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.11813 ↗

The classical Cameron-Goethals-Seidel-Shult theorem characterizes graphs with least eigenvalue at least $-2$ in terms of generalized line graphs, exceptional graphs, and root systems. In this paper, we establish a marked graph extension of this theorem. For a graph $G$ on $n$ vertices and a binary vector $\mathbf{b}\in\{0,1\}^n$, we completely characterize all marked graphs $\mathbf{G}=(G,\mathbf{b})$ such that $λ_{\min}(A(G)+\mathbf{b}\mathbf{b}^\top-J_n)\ge -2$, where $J_n$ denotes the all-ones matrix of order $n$. Using representations by finite root systems, we show that every irreducible marked graph satisfying the above inequality is represented by either the root system $B_n$ or the exceptional root system $E_8$. This leads to a complete structural characterization in terms of irreducible marked graphs, namely induced subgraphs of extended generalized line graphs, the marked graph $(2K_1,\mathbf{0})$, and exceptional graphs with all vertices marked. In the special case $\mathbf{b}=\mathbf{j}$, our characterization reduces to the original Cameron-Goethals-Seidel-Shult theorem. The root system $B_n$ and extended generalized line graphs play the roles occupied by $D_n$ and generalized line graphs in the classical theory. We further apply the characterization to graphs whose second largest eigenvalue is at most $1$, showing that every $-2$-markable graph satisfies this spectral condition.

comments
5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.11870 ↗

A finite matroid is representable over a field if its elements can be assigned vectors over that field such that the rank of every subset equals the dimension of the span of its vectors. For an integer q >= 2, a matroid is q-entropic if there exists a random vector indexed by its ground set, with each coordinate taking values in a common q-element alphabet, such that the entropy of every marginal subvector equals the rank of the corresponding subset multiplied by log q. It remains open to determine for which values of q every q-entropic matroid is representable over a field. For q=2 and q=3, representability over F_q has long been known. More recently, it was established that every 4-entropic matroid is representable over F_4 and that the 6-entropic matroids are precisely the regular matroids, that is, those representable over every field. We settle the previously unresolved five-symbol case, proving that a finite matroid is 5-entropic if and only if it is representable over F_5. For the nontrivial implication, we use Matúš's equivalence between entropic and partition representations. We show that a degree-five partition representation induces, on each embedded U_{2,4}-minor, an F_5-linear representation after coordinatewise relabeling, with a rescaling class independent of the chosen linearization. Using the foundation presentation of Baker and Lorscheid, we verify the compatibility relations among these local classes and thereby obtain a global F_5-representation.

fields
Combinatorics
pdf ↗ page arXiv:2611.11970 ↗

For $t>0$, a graph $G$ is called $t$-tough if $|S|\geq t\,c(G-S)$ for every $S\subseteq V(G)$ with $c(G-S)\geq2$, where $c(G-S)$ denotes the number of components of $G-S$. Toughness is closely related to the existence of Hamiltonian cycles and factors in graphs. Chvátal [Discrete Math. 5 (1973) 215–228] conjectured that there exists a constant $t_0>0$ such that every $t_0$-tough graph of order at least three is Hamiltonian. Bauer, Broersma and Veldman [Discrete Appl. Math. 99 (2000) 317–321] constructed $(9/4-\varepsilon)$-tough graphs without a Hamiltonian path for arbitrarily small $\varepsilon>0$. For the weaker requirement of a $2$-factor, Enomoto et al. [J. Graph Theory 9 (1985) 87–95] proved that every $2$-tough graph of order at least three has a $2$-factor and that the toughness threshold $2$ is best possible. A graph $G$ is said to have a $\{K_2,\{C_k:k\geq3\}\}$-factor if and only if $G$ contains a spanning subgraph consisting of components that are either cycles or single edges. A $\{K_2,\{C_k:k\geq3\}\}$-factor can be viewed as a combination of a $1$-factor and a $2$-factor, motivating the study of such factors in tough graphs. In this paper, we establish sharp sufficient conditions in terms of the adjacency spectral radius, the distance spectral radius, and the distance signless Laplacian spectral radius for a $t$-tough graph to have a $\{K_2,\{C_k:k\geq3\}\}$-factor.

fields
Combinatorics
pdf ↗ page arXiv:2611.12030 ↗

Let $p$ be prime. We prove that a noncollinear set of $2m+1\le p$ points in $\AG(2,p)$ determines exactly $m+2$ directions if and only if, up to an affine transformation, it consists of the origin and a coset of a multiplicative subgroup of order $m$ on each coordinate axis. Thus equality is possible precisely when $m\mid p-1$. This extends the Lovász–Schrijver classification for $2m+1=p$.

fields
Combinatorics
pdf ↗ page arXiv:2611.12055 ↗

A good coloring of a sphere triangulation is a black-and-white coloring of its faces such that, at every vertex, the numbers of black and white faces differ by a multiple of~$3$. Good colorings correspond to proper vertex $4$-colorings. For a good coloring with fold count $\mathrm{f}$ (the number of black-white edges) on a triangulation with $F$ faces, R.~E.~Schwartz introduced the Eisenstein isoperimetric ratio $η=\mathrm{f}^2/F$. For triangulations with degree sequence $6,\dots,6,2,2,2$, he proved that $η\ge3$ and conjectured that every such triangulation has a good coloring with $η$ below a universal constant. These triangulations are indexed by the nonzero Eisenstein integers~$β$. We study the family $\T(n)$ given by $β=n$, a positive integer, which consists of the doubled equilateral triangles of side~$n$. We prove that every good coloring of $\T(n)$ has at least $3n$ folds, so $η\ge9/2$, and that this bound is attained for every~$n$. Thus the minimum of $η$ on this family is exactly $9/2$, and Schwartz's conjecture holds for it. We also prove that subdividing a good coloring of $\T(β)$ gives a good coloring of $\T(nβ)$ with the same value of $η$. Consequently, Schwartz's conjecture holds in general if and only if it holds for primitive Eisenstein integers.

fields
Combinatorics
pdf ↗ page arXiv:2611.12065 ↗

Permutons are limit structures for large permutations. Intrinsically, a permuton is a familiar mathematical object: a probability measure on the unit square with uniform marginals. The compact space of permutons completes the set of permutations of all sizes under a natural topology; each permuton is not only a limit of permutations but also a generator of random permutations. Since their (relatively recent) discovery as a tool for understanding the behavior of large (possibly random) permutations, permutons have proved remarkably fruitful, with dozens of fascinating connections to combinatorics and probability. We review the fundamentals of permutons, sometimes providing new, shorter proofs, and give an account of some of their myriad applications. The survey concludes with a long list of open problems. An extensive -- but not comprehensive -- bibliography is appended.

comments
Survey paper. 64 pages, many pictures
fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.12104 ↗

Let $p$ be prime and let $S\subseteq\mathbb F_p^3$ have $p^2$ points, with every affine plane meeting $S$ in a multiple of $p$ points. We give a self-contained argument that $S$ is a union of $p$ parallel lines.

fields
Combinatorics
pdf ↗ page arXiv:2611.12153 ↗

Jorgensen conjectured that every $6$-connected graph with no $K_6$-minor is apex. For a $6$-connected graph containing a $K_4$ on vertices $a_1,\dots,a_4$, being apex is equivalent to $G-a_i$ having a planar embedding with the other three roots on a common face for some $i$, so that for such graphs the conjecture becomes a rooted planarity statement. Robertson, Seymour, and Thomas showed that the failure of the corresponding three-rooted planarity is witnessed by a legless tripod. We introduce a four-root structure, called a frame, that extends this certificate, and prove a structural theorem: every $5$-connected graph containing a frame rooted at four prescribed vertices contains a subgraph of one of five explicit types, denoted $A$--$E$. This theorem does not depend on the edges among the roots. As an application, we show that when the four roots span a $K_4^-$, each of the five configurations yields a $K_6^-$-minor. Together with a planar argument for the case without a frame and an induction based on a theorem of Kawarabayashi, this gives a proof that every non-planar $5$-connected graph contains a $K_6^-$-minor. This statement also follows from a recent theorem of Lo; our proof is independent and is driven by the rooted structure theorem, whose method we expect to apply to Jorgensen's conjecture with other target configurations.

comments
30 pages, 12 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.12172 ↗

A family ${\mathcal A}\subseteq 2^{[n]}$ is \emph{uncomplemented} if it contains no set together with its complement. Families ${\mathcal A}_1,\ldots,{\mathcal A}_t$ are \emph{strongly incomparable} if every set in one family is incomparable with every set in another family. In 1976, Hilton conjectured that if ${\mathcal A}_1,\ldots,{\mathcal A}_t\subseteq 2^{[n]}$ are uncomplemented and strongly incomparable, then $$\sum_{i=1}^t |{\mathcal A}_i|\le 2^{n-1}.$$ We confirm this conjecture by a matrix rank argument that encodes incomparability and uncomplementedness in the same matrix, which is quite different from the earlier methods on this problem. We also study weak incomparability, in which the same set may occur in different families. Goldwasser, Hilton and Zheng conjectured an upper bound in this setting and claimed that their conjecture is equivalent to Hilton's conjecture. We give counterexamples to their conjecture for every $t\ge3$ and identify the error in the claimed equivalence. We then propose a replacement conjecture and confirm it when $t$ is large. The upper bound $2^{n-1}$ in Hilton's conjecture can be attained if some families are allowed to by empty. It is natural to consider the maximum size of $\sum_{i=1}^t |{\mathcal A}_i|$ for uncomplemented and strongly incomparable families ${\mathcal A}_1,\ldots,{\mathcal A}_t\subseteq 2^{[n]}$ when all families are required to be non-empty. Denote this maximum number by $M(n,t)$. We show that \[ 2^{n-1}-1\le M(n,t)\le 2^{n-1} \] for $n\ge3$ and $3\le t\le n$.

fields
Combinatorics
pdf ↗ page arXiv:2611.12199 ↗

The paper studies the topological structure of the set of subsums (incomplete sums) of multigeometric series of the form $\frac{k_1}{s} + \frac{k_2}{s} + \ldots + \frac{k_m}{s} + \frac{k_1}{s^2} + \frac{k_2}{s^2} + \ldots+ \frac{k_m}{s^2} + \frac{k_1}{s^3} + \frac{k_2}{s^3} +\ldots$, where $k_1, \ldots, k_m, s \in \mathbb{N}$. In terms of graph theory, necessary and sufficient conditions are established for the set of subsums of a given series not to be a finite union of closed intervals, as well as necessary and sufficient conditions for this set to contain an interval. As a consequence of these statements, a criterion for the set of subsums to be a Cantorval is obtained. An example of applying the criterion to a series whose Cantorval property was previously unknown is given. A more general object of study of topological properties is the set of numbers whose representations in a numerical system with a natural base and a redundant alphabet are subject to restrictions on the use of digits. It is for this object that the above statements are proved.

comments
Contains both the original Ukrainian version and its English translation
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.12214 ↗

Heffter arrays are combinatorial structures that can be used to construct orthogonal cyclic cycle decompositions of complete graphs. A square Heffter array $H(n;k)$ is a partially filled $n \times n$ array with $k$ filled cells in each row and column. Its entries are distinct and nonzero, form a half-set of the group $\mathbb{Z}_{2nk+1}$, and sum to zero in every row and column. If the natural orderings of the rows and columns of an array are simple, the array is called globally simple. The globally simple property guarantees the orthogonal cycle decompositions constructed from the Heffter array consist of simple cycles. While existence results are known for most congruence classes of the parameters $n$ and $k$ modulo 4 for square globally simple Heffter arrays $H(n;k)$, the existence for $k \equiv 2 \pmod{4}$ has remained largely open. In this paper, we present a construction for globally simple integer Heffter arrays $H(n;k)$ covering all admissible values of $n$ when $k \equiv 2 \pmod{4}$. This settles the existence question across all congruence classes.

comments
17 pages, 9 tables
fields
Combinatorics
pdf ↗ page arXiv:2611.12215 ↗

A tiling of the integer lattice $\mathbb{Z}^d$ by translates of the discrete cube $K_d=\{0,1\}^d$ cuts every translate $K_d+x$ into subcubes. We study the function $\ell(x)$ counting these parts. Its sum over every translate of $K_d$ equals $3^d$, for an arbitrary translation set. For lattice tilings with a triangular basis we obtain a dimension-reduction formula, and we describe every cocyclic lattice by a single normalized congruence. Along a cyclic generator, the counter of a signed bidiagonal lattice is a row of Stern's diatomic sequence; pairs of counter values realize the Calkin–Wilf tree, and complementary binary words realize the Kepler tree. For the binary lattice, the translated counter labelings of the cube carry generating face partitions, supplied by the tiling itself, which force the levels of the Kepler tree, and every nontrivial face partition has a unique lamination direction. Using finite Fourier analysis we prove that the ordered cyclic profile determines a standard cocyclic cube tiling lattice up to coordinate reflections. For lattices tiling by discrete boxes we determine exactly when the analogous statement holds.

comments
23 pages, 7 figures
fields
Combinatorics, Metric Geometry, Number Theory
pdf ↗ page arXiv:2611.12239 ↗

Determining the number of realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. Gortler, Healy and Thurston showed that the number of real realisations of a generic framework is always even or equal to one. Despite being rare, there do exist graphs whose number of complex realisations is odd and not equal to one. In this article, we exhibit two necessary conditions for a rigid graph to have an odd realisation number other than one. We also provide an infinite family of rigid graphs with an odd realisation number other than one.

comments
21 pages, 7 figures
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.12245 ↗

Let $G=(V(G),E(G))$ be a connected multigraph with $n$ vertices and $m$ edges. The all-terminal reliability polynomial of $G$ can be written as $R_G(q)=(1-q)^{n-1}\sum\limits_{i=0}^{d}H_iq^i$ where $d=m-n+1$ is the cycle rank, each edge fails independently with probability $q\in[0,1]$, and $H_0,\ldots,H_d$ are the associated coefficients. A cycle basis, which consists of cycles that form a basis of the cycle space of a graph, is an important tool for characterizing its cycle structure. The structural properties of cycle bases, together with the associated length optimization problems and construction algorithms, have been extensively studied. In this context, Colbourn posed the following open problem, which concerns upper bounds on the reliability coefficients in terms of cycle-basis lengths: For all-terminal reliability, is it true that if $G$ has a cycle basis containing cycles of lengths $c_1,\ldots,\allowbreak c_{m-n+1}$, then $H_i \le\sum\limits_{\substack{I\subseteq\{1,\ldots,m-n+1\},|I|=i}}\prod\limits_{j\in I}(c_j-1)$? In this paper, we establish a result that resolves this open problem.

fields
Combinatorics
pdf ↗ page arXiv:2611.12302 ↗

Is it true that for $n\geq 3$, $n-1$ lines are needed to pierce every cell of an $n\times n$ board? This problem was independently rediscovered several times: Alkauskas (1998), Harel-Ackerman-Pinchasi (2012, without claiming the $n-1$ bound), Bárány-Frankl (2021). However, apparently the first to pose it was T. Keller (Honolulu, Hawaii), in 1980, in the problem section of The American Mathematical Monthly. In this note, we give an affirmative answer to Keller's problem when all lines have slopes in $(-\infty,-1]\cup(0,1]$.

comments
5 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.12329 ↗

In contrast to the max-flow/min-cut theorem for single-commodity flows, the cut condition is necessary but not sufficient for the existence of directed multiflows, even with only two commodities. Poremba and Shepherd (IPCO 2023) conjecture that the cut condition is sufficient for all capacities and demands on a directed two-commodity topology if and only if it contains neither of two specific topologies as a relevant minor. We prove this conjecture. As a consequence, the fractional and integral flow-cut gaps of every directed two-commodity topology coincide and are either 1 or 2. We then investigate stronger necessary conditions for multiflow feasibility and their implications for integrality. We introduce a hierarchy of five conditions, ranging from the classical cut condition through conditions based on blocking edge sets and binary edge lengths to the linear programming dual characterization of fractional feasibility. The corresponding classes of sufficient topologies are strictly nested. We extend the Nagamochi-Ibaraki theorem: whenever one of the first four conditions is sufficient on a topology, integral capacities and demands satisfying that condition admit an integral multiflow, computable in polynomial time. Finally, we prove that recognizing topologies on which any of these four conditions is sufficient is coNP-complete, even for two commodities.

fields
Combinatorics
pdf ↗ page arXiv:2611.12330 ↗

Let $G$ be a connected graph and $T$ a spanning tree of $G$. The toughness of $G$ is defined by $t(G)=\min\Big\{\frac{|S|}{c(G-S)}:S\subseteq V(G), c(G-S)\geq2\Big\}$ for $G\neq K_n$. A graph $G$ is said to be $t$-tough if $t(G)\geq t$. The size, the adjacency spectral radius and the signless Laplacian spectral radius of $G$ are denoted by $e(G)$, $ρ(G)$ and $q(G)$, respectively. The $k$-excess of a vertex $v$ in $T$ is defined as $\max\{0,d_T(v)-k\}$. The total $k$-excess $\mbox{te}(T,k)$ is defined by $\mbox{te}(T,k)=\sum\limits_{v\in V(T)}{\max\{0,d_T(v)-k\}}$. A tree $T$ is called a $k$-tree if $d_T(v)\leq k$ for every $v\in V(T)$, namely, the maximum degree of a $k$-tree is at most $k$. It is obvious that $T$ is a spanning $k$-tree if and only if $\mbox{te}(T,k)=0$. This paper investigates a generalization of spanning $k$-trees using a concept called total $k$-excess and puts forward three lower bounds based on $e(G)$, $ρ(G)$ and $q(G)$ in a connected $\frac{k}{k(k-2)+b+3}$-tough graph $G$ to guarantee that $G$ has a spanning tree $T$ with $\mbox{te}(T,k)\leq b$, where $k\geq3$ and $b\geq0$ are two integers. As corollaries, we obtain three sufficient conditions for a connected $\frac{k}{k(k-2)+3}$-tough graph to has a spanning $k$-tree.

comments
15 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.12349 ↗

Motivated by Hamilton cycle problems and applications to collective communication, we study edge-disjoint Hamilton cycles in the McKay–Miller–Širáň (MMS) graphs. The MMS graph $H_q$ (indexed by a prime power $q$) is a highly symmetric graph arising from finite fields. For every prime power $q\geq 3$, we prove that the MMS graph $H_q$ contains $\big\lceil\frac{q-1}{2}\big\rceil$ edge-disjoint Hamilton cycles. This resolves a problem of Li, Wang and Zheng, who established the result for prime $q$ and for $q=4$. Our construction uses graph lifts over finite fields and joins the components of lifted Hamilton cycles by adding edges within vertex fibres. The resulting cycles can be constructed using $O(|E(H_q)|)$ finite field operations, comparisons, and elementary list operations. As an application, these cycles provide edge-disjoint spanning rings for parallel ring-all-reduce algorithms on MMS networks.

comments
18 pages,4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.12355 ↗

The notion of induced packing treewidth aims to unify classes defined by forbidden induced subgraphs or induced minors with classes defined by the existence of certain structured tree decompositions. In this paper, we introduce induced packing branchwidth, a branch-decomposition analogue of induced packing treewidth. For a graph $H$, the induced $H$-packing branchwidth of a graph $G$, denoted by $\branchpi_H(G)$, is the minimum, over all branch decompositions of $G$, of the largest number of pairwise anticomplete induced copies of $H$ that cross one displayed cut. For $H=P_2$, it equals sim-width. We prove several structural properties of graphs of bounded $\branchpi_H$, for various choices of $H$, including $χ$-boundedness, polynomial degree-boundedness, and metric properties.

fields
Combinatorics
pdf ↗ page arXiv:2611.12358 ↗

Recently, Currier, Moore, and Yip developed a general framework for constructing colorings avoiding prescribed monochromatic arithmetic progressions in Euclidean Ramsey theory. Writing $\ell_m$ for an $m$-term arithmetic progression with unit spacing, they proved $\mathbb E^n\not\to(\ell_3,\ell_{20})$ and $\mathbb E^n\not\to(\ell_3,α\ell_{6889})$ for every $α>0$. We refine and simplify their framework, proving $\mathbb E^n\not\to(\ell_3,α\ell_{22})$ for every $α>0$. We further establish $\mathbb E^n\not\to(\ell_3,α\ell_{21})$ except possibly for four values of $α^2$, and $\mathbb E^n\not\to(\ell_3,α\ell_{17})$ for all but finitely many $α>0$. Our approach also recovers several earlier results and avoids some technical arguments used in previous works.

comments
10 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.12360 ↗

We study the mixing time of Glauber dynamics for sampling uniformly from the proper $q$-colorings of sparse Erdős-Rényi random graphs $G(n,d/n)$. Our main result establishes that with probability $1-o(1)$ over the draw of $G$, Glauber dynamics is rapidly mixing for every $q\geq d+d^{1/2+\varepsilon}$, given any fixed $0<\varepsilon\leq1/2$ and any sufficiently large fixed $d$. In particular, the surplus of colors above $d$ is sublinear and close to $\sqrt{d}$. The achieved color range therefore approaches the tree uniqueness threshold and improves over the previously best achievable number of colors $q > 1.763 d$ due to Efthymiou, Hayes, Stefankovic, and Vigoda [SODA 2018]. Moreover, our mixing-time bound is $O(n^{2+o_d(1)})$, and hence almost quadratic as $d\rightarrow\infty$. Our proof is based on establishing a spectral gap for block dynamics resulting from a suitable decomposition of $G(n,d/n)$ into blocks and singleton vertices, ensuring that every high-degree vertex is encapsulated within a block. Our main technical contribution is a novel way of establishing rapid mixing of block dynamics via an integrated Bochner-Bakry-Émery approach, which we expect to have applications beyond sampling colorings. We further devise a new block decomposition of $G(n,d/n)$ that strengthens and simplifies similar constructions used in previous work. Finally, to compare block and Glauber dynamics, we establish a novel recursive separator decomposition of tree-like blocks, together with a coupling argument that avoids the need for nearly uniform color marginals at vertices adjacent to hubs. This comparison argument might be of independent interest.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.12444 ↗

We prove the touching refinement of the Theta conjecture of Interdonato and Iraci, giving a formula for $Θ_{e_\ell}Θ_{e_k}\nabla E_{d,j}$ as a weighted sum over parking functions with decorated rises and valleys and touch number $j$. Summing over $j$ gives the Theta conjecture. As corollaries, we prove the valley Delta conjecture of Haglund, Remmel, and Wilson and its generalized version proposed by Qiu and Wilson. Our proof compares algebraic and combinatorial recurrences using an extension of the plethystic substitution $X\mapsto(q-1)X$ to quasisymmetric functions. The algebraic recurrence follows from an endomorphism constructed by D'Adderio, Interdonato, Iraci and Pagaria on the Dyck path algebra of Carlsson and Mellit. The combinatorial recurrence is obtained by introducing signed labels and deleting the main diagonal. The two recurrences have the same initial conditions, which identifies the corresponding generating functions.

comments
61 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.12451 ↗

For an $n$-vertex $3$-uniform hypergraph $H$, let $σ(H)$ denote the minimum adjacency spectral radius of its vertex links. We determine the exact thresholds for $σ(H)$ that force loose and tight Hamilton cycles for all sufficiently large admissible orders, and give constructions showing that each bound is best possible. The loose threshold is $(1+\sqrt{13})n/8+O(1)$, with two forms according to $n$ modulo four. The tight threshold is $2n/3+O(1)$, with four forms determined by $n$ modulo three and, when $3\mid n$, modulo nine. The resulting spectral conditions and the corresponding minimum vertex degree conditions do not imply one another. For loose cycles, we combine fractional packing stability and absorption with exact completion near a space barrier. For tight cycles, spectral stability and rooted sampling reduce the problem to three extremal configurations. We resolve these configurations by controlling the spectral loss caused by missing triples and constructing short paths that extend to Hamilton cycles, including in the presence of exceptional vertices.

comments
49 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.12453 ↗

Chvátal's toughness conjecture asserts that there is a constant $t_0$ such that every $t_0$-tough graph on at least three vertices is Hamiltonian. Most partial results on this conjecture concern graphs with a restricted structure, such as chordal graphs and $H$-free graphs for small linear forests $H$. We confirm the conjecture with $t_0=4$ for dense almost regular graphs, without any structural assumption: for every $α>0$, there exist $\varepsilon>0$ and $n_0$ such that every $4$-tough graph $G$ on $n\ge n_0$ vertices with $δ(G)\geαn$ and $Δ(G)-δ(G)\le\varepsilon n$ is Hamiltonian. This result also bears on a conjecture of Bollobás and, independently, Häggkvist from the 1970s that every $k$-connected $D$-regular graph on $n$ vertices with $D\ge n/(k+1)$ is Hamiltonian. This conjecture is false for every $k\ge4$, even for large $n$. Our result shows that its conclusion holds for all large $n$ when $k$-connectivity is replaced by $4$-toughness, and that the degree condition can then be weakened to $D\geαn$ for an arbitrarily small fixed $α>0$. We also construct $3/2$-tough regular non-Hamiltonian graphs of linear degree, showing that the constant $4$ cannot be replaced by $3/2$.

fields
Combinatorics
pdf ↗ page arXiv:2611.12519 ↗

We determine the exact codegree Turán density of the $3$-uniform zycle $Z_\ell$ for every even integer $\ell\ge 8$ with $3\nmid\ell$,showing that $γ(Z_\ell)=1/3$. More generally, we prove that $γ(Z_\ell)\le 1/3$ for all even $\ell\ge 8$. Our results partially answer a question of Piga and Schülke [Bull. Lond. Math. Soc. 58 (2026), e70348] concerning the sharpness of their upper bound of $1/2$.

fields
Combinatorics
pdf ↗ page arXiv:2611.12582 ↗

We compute certain multilinear functionals of permutation-invariant random matrices, following the work of Marcus and Geneson. As an application, we derive formulae for the average characteristic polynomial of the sum and the product of permutation-invariant random matrices.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.12606 ↗

We prove a Budan–Fourier theorem for linear combinations of analytic functions whose successive Wronskians are positive: the number of zeros of $g=\sum_{k=1}^s c_kh_k$ in an interval $(a,b]$, counted with multiplicities, is bounded by the drop of the number of sign changes of the sequence of Wronskians $W(h_1,\ldots,h_{k-1},g)$ between $a$ and $b$, and the difference is even. This refines the bound $s-1$ of Koiran, Portier and Tavenas, and we show that it applies, after a suitable renumbering, to any sequence of functions satisfying Descartes' rule of signs. We then study the functions arising from polynomial systems supported on circuits, that is, systems of $n$ equations in $n$ variables with $n+2$ monomials. For these functions, we show that the Budan–Fourier bound never exceeds Descartes' bound, and we compute it at the endpoints of the interval of definition. As an application, we obtain a refinement of the optimal Descartes' rule of signs for circuits of Bihan, Dickenstein and Forsgård: we bound the number of positive solutions whose logarithm lies in explicit polytopes, these bounds add up to at most the bound of Bihan, Dickenstein and Forsgård, and they determine the parity of the number of positive solutions.

fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.12613 ↗

We consider Stanley's problem on describing symmetric chain decompositions for the Bruhat–Chevalley posets of partial flag varieties and, more generally, Schubert varieties. These posets describe the containment relations of cell closures in the partial flag variety $G/P$ of a connected complex reductive algebraic group $G$. A famous instance of this problem asks whether the poset of partitions that fit inside a rectangle ordered by containment admits a symmetric chain decomposition (SCD), corresponding to the case of Grassmannian Schubert varieties in type $A$. Our first main result applies the ``complete BP decomposition" of Richmond–Slofstra to show that the SCD problem for any rationally smooth Schubert variety reduces to the (generalized) Grassmannian case, in any semisimple type. We further study the SCDs provided by codes for Bruhat–Chevalley posets in type $A$. These SCDs can be viewed as a consequence of a particular form of complete BP decomposition. In particular, we show that a poset of permutation-labeled partitions in a rectangle corresponding to the quotient $\mathcal{S}_n/\mathcal{S}_{n-k}$ admits an SCD. Further, posets of weak compositions inside a rectangle are realized as Bruhat–Chevalley intervals with associated codes and SCDs.

comments
21 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.12707 ↗

We determine the dimensions, and the implicit equations, of several polytopes from integer programming whose vertices are the largest stable sets of highly symmetric graphs. Our main tools are two new dimension formulae within Lee's spectral method, which reads the dimension off of an association scheme: for amorphic schemes it becomes a threshold formula, and for point sets in $GF(q)^d$ invariant under the maps $z\mapsto az+b$ it is $q-1$ times the number of hyperplane directions along which some point is not equidistributed. A single integer point, a witness, then certifies a whole eigenspace. For the multi-index assignment polytopes of Appa, Magos, and Mourtos at prime-power orders, the dimension equals that of the linear relaxation except in two infinite families, which are, to our knowledge, the first counterexamples to their expectation that the two always coincide. The missing equations are explicit clique equations that the standard integer-programming formulation omits. For every abelian group with a transversal, the Latin-square transversal polytope of its Cayley table, equivalently the polytope of rainbow perfect matchings of the corresponding edge-colored $K_{n,n}$ , has the maximal dimension ${(n-1)(n-2)}$; the witnesses come from new constructions of complete mappings. We also treat transversals of Desarguesian nets and the largest sets of symmetric $3\times3$ and $4\times4$ matrices over $GF(q)$ whose differences have rank at least $3$, of sizes $q^3$ and $q^5$.

fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.12780 ↗

Let G be a connected graph of order n, let μ(G) denote its average distance, and let L(G) denote the maximum order of an induced linear forest of G, that is, of an induced subgraph whose components are chains. Hansen, Hertz, Kilani, Marcotte and Schindl conjectured that μ(G) {\le} L(G)/2, which can be written as 4W(G) {\le} L(G)n(n-1), where W(G) is the Wiener index of G. This inequality strengthens their bound μ(G) {\le} F(G)/2, where F(G) is the maximum order of an induced forest, as well as Chung's classical bound μ(G) {\le} α(G). In this paper we prove the conjecture for all connected graphs.

comments
This paper establishes a conjecture dating back to 2009. It is 18 pages long and contains 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.12781 ↗

We prove that broad families of regular pattern packings are enumerated by moments of probability measures on $[0,\infty)$. A packing prescribes occurrences of a consecutive permutation pattern at equally spaced positions, with successive occurrences overlapping and together covering the permutation. This regularity underlies the structure theory for the associated pattern-packing posets that we developed in Part I (arXiv:2610.29846). We obtain moment representations for all two-level shifted-grid families of Part I and all overlap-one patterns whose first and last letters differ by one or two. For families whose posets are trees with a unique minimum or maximum and overlap at most half the pattern length, positivity instead holds after finitely many initial terms of the enumerating sequence have been discarded. Our proofs develop further enumeration formulas and combine probabilistic constructions with total nonnegativity and weighted paths, yielding explicit laws or continued fractions in several cases. Although a previously conjectured universal moment property fails, our results establish positivity for all packing sequences associated with patterns of length at most four and all but one of the distinct sequences arising from patterns of length five. Extensive numerical evidence suggests that the remaining sequence is also a moment sequence. These results lead us to formulate refined conjectures for all overlap-one patterns and for the shifted-grid families of Part I with arbitrarily many levels.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.12829 ↗

Differential Geometry56

We establish local Aronson-Bénilan estimates for positive solutions to the porous medium and fast diffusion equations on complete noncompact Riemannian manifolds with a small scale-invariant integral bound on the negative part of the Ricci curvature in $L^p$, where $p>n/2$. No uniform lower bound on the volume of unit balls is assumed, and hence the results apply to manifolds that may collapse. For the fast diffusion equation, we obtain the estimate in the range $1-2/n<m<1$. The auxiliary function method, which was designed for the heat equation under integral curvature conditions, is not directly applicable to those two nonlinear equations. The pressure operator in both cases contains a solution-dependent coefficient, which produces a residual term involving $\partial_t J$ in the evolution inequality. Its treatment requires a positive lower bound for $J$, and moreover, control of $-\partial_t\log J$. We obtain these bounds by linearizing the auxiliary equation, applying Duhamel's formula, and combining local Dirichlet heat kernel estimates with a singular Volterra inequality. Additionally, in the fast diffusion case, the negativity of $v$ changes the sign structure of the evolution inequality, so a separate coercive estimate is required to close the argument. Local Aronson-Bénilan estimates follow for both diffusion regimes and integrating them along space-time curves gives the corresponding Harnack inequalities.

comments
20 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.09962 ↗

In this manuscript, we consider a degenerate elliptic equation on a Riemannian manifold whose weight vanishes at an interior point $p$, and prove the strong unique continuation property (SUCP) at $p$. The curved setting gives rise to intrinsic geometric error terms that obstruct the analytic estimates available in the Euclidean case. To overcome this, we introduce a convexified radial weight that restores coercivity in the Carleman commutator. Combining the resulting Carleman estimate with a Hardy-type inequality and a Caccioppoli inequality, we show that any weak solution vanishing to infinite order at the degeneracy point must be identically zero on the connected domain. This result is the first SUCP theorem for this class of degenerate operators on general Riemannian manifolds.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.09963 ↗

We construct a compact Riemannian manifold $M$ with strictly positive sectional curvature and prove that $M$ admits no effective smooth $S^{1}$-action, which yields to a counterexample of a longstanding conjecture attributed to Yau.

fields
Differential Geometry
pdf ↗ page arXiv:2611.09966 ↗

We establish monotonicity formulas for parabolic frequency functions on closed Finsler metric measure spaces with fixed or evolving metrics and measures. When the reference measure is fixed, an integral bound on the metric variation yields monotonicity for the Finsler heat equation. For coupled metric measure flows, we construct positive global supersolutions and subsolutions of a linearized conjugate heat equation from local radial barriers. These weights define a frequency function whose monotonicity follows from an integral bound involving the metric variation and the change in weighted Ricci curvature. For parabolic equations with a source controlled by the solution and its gradient, we obtain a differential inequality for the frequency and prove that a solution vanishing at the terminal time must vanish throughout the preceding interval. The proof controls the comparison of the two weights through an energy quotient computed with the subsolution measure.

fields
Differential Geometry
pdf ↗ page arXiv:2611.09969 ↗

For the affine foliation $\langle x\partial_x,y\partial_x\rangle$, we prove that smooth coefficient integration is a strictly unital $A_\infty$ quasi-equivalence on every ordinary open subset of $\mathbb R^2$, for globally bounded, degreewise finite-projective real coefficient bodies, allowing internal cohomology of nonconstant rank. A horizontal-hull restriction of a finite Lie $2$-groupoid model admits a smooth simplicial section of the comparison from full Maurer–Cartan integration, with a homotopy relative to all unit-generated simplices. Strict differentiation and two relative Hom models yield a real-linear chain map whose internal-degree diagonal is the identity. Its inverse is a finite sum acting directly on the possibly rank-jumping body complex. Global acyclicity of the differentiation kernels gives invertible counits that are the identity on the body. Infinitely flat and nongeneric rank-jumping examples illustrate the nonregular theorem. Separately, regular two-term coefficients admit a residue classification and an exact ordinary-quotient descent criterion. Nonzero residue obstructs pullback through any strict map to an ordinary groupoid nerve with represented objects in the stated raw coefficient theory. For regular vertical families over $S\times\mathbb R^2$, we also prove a finite-projective bundle-valued theorem natural under smooth parameter pullback; its two-term invariants are bundle arrows, rather than pointwise rank profiles.

comments
94 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.09978 ↗

In the search for new characterizations of spacelike slices in generalized Robertson-Walker spacetimes, we introduce a new approach. The main tool for addressing this question is the infty-Laplacian with respect to the Riemannian metric induced on the spacelike hypersurface, together with a Liouville-type property for the infinity-Laplacian on any complete Riemannian manifold by Araujo, Mari and Pessoa in 2021. Starting from the infinity-Laplacian of the height function of a spacelike hypersurface, we derive several differential equations involving the infinity-Laplacian of suitable compositions of the height function, namely, the warping function f(h), its primitive P=\int f, and the logarithmic composition log(f(h)). Under some natural assumptions, including timelike and null energy conditions, global rigidity results are established in the parametric setting. Some of these results specialize naturally to complete spacelike hypersurfaces in the Steady State spacetime and in Einstein-de Sitter spacetime. Finally, we consider a second-order PDE involving the infty-Laplacian and study the uniqueness of its entire solutions on the fiber of the generalized Robertson-Walker spacetime. This leads to new Calabi-Bernstein-type uniqueness results in the non-parametric setting.

fields
Differential Geometry
pdf ↗ page arXiv:2611.09985 ↗

We prove that isomorphisms of the type constructed by Daemi, Fukaya and Lipyanskiy, between framed instanton homology and the Lagrangian Floer homology of a Heegaard splitting, intertwine the cobordism maps of Kronheimer and Mrowka with maps defined by holomorphic curves alone, over the field of two elements. This holds for every connected cobordism between connected three-manifolds carrying a framed arc between its ends and an $\mathrm{SO}(3)$ bundle trivialized along the ends and the arc. The symplectic maps count holomorphic triangles in moduli spaces of flat connections on surfaces, with the correspondence of a compression body as boundary condition for one- and three-handles. Consequently these maps are independent of the handle decomposition and of the Heegaard data, and form a functor isomorphic to framed instanton homology; where both are defined, our isomorphisms agree with those of Daemi, Fukaya and Lipyanskiy modulo two. The proof rests on two analytic results for the mixed anti-self-duality and holomorphic curve equation: an adiabatic limit in which a compression body collapses next to a holomorphic strip and becomes the Lagrangian boundary condition of its flat connections, and an excision theorem along a torus.

comments
156 pages, 8 figures
fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2611.10002 ↗

We summarize a coordinate-free classification of six-dimensional real Lie algebras up to isomorphism. Instead of solving the overdetermined Jacobi system of 120 quadratic equations on 90 structure constants modulo $\mathrm{GL}(6,\mathbb{R})$, the method uses the Levi–Malcev decomposition, Mostow's nilradical constraints, and the Skjelbred–Sund cohomological central extension technique. In the semisimple sector, the four real forms of $A_1\oplus A_1$ are classified by Killing signature invariants, with explicit matrix representatives for $\mathfrak{sl}(2,\mathbb{C})_{\mathbb{R}}\cong\mathfrak{so}(3,1)$. For non-solvable algebras with three-dimensional radical, representation-theoretic rigidity shows that $\mathfrak{su}(2)$ cannot couple indecomposably with non-abelian radicals, yielding exactly three indecomposable classes governed by $\mathfrak{so}(3)$ and $\mathfrak{sl}(2,\mathbb{R})$. In the solvable category, Mostow's theorem restricts the nilradical dimension to $\{3,4,5,6\}$. The nilpotent sector in dimension six has twenty-four indecomposable isomorphism classes plus decomposable counterparts. Solvable non-nilpotent algebras are classified by nilradical codimension, with explicit real Jordan matrix representations for codimension one and two that resolve continuous moduli under gauge actions. The work also computes the minimal faithful representation dimension $μ(\mathfrak{g})$ under Ado's theorem, relates the classification to invariant complex structures on nilmanifolds, and provides a deterministic, page-breakable identification algorithm.

fields
Differential Geometry
pdf ↗ page arXiv:2611.10009 ↗

This paper investigates the index problem for elliptic end-periodic differential operators on a two-dimensional manifold with a cylindrical end. We define the topological index as the sum of the contribution of the interior symbol, expressed by an Atiyah–Singer type integral, and the contribution of the limit operator, expressed in terms of the Melrose type eta-invariant and a correction term that depends on the lower order terms of the limit operator. We prove the homotopy invariance of the topological index, which allows us to reduce the original problem to the study of operators of a simpler form by employing $K$-theoretic methods.

comments
16 pages
fields
Differential Geometry, Analysis of PDEs, K-Theory and Homology, Operator Algebras
pdf ↗ page arXiv:2611.10159 ↗

We prove that Appleton's noncollapsed steady gradient Ricci solitons on complex line bundles over positive Kähler–Einstein manifolds are the unique such solitons arising from his metric ansatz. We then show that the four-dimensional examples on $O_{\mathbb{CP}^1}(-k)$, $k \geq 3$, are strictly linearly stable. By a result of Deruelle, this implies dynamical stability under the Ricci flow.

comments
56 pages. A Wolfram Mathematica notebook containing computational checks is included in the submission source
fields
Differential Geometry
pdf ↗ page arXiv:2611.10444 ↗

The Fast Tree Transform is a locally-aggregated transform defined for arbitrary graph geometries that generalizes both the Hadamard frequency transform and the Haar wavelet transform on the circle. The pure frequency part of the transform approximately diagonalizes the graph Laplacian; this fact makes it useful as a preconditioner in geometric optimization problems. The full transform provides an only slightly-redundant representation of signals on the graph that allows sparse representation of signals that include both edges and textures.

fields
Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2611.10466 ↗

Every smooth homotopy $13$-sphere admits a Riemannian metric of strictly positive sectional curvature. We construct a special $S^3$--$S^3$ bundle over $S^{13}$ whose star quotient represents the nonzero class $\pmα_1β_1\inΘ_{13}\cong\mathbb Z/3$. The defining equivariant map factors through the Blakers–Massey map by a smooth Hopf construction representing an unstable $J$-generator. This factorisation retains the prescribed base representation and makes Schultz's plumbing composition formula applicable; a normal-invariant computation in smoothing theory then identifies the smooth structure. On the quotient we implement the compatible-disk strategy with complete curvature estimates on arbitrary two-planes, matching boundary metrics, and a strictly positive sum of outward second fundamental forms. A direct smoothing argument completes the metric construction. Orientation reversal gives the remaining nonzero class in $Θ_{13}$.

fields
Differential Geometry
pdf ↗ page arXiv:2611.10535 ↗

A hypersurface $Σ\subset\mathbb{R}^{n+1}$ is called EDH-stable if it is a critical point of the Euler-Dierkes-Huisken functional $\mathcal{E}_α(Σ)=\int_Σ|x|^α\, d\mathcal{H}^n$ with nonnegative second variation, which was introduced by Dierkes and Huisken in \cite{[DH-24]}. In this paper, we first establish a Bellettini-type $ε$-regularity theorem and use it, together with tangent cone analysis, to derive curvature estimates for EDH-stable hypersurfaces with $2\leq n \leq 6$.

comments
All comments are welcom
fields
Differential Geometry
pdf ↗ page arXiv:2611.10597 ↗

We prove that every smooth four-dimensional Riemannian metric admits, near each point, a local isometric embedding into $\mathbb{R}^{10}$, and that this universal dimension is optimal. A Gram criterion constructs a regular analytic embedding of the Euclidean metric from a rational positive semidefinite tensor obtained by signed evaluations. A specified finite-field minor certifies characteristic regularity. The real-principal-type construction of Nakamura and Maeda gives openness of the metric map on a fixed ball. Rescaling then applies it to arbitrary smooth metrics.

comments
8 pages, with ancillary Python scripts for verifying the algebraic certificates
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.10598 ↗

We study spectral Einstein functionals associated with the $J$-twist of the Dirac operator on almost product Riemannian spin manifolds. On closed even-dimensional manifolds, we compute the corresponding noncommutative residue in terms of the Einstein tensor, the curvature of the connection determined by $D_J^2$, and its zero-order endomorphism. For four-dimensional compact manifolds with boundary, we consider two boundary residue functionals obtained by inserting two covariant derivatives in the first factor of the compositions $π^+(D_J^{-2})\circπ^+(D_J^{-2})$ and $π^+(D_J^{-1})\circπ^+(D_J^{-3})$. Under the stated collar and almost product structure assumptions, we calculate their interior and boundary contributions and obtain Dąbrowski–Sitarz–Zalecki type formulas. We also present applications of these results in physics and noncommutative geometry, focusing on spectral actions, spectral distance, and mean-curvature boundary contributions.

fields
Differential Geometry
pdf ↗ page arXiv:2611.10775 ↗

Given a compact Lie group acting smoothly and freely on a compact connected manifold, we prove that the space of invariant Riemannian metrics whose symmetry group is precisely the group in question is open dense in that of all invariant metrics provided the orbit space is sufficiently large. This strengthens the author's prior results and recovers Ebin's to the effect that trivial-symmetry Riemannian metrics constitute an open dense set. In the process, the discussion also addresses a number of apparent gaps in said sources, pertaining to the rigidity results in question.

comments
9 pages + references
fields
Differential Geometry, Functional Analysis, General Topology, Metric Geometry
pdf ↗ page arXiv:2611.10854 ↗

We study positivity and rigidity for an expanding quasi-local energy $E_λ$ associated with constantly umbilic initial data $(Ω,g,k=λg)$, introduced in earlier work [ALP26] as an analogue of the Brown-York energy adapted to an expanding flat de Sitter background. Under nonnegative scalar curvature and suitable boundary assumptions, our previous results established positivity for $λ$ below a geometrically determined threshold $α$, while vanishing $E_λ$ at $λ=α$ forced the boundary to be round. In this paper, we strengthen this endpoint rigidity statement by showing that, if $E_λ=0$ when $λ=α$, then $(Ω,g)$ is isometric to a closed Euclidean 3-ball of radius at most $1/λ$. The proof combines the rigidity theorem of Shi-Tam for the Brown-York energy with a strict concavity argument. We also construct an explicit counterexample to the positivity and rigidity conjecture formulated in [ALP26], showing that the energy can become negative beyond this threshold and that vanishing energy need not imply rigidity.

comments
8 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.10880 ↗

We give a uniform second-order Taylor formula for tensorial Riemannian $H$-structures in Riemannian normal coordinates whose initial frame is $H$-adapted. For a defining multi-tensor $ξ$ with intrinsic torsion $T$, the linear coefficient is $T_q\diamondξ$, and the quadratic coefficient features the covariant derivative of $T$, its iterated diamond action, and curvature. The formula applies componentwise to tensors of arbitrary type and recovers the known $G_2$ and $\operatorname{Spin}(7)$ expansions. We also give the almost Hermitian specialisation and prove that vanishing of the complete second-order torsion contribution forces the intrinsic torsion to vanish at the centre of the coordinates.

fields
Differential Geometry
pdf ↗ page arXiv:2611.10968 ↗

We study the relationship between Jacobi sections and Jacobi fields associated with semisprays on Lie algebroids. First, we characterize compatible transverse variations in terms of Lie algebroid morphisms. This characterization leads to a variational description of Jacobi sections: a section along an integral curve of a semispray is a Jacobi section if and only if it arises as the infinitesimal variation of a compatible transverse variation of a dynamical variation satisfying a suitable condition on its image in the base. We also investigate the relationship between Jacobi sections and Jacobi fields through the anchor map. We prove that every Jacobi section projects to a Jacobi field, and establish a converse when the corresponding base variation is contained in a single leaf of the characteristic foliation.

comments
26 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.11039 ↗

Let $(M,g)$ be a smooth compact Riemannian surface homeomorphic to a closed disk, with boundary length $L$. We establish sharp upper bounds for its Escobar constant under upper bounds on the Gaussian curvature. If $K_g\leq 0$, then $I(M,g)\leq 2/π$, with equality if and only if $(M,g)$ is isometric to a Euclidean disk. If $K_g\leqκ$ for some $κ>0$, $L<2π/\sqrtκ$, and $\operatorname{Area}_g(M)<2π/κ$, then $I(M,g)\leq\frac{4}{\sqrtκL}\arcsin(\frac{\sqrtκL}{2π})$, with equality if and only if $(M,g)$ is isometric to the geodesic disk of the same perimeter contained in an open hemisphere of the sphere of constant curvature $κ$. We also discuss the higher order Escobar constant for planar domains. In particular, we construct counterexamples to Hassannezhad and Siffert's conjecture.

comments
21 pages, 2 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.11120 ↗

We use the maximum principle to prove a second-order estimate with linear dependence on the gradient for the nondegenerate complex Hessian equation on a compact Kähler manifold. The proof combines $C^0$ compactness and a refined concavity inequality with the use of nearby smooth admissible functions. A standard interpolation argument then yields the known uniform gradient and complex Hessian bounds.

comments
14 pages. Comments are welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.11176 ↗

This work focuses on an anisotropic fluid spacetime with these unique forms of the stress-energy tensor associated with radial pressure and a transverse pressure p. In an anisotropic fluid spacetime , we mani- fest curvatures symmetry such as Ricci pseudo-symmetric and prove that Ricci pseudo-symmetric anisotropic fluid spacetime is generalized quasi- Einstein spacetime. We deduce the Einstein gravitational field equation of Ricci pseudo-symmetric anisotropic fluid spacetime. In the framework of pseudo-Riemannian geometry, specifically, we study the quasi-conformal Ricci pseudo-symmetric anisotropic fluid spacetime, which exhibit the dark matter era. Moreover, we discuss the hyperbolic Ricci soliton and Hyperbolic Yamabe soliton on Ricci pseudo-symmetric anisotropic fluid spacetime with a time-like Ricci vector field. Finally, we turn up the char- acteristics of hyperbolic Ricci soliton and hyperbolic Yamabe soliton on Ricci pseudo-symmetric anisotropic fluid spacetime with a time-like Ricci vector field.

fields
Differential Geometry
pdf ↗ page arXiv:2611.11314 ↗

In this paper, we establish several sharp comparsion results for noncompact 3-manifolds with nonnegative scalar curvature and with a compact, connected boundary under a boundary mean curvature condition. Then we apply these gradient estimates to establish a Cohn-Vossen type bound for the average of the scalar curvature. This generalizes the work of Colding-Minicozzi \cite{Cold4} and Oronzio \cite{Oro2}.

fields
Differential Geometry
pdf ↗ page arXiv:2611.11331 ↗

We review the gamma class of complex projective space, but from the point of view of topological-antitopological fusion. We deconstruct the central connection matrix which appears in the work of Dubrovin, Galkin-Golyshev-Iritani, and Cotti-Dubrovin-Guzzetti.

comments
25 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.11338 ↗

In every dimension $n\geq3$, we classify positive solutions of the flat Escobar–Yamabe equation on the Euclidean half-space with a possible isolated boundary singularity at the origin. Solutions with a removable singularity are boundary bubbles. Up to dilation, the nonremovable solutions are the cylindrical solution and a family of periodic Delaunay solutions uniquely parametrized by the necksize $ε\in (0,1)$, the minimum of the normalized boundary trace. In each fundamental period $T_ε$, the trace has exactly two critical points, a nondegenerate minimum and a nondegenerate maximum. The period and the solution centered at the trace minimum and rescaled to period one depend smoothly on $ε$. As $ε\to 0$, $T_ε= \frac{4}{n-2}\log(1/ε)+O(1)$. As $ε\to 1$, the solutions converge to the cylindrical solution and their periods tend to that of its linearized oscillation. We use uniqueness in the odd and even classes for linear Robin equations to obtain reflection symmetry and continuation in the necksize.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.11400 ↗

We prove the maximal existence conjecture for pluriclosed flow on Kähler backgrounds. This leads to a priori generalizations of the Aubin-Yau and Calabi-Yau theorems, and resolves the question of connectedness of generalized Kähler structures on Calabi-Yau backgrounds.

fields
Differential Geometry, Mathematical Physics, Complex Variables
pdf ↗ page arXiv:2611.11614 ↗

We study endpoints and conformal projection of the Möbius-invariant Willmore flow in the round three-sphere. Under uniform nonumbilicity or an integrable weighted condition, image-measure transport yields a unique finite-time integral-varifold limit. Reduced Hopf trajectories have unique anchored finite-time profile and marked conformal endpoints at arbitrary energy. Every smooth global reduced trajectory converges smoothly modulo reparametrization to an elastic profile, with quantitative rates and finite dissipation length. We compute the differential of the conformal-class projection along reduced trajectories and prove that its maximal rank persists at every finite time when it holds initially. Near the Clifford torus, Hopf tori with the same marked conformal type can have noncollinear projected velocities, ruling out a common autonomous Teichmüller equation even after positive time recalibrations.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.11630 ↗

We classify polar foliations on the Cayley projective plane, completing the classification of polar foliations on compact rank one symmetric spaces.

comments
24 pages, 2 tables, 4 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.11638 ↗

We study volume collapse of compact connected flat manifolds with nonempty totally geodesic boundary and uniformly bounded diameter. We prove subsequential Gromov–Hausdorff convergence to compact flat orbifolds, allowing reflector loci, and describe the limit using the canonical involutions of the doubles. We distinguish the cases in which the maximal distance to the boundary tends to zero or to a positive limit, and classify all possible limits in dimension three.

comments
27 pages. Comments are welcome
fields
Differential Geometry
pdf ↗ page arXiv:2611.11666 ↗

We establish certain integral inequalities for $m$-modified conformal vector fields on compact Riemannian manifolds and derive corresponding triviality and rigidity results. We further obtain integrability conditions for such vector fields and establish an extended Bourguignon-Ezin identity. We then prove that a compact Riemannian manifold admitting a non-trivial closed $m$-modified conformal vector field is isometric to a round sphere under either a constant scalar curvature and positive Ricci curvature assumption or a suitable bound on the Ricci curvature involving the first nonzero eigenvalue of the Laplace operator. As a consequence, we obtain an extension of a classical sphere characterization result of Yano and Nagano to the corresponding result for a non trivial $m$-modified conformal vector field assumed closed. Finally, we consider a complete Kähler manifold admitting a closed $m$-modified conformal vector field $V$, and show that $V$ is $m$-modified Killing and around a non-zero point of $V$ the manifold splits as the product of the complex Euclidean plane $\mathbb{C}$ and a complete Kähler manifold.

fields
Differential Geometry
pdf ↗ page arXiv:2611.11715 ↗

We develop an algebra of smoothing operators adapted to the geometry of end-periodic manifolds. We extend the renormalized trace and trace defect formula of Mrowka-Ruberman-Saveliev to this algebra, and establish a Fredholm criterion and winding-number index formula for smoothing perturbations of the identity. Our main result computes the homotopy groups of the associated end-periodic smoothing group. This provides a foundation for future work on relative index theory for families of end-periodic differential operators.

comments
50 pages
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.11722 ↗

We establish a sharp relative isoperimetric comparison for compact surfaces with nonnegative Gaussian curvature and smooth nonempty boundary whose geodesic curvature is at least 1. We prove that the normalized relative isoperimetric profile for such a surface is bounded below by that of the Euclidean unit disk, with equality holding at some area fraction in (0,1) if and only if the surface is isometric to the unit disk. The proof uses a differential comparison argument for the isoperimetric profile, based on a suitable non-constant normal variation of isoperimetric curves inspired by the model geometry.

comments
11 pages, 1 figure
fields
Differential Geometry
pdf ↗ page arXiv:2611.11728 ↗

For a flat superconnection ${\mathbb{A}}$ on a ${\mathbb{Z}}_2$-graded vector bundle $E$ over a closed oriented odd-dimensional manifold $M$, we prove a Cheeger-Müller type theorem as proposed by Arias Abad and Schätz. Namely, that the topological Reidemeister norm of ${\mathbb{A}}$ as defined by them equals the Ray-Singer metric defined by Mathai and Wu. The main step proves an analytic reduction result identified by Arias Abad and Schätz and formulated as a conjecture by the author, that the Ray-Singer metric coincides with that of the fibrewise cohomology $H(E,\partial)$ with its Gauss-Manin connection, where $\partial$ is the component of ${\mathbb{A}}$ of form degree zero, under the Knudsen-Mumford isomorphism associated to the form-degree spectral sequence. As an application, we consider Goette's Morse flat superconnection of a fibrewise Morse function on a fibre bundle with even-dimensional fibres over an oriented odd-dimensional base.

comments
20 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.11773 ↗

Suppose $(M^5,g,f)$ is a complete gradient shrinking Ricci soliton with bounded scalar curvature. We prove that if $ν(g)>-\log 2$, then its Riemannian curvature is bounded. The proof uses curvature blow-up, a local Ricci estimate, and the splitting given by the rescaled potential. An entropy estimate then allows us to apply the volume-ratio gap theorem for Ricci-flat four-manifolds.

fields
Differential Geometry
pdf ↗ page arXiv:2611.11799 ↗

Many seemingly standard formulas for the evolution of the mean curvature vector in higher codimension assume only normal variations, which are ill-suited for analyzing the evolution of submanifolds- with-boundary whose boundaries may not be moving orthogonally at each time. Such situations arise when one considers inverse problems for minimal areas, for example, where such boundaries are confined to a larger ambient boundary. In this note, we provide coordinate-free identities for use in such problems, including higher order derivatives of mean curvature. We translate these identities to some of the existing inverse problem literature in codimension one. We also hope readers may find the computational framework helpful in other situations arising in geometric analysis.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.11837 ↗

We study Toda systems associated with arbitrary complex simple Lie algebras. For solutions on a punctured disc, we prove that finite energy of at least one component near the puncture forces every component to have a conical singularity there. On the punctured plane, we give a geometric formulation and proof of the Lin–Nie–Wei classification of solutions with prescribed cone exponents at the origin and finite total energy in at least one component. We express the parameter space as the complex centralizer of the monodromy modulo a maximal compact subgroup. We also recover the formulas of Karmakar–Lin–Nie–Wei for the cone exponents at infinity and the total energies of the components.

fields
Differential Geometry
pdf ↗ page arXiv:2611.11919 ↗

We prove Donaldson's conjecture which describes the infimum of the Calabi functional by the normalized non-Archimedean K-energy. The proof makes use of proximal equation for the K-energy. To obtain approximate smooth solutions, a continuity path of prescribed scalar curvature equation is coupled with a version of Chen's $\e$-subgeodesic. It does not require a global smooth solution to the Calabi flow.

fields
Differential Geometry, Complex Variables
pdf ↗ page arXiv:2611.11938 ↗

The Riemannian product $S^2\times S^2$ of two unit spheres admits several important geometric interpretations. It can be identified both with the complex quadric $Q^2$ and with the space $\mathcal{L}(S^3)$ of oriented geodesics in the unit $3$-sphere $S^3$. In this paper, we first develop a unified framework for the geometry of curves in $S^2\times S^2$. We introduce projection-regular curves in $S^2\times S^2$ and their curvature data, and prove a congruence theorem for these curves. As an application of this framework, regarding $S^2\times S^2$ as the complex quadric $Q^2$, we classify Kähler magnetic geodesics associated with the product Kähler–Einstein structure. For closed generic projection-regular curves, we establish a sharp Fenchel-type inequality. We then identify $S^2\times S^2$ with the space $\mathcal{L}(S^3)$ of oriented geodesics in the unit $3$-sphere $S^3$ and apply our curve theory to ruled surfaces in $S^3$. In particular, we prove that every nonsingular closed generic projection-regular ruled surface attaining equality in the Fenchel-type inequality is an embedded torus.

comments
19 pages, 6 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.11963 ↗

We construct nonnegatively curved metrics on the cyclic and full permutation quotients of the Wallach flag manifolds in dimensions $6$, $12$, and $24$. The metrics are quasipositively curved in all three dimensions and almost positively curved in dimensions $12$ and $24$. The cyclic quotients are orientable with fundamental group $C_3$, and their further full permutation quotients have fundamental group $S_3$; none admits any metric of everywhere positive sectional curvature. For the almost-positive metrics we describe every zero-curvature plane and prove that the zero-point loci have Hausdorff dimensions exactly $11$ and $23$, respectively. A one-step deformation has, in each dimension, an explicit zero locus with nonempty interior. Further nested deformations reduce it to a measure-zero set while leaving a common codimension-one stratum. The argument combines normal forms for horizontal commuting planes with quaternionic rank conditions and a dimension estimate for commuting compressions of skew-symmetric operators. We also determine the possible degrees of arbitrary free finite quotients of the three flag covers and derive order bounds for fundamental groups when the Euler characteristic is nonzero. We have used ChatGPT-6-astra for mathematical exploration and verified and rewritten all the results.

comments
30 pages. AI-assisted research work and all results are verified by the authors. Comments are welcome
fields
Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2611.12029 ↗

We use the theory of $3$-cyclic $\mathrm{SL}(3,\mathbb{R})$-Higgs bundles to study real branched projective structures on compact surfaces recently introduced by the authors. After fixing a Riemann surface structure on $S$, the Higgs bundle approach allows us, on the one hand, to construct branched structures with prescribed branching data and, on the other hand, to introduce new classes of such structures. The latter are directly related to singular hyperbolic affine spheres and carry a Blaschke metric with conical singularities. In the final part of the paper, using different methods, we prove that every Anosov surface group representation into $\mathrm{SL}(3,\mathbb{R})$ is either Hitchin or belongs to the Barbot component. As a by-product, we obtain that some of the representations associated with the branched structures constructed above are not Anosov.

comments
Comments are welcome! 37 pages
fields
Differential Geometry, Complex Variables, Geometric Topology
pdf ↗ page arXiv:2611.12101 ↗

We show that for certain smooth 4-manifolds, almost complex structures on its triple blow-up induce all its spin$^c$ structures with a non-negative-dimensional Seiberg-Witten moduli space. Since this includes all basic classes, our result provides an approximation to the simple type conjecture. Moreover, we expand a result by Dieter Kotschick showing that every finitely presented group is the fundamental group of an almost complex 4-manifold. We show that it can furthermore be chosen to have every even integer as the virtual dimension of the Seiberg-Witten moduli space of a spin$^c$ structure.

comments
7 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.12110 ↗

We resolve Ge's local scalar curvature rigidity conjecture for spherical isoparametric tubes. The conjecture fails throughout its stated radius range for families with at least two distinct principal curvatures, via arbitrarily small smooth deformations supported in any regular annulus. Geodesic balls of radius less than $\fracπ{2}$ are locally rigid under $C^2$ smallness. We also prescribe sufficiently small smooth nonradial scalar-curvature increments with fixed compact interior support, under antipodal symmetry for families with 2, 4, or 6 distinct principal curvatures and without symmetry for families with 3 distinct principal curvatures.

comments
16 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.12173 ↗

We obtain an upper bound for the local holomorphic sectional curvature pinching of a Kähler manifold containing a smooth rational curve of negative total normal degree. As an application, we prove that a compact Kähler surface with positive holomorphic sectional curvature and local pinching constant at least $1/9$ is biholomorphic to $\mathbb{CP}^2$, $\mathbb{CP}^1\times\mathbb{CP}^1$, or the first Hirzebruch surface $\mathbb F_1$. For pinching strictly greater than $1/9$, only the first two possibilities occur, confirming a conjecture of Yang and Zheng. We also determine the optimal local pinching constants on $\mathbb F_1$ and $\mathbb F_2$.

comments
5 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.12194 ↗

We characterize the existence of a geodesic joining two prescribed points of a globally hyperbolic spacetime $(M,g)$ admitting a complete causal Killing vector field $K$ and a complete smooth spacelike Cauchy hypersurface $S$. We prove that two points $p,q\in M$ are joined by a geodesic if and only if there exists an $H^1$ curve $γ$ from $p$ to $q$ such that $g(\dotγ,K)$ is constant almost everywhere. The statement is intrinsic and allows $K$ to be timelike at some points and lightlike at others. A global splitting induced by the flow of $K$ is used in the proof, but no global bounds on the metric coefficients are imposed. The proof relies on stationary perturbations of $(M,g)$, whose relevant compactness properties follow from global hyperbolicity of $g$, and on uniform estimates based on an integral admissibility condition and a Glaeser-type inequality. Two examples illustrate geodesic connectedness and the obstruction detected by the characterization.

comments
16 pages, AMSLaTeX
fields
Differential Geometry
pdf ↗ page arXiv:2611.12207 ↗

We study two problems motivated by the local geometry of conformal $φ$-curves. First, let $T$ be a $k$-dimensional locally area-minimizing integral current in Euclidean space, with $k\geq3$, codimension at least two, no boundary, and a locally conformally flat induced metric on $\operatorname{reg} T$. We prove the following branch obstruction: at any rapid-decay branch point whose planar frequency differs from $2$, every nonzero cyclic component of every cylindrical normalized tangent function has repetition multiplicity at least two. Consequently, the nonintegral-frequency points of densities $2$ and $3$ in the rapid-decay branch set have Hausdorff dimension at most $k-3$. On the full branch set, they have zero $\mathcal H^{k-2}$ measure. These conclusions apply to Euclidean image currents of conformal $φ$-curves with locally conformally flat domains, provided the image currents satisfy the stated hypotheses. Second, for $C^j$ weakly-conformal maps between smooth Riemannian manifolds, with domain dimension $k\geq3$ and $j\geq2$, we prove that all derivatives of orders $1$ through $j$ vanish at every critical point. As a consequence, for smooth weakly-conformal maps with connected domain, we establish a curvature condition under which the map is constant or has no critical points. The flatness and continuation results apply in particular to conformal $φ$-curves with the corresponding regularity and curvature assumptions. Finally, we examine the Borůvka cone, which illustrates the role of regularity and the distinction between critical points and branch points.

comments
68 pages
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.12461 ↗

We prove that isoperimetric clusters in general Finsler manifolds can be disconnected even when the volume constraint is small. This is in contrast with the Riemannian case and the ``fixed-norm'' case, where connectedness for arbitrarily small volume has recently been proved.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.12507 ↗

Let $x:M^n\to\sphere^{n+1}(1)$, $n\ge2$, be a full minimal immersion of a closed, connected, oriented manifold. We prove that its Morse index is at least $n+3$, with equality precisely for the standard Clifford embeddings. For a non-Clifford image, the constant function and the position and normal coordinates span a space containing an $(n+4)$-dimensional subspace on which the Jacobi quadratic form is negative definite.

comments
7 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.12632 ↗

We study continuum and kinetic dynamics on locally conformally symplectic (LCS) and locally conformally cosymplectic (LCCos) manifolds. The main geometric tool is the Lichnerowicz-de Rham differential, which allows local geometric data that are compatible only up to conformal rescaling to glue into global structures. In the LCS setting, we analyze the locally conformal Vlasov equation from the viewpoint of continuity. Its source term does not represent particle creation or annihilation: it measures the mismatch between the ordinary phase-space volume and the conformally weighted volume determined by the Lee form. Absorbing this weight into the density yields a source-free continuity equation. We also compute the entropy production of the transported density, and illustrate the framework through a thermostatted ensemble, an LCS-driven Vlasov model with a momentum-dependent gyroscopic force, and their combination. We then propose a new definition of LCCos manifolds in which the defining one-form and two-form carry the same conformal weight. Unlike the usual convention, this allows local cosymplectic Hamiltonian systems to glue directly into global LCCos Hamiltonian dynamics, and it normalizes the evolution vector field by the conformal unit rather than by the ordinary unit. We develop the corresponding Hamiltonian, evolution and continuum dynamics, and illustrate them with a time-dependent mass example exhibiting transport in the distinguished time direction, momentum-space drift, and conformal source terms.

fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.12656 ↗

Let $M$ be a complete open $κ$ noncollapsed Riemannian manifold and have Ricci curvature bounded from below. If the negative part of its Ricci curvature goes to zero sufficiently rapidly at infinity in terms of the volume noncollapse constant and dimension $n$, then the fundamental group of $M$ is finite. When the Ricci curvature is nonnegative, the result agrees with the classical conclusion of [Peter Li, 1986].

fields
Differential Geometry
pdf ↗ page arXiv:2611.12700 ↗

We prove local rigidity of the vanishing Szegő log-term for integral Kähler–Einstein polarizations of a product of irreducible compact Hermitian symmetric spaces. Near the invariant metric, vanishing of the log-term forces the Kähler form to lie in its biholomorphic orbit. The argument combines the first variation of the Kempf distortion function with a central-positioning procedure, reducing rigidity to polynomiality of spectral multipliers of the Laplace operator and the Berezin transform. For integral Kähler–Einstein polarizations, a common-pole obstruction then rules out all infinitesimal deformations transverse to the automorphism orbit.

comments
27 pages. Comments are welcome!
fields
Differential Geometry, Complex Variables
pdf ↗ page arXiv:2611.12708 ↗

We prove a pointwise gradient estimate for positive Jacobi fields on minimal hypersurfaces of dimension two and three, inspired by the Cheng–Yau estimate for harmonic functions. The estimate also controls the second fundamental form, and so provides yet another proof of the stable Bernstein theorem in dimensions two and three.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.12758 ↗

We give a geometric proof that every Kähler class on a compact Kähler manifold with vanishing real first Chern class contains a unique Ricci-flat metric, and that the Kähler–Ricci flow converges smoothly to this metric. The fixed Kähler class and the bounded logarithmic volume density control the mean pairwise distance. Chow's scalar-curvature decay makes available, at a fixed spatial scale and all sufficiently late times, the relative-volume comparison of Jian–Song, derived from Bamler's pointed Nash entropy estimates. This comparison upgrades the mean-distance bound to a diameter bound without an absolute lower bound for entropy. A restarted heat-gradient estimate then gives exponential decay of the Ricci potential. A parabolic Schwarz estimate and the interior estimates of Sherman–Weinkove yield smooth exponential convergence. The proof does not invoke the Calabi–Yau existence theorem or global estimates for a scalar complex Monge–Ampère equation.

fields
Differential Geometry
pdf ↗ page arXiv:2611.12800 ↗

We study the one-parameter family of Riemannian metrics $g_λ$ induced by the Hamiltonian cotangent deformation $H_λ= H_0 + \fracλ{2}\|J\|^2$ on simply connected space forms of constant curvature $κ\in \{1, 0, -1\}$, where $J$ is the momentum map of the isotropy action fixing a base point. The master reciprocal identity $1/f_λ^2 = 1/s_κ^2 + λ$ governing the warping function controls the geometry of the family and implies that radial geodesic acceleration is independent of $λ$. From this mechanism we derive three classes of results: (1) Curvature and rigidity: closed-form sectional curvatures, the sharp positivity trichotomy, pointwise and global Brendle-Schoen $1/4$-pinching windows on $\mathbb{S}^{n+1}$, never-Einstein rigidity for $λ\neq 0$, and the realization of Hamilton's steady cigar soliton on $(\mathbb{H}^2, g_1)$ as the unique gradient Ricci soliton in the family. (2) Dynamics and stability: iso-kinematic decoupling into unperturbed radial motion and uniform precession $Ω= λL$, closed-form Clairaut integration, the transcendental inward conjugate point law with Euclidean inversion $r_0 R^* = 1/λ$, and stratified $A_3$ cusp caustics. (3) Integrability and spectral theory: maximal superintegrable rational pericenter invariants on $\mathbb{R}^{n+1}$, transverse Killing rigidity on curved space forms, Fuchsian Heun spectral reduction with modulus $τ= 1 + λ/κ$, and essential spectrum gap collapse to $[0, \infty)$ on $\mathbb{H}^{n+1}$. Extensions to anisotropic sphere families and intrinsic deformations of compact rank-one symmetric spaces ($\mathbb{C}P^n, \mathbb{H}P^n, \mathbb{O}P^2$) are also established.

comments
56 pages, 2 tables. Dedicated to the memory of James J. Hebda
fields
Differential Geometry, Dynamical Systems, Symplectic Geometry
pdf ↗ page arXiv:2611.12821 ↗

By the Skew-Torsion Holonomy Theorem of Olmos and Reggiani (2012), the 15-sphere $S^{15}$ admits no non-trivial naturally reductive metric under any transitive Lie group, precluding geodesic integration via canonical Ambrose-Singer connections. Simultaneously, Nikonorov (2013) established that every $Spin(9)$-invariant metric on $S^{15}$ is a geodesic orbit (GO) space. We integrate the geodesic flow on this non-naturally reductive GO manifold via the Lie Subalgebra Closure Principle: whenever the slice generators of a multi-axial reductive decomposition close into a finite-rank reductive Lie subalgebra, the geodesic vector equations decouple into an algebraic eigenvalue problem. Using the 16-dimensional spin representation and Vol'per's decomposition $\mathfrak{spin}(9) = \mathfrak{spin}(7) \oplus \mathfrak{p}_1 \oplus \mathfrak{p}_2$, we prove that the slice generators $X_1 \in \mathfrak{p}_2$ and $Y_1 \in \mathfrak{p}_1$ close into $\mathfrak{u}(2) \cong \mathfrak{su}(2) \oplus \mathfrak{u}(1) \subset \mathfrak{so}(16)$. The generator $M = αX_1 + βY_1$ has the four-mode spectrum $Ω\in \{ |R \pm 3α|, |R \pm α| \}$ ($R = \sqrt{α^2 + β^2}$), yielding a closed-form 4-projector decomposition and Euler-Cartan factorization for $\exp(αX_1 + βY_1)$. Under the normalized Ricci flow, we prove that the Bourguignon-Karcher squashed Einstein metric at $t = 3/11$ ($λ= 64$) is an unstable repeller separating sub-Riemannian fiber collapse from the round sphere basin. Finally, on the deformed Cayley plane $\mathbb{O}P^2 = F_4/Spin(9)$, we prove universal CROSS never-Einstein rigidity, establish the 15-dimensional three-stratum Whitney stratification of the cut locus $Cut(q_0)$ at non-polar basepoints $q_0$, and prove Blaschke and Besse rigidity for all $λ> 0$.

comments
36 pages, 1 table. Dedicated to the memory of James J. Hebda
fields
Differential Geometry, Dynamical Systems, Symplectic Geometry
pdf ↗ page arXiv:2611.12828 ↗

In dimensions $n\geq3$, we prove that near an isolated boundary singularity a positive solution of the Escobar–Yamabe equation for a smooth metric approaches a fixed periodic Delaunay solution or the cylindrical solution if its trace lies between positive multiples of $|\overline x|^{-(n-2)/2}$, where $\overline x$ is the tangential Fermi coordinate. The relative error decays at a positive power rate, with weighted estimates through two derivatives in Fermi coordinates. The necksize is unique, and the translation parameter is unique modulo the least positive period in the periodic case. The Hamiltonian smoothly parametrizes the periodic family modulo translation. We classify Jacobi fields of polynomial growth at both ends without assuming symmetry. Translation and energy differentiation generate these fields along periodic solutions, and two oscillatory fields generate them along the cylindrical solution. We also exhibit a first-order obstruction to improving these asymptotics by boundary-preserving conformal deformations of the flat models.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.12842 ↗

The paper is devoted to the construction of exact general solutions of the equations of oil filtration in a porous medium under the action of an active reagent injected into the reservoir. The choice of the reagent solution determines the control process of chemical oil flooding in hard-to-recover fields. The problem is described by a system of two first-order nonlinear partial differential equations (the Barenblatt model). Conditions are found on the Buckley–Leverett function, the adsorption function, and the distribution function of the reagent in oil under which the original system, by means of a nonlinear change of variables on a five-dimensional manifold endowed with a contact structure, is reduced to a linear wave system with constant coefficients. Six families of such functions are indicated. For them, contact transformations and Legendre surfaces corresponding to general solutions in implicit form are constructed.

fields
Differential Geometry
pdf ↗ page arXiv:2611.12887 ↗

Numerical Analysis47

We introduce P-IMLA, a preconditioned implicit-midpoint Langevin sampler for high-dimensional log-concave targets with non-smooth regularization. The obstruction is that the large steps enabled by matrix preconditioning are precisely where preconditioned Euler-Maruyama inflates stationary variance. Implicit midpoint removes this surplus via a Cayley-transform identity, making P-IMLA Gaussian-exact at any step size. Beyond Gaussians, whitening transfers the sharp IMLA contraction rate to $κ_{\mathrm{eff}}$, and backward-error analysis gives drift-only rather than Euler-type diffusion bias under explicit smoothness assumptions. An $M$-norm Moreau envelope yields a proximal non-smooth variant with a three-term error budget. Controlled Gaussian and TV-regularized imaging experiments confirm the predicted separation: the unpreconditioned midpoint scheme retains long transients as $κ_f$ grows, whereas P-IMLA remains $κ_{\mathrm{eff}}$-governed and near variance-exact.

comments
Accepted at NeurIPS 2026. 40 pages, 19 figures
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.09980 ↗

We consider the joint recovery of the state and diffusion coefficient in a high-contrast elliptic equation from sparse, noisy state measurements. We seek the coefficient in a parameterized family defined relative to a prescribed reference coefficient. We construct a generalized multiscale finite element basis from the reference coefficient and use it to define a finite-rank kernel for the state. A weak Galerkin residual enforces the equation without pointwise differentiation across material interfaces. For each trial coefficient, the state is obtained by solving a linear least-squares problem. Variable projection eliminates the state coordinates from the objective, and the reduced gradient is evaluated without an adjoint PDE solve. We split the state reconstruction error into multiscale approximation, penalty relaxation, and parameter estimation terms. Under an admissible patch decomposition, the squared multiscale approximation error is bounded by a local spectral tail estimate with a contrast-independent interpolation constant. For a fixed coefficient and discretization, the penalty relaxation error is of order $O(\varepsilon^2)$ when the residual weight is proportional to $\varepsilon^{-2}$. The parameter contribution is bounded by local Lipschitz continuity of the projected state. In 50 synthetic tests based on a reference medium of contrast $10^4$, the multiscale space with the weak residual gives mean relative state and log-coefficient errors of 2.37\% and 4.43\%, respectively, the lowest among the four configurations tested.

fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.10071 ↗

In practical engineering, there is a clear need for uncertainty quantification (UQ) of models used in design because forward UQ puts probabilities on performance predictions. However, without surrogate building, most forward engineering models are too expensive for traditional UQ methods like Markov chain Monte Carlo (MCMC) sampling. Our goal is to provide inexpensive, approxi- mate UQ that can be applied after an expensive traditional least squares fit, where the UQ handles both uncorrelated noise and parameter variance as in the embedded-error treatment developed by Sargsyan, Najm, and Ghanem (2015). After developing the basic theory to connect a Laplace-like approximation to Bayesian calibration, we compare the proposed method to black-box variational inference in terms of cost and fidelity. Then we demonstrate the method on real-world calibration of solid material models.

comments
16 pages, 13 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.10210 ↗

We consider a general class of operator equations $\mathcal B u=f$ where $\mathcal B:\mathbb U\to \mathbb L_2$ is a linear isomorphis from a Hilbert space $\mathbb U$ onto an ``$L_2$-type'' space $\mathbb L_2 = L_2(Ω;\mathbb R^q)$. This covers weak first order formulations of stationary elliptic boundary value problems, the Stokes system or systems for linear elasticity as well as space-time formulations of heat or wave equations. Since an $L_2$-residual is uniformly equivalent to the corresponding error in the trial space norm reliable and efficient computable a posteriori error bounds are for free. In contrast to a matured theory of classical adaptive finite element methods, estblishing linear convergence - and eventually optimal complexity - in a least squares setting seems to have remained open. To a large extent this is due to the fact that least squares error indicators do not exhibit any explicit dependence on local mesh-sizes. In this paper we propose a rather different approach to establish under which circumstances standard Dörfler-marking mesh refinement gives rise to linear convergence and rate optimality of adaptive least squares finite element methods as well. A central role is played by a new notion of {\em data-visibility} which is a structural property of the data rather than a smoothness condition.

comments
26 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.10278 ↗

This paper studies the approximation power of polynomial splines on a uniform one-dimensional mesh. The quality of the best approximation of the unit ball of $H^{s}$ by an $n$-dimensional subspace, measured in the $L^{2}$ norm, is quantified by the sup-inf of that space: for each function in the Sobolev ball, take its minimal approximation error over the space, and then take the supremum of these errors over the ball. The infimum of this sup-inf over all $n$-dimensional spaces is the well-known Kolmogorov $n$-width $d_{n}$. Choosing the $n$-dimensional subspace to be the piecewise polynomial space of degree $k$ with smoothness $C^μ$ ($-1\leμ\le k-1$) gives our sup-inf $E$. The approximation accuracy of spline spaces is then examined by comparing $d_{n}$ and $E$. The two quantities are determined by two eigenvalue problems, through which we obtain a lower bound for $d_{n}$ and an upper bound for $E$. Under the restriction $k\ge s-1$, the upper bound for the error of the maximally smooth spline space ($μ=k-1$) is asymptotically equal to the lower bound for $d_n$, showing that uniform $B$-splines are asymptotically optimal among all $n$-dimensional spaces. For $μ<k-1$, we prove that $E/d_n$ is bounded below by a constant strictly larger than $1$, except when $k>s-1$ and $μ=k-2$ hold simultaneously. This reveals the superiority of $B$-splines in the sense of $n$-widths. Numerical experiments corroborate these bounds and, in some cases (e.g. the exception above), show that they are sharp.

comments
37 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.10371 ↗

We present in this paper two scalar auxiliary variable (SAV) correction steps for constructing long-time stable schemes for the forced incompressible Navier–Stokes equations with no-slip boundary conditions. A main feature is that the same correction steps apply to any linear predictor satisfying the order and spatial regularity requirements in Assumption~P. Their construction and stability analysis are independent of the particular form of the predictor and require no energy estimate for it. The first correction uses a damped, shifted kinetic-energy variable to obtain a uniform-in-time $L^2$ bound in two and three dimensions, together with a weighted dissipation estimate. In two dimensions, the second correction combines a higher-energy auxiliary variable with a scalar relaxation to yield a uniform-in-time $H^1$ bound. Under the stated assumptions, these estimates hold on arbitrary positive time grids, without restrictions on step sizes or adjacent step ratios. We also derive eventual absorbing bounds; for the two-SAV scheme, these apply to the admissible initial class associated with fixed parameters. The generalized BDF schemes require one constant-coefficient Helmholtz solve per velocity component and one pressure Poisson solve per step; the second correction adds no field solve. Numerical experiments exhibit second-, third-, and fourth-order convergence for the tested BDF schemes and illustrate the long-time stability and efficiency of adaptive time stepping.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.10436 ↗

Repeated solutions of parametric Helmholtz problems arise in multi-query applications such as sensitivity analysis and uncertainty quantification. Classical preconditioned iterative solvers do not automatically reuse low-dimensional structures across parameters. Multispace reduced basis (MSRB) preconditioners can exploit such structures by constructing iteration-specific reduced order models (ROMs) from training data, but storing global iteration-dependent bases incurs substantial memory costs. Building on trajectory-aware MSRB training, we develop a domain-decomposed MSRB (DD-MSRB) preconditioner for parametric Helmholtz systems truncated by perfectly matched layers (PMLs). Within flexible GMRES, each reduced space is trained on inverse-action snapshots along the Krylov trajectories generated by the ROM-based preconditioners applied in preceding iterations. To reduce storage, problem-adapted spatial partitions exploit heterogeneous local snapshot compressibility across the physical interior and the PML. Local basis dimensions in each subdomain are determined greedily under a global snapshot-error budget to balance approximation accuracy and storage. The resulting hybrid solver applies DD-MSRB preconditioning during the initial iterations to capture dominant cross-parameter modes and then switches, when necessary, to a shifted-Laplacian preconditioner to reduce error components poorly represented by the reduced spaces. Numerical experiments on two-dimensional half-space propagation, elliptic-obstacle scattering, and three-dimensional waveguides demonstrate significant acceleration over the shifted-Laplacian baseline and substantial memory savings relative to global MSRB. For the largest waveguide system, with 11.0 million unknowns, DD-MSRB reduces deployed ROM storage by 44.9% and mean online solve time by 30.2% compared with global MSRB.

comments
24 pages, 14 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.10491 ↗

Blood flow and elastic vessel-wall motion interact with each other: fluid stress drives wall deformation, while the moving wall changes the domain in which blood flows. Given noisy flow images, we study the inverse problem of reconstructing the coupled, unsteady three-dimensional motions. We solve the reconstruction through Gauss–Seidel-type alternating fluid and geometry updates. For the fluid, we use physics-informed networks to recover velocity and pressure by fitting the observations while enforcing the incompressible Navier–Stokes equations on the moving domain, which is described by an arbitrary Lagrangian–Eulerian (ALE) map. For the geometry, a reference-domain correction and sequential registration recover the vessel shape and wall displacement. Interface traction continuity and an elastic momentum equation regularize the registration so that the recovered displacement is also physics-informed. The networks evaluate fields and physical residuals at sampled space–time points without remeshing the moving domain. Experiments on a converging channel and a patient-like aorta demonstrate reconstruction of flow and wall motion from noisy data. Ablation and parameter-sensitivity studies examine the role of structure regularization and imperfect physical coefficients. A further experiment with a three-element Windkessel outlet condition demonstrates how the framework accommodates a more physiologically realistic boundary setting.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.10505 ↗

Mechanism–AI coupled dynamical systems retain known mechanisms while learning unknown dynamics from data. We study how neural approximation, numerical integration, finite observations, and optimization jointly affect the accuracy of this learning process. For time-dependent learned terms in a fixed compact admissible class, we derive a four-component objective error bound within an optimal control formulation. Explicit estimates are obtained for constrained ReLU approximation and Euler integration, with deterministic quadrature and random sampling treated separately. Under joint refinement, we establish $Γ$-convergence of the approximate objectives and show that approximate minimizers approach the continuous optimal set when the global optimization gaps vanish. We also derive conditional stability estimates for state-dependent learned terms. Numerical experiments with a susceptible–infected–recovered (SIR) model illustrate the analysis and show how solver resolution affects continuous-trajectory accuracy even when training losses are similar.

fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.10520 ↗

Neural networks trained by gradient-based methods learn the low-frequency content of a target function faster than its high-frequency content. This spectral bias is well documented, but it is much less clear which architectural choices mitigate it and which cannot. We study the question for shallow ReLU models linear in their trainable parameters, where each mode is learned at a rate given by a Gram-matrix eigenvalue, and for a general symmetric bilinear form $a(\cdot,\cdot)$, so that least-squares regression ($a=$ the $L^2$ inner product) and variational or physics-informed losses ($a=$ the $H^1$ energy form) are two instances of one analysis. Within this framework we propose gated local ReLU dictionaries, obtained by multiplying each ReLU feature by a hat partition-of-unity weight, in the spirit of partition-of-unity finite elements and overlapping Schwarz methods. The resulting Gram matrices are block-banded for any local bilinear form, with a block-Toeplitz interior whose matrix-valued symbol governs the spectrum. The two forms then behave very differently. For $L^2$ regression, the symbol is bounded away from zero, the ratio is uniform in the number of windows, and the measured spread of frequency-dependent learning rates falls from $1.9\times10^{5}$ to $4.5$ at matched model size. For the $H^1$ stiffness matrix, the symbol vanishes at zero frequency: gating leaves the $Θ(N^2)$ conditioning intact and inverts the frequency ordering instead of removing the bias. A preconditioner built from the same interior stencil will fix the spectral bias, showing that architecture alone is not enough. Experiments on $1$D regression and Poisson problems confirm the dichotomy, and the regression effect persists when the hidden-layer parameters are trained as well.

comments
24 pages, 4 figures, 5 tables. Preliminary version; comments welcome
fields
Numerical Analysis
pdf ↗ page arXiv:2611.10700 ↗

We develop a structure-preserving arbitrary Lagrangian–Eulerian (ALE) finite element method for incompressible Navier–Stokes flow with gravity and moving contact lines, based on a scalar auxiliary variable (SAV) reformulation. The reformulation expresses the geometric energy quadratically in the auxiliary variable and permits linear treatment of the capillary, wetting and gravitational forces. The method combines high-order isoparametric elements in space with a linearly implicit, second-order Crank–Nicolson discretization in time. Second-order extrapolation supplies the predicted geometry and known coefficients of the linear fluid–SAV system. Mesh motion changes the kinetic-energy inner product and requires a compatible discretization of the time-derivative terms in the ALE formulation. We discretize these terms using an $L^2$-isometric velocity transfer to retain the kinetic-energy balance after the geometry update. We also construct a boundary update that preserves area or volume exactly using only linear solves. The resulting scheme satisfies a discrete SAV energy-dissipation law and preserves area or volume exactly. Numerical experiments in two and three dimensions demonstrate high-order spatial and second-order temporal convergence and confirm SAV energy dissipation and area or volume conservation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.10828 ↗

Neural operators can accurately approximate well-posed mappings, but for unbounded or discontinuous operators, common in inverse problems, we verify that their network parameters often blow up in architectures such as DeepONet and FNO. To solve inverse problems stably, we use Landweber iteration, which requires only a forward map and the adjoint of its derivative (linearisation). To reduce repeated PDE forward evaluations, we replace the forward operator and its derivative with a differentiable neural-operator surrogate. We show that encoder-network-decoder operators, including generalised DeepONets and fully coupled Fourier operators, approximate both the forward map and its derivative. A modified discrepancy principle ensures decreasing error before finite stopping. With a compact preconditioner, the iterates remain in a compact set where accurate surrogates exist, and the stopped reconstructions converge as data and surrogate errors vanish under a regularity condition. We also relate the theory to derivative-informed training along finite directions, showing that the preconditioner determines which derivative errors affect the Landweber iteration update. Experiments on identifying a reaction coefficient in an elliptic equation show that smoothing reduces late-iteration deterioration for less accurate surrogates but slows sharp-feature recovery, and that smaller derivative errors along training directions do not by themselves improve reconstruction accuracy.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.10865 ↗

AI agents are increasingly capable of discovering new mathematical results, yet their reasoning and generated proofs can be difficult to understand and verify. We introduce an interpretable framework for AI-guided mathematical discovery, focused on improving quantitative bounds on analytic constants. Our key insight is that existing proofs often contain slack in intermediate lemmas, which can be tightened without reconstructing the entire argument. To exploit this structure, we represent proofs as partially-formalized Lean blueprints: human-interpretable dependency graphs of definitions, lemmas, and theorems. An AI agent then iteratively refines the Lean code while preserving the blueprint's dependency structure, allowing local improvements to automatically propagate to a verified final bound. This interpretable structure allows humans to inspect the agent's refinements and understand how local improvements propagate to the final theorem. For Grothendieck's constant ($\mathcal{K}_G$), we obtain $$ \mathcal{K}_G \leq \fracπ{2\log(1+\sqrt{2})} - 10^{-17}, $$ an explicit numerical improvement over Krivine's 1977 bound. For Korenblum's constant ($\mathcal{K}_K$), we obtain $$ \mathcal{K}_K \geq 0.356565, $$ improving Wang's 2025 bound of $0.3554$. Our experiments demonstrate the potential of both partial formalization and iterative agentic refinement for interpretable mathematical discovery.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.10961 ↗

We study discrete bound preservation for fully discrete piecewise-linear streamline upwind Petrov–Galerkin (SUPG) finite element approximations of time-dependent convection–diffusion equations on anisotropic triangular meshes. Although the continuous homogeneous-source problem satisfies a parabolic maximum principle, SUPG approximations can exhibit nonphysical undershoots and overshoots. We derive sufficient nodal discrete maximum principle (DMP) conditions that account for the stabilized mass matrix, the combined effects of physical and streamline diffusion, time-step restrictions, and transfer between successive meshes. The analysis identifies a SUPG-effective diffusion tensor and motivates an anisotropic metric aligned with its inverse. We construct a combined metric that retains the effective-tensor geometry while introducing solution-dependent mesh density through recovered Hessian information. The resulting DMP conditions provide a theoretical basis for anisotropic mesh design. Numerical experiments for time-dependent transport problems with isotropic and moderately anisotropic diffusion demonstrate that, under mass-compatible limited SUPG stabilization, the combined metric substantially reduces measured undershoots relative to other methods at matched nominal mesh budgets, although improved bound behavior can carry an accuracy penalty. A controlled tensor–density comparison in the anisotropic transport test supports a contribution from the effective tensor beyond the prescribed mesh density.

comments
31 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.10963 ↗

On-the-fly reduced order models (ROMs) are widely used in applications where multiple queries of large-scale models are required in an iterative method, like PDE-constrained optimization or fluid-structure interaction. When compared to classical offline–online ROMs, they have the advantage of being agnostic to any precomputed training data, mesh or geometry, which makes them more general linear/nonlinear solver accelerators. The main goal of this work is to study the effect of using a reduced basis constructed on-the-fly to accelerate a restarted Krylov algorithm, and to formally bridge this category of data-driven methods with classical augmented Krylov methods. The guiding principles of on-the-fly reduced basis will be translated into the framework of Krylov subspace methods, for a Petrov-Galerkin projection method. Previous corrections generated by the algorithm are stored in a snapshot matrix, and a singular value decomposition (SVD) is used to determine a reduced subspace containing the most significant directions. It will be shown that this approach can be embedded in the framework of Krylov methods with augmented or deflated restart, but with a different, data-driven recycling strategy. An analytical study will be presented to determine the consequences of augmentation by ROM-based vectors. Numerical experiments on a convection-diffusion problem with various degrees of convection will show that the proposed methodology yields results comparable to classical iterative linear solvers in some regimes, especially for nearly symmetric or skew-symmetric operators. At equal sizes of the augmentation basis, the convergence was sometimes faster with the proposed framework than with deflation methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.11129 ↗

We develop an arbitrary-order distributional finite element method for the three-dimensional curl–dev grad Stokes system governed by the Hessian complex. On tetrahedral meshes, the method couples degree-$(k+1)$ nonconforming symmetric-tensor virtual elements, degree-$k$ tangential-normal continuous traceless tensor elements, and Raviart–Thomas elements of index $k$, without additional virtual-element stabilization. Building on zero-extension curl–div theory, we derive a well-posed distributional saddle-point formulation with an $H(\operatorname{div})$ vector multiplier. A divergence-augmented discrete norm equivalence controls the full Raviart–Thomas space modulo translations and underpins mesh-uniform stability for each fixed $k\ge0$. We establish optimal $O(h^{k+1})$ energy error estimates and an optimal $O(h^{k+2})$ $L^2$ error estimate for the full symmetric-tensor approximation, under suitable regularity and load approximation assumptions. As an application, the method supplies the Stokes block of a decoupled triharmonic scheme with optimal Hessian error estimates. Numerical experiments support the predicted convergence rates for computable quantities.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.11158 ↗

We develop and analyze a Discrete de Rham (DDR) method for the Kirchhoff–Love plate problem on general polygonal meshes and demonstrate its extension to geometrically nonlinear plates. The construction uses local degrees of freedom and polynomial reconstructions, avoiding the implementation difficulties associated with globally $C^1$-conforming approximation spaces. A new deflection reconstruction obtained from the discrete Hessian permits a uniform treatment of the load term at all polynomial degrees. The use of this reconstruction improves the convergence rates of previous DDR methods and enables the formulation of a lowest-order scheme with only vertex unknowns. We provide a stability and convergence analysis of the method and validate the theoretical results through a comprehensive set of numerical tests. The method is then extended to the coupled von Kármán equations, for which we demonstrate convergence numerically. We also study the flat-branch spectrum of a compressed perforated plate and its small-amplitude forced nonlinear response near the first critical load.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.11312 ↗

Pressure mass preconditioners for the incompressible Stokes equations can deteriorate on domains with narrow gaps. We develop a pressure preconditioner that uses the distance to the boundary to account for spatially varying geometric scales. Its application consists of a pressure mass solve and a weighted pressure Poisson solve, with the squared boundary distance as the diffusion coefficient. The theoretical basis is a distance-weighted pressure norm defined by splitting the pressure into an $L^2$ component and a component controlled by its weighted gradient. We prove that this norm is bounded by the negative norm of the pressure gradient on every bounded connected open set, with a constant depending only on the dimension. A reverse bound follows from the boundary Hardy inequality, giving norm equivalence uniformly over families with bounded Hardy constants. Two-dimensional finite element experiments on slender, perforated, and composite domains demonstrate stable performance across the tested geometric parameters and mesh refinements. The smallest eigenvalues of the preconditioned pressure Schur complement remain close to $0.54$, and block preconditioning with algebraic multigrid auxiliary solves requires about 20–30 FGMRES iterations across the geometric sweeps.

comments
20 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.11442 ↗

We introduce a discontinuous Galerkin method for the approximation of the eigenvalues and eigenfunctions of the Stokes-Brinkman eigenvalue problem. The method is based on a mixed formulation in which the pseudostress tensor and the fluid velocity are the main unknowns, while the pressure can be recovered through a post-processing procedure applied to the pseudostress tensor. Using discontinuous polynomial spaces of degree $k\geq 1$, we propose a consistent symmetric interior penalty discretization for the approximation of the spectrum. Relying on the spectral theory for non-compact operators, we establish convergence of the discrete spectral approximation and derive error estimates for the method. A series of numerical experiments is presented to assess its computational performance. On the one hand, we investigate the convergence rates for different polynomial degrees, computational domains, and values of the permeability. Furthermore, we study the influence of the stabilization parameter on the discrete spectrum by comparing different choices of this parameter and examining their impact on the occurrence of spurious eigenvalues.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.11466 ↗

Kinetic models of opinion dynamics provide a mesoscopic framework for describing collective behavior arising from interactions among a large number of individuals. Highly accurate numerical approximation to such Boltzmann-type equations, however, remains challenging due to the nonlinear inelastic collision operators involving multiple integrals coupling opinion variables and random perturbations. To address the difficulties, we develop a Legendre-Galerkin spectral method for a general class of kinetic models with opinion-dependent interaction rules. Our method exploits an exact decoupling of the weak collision kernel to obtain a time-independent tensor representation of the Galerkin collision operator. A recursive construction reduces collision-tensor assembly to one-dimensional quadrature, allowing the coefficients to be precomputed for subsequent use. A rigorous $L^2$-error estimate, along with mass preservation, is established for the fully discrete scheme under suitable regularity and stability assumptions. In the quasi-invariant regime, we derive the limiting Fokker-Planck equation and establish consistency between the exact Legendre-Galerkin operators of the rescaled Boltzmann equation and its limit for each fixed polynomial degree. Numerical experiments support the theoretical results, illustrate quasi-invariant consistency, and capture the formation of opinion clusters under the bounded-confidence interactions.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.11492 ↗

We study the worst-case error of Gaussian quadrature for integrals over the real line weighted by Freud weights $\exp(-|x|^β)$ with $β>1$, and by the logistic density $\mathrm{e}^{-x}/(1+\mathrm{e}^{-x})^2$. The integrand functions are assumed to live in the $ρ$-weighted $L^2$-based Sobolev space of smoothness $α\in\mathbb{N}$. We prove that any linear quadrature using the $n$ Gaussian nodes, irrespective of the choice of quadrature weights, has a worst-case error bounded from below by a constant times $n^{-α(1-1/β)}$ for the Freud weights, and by a constant times $(\log n)^{-α}$ for the logistic weight. Our proof is based on three simple observations. First, the worst-case error of any linear quadrature is bounded from below in terms of the number of its nodes in a fixed interval. Second, the number of Gaussian nodes in such an interval is bounded from above by means of Christoffel functions. Third, Christoffel functions admit sharp lower bounds on such an interval. For the Freud weights with even integer exponents and for the logistic weight, all steps are proved in an elementary and self-contained way; for the logistic weight, we use explicit recurrence coefficients of the corresponding orthogonal polynomials. Our results provide a theoretical explanation, for integrands of finite smoothness, of the slow convergence of Gauss–Logistic quadrature observed in the literature. In contrast, for the logistic weight and for the Freud weights with even integer exponents, the Möbius-transformed trapezoidal rule attains the optimal rate $n^{-α}$. This rule does not depend on the smoothness $α$ and requires only point values of the integrand and the weight.

comments
21 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.11545 ↗

We prove linear convergence and algebraic rate optimality of an adaptive finite element method for the Dirichlet Poisson problem in W1p. We assume well-posedness of the continuous problem and discrete inf-sup stability over the refinement family. We verify both hypotheses when p is sufficiently close to 2, without requiring convexity of the domain. The Galerkin equations remain unchanged, while the residual estimator and Dörfler marking use the target exponent p. Linear convergence holds for every fixed marking fraction between zero and one. For sufficiently small marking fractions and marked sets of nearly minimal cardinality, the method attains the best algebraic rates for W1p approximation together with data oscillation. The main ingredient is a Banach-space extension of Feischl's relaxed quasi-orthogonality, proved under discrete inf-sup stability.

comments
24 pages, 2 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.11668 ↗

We consider a kinetic model for bacterial chemotaxis that describes the propagation of traveling pulses driven by a nutrient and a self-produced chemoattractant. In the diffusive regime, the model converges to a macroscopic drift-diffusion system with bounded chemotactic fluxes. We construct a fully discrete asymptotic preserving (AP) finite difference scheme based on a micro-macro decomposition of the kinetic equation. The method is stable uniformly with respect to the scaling parameter and, as this parameter tends to zero, reduces to a consistent discretization of the limiting macroscopic equations. We prove positivity and mass conservation for the limiting scheme, and use a positivity-preserving correction for the kinetic solver. Numerical simulations reproduce the experimentally observed traveling pulses at both the kinetic and the macroscopic level, validate the theoretical traveling wave speed, and illustrate the convergence of the kinetic model to its macroscopic limit.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.11764 ↗

Feedback control of kinetic plasma instabilities is challenging because observing the full phase-space distribution is costly, while sensing and actuation inevitably introduce delay. We develop a structure-informed electromagnetic feedback framework for the Vlasov-Maxwell system that uses only macroscopic observations to control the full kinetic distribution. We first show that magnetic actuation alone does not directly regulate radial velocity moments, motivating the use of combined electric and magnetic controls. A nonlinear perturbation estimate yields an instantaneous cancellation-dissipation feedback law. To account for delayed observations, we then use Maxwell's equations to identify the macroscopic quantities governing the resulting cancellation errors, namely currents and spatial field gradients. These quantities serve as inputs to a low-rank neural operator that learns a residual correction to the delayed cancellation baseline. Thus, while the feedback depends only on low-dimensional macroscopic observables, the control objective remains the stabilization of the full distribution toward a prescribed kinetic equilibrium. Numerical experiments for two-stream and Weibel-type instabilities demonstrate effective long-time stabilization under substantial feedback delays.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.11787 ↗

We study the learning of homogenized constitutive laws for inelastic heterogeneous materials, aiming to replace costly concurrent unit-cell simulations with surrogates that generalize across loading histories and microstructures. We focus on the recurrent neural operator framework, motivated by the explicit form of homogenized Kelvin–Voigt linear viscoelasticity. In this framework, internal variables enable a Markovian approximation of loading-history dependence, and neural operators represent the microstructure-dependent constitutive response. For periodic Kelvin–Voigt viscoelasticity, we prove a universal approximation theorem showing that the model can approximate the homogenized constitutive law to any prescribed accuracy, uniformly in time and over a wide set of admissible strain trajectories and microstructural property fields, in two and three dimensions. This comprises a significant extension of the existing, somewhat limited, one-dimensional theory that uses explicit solutions for piecewise constant materials. Instead, in two and three dimensions, we adopt a more versatile approximation based on the spectral representation of the memory kernel that arises from homogenization. This also enables us to give an explicit bound on the internal-variable dimension, sufficient for approximation, exhibiting logarithmic growth in the inverse relative stress error and in material contrast. Numerical experiments on viscoelasticity and crystal plasticity complement the theory, illustrating the roles of internal-variable dimension and sample complexity in learning homogenized responses from unit-cell data. Theoretical results are formally verified in Lean 4.

comments
52 pages, 12 figures, including appendices
fields
Numerical Analysis, Dynamical Systems
pdf ↗ page arXiv:2611.11805 ↗

The Adam optimizer is widely used to train neural networks with highly nonlinear and nonconvex objective functions. Remarkably, Adam often drives the empirical training loss nearly to zero. This phenomenon has been partially explained by neural tangent kernel (NTK) analyses of gradient descent (GD) and stochastic gradient descent (SGD). However, analyzing Adam presents additional challenges. Its first-moment momentum couples stochastic gradients across iterations, while its adaptive second-moment preconditioner depends on the same stochastic gradient used in the update. In this paper, we establish linear convergence guarantees for Adam in training sufficiently wide two-layer neural networks with either full-batch or minibatch gradients. For full-batch Adam, we construct a Lyapunov function to control the effect of historical momentum. For minibatch Adam, our analysis builds on an exact virtual-iterate representation, a conditional analysis of the dependence between stochastic gradients and adaptive preconditioners, and uniform concentration bounds for the second-moment estimates. We prove geometric decay of the empirical loss for full-batch Adam and geometric decay in restricted expectation on a high-probability event for minibatch Adam. Beyond regression, we extend our convergence analysis to physics-informed neural networks (PINNs) for solving the Poisson equation, where differential operators and separate sampling of interior and boundary points introduce additional challenges. We establish analogous global convergence guarantees for both deterministic and stochastic Adam under explicit conditions on network width and Adam's parameters, characterizing the effects of minibatch size on convergence. These results help bridge the gap between Adam's empirical success and its theoretical understanding, providing sharper convergence guarantees for PINNs than existing analyses.

fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.11905 ↗

In this paper, we analyze a finite-lag Markov chain approximation for coarse-grained linear stochastic differential equations. The chain uses the limiting conditional transition law of the resolved variables to advance on a prescribed time grid. Its stability and statistical properties are studied, with particular attention to the role of the lag time. The chain preserves the exact equilibrium distribution and matches the autocovariance at the chosen lag, while errors at subsequent times are quantified. For a slow-fast system, the analysis relates lag selection to scale separation and dynamical accuracy. A continuous embedding of the chain enables a unified comparison with some existing continuous-time Markovian effective models based on the temporal statistics they preserve. Numerical examples illustrate the theoretical results.

fields
Numerical Analysis, Dynamical Systems
pdf ↗ page arXiv:2611.12022 ↗

We present SPOD-GPR, a non-intrusive, parametric, spatio-temporal reduced-order model (ROM) that combines Proper Orthogonal Decomposition (POD), Spectral POD (SPOD), and Gaussian Process Regression (GPR). A parametric POD first projects the high-dimensional state onto a low-dimensional subspace. The reduced trajectories are then divided into windowed sections, transformed into the frequency domain, and truncated to the most energetic frequencies. SPOD is then performed independently at each retained frequency, yielding temporally coherent modes and coefficients. The parametric dependence of the POD and SPOD bases is modelled by GPR on a local chart of the Grassmann manifold after Procrustes alignment. The SPOD modal coefficients are learned both as explicit functions of the parameters and through a parameter-conditioned autoregressive model that allows for temporal extrapolation beyond the training window. Gaussian processes are sampled jointly and pathwise via Matheron conditioning, ensuring that each predictive realization carries uncertainty quantification consistent with the posterior distribution. The method is tested on four parametric examples where the parameter values and the prediction horizon lie outside the training data: the two-dimensional anisotropic Kuramoto–Sivashinsky equation in a time-periodic and a travelling-wave regime, each parametrised by one of its two coefficients; flow past a cylinder parametrised by the Reynolds number; and flow past an elliptic obstacle parametrised by its semi-axes. In all cases, SPOD-GPR reduces the normalised mean absolute error compared to a POD-GPR baseline, and improves the calibration of the predictive uncertainty, especially in the fluid flow cases, where POD-GPR is severely overconfident. This opens the way to spectral, uncertainty-aware reduced-order models for many-query and real-time applications, such as digital twins.

comments
33 pages, 6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.12028 ↗

Training Gaussian processes (GPs) at large scale is computationally challenging because evaluating the log-marginal likelihood and its gradients involves large, dense kernel matrices. We develop a scalable low-rank GP training approach that combines AnchorNet landmark selection with a fully independent training conditional (FITC) correction. The resulting objective and its analytic gradients can be evaluated using low-rank factors, diagonal quantities, and small dense matrices, without forming the full kernel matrix or its derivatives. The complete training procedure is implemented in single precision and evaluated on nine large-scale regression datasets. Across these problems, the method reaches the reference predictive accuracy while substantially reducing training time, although the required approximation rank varies across datasets. We also study the numerical behavior of the full-kernel predictive solve and show that single precision can become limiting for ill-conditioned problems. Finally, we investigate further reducing selected matrix operations to fp16 or TF32. These lower-precision variants provide only modest additional speedups and can become unreliable when the reduced system is poorly conditioned.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12054 ↗

Nowadays, there are different medical imaging techniques to collect data about the progression of Alzhei\-mer's disease in a patient's brain. These data describe different phenomena which are still not understood from a biological point of view. How can these data sets be combined in a mathematical model to simulate the evolution of such a neurodegenerative disease in a computer? In this snapshot, we present one possible approach to address this task with the help of graph theory and partial differential equations.

journal
Snapshots of modern mathematics from Oberwolfach;2026-07
fields
Numerical Analysis
pdf ↗ page arXiv:2611.12084 ↗

Differentiable simulation propagates derivatives through a physics simulator, turning animation, system identification, control, and computational design into gradient-based optimization. Engines differ in the physics they model and, less visibly, in which mathematical object they differentiate. We separate two questions the literature conflates. The referent is which object the returned derivative belongs to: the finite computation that executed, the converged equation it approximates, or the continuous dynamics. The realization describes the organization of the backward pass: automatically generated differentiation, an equation-level adjoint solve, or a custom adjoint. The referent defines the target against which exactness is assessed; the implementation determines how accurately that target is approximated. Cost depends on the realization together with how the states needed by the backward pass are retained or recovered. Crossing the axes places every method and engine we classify in a cell, separates claims the literature merges, and shows that the apparent trade-off between exactness and memory follows from how methods have been built rather than from a constraint. A second, orthogonal taxonomy covers contact, where the map is non-smooth. We then ask whether a correct gradient helps. Four mechanisms by which useful gradients are lost are cataloged and measured on one testbed, where the advantage of the exact derivative over the equation-level adjoint depends on where the fitting target comes from as much as on the solver budget, and we review the evidence that zeroth-order methods can outperform simulator gradients in the regimes where those mechanisms act. The model classes, systems techniques and applications are surveyed through this lens, and we close with a reporting checklist, a released diagnostic that computes it, and a research agenda.

comments
35 pages, 8 figures, 9 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.12162 ↗

We prove that the finite element exterior calculus (FEEC) approximation to the Hodge-Dirac and Hodge-Laplace problems on any closed oriented Riemannian manifold converges. Its approximate solutions, together with their exterior derivatives, converge to the continuum solutions for every source, and at the rate of the mesh size when the source and its codifferential are square integrable. We use Licht's estimate for the FEEC approximation of forms with one square-integrable derivative by finite element forms. We combine this with a new abstract error bound for approximations of Hilbert complexes. This bound uses a version of Di Pietro and Droniou's third Strang lemma. To apply these estimates, we show that every closed manifold admits a family of arbitrarily fine triangulations whose shapes stay uniformly under control.

comments
40 pages, 1 figure. Comments welcome!
fields
Numerical Analysis, Differential Geometry
pdf ↗ page arXiv:2611.12171 ↗

We introduce a novel structure-preserving finite volume method that exploits mesh motion to enforce differential involutions arising in hyperbolic systems of conservation laws. The key idea is to leverage the geometric degrees of freedom of an Arbitrary-Lagrangian-Eulerian (ALE) framework to construct a constrained mesh motion that is intrinsically compatible with the involution constraints embedded in the governing equations. The method is developed within a cell-centered formulation on moving quadrilateral meshes, where discrete divergence and curl operators are constructed from vertex-based differential operators. Particular care is devoted to the consistent evolution of the mesh geometry and the satisfaction of the Geometric Conservation Law (GCL). The proposed framework is applied to two representative hyperbolic systems featuring distinct involution constraints: the ideal magnetohydrodynamics equations, endowed with the divergence-free condition on the magnetic field, and the hyperbolic Euler-Heat equations, subject to a curl-free constraint on the thermal impulse. Second-order accuracy in time is achieved through a Runge-Kutta discretization, with the geometric constraints consistently enforced at each stage. A comprehensive set of classical benchmark problems is presented to assess the accuracy and effectiveness of the method. The numerical results demonstrate that appropriately constrained mesh motion provides an effective mechanism for preserving differential involutions, establishing a novel connection between mesh geometry and the structure-preserving discretization of hyperbolic systems.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12188 ↗

Hierarchical Bayesian models pool measurements, but with the forward model in the likelihood every posterior evaluation costs one forward solve per cell. To reduce this cost, we introduce a simulation-based inference framework in which a triangular transport-map likelihood, trained once per design, serves every cell. We apply it to infer wetting properties from photographs of a stable hole in a thin liquid film. The hole's radius depends, through the nonlinear Young-Laplace equation, on the contact angle and capillary length. One photograph gives rank-one information about them, so we pool many in a hierarchical model whose cells, each a substrate at one volume setting, share the apparatus geometry and the noise scale. A design fixes the number of substrates, the volume settings and the photographs per cell. The map's posteriors agree with direct sampling of the forward model in the wetting properties at a synthetic validation design, and less closely at a larger synthetic scaling design. At the validation design, simulation-based calibration detects no departure for any parameter. There, the map needs several hundred times fewer forward-model evaluations than direct sampling with a gradient-free ensemble sampler for a single posterior, and about five orders of magnitude fewer over a calibration study of 200 posteriors. On real photographs its posterior agrees with direct sampling and is consistent with the measured radii. Trained offline, the amortized map turns new photographs into a posterior with no forward solve. It is thus a major step toward measuring wetting properties in situ without disturbing the liquid.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12193 ↗

Coding agents now write simulation programs, but benchmarks usually judge only whether their output matches a reference. In manufactured-solution tasks the data determine the exact solution, so a matching output need not come from a solver. We introduce PDEViBench, a benchmark of 290 tasks in six equation families that traces each passing program to the computation behind its output and reruns unclear programs on changed data. A Codex agent (GPT-5.2) passed 80% of 1,450 runs, yet about one pass in ten returned the exact solution without solving the equation. Counting only solved passes changed which task features made problems seem hard and reversed the ranking of two prompts. Once the prompt forbade the shortcut, every pass was a numerical solve, and on tasks without a closed-form solution passing programs stayed correct on changed data. Scientific coding benchmarks should check how each answer was computed as well as whether it matches.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12308 ↗

A central objective in stochastic mechanics is to separate deterministic physical behavior from the probability laws governing uncertain inputs. While classical spectral approaches achieve this separation in linear settings, nonlinear responses introduce interactions beyond conventional second-order variability response functions (VRF). Inspired by the spirit of VRFs, this work establishes that, for a fixed physical system, uncertainty propagation is described by a law-invariant operator mapping input realizations to responses, governed by the underlying physics and the deterministic parameters of the system. Different probability laws affect the input sampling and resulting response statistics, but not the mapping operator. We establish this law invariance under complete, invertible coordinate transformations and develop complementary, Fourier, fixed-reference polynomial-chaos (PCE) and finite element method (FEM) transfer formulations. Fourier captures nonlinear cross-frequency interactions and recovers the classical VRF in the appropriate linear limit, PCE describes coupling among stochastic modes, while FEM expresses the deterministic inverse-stiffness action. Neural approximations of these deterministic operators are investigated through analytical and finite-element benchmarks, examining cross-law generalization, the influence of training distributions and stochastic excitation, and the prediction of response fields and statistics. The results demonstrate the potential for reusing learned physical operators across different stochastic laws without retraining, while highlighting the importance of adequate training coverage and the challenges of accurately estimating low-probability events.

comments
31 pages, 19 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.12361 ↗

Electroencephalographic source reconstruction of visual evoked activity is challenging because distributed, temporally evolving, and overlapping cortical sources generate scalp potentials. We present a controlled simulation framework for flash visual evoked potentials (FVEPs) based on a coupled Jansen–Rit neural mass network and a realistic finite-element EEG forward model. The framework generates a sequential activation pattern across early visual, parietal, and frontal regions and enables direct comparison of reconstructed activity with known ground truth. Standardized Kalman filtering (SKF), change-rate SKF (CrSKF), conventional Kalman filtering (KF), and linearly constrained minimum variance (LCMV) beamforming are compared using parcel-wise time courses, temporal lags, and assessments of spatial focality and Earth Mover's Distance. In the inverse comparison, SKF and CrSKF preserve the principal temporal progression more consistently than KF and LCMV, while CrSKF produces smoother temporal estimates. The results also demonstrate parcel-wise leakage and reduced separation of closely spaced components, emphasizing the need to interpret temporal ordering together with spatial reconstruction quality. The proposed framework provides a reproducible test environment for evaluating dynamic EEG inverse methods under controlled noise conditions.

comments
12 pages, 13 figures
fields
Numerical Analysis, Dynamical Systems
pdf ↗ page arXiv:2611.12366 ↗

Neural surrogates for engineering models are often trained on large collections of simulated solutions. We investigate whether physics-informed neural networks (PINNs) can achieve accurate predictions from scarce labelled observations by incorporating governing equations and prescribed initial and boundary conditions. We introduce hierarchical loss weighting (H-PINN) and its gradient-direction-aware extension (HO-PINN), which adjust the emphasis on physical constraints according to higher-priority losses. Hierarchical PINNs are compared with Vanilla PINN, tuned gradient boosting, support-vector regression, and Gaussian-process regression on a heat equation and three heterogeneous two-phase-flow benchmarks. Experiments use 20–1000 labelled states and ten paired seeds. Each label is one coordinate–state observation, not a complete simulation. At least one PINN variant achieves the highest mean primary-target \(R^2\) in each interpolation and equation-assisted forecasting comparison at 20 and 50 labels. The advantage for water saturation persists across all tested budgets. Hierarchical weighting reduces variability across runs in selected settings. These results demonstrate that known physics can support accurate neural surrogate predictions from very few solution observations, at substantially higher fitting cost than the tested classical regressors.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12424 ↗

Sampling from high-dimensional, multimodal target distributions plays a fundamental role in scientific computing, statistics and machine learning. Recently, the Schrödinger-Föllmer sampler (SFS) has been proposed by Huang et al. (IEEE Trans. Inform. Theory, 2025) as an efficient sampling algorithm that transports the degenerate distribution at $t=0$ to the target distribution at $t=1$, without relying on long-time ergodicity. In this paper, we establish non-asymptotic error bounds for SFS in the total variation distance by deriving regularization estimates for the associated Kolmogorov equation via the Bismut-Elworthy-Li formula. When the drift can be computed exactly, a convergence rate of order $\mathcal{O}( h|\ln h|)$ was obtained under certain smoothness conditions on the drift with a uniform time step-size $h>0$. When the drift is approximated by Monte Carlo methods, we obtain a convergence rate of order $\mathcal{O}( h|\ln h|+ 1/M)$, where $M$ is the number of samples used in the Monte Carlo approximation. This yields a sharper dependence on $M$ than the existing bound $\mathcal{O}(1/\sqrt{M})$ in the $L^2$-Wasserstein distance in the aforementioned paper, by turning the total variation error to the weak error analysis in the setting of non-smooth test functions. Numerical experiments are presented to illustrate the convergence rate with respect to the time step-size $h$ and the Monte Carlo sample size $M$ and the effectiveness of the proposed algorithm.

fields
Numerical Analysis, Statistics Theory
pdf ↗ page arXiv:2611.12447 ↗

This work addresses the discretisation and iterative coupling algorithm for an induced seismicity model accounting for fault reactivation and slip driven by subsurface fluid injection. The model couples single-phase Darcy flow in both the porous matrix and the fault network with a quasi-static poroelastic mechanical response in the bulk and fault slip governed by a rate-and-state friction law with radiation damping stabilisation leading to a quas-dynamic formulation. The contact mechanics problem is discretised using the Virtual Element Method with bubble stabilisation of the facewise constant Lagrange multiplier. It is combined with a Hybrid Finite Volume scheme for the mixed-dimensional Darcy flow model. The time discretisation is implicit and the nonlinear system is solved at each time step using an iterative coupling algorithm which iterates between the Darcy flow, the frictional contact-mechanics, and the state differential equation. The contraction of this iterative coupling algorithm is established with a smallness assumption on the time step independent on the mesh size. This proves convergence of the fixed-point as well as well-posedness of the system. The frictional contact-mechanical model is solved using a semi-smooth Newton algorithm based on a local nonlinear inversion of the friction rate-and-state law and a block Gauss–Seidel preconditioner exploiting the structure of the VEM-bubble-$\mathbb{P}^0$ mixed discretisation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12462 ↗

A learning based method for Helmholtz equations was proposed in [J. Comput. Phys. 520:113478,2025]. Based on Runge's approximation, it can be proved that when the solution can be continued outside the computational domain, using fundamental solutions as learning samples is sufficient to obtain the solution mapping with spectral accuracy. However, for complex geometries, such as domains with corners, approximation by fundamental solutions may only have logarithmic convergence due to the regularity issue, which is computationally impracticable. Moreover, approximation of a solution to the elliptic equation with those on larger domains is an ill-posed problem. In this work, we investigate how to feed additional learning samples to essentially get a practicable convergence rate and a stable algorithm, so as to ensure the generalizability of the learning based method. Error analysis and numerical examples illustrate flexibility and high-accuracy features.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12506 ↗

Numerical simulation of hypersonic vehicles is an attractive approach to investigate the complex phenomena involved in such technologies. For this, second-order finite volume methods (FVM) are the established method in computational fluid dynamics, with the cost of high dissipation in affordable meshes, thus needing refined ones or adaptive mesh refinements techniques to obtain accurate results. An alternative is to make use of high-order discontinuous Galerkin methods, in particular discontinuous Galerkin spectral element method (DGSEM), once it achieves higher formal order of accuracy on element-local polynomial bases. Therefore the goal of this work is to present the numerical simulations of a two-dimensional scramjet configuration to test and verify the applicability of the DGSEM approach for a complex hypersonic flow where shock-shock interactions occur. Results revealed to be in agreement with reference FVM solvers, thus verifying the code implementation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12511 ↗

The behavior of the nodal line of the second eigenfunction of the negative Laplacian has been widely studied. Dahne could show numerically for one domain with six holes in two dimensions that it is possible to reject Payne's nodal line conjecture. We investigate the behavior of the nodal line if it does not touch the boundary, specifically the general shape, its prediction, its dependence on the parameters, and the numbers of holes. In this paper, we could address these issues numerically with a very efficient parallelized algorithm showing the rejection for various domains with six and five holes.

comments
35 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.12542 ↗

We present a class of numerical collocation methods to solve a typical inverse problem that arises in the stress-controlled rheology of complex fluids with pronounced history-dependent response, where the relation between stress and flow rate is given by an integral constitutive equation as the material law. We demonstrate the method by calculating the creep response of a nontrivial model of a shear-thinning viscoelastic fluid where a stress overshoot in rate-controlled startup flow leads to ``sudden yielding'' in stress-controlled creep. Our method is able to address the long-time behavior of the model, distinguishing the amorphous solid from the stress-induced yielded fluid, and from the in-between case of infinite deformation that never achieves a stationary shear rate (proper creep). To this end, we implement a method with flexible time-stepping, and prove uniqueness of the solution and convergence of the methods for a broad class of highly viscoelastic non-linear rheological laws in integral form.

comments
45 pages, 5 figures, for an implementation that also has been used to create the figures see https://doi.org/10.5281/zenodo.22978793
fields
Numerical Analysis
pdf ↗ page arXiv:2611.12578 ↗

We compare two cubic Hermite Galerkin semidiscretizations of the Korteweg-de Vries equation on a bounded interval with boundary dissipation. They use the same trial space. The first is the weighted scheme considered in our previous paper (arXiv:2610.39269), called the W-scheme. It has mesh-uniform regularity: the discrete semigroups of the linearized equation inherit Crandall-Pazy regularity and Kato smoothing, with bounds uniform in the mesh size $h$. The second is the standard Galerkin method in $L^2$, called the S-scheme. It has no mesh-uniform regularity. For the W-scheme, the full error and the ordering error converge at an algebraic rate in $h$, uniformly on $[t_0,\infty)$ times small balls of $L^2$ for any fixed $t_0>0$. They are bounded by $Ch^p\varepsilon$ and $Ch^p\varepsilon^2$, respectively, where $\varepsilon$ is the size of the datum and $p>0$. We prove that neither bound holds for the S-scheme by using exact high-frequency spurious eigenpairs of the S-scheme. The existence of such eigenpairs for fine meshes with at least 512 elements has a proof checked by Lean 4. Computations compare the two schemes on unit-norm data built from these eigenfunctions, on 512, 1024 and 2048 elements. The full error of the S-scheme stays at $4.6\times10^{-2}$. That of the W-scheme is at most $2.2\times10^{-9}$. The ordering error of the S-scheme stays at $9.6\times10^{-6}$. That of the W-scheme falls from $2.3\times10^{-9}$ to $1.4\times10^{-10}$. Their ratio grows from $4.2\times10^3$ to $6.6\times10^4$.

comments
44 pages, 2 figures. Ancillary files: the Lean 4 development for Theorem 3.1, and the programs, outputs and logs of the computations
fields
Numerical Analysis, Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.12585 ↗

We establish the holomorphic dependence of the Calderón projector for the Helmholtz operator upon shape boundary deformations of a family of bounded Lipschitz domains in two and three spatial dimensions, with bounds explicit in the wavenumber and the size of the holomorphic extension. More precisely, after transporting the four boundary integral operators contained in the Calderón projector to a fixed reference boundary, we prove that the resulting parameter-to-operator maps admit bounded holomorphic extensions in their natural fractional Sobolev spaces. Unlike approaches that require boundary regularity of class $\mathscr C^{1,1}$ or higher, our argument traces the holomorphic dependence on the shape by transferring elliptic estimates to the boundary through the fundamental solution and the Dirichlet and conormal trace operators. This construction is the key step that allows us to treat Lipschitz-regular boundary deformations. Furthermore, we show that the domain of holomorphy can be chosen independently of the wavenumber $κ$, while the operator bounds in the corresponding fractional Sobolev spaces contain algebraic factors in $κ$ multiplied by $\exp(Cκδ)$. In particular, for real domains, corresponding to $δ=0$, our single layer estimate recovers, to our knowledge, the best available frequency dependence on general Lipschitz boundaries. For the double layer, adjoint double layer, and hypersingular operators, we obtain novel frequency-explicit bounds. The results proved in this work provide the analytic foundation for frequency-explicit uncertainty quantification, model order reduction, and high-dimensional approximation of boundary integral operators, their Galerkin discretizations, and the resulting boundary densities and quantities of interest on families of parametrically varying boundaries.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12659 ↗

Sampling only part of the data reduces the cost of each iteration in an inverse problem, but can make reconstruction updates unreliable. We study stochastic multilevel sampling, which computes updates on a coarse-to-fine hierarchy of correction spaces. The guiding idea is that a small sample may support a reliable coarse-grid update even when it provides insufficient information for a fine-grid update. For quadratic objectives, we identify conditions under which corrections computed from sampled data decrease the full-data objective. In small-batch experiments with computed tomography and periodic deblurring, the stochastic multilevel method improves reconstruction accuracy over matched single-level methods. In an increasingly ill-conditioned CT refinement with a fixed number of projection angles, the single-level error increases as the image dimension grows, whereas a deep hierarchy maintains or improves accuracy and outperforms full-data single-level optimization at the same number of forward and adjoint applications. The gains persist across the tested local solvers and strengthen with deeper hierarchies. A separate known-probe ptychography study provides complementary evidence for the benefit of hierarchical corrections for nonlinear inverse problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12667 ↗

Mathematical Physics43

In this Letter, we develop a graph-geometric framework and prove that the pentagonal bipyramid (PBP) is the unique global minimiser of both the seven-particle Lennard-Jones energy in $\mathbb{R}^3$ and the seven-charge Thomson energy on $S^2$, up to rigid symmetries and particle relabelling. For the Thomson problem, this strengthens a recent deterministic global-optimality certificate to numerical tolerance into an exact global-optimality and uniqueness theorem. A weak-interaction graph, defined by thresholding pair geometry, organises configuration space without imposing symmetry or discarding any pair interaction. For Lennard-Jones, pair-energy counting, graph classification, subset bounds, and force balance reduce all possible minimisers to 29 bounded domains; exact geometric certificates exclude 28, localise the survivor near the PBP, and a uniform restoring-energy estimate proves uniqueness. The Thomson proof follows the same progression: graph reduction, geometric localisation, and rigidity, but finalises through whole-domain coercivity and a global localisation theorem. The same fivefold order therefore emerges in two very different physical settings: an unconstrained cluster with a preferred bond length and purely repelling charges confined to a sphere, showing a common geometric organising principle for seven particles that is not tied to either interaction.

comments
6 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09925 ↗

An example of computation of locations of constrictions on the phase-lock area in the parameter space for the equation modeling dynamics of overdamped Josephson junction is discussed. Several conjectures of qualitative character are inferred from the heuristic data thus obtained. The method applying isomonodromic deformations of the special double confluent Heun equation associated with the noted model is used. Such a deformation is controlled by the data provided by solution to a Third Painlevè equation for which a new representation in conjunction with the corresponding non-linear second order differential equation fairly efficient in the treatment of the problem in question is proposed.

comments
47 pages, 16 fugures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09931 ↗

A Markov operator on a matrix algebra, that is, a unital completely positive map, is called positivity improving if it maps every nonzero positive element to an invertible one. This is the noncommutative counterpart of a stochastic matrix with strictly positive entries. We show that positivity improvement is self-dual and equivalent to a faithful quantum Markov–Dobrushin–Doeblin minorization. We also compare the scalar trace minorization with the optimal common-lower-bound construction of the quantum Markov–Dobrushin coefficient. We then characterize positivity improvement through the Kraus space of the map: a Markov operator is positivity improving if and only if the Hilbert–Schmidt orthogonal complement of its Kraus space contains no operator of rank one. As a consequence the Kraus rank of a positivity improving Markov operator on the algebra of $d\times d$ matrices is at least $2d-1$, and an explicit Hankel-type channel shows that this bound is attained in every dimension. Although deciding positivity improvement is NP-hard in general, we obtain complete and effectively checkable classifications for qubits and qutrits, together with families of examples (Pauli, Weyl and Werner–Holevo channels) showing that all our estimates are optimal. Finally we show that, in infinite dimensions, positivity improvement no longer implies any contraction of the Markov operator.

fields
Mathematical Physics, Operator Algebras, Probability
pdf ↗ page arXiv:2611.10042 ↗

We investigate a finite-periodic Miura free-field realization of the classical Virasoro–dilaton sector relevant to sl(2,R) Jackiw–Teitelboim (JT) gravity. Starting from a single logarithmic Cartan field, we use the established discrete Miura map and its free-field Poisson bracket to construct the lattice spin-two current. The dilaton is then realized as a periodic composite of the same Cartan variables, selected by an inhomogeneous difference equation and its monodromy condition. This construction yields an explicit induced mixed Poisson bracket without postulating an independent dilaton bracket. We examine the associated transfer problem and quadratic adjoint invariant, and test the finite Fourier algebra against the continuous Virasoro–dilaton transformation, in which the dilaton has conformal weight minus one. The construction supplies a free-field counterpart of the JT boundary transformation laws; it does not by itself identify the Miura Poisson structure with the canonical BF boundary-charge algebra.

comments
18 pages, LaTeX
fields
Mathematical Physics
pdf ↗ page arXiv:2611.10074 ↗

We show that half-BPS D3-branes wrapping AdS$_2\times$S$^2$ in AdS$_3\times$S$^3\times$T$^4$ with mixed NSNS and RR flux define integrable boundary conditions for the supercoset sigma model of the Green–Schwarz superstring. This extends the integrable D-branes of Dekel and Oz to backgrounds with a Wess–Zumino term, and previous bosonic results for mixed flux to the full superstring. Using the D3-brane action, we find that the electric and magnetic worldvolume fields that stabilise the branes at generic positions are obtained from those of the AdS$_2\times$S$^2$ branes of the WZW model by the same $SL(2,\mathbb{R})$ rotation that maps the pure NSNS background to the mixed flux one, acting on the D3-brane as electric–magnetic duality. On the worldsheet, cancelling the fermionic boundary terms requires introducing a specific closed two-form in the boundary action, and its contribution to the bosonic boundary conditions reproduces precisely these worldvolume fields. We then construct field-dependent reflection matrices that lift the boundary conditions to gluing conditions for the Cagnazzo–Zarembo Lax connection and describe displacements along geodesics normal to the brane. The resulting double-row monodromy matrix generates infinitely many conserved charges, which establishes the classical integrability of the open superstring for any mixture of fluxes. In AdS$_3$/CFT$_2$, these branes are expected to be dual to conformal interfaces in a deformation of the symmetric product orbifold of T$^4$.

comments
42 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.10120 ↗

We present a systematic geometric classification of the Noether point symmetries of time-dependent conformal Lagrangians of the form $L = A(t)\left(\frac{1}{2}g_{ij}\dot{x}^{i}\dot{x}^{j} - V(x)\right)$, whose Euler–Lagrange equations describe dynamical systems with time-dependent linear damping. The classification is carried out by coupling the temporal parameters of the conformal factor $A(t)$ with the homothetic algebra of the kinetic metric $g_{ij}$ through a set of compatibility and integrability conditions. The central result is a main theorem which determines the Noether generators, the associated gauge functions and the resulting invariants. The theorem splits naturally into two cases according to whether the quantity $D - 2ψ$ is non-zero or zero, with further subcases depending on whether the homothetic vectors are gradient or non-gradient. The theorem imposes no restrictions on $A(t)$, $g_{ij}$ or $V(x)$, and is therefore fully general and covariant. We apply the theorem to the time-dependent damped Duffing oscillator (DDO) in Euclidean space $E^{3}$ with $A(t) = e^{γt}$ and potential $V = \frac{1}{2}a\,r^{2} + \frac{% λ}{4}r^{4}$. For the damped harmonic oscillator ($λ= 0$) the theorem reproduces the classical Bateman invariant as a special case. For the anharmonic case we obtain a new exact time-dependent quadratic invariant, valid when the linear stiffness satisfies $a = 2γ^{2}/9$. Each invariant is verified explicitly by direct differentiation along the equations of motion. The new invariant provides a rare example of a global conservation law for a fully nonlinear dissipative system, and can be used for the integration and quantization of the DDO.

comments
17 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.10522 ↗

We develop a variational and geometric theory based on statistical physics for the joint evolution of Transformer attention and token representations at fixed model parameters. To this end, we introduce a free energy for the attention and model the evolution of the attention weights by its Fisher–Rao gradient flow. At fixed token representations, we prove that the softmax matrix is the unique free-energy minimiser and that every positive attention trajectory converges to it. For prescribed time-dependent representations, we show that the attention dynamics becomes linear after a change to logit variables. This result yields tracking bounds relative to the instantaneous softmax and sufficient conditions for attention to converge to a fixed matrix. Hamiltonian dynamics for the representations and their momenta are then coupled to the attention relaxation driven by the same energy. This coupling results in an energy-dissipation law. We also develop two alternative Hamiltonians incorporating the attention value map. We prove global well-posedness of the attention flow and all three coupled systems.

comments
29 pages Submitted to Proc Roy Soc A
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.10691 ↗

Variational quantum classifiers can generate highly structured decision boundaries through the Fourier dependence of observable expectation values on circuit parameters. We show that expressivity can come at a sharp statistical cost, by considering a quantum perceptron whose readout is the simplest periodic classifier, namely a square-wave function of the weighted inputs, and determine its typical generalization in the thermodynamic limit using a teacher-student replica-symmetric theory. Above a critical oscillation frequency, increasing the training load induces a first-order transition from weakly to strongly teacher-aligned phases, resulting in a discontinuous improvement in generalization. At fixed load, however, increasing the frequency eventually drives the equilibrium generalization error to chance level, despite perfect classification of all the training examples. Thus, the same periodic structure that enhances random-label storage can delay the onset of learning. Our results expose a quantitative tradeoff between memorization and generalization generated purely by periodic readout, and provide a benchmark for understanding Fourier-rich variational quantum classifiers.

comments
29 pages, 4 figures, comments are welcome
fields
Mathematical Physics, Statistics Theory
pdf ↗ page arXiv:2611.10887 ↗

A hard edge of a Hermitian random matrix occurs when the eigenvalue density is strictly zero on one side of the edge, and nonzero on the other. Another possibility is that the eigenvalues occur in $\pm$ pairs, which creates a hard edge at the origin for the positive eigenvalues. Both review material and new results are presented for random matrix ensembles exhibiting a hard edge. The review material has two focuses: one is on applications of the random matrix hard edge, while the other is on exact eigenvalue probability density functions. The new results relate to the large $N$ expansion of correlation functions and conditioned gap probability generating functions with hard edge scaling for the Jacobi ensemble. For all even $β$ we are able to show that these quantities admit expansions in inverse even powers of the variable $N_{\rm hJ}':= N - 1/2 + (a + b + 1)/β$. For the $β=2$ Jacobi unitary ensemble, we can relate the leading (next leading) correction to the limit law to a particular second order (fourth order) differential operator applied to the latter. The analogous second order differential operator is found for $β=1,4$, leading then to its conjectured form for all $β>0$.

comments
39 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.10990 ↗

For a random matrix, with eigenvalues in a one-body potential $V(x)$ and a 2-body interaction $R(x,x')$, it is known that the resolvent converges in the large $N$ limit to an analytic function in the complex plane minus cuts, called the spectral curve. In the 1-cut case, a two-sheeted neighborhood of the cut is a cylinder with two simple ramification points. We describe these spectral curve data by boundary integral operators and generalized cycles. Vice-versa, given a 2-branchpoints spectral curve in a cylinder, there exists a formal random matrix model that corresponds to it. The goal of this article is to show the method to recover a formal random matrix model, with its potential and 2-body interaction, from the geometry of the spectral curve.

comments
27 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11015 ↗

The primary object in quantum field theories is the one-step relativistic evolution operator. In this paper we consider the evolution operator defined on the auxiliary Kagomé lattice with the $q$-oscillator algebra of observables, the local ingredient of the evolution operator is the $q$-oscillator $R$-matrix of the Zamolodchikov tetrahedron equation. We construct explicitly the complete system of equations (which can be seen as a specific form of nested Bethe Ansatz equations) defining the spectrum of the evolution operator. This system of equations is valid for an arbitrary initial data (occupation numbers), and the thermodynamical limit is well defined for this system.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.11182 ↗

We examine the geometric mechanism controlling the transition from local to global chaos in a generic 2D Hamiltonian system, the generalized Hénon-Heiles system. Using Poincaré sections and invariant manifolds, we show that the chaotic fraction grows through abrupt transitions associated with the destruction of invariant barriers. We introduce an index that gives the time required for the first penetration of a local chaotic domain into the global chaos. This index increases sharply and tends to infinity as a critical energy is approached. The set of lobes generates heteroclinic connections, while multiple unstable periodic orbits exhibit a global manifold structure characterised by repeated loops and lobes. However, in special chaotic cases close to the integrable Hénon-Heiles potential, where two asymptotic curves extend to infinity, the manifold topology differs qualitatively from the generic case, as the asymptotic curves no longer form closed structures surrounding the periodic orbits.

comments
9 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11255 ↗

The Love equation is a paradigmatic example of a Fredholm integral equation of great interest in mathematics and physics, where its applications range from electrostatic problems to exactly solvable models for one-dimensional systems. In this work we propose a method to approximate the normalized solutions of Love equations of the first and second kind via a parametrization obtained by Hermite interpolation at Chebyshev nodes. Following the same approach, we also obtain approximations for the second, fourth and sixth momenta of the solution of the Love equations. We focus in particular on one-dimensional quantum gases described by the Lieb-Liniger and the Gaudin-Yang models. For these models, the solutions of Love equations correspond to the normalized densities of pseudorapidities. We show that remarkably accurate results can be obtained using the Hermite-Chebyshev interpolation with a number of points as low as 17+2. In the case of the Lieb-Liniger model, we also propose a very accurate closed-form estimate of the dimensionless ground state energy valid for all values of the dimensionless interaction parameter incorporating known results for small and large couplings supplemented by the Hermite-Chebyshev interpolation for intermediate couplings. As an application of this result, we compute the dimensionless local two-particle correlation function and the black soliton solutions of the Lieb-Liniger model.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.11268 ↗

The Lieb-Sokal theorem provides a tool for establishing the Lee-Yang property of the partition function of a spin model if the corresponding single-spin partition function has this property and the interaction term in its Hamiltonian is of the form $-\sum J_{ij} S_iS_j$ with $J_{ij}\geq 0$. According to the result of this paper, the spin $S=1$ model with the Hamiltonian $-\sum (J_{ij} S_iS_j + K_{ij}S_i^2S_j^2) + \sum ΔS_i^2$ has the Lee-Yang property for all $K_{ij}\in \mathds{R}$ and $Δ>0$, whenever each $J_{ij}$ exceeds an explicitly computed bound $C(β, Δ, K_{ij})>0$, such that $C(β, Δ, K_{ij})\to + \infty$ as $β\to 0$. The latter suggests that the Lee-Yang property of this model may hold only for sufficiently low temperatures.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.11484 ↗

The Einstein equations constrain the transverse Taylor series at a degenerate Killing horizon, but even complete knowledge of that series need not determine a smooth spacetime: a nonzero difference can vanish to every order at the horizon. We show that this ambiguity disappears when the limiting metric on the space of Killing orbits admits a spacelike graph over a compact horizon section. In dimensions $d\geq4$, smooth vacuum Einstein germs with the same marked transverse jets are then locally isometric on a two-sided neighborhood of the whole section. The proof combines a terminal wave-map gauge with energy estimates on the orbit cylinder and yields a finite weighted matching criterion. For unwarped horizons with positive-Einstein sections, a condition on the full Lichnerowicz spectrum reduces the smooth classification to parallel first transverse data. All such data have convergent multiwarped Einstein realizations, including examples whose sections have negative sectional-curvature directions. We also obtain a finite-regularity version for round sections. The continuation argument extends to four-dimensional Einstein–Maxwell theory and gives smooth charged-Nariai rigidity. Finally, rotating Nariai data admit the required spacelike graph throughout the regular branch; an all-order tensor estimate yields smooth Kerr–de Sitter or rotating-Nariai rigidity for $a^2/r_0^2\leq1/8$, without assuming ambient axial symmetry.

comments
55 pages
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.11495 ↗

A continuum mass-gap argument must preserve nonzero renormalized states and a positive spectral estimate while the spatial cutoff is removed and physical volume grows. We develop quantitative results that separate these requirements. Gauge reduction, reflection positivity and attributed strong-coupling estimates give physical-transfer bounds with nontrivial local sectors. At fixed spatial cutoff and positive coupling, we construct subsequential infinite-volume physical-time dynamics from local history correlations, with nonconstant gauge-invariant observables. For finite spatial boxes, explicit bounds apply to the entire physical vacuum complement; finite-matrix criteria include all omitted representations. Vacuum concentration gives extensive entropy bounds, quantitative fidelity obstructions for hard electric cutoffs, and necessary growth of retained representation spaces. A sharper local comparison yields complete bounds on fixed discarded-link sectors, while collective projection and Schur estimates isolate the additional input needed for a volume-uniform gap. The work also certifies a finite three-link conditioning functional through Wilson coupling 0.354, with its physical interpretation conditional on the stated block-comparison hypotheses. Exact blocking, corrected effective-potential theorems and a representation-by-representation two-dimensional benchmark clarify which approximations preserve the relevant observables. Published glueball measurements retain their original attribution; their reanalysis and the reproduced winding-channel and replica studies have explicitly statistical scope. Complete derivations and reproducible calculations support a set of certified benchmarks and continuum transfer criteria. A nontrivial four-dimensional spatial-cutoff construction and a positive spectral bound along it are not established; no exact continuum mass is asserted.

comments
414 pages, 98 references. Supporting calculations, code, and research data: https://doi.org/10.5281/zenodo.23986334
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11534 ↗

For ferromagnetic Ising chains with $n^2J_n\to B>0$, the critical excess magnetization in a field inversely proportional to spin separation determines the connected correlation. Their slowly varying profile has finite logarithmic integral exactly when the ordered thermal slope is finite. For any finite nonnegative core, an exact tail gives inverse-logarithmic correlations and a square-root cusp. A relative correction $c/\log(n+e)$ with $c>1$ gives continuously varying logarithmic powers and a linear cusp. A lower bound on its disordered susceptibility excludes the usual Kosterlitz–Thouless law.

comments
39 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11546 ↗

We study CFT four-point functions of identical scalar primaries as their dimension $Δ$ grows for fixed $0<z, \bar z<1$, and call them liberated if they grow at the same exponential rate as those of a generalized free field (GFF), as is the case for heavy free particles propagating along geodesics in AdS. We show that the correlator is liberated at the crossing symmetric point if and only if the light spectrum is sparse, and that liberation then holds wherever $z$ and $\bar z$ lie on the same side of $1/2$. If the low twist states are also sparse, liberation holds everywhere except in an explicit band around $z+\bar z=1$. In particular, if the primary twist gap lies above $\sqrt{2}Δ$, then the correlator is liberated everywhere. For twist cutoffs below $Δ$, composites of two spinning generalized free fields fail to be liberated in a region that fills the band near the double lightcone limit. In two dimensions, Virasoro primaries cannot be liberated unless the central charge grows faster than $Δ$. The same framework sharpens the universality of large-$c$ torus partition functions of two-dimensional CFTs.

comments
52 pages, 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11594 ↗

The dynamical Casimir effect was first predicted by G. T. Moore in 1969, who considered a real scalar field inside a cavity with a moving mirror in ($1+1$)D, satisfying Dirichlet boundary conditions. Moore wrote the general solution for the field in terms of a function that satisfies a functional equation nowadays known as the Moore equation.In the literature, exact analytical solutions to the Moore equation form a rather small set, restricted to specific classes of laws of motion. Cole and Schieve (1995) developed a geometrical approach that yielded a general formula for the solution of the Moore equation for cavities initially at rest. However, its application has always been done through numerical calculations, and their approach has therefore long been regarded solely as a numerical method. In this work, we show that their method can also be employed as a powerful method for deriving exact analytical solutions, and show the applicability of this approach to deriving analytical solutions to the Moore equation. We obtain original exact analytical solutions for an expanding cavity with a uniformly moving mirror, a contracting cavity with a mirror that approaches the static one asymptotically, and, in addition, we recover the first analytical solution to the Moore equation for a resonant mirror motion, originally obtained by Law in 1994. Moreover, we extend the Cole-Schieve approach, showing that exact solutions can be constructed from any spacetime region where the Moore function has already been determined. We show that this extended geometrical approach allows us to expand the set of known analytical solutions to the Moore equation from the few classes of motion reported in the literature to an infinite set, as it enables the treatment of new classes of laws of motion obtained by combining those presented here with each other as well as with previously known classes of trajectories.

comments
20 pages, 15 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11595 ↗

The central difficulty in quantum many-body physics is that the Hilbert space dimension grows exponentially with the total degrees of freedom. A key feature to circumvent this problem is locality, which manifests dynamically through an approximate causal structure in the form of a Lieb-Robinson bound (LRB). LRBs have been proved for quantum spin systems and certain lattice boson systems, but so far never for realistic continuum systems. We present the first LRB that applies to a standard system of one-dimensional continuum fermions. It applies to initial states with controlled moments of local particle number and energy and is thus thermodynamically stable. Our result breaks the main technical barrier that has existed for using the vast locality toolbox on continuum systems.

comments
40 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11655 ↗

We compare the fixed-charge planar Gross–Witten–Wadia (GWW) model with source-free one-dimensional QCD at large $N$ and $N_f/N$ fixed. In both models the resolvent and one-cut condition give an algebraic equation for a derivative of the free energy: a quartic for GWW and a sextic for QCD. Finite-$N$ Toeplitz determinants independently check the selected QCD branch. Signed permutations of homogeneous parameter triples realize $S_4$; the resulting action on the algebraic branches and operator labels gives a common projective description of the two models. For QCD, the sextic yields a differential recurrence linking small-charge rows two apart. The same second-order PDE gives a finite-width column recursion that reconstructs the coefficient pyramid from its GWW boundary. A distinct boundary, obtained from the first resummed coefficient, is the Narayana triangle. A formally collapsed slice counts decorated bipartite plane trees and admits an exact symmetric product formula. The many-flavor scaling reduces the sextic to the quartic and retains transverse projective data: the QCD divided-difference triple coalesces at this boundary, whereas the limiting quartic satisfies the full standard GWW third-order system. We distinguish algebraic degree, mixed differential order, and fixed-parameter ordinary differential order throughout.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.11670 ↗

In this paper, we provide a functorial characterization of Hilbert module classical and quantum reference frames. Using the functorial characterization, we construct a category for equivariant couplings and Hilbert module reference frames. We prove the construction of the reference frame system from the equivariant coupling data yields a functor. We also deduce a ``unitary" groupoid as frame transformations for Hilbert module reference frames of a fixed Hilbert module dynamical system. We provide some examples of these frame transformations in the case of the indistinguishable classical two state switch and in the case of Hilbert spaces.

comments
58 pages, comments welcomed!
fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.11683 ↗

Variational second-order reduced-density-matrix calculations can dissociate molecules into fractionally charged fragments; Part I largely removed this failure with integer electron-count conditions on fixed partitions. Building on the realizability theory of point processes, we place these conditions in a convergent hierarchy of rigorous relaxations, defined by finite occupation linear programs (LPs) on spatial partitions, for real-space pair densities at fixed one-particle density. Every level contains all representable pair densities, the levels tighten under nested refinement, and their intersection characterizes pair densities admitting a symmetric $N$-particle probability-measure extension. In a fixed orbital basis the levels give monotonically increasing lower bounds to the full configuration-interaction energy, which they need not reach, even for the Coulomb repulsion. The spin-summed real-space cuts of Part I are its two-cell members. The LP optimum is also a measure: at fixed one-particle density it equals the $L^1$ distance of the coarse-grained candidate from representability and increases under refinement to that of the candidate, with a vanishing coarse-graining error; its primal law constructs a representable approximation, and its dual a violated valid inequality, used as a cut in molecular calculations. The count conditions are not implied by the usual positivity conditions: moment data that satisfy all three-particle positivity conditions, including $T_1$ and $T_2$, give through Gaussian orbitals a smooth pair density that violates an integer count. For atoms at fractional electron number, ensemble relaxations with the integer-count condition lie closer to the exact piecewise-linear energy than the zero-variance fixed-$N$ form.

comments
25 pages, 5 figures, 7 tables; supplementary material (43 pages) as ancillary file; code, verification programs, and data at https://doi.org/10.5281/zenodo.24063922
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11707 ↗

Chip performance is limited by a shared bottleneck: the core produces heat faster than it can be moved out. We study the hardest case, RF power GaN HEMTs, whose hotspots exceed 5 kW/cm^2, and propose a horizontal near-junction active cooling topology built on electron entropy transport. Classical on-chip thermoelectric cooling faces a contest: Peltier absorption grows linearly with current, Joule heating with its square. In a vertical pillar, its own conduction resistance locks about half the Joule heat back toward the cold end, capping net cooling. From the Onsager framework we show the origin of this asymmetry: Peltier absorption localizes at the interface where the Seebeck coefficient jumps, whereas Joule heating fills the volume. The topology exploits this: a thermoelectric thin film lies flat on a diamond substrate beside the device drain (the electron exit), so bulk Joule heat leaves vertically into the substrate. A lateral fin model gives a closed form for the recirculation factor gamma: the vertical pillar yields gamma = 1, while the horizontal film yields gamma_max = sqrt(2) L_z/L_x, about 0.03 for L_z = 10 um, L_x = 500 um. The decoupling scales the net cooling ceiling and the critical runaway current by roughly 1/gamma. At equal resistance, the same film lifts maximum cooling from 13 mW to 500 mW, and the critical current from 0.65 A to 24 A. A time-constant and linear stability analysis with temperature-sensitive parameters defines the working window and safety margins for microsecond pulse cooling. The architecture leaves the device structure untouched; the principle, absorb at an interface and extract bulk heat vertically, applies to any chip with a hot core and offers a reproducible design path for near-junction thermal management.

comments
10pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11716 ↗

When heat and solute both destabilise a rapidly rotating fluid, do their buoyancies add? Codensity models assume so, giving a straight onset diagonal; spherical shells show curved and kinked thresholds. We study the Busse–Simitev rotating annulus, whose normal modes obey an exact complex cubic dispersion relation. Combining the Bilharz criterion with the neutral-curve envelope yields, in the rapid-rotation limit, an explicit swallowtail wave front, in Arnold's sense, that bends the codensity diagonal into smooth and then kinked thresholds as the diffusivity ratio decreases. Its cusp edges lie inside the unstable domain and its exposed kink ends at the swallowtail singularity; these are singularities of wave-number selection, without coalescence of temporal eigenvalues, and the swallowtail diffusivity ratio has analytical small- and large-Prandtl-number limits. At a kink, broad, fast thermal and narrow, slow compositional Rossby waves become neutral together; hidden arcs mark the birth and merger of unstable wave-number bands. The same geometry enters nonlinear selection: mean-scalar feedback factors through neutral-arc normals and scalar responses, so the mean-profile coexistence margin vanishes with the kink angle as the waves merge. Complete cubic coefficients predict robust coexistence at a reference corner and a narrow bistable interval near merger. Exact finite-rotation corners and periodic-cell simulations confirm the coexisting waves and their invasion thresholds.

comments
10 pages, 3 figures, supplementary material
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11719 ↗

We study the two-player hat game as a two-input, three-output non-local game. We calculate the quantum commuting value and show that it coincides with the quantum one. In particular, we show that \[ω_{\rm q}(H_2)=ω_{\mathrm{qc}}(H_2)=\frac{15+\sqrt{33}}{36}\approx 0.576238.\] We achieve the optimal quantum advantage using a shared non-maximally entangled qutrit state. To establish optimality, we exploit the game's symmetry under the dihedral group $D_8$ and apply its representation theory to substantially reduce the complexity of the underlying matrix problem. We also determine the no-signalling value $ω_{\mathrm{ns}}(H_2)=2/3$.

fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.11759 ↗

The photonic bath at infinity represents the unbounded electromagnetic environment as an effective reservoir in the nonequilibrium Green's function (NEGF) formalism. It accounts for outgoing radiation and incoming electromagnetic fluctuations, allowing radiative transport to be described consistently. We clarify how environmental fluctuations are incorporated without double-counting the outgoing radiation response already contained in the free retarded Green's function. We develop four complementary approaches to deriving the bath self-energy: infinitesimal environmental absorption, semi-infinite leads, inversion of the free Green's function, and sesquilinear forms with outgoing radiation boundary conditions. In particular, we present an explicit three-site matrix inversion for a planar geometry and introduce a sesquilinear form that relates the bath self-energy to the Silver–Müller radiation condition. We establish the connections among these approaches and obtain explicit bath self-energies for one-dimensional, planar, and spherical geometries. The resulting bath self-energies reproduce the Planck spectrum, the Stefan–Boltzmann law, and radiation pressure, and provide the radiative contribution required for energy conservation in photon NEGF.

comments
21 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11816 ↗

We investigate the entanglement entropy of topological quantum states associated with $T_{d,\,dn}$ torus links in (2+1)-dimensional SU(2) Chern–Simons theory at level $k$. These links consist of $d$ components with pairwise linking number $n$, and the corresponding link-complement states provide a natural setting to study multipartite entanglement in topological quantum field theories. We analyze the semiclassical limit $k\to\infty$ of the entanglement entropy by deriving the asymptotic behavior of the moments of the reduced density matrix. To achieve this, we decompose the integrable-representation space into left-edge, right-edge, and bulk regions and employ the stationary-phase method to evaluate their respective contributions. We find that the leading asymptotic behavior is governed entirely by the two edge regions, while the bulk contribution is asymptotically suppressed. The resulting expression for the limiting entanglement entropy is given in terms of Hurwitz zeta functions and exhibits a dependence on the residue class of $k$ modulo $n$. We further investigate the dependence of the limiting entanglement entropy on the winding parameter $n$ and the number of link components $d$. In the large-$d$ limit, the entropy reduces to a binary entropy determined by two normalized weights associated with the left and right edges. Finally, we show that the two iterated limits, $k\to\infty$ and $d\to\infty$, commute, reproducing the result obtained previously by taking the large-party limit first.

comments
26 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11961 ↗

The inner heliosphere is a highly nonlinear continuous medium where macroscopic ideal magnetohydrodynamics is inextricably coupled with microscopic, fully developed stochastic turbulence. State-of-the-art global 3D numerical solvers, while proficient at capturing the large-scale propagation of extreme space physics phenomena such as coronal mass ejections and corotating interaction regions, are computationally constrained by grid resolution and fundamental partial differential equation formulations. Consequently, they inherently do not resolve the local small-scale turbulent cascade, magnetic intermittency, and localized thermodynamic anomalies. To bridge this fundamental scaleseparation gap, this paper presents a novel mathematical and numerical framework that harmoniously integrates global heliospheric structures with local turbulent physics. The framework generates a highly realistic synthetic continuous medium by superimposing a stochastically driven nonlinear turbulent cascade onto a bimodal deterministic background flow. This cascade reproduces theoretical constraints for fractional power spectral densities, magnetic compressibility, and small-scale intermittency via a discrete multiplicative binomial cascade (p-model). This multiscale continuous background is dynamically perturbed by analytical models of large-scale nonlinear transients, including kinematic shock steepening, continuous current sheet topological reversals, and solar ejecta formalized as asymmetric force-free magnetic flux ropes. By generating exact spatio-temporal arrays across arbitrary distributed coordinates, this unified mathematical model overcomes the spatial degeneracy of single-point observations and provides a computationally efficient analytical baseline for performance models supporting future in-situ multi-spacecraft heliospheric missions, which are currently in their feasibility study phase.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.11999 ↗

Variational principles for dissipative processes come in two families: minimum principles at nonequilibrium stationary states (Helmholtz, Kirchhoff, Prigogine) and maximum principles for relaxation in continuum mechanics (Ziegler, Hackl, Fischer). We contribute to the understanding of the thermodynamic extremal principle (TEP) by investigating its extremal properties, and uncover the connection between the two families, whose distinction was recently made precise for diffusion: the extremal character is decided by the regime, which is either relaxation at frozen state, as in a closed system (maximum dissipation), or a driven stationary state in an open system (minimum dissipation), while the underlying Rayleighian functional is convex and minimized in both cases. We further examine the Reynolds transport theorem, a useful tool for fixing the energy rates of continua, and the role of inertia, recently argued to lie beyond the reach of Rayleighian principles. With inertia the driving force must be held fixed during the variation, which is less elegant than in the inertialess case, where it is a state function. Writing the energy rate as rates times driving forces still yields the correct equations, and an extremal statement survives whenever the frozen force does not depend on the varied rate. This holds directly for unsteady Stokes flow, and for Navier-Stokes flow after a change to material coordinates, in which the particle acceleration is the second time derivative of the state and the convective term, nonvariational in the Eulerian description, does not appear. The framework is tested on the Navier-Stokes family (Stokes, unsteady Stokes, and Navier-Stokes flow, in order of increasing complexity) and on dissipative Lagrangian mechanics.

comments
22 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.12045 ↗

Plain weave is one of the simplest woven structures, formed by two sets of yarns that cross at right angles in an alternating over-under pattern. While such woven fabrics are usually confined to a 2D surface, here we propose a practical approach to fabricate volumetric plain weaves, entanglements featuring three mutually orthogonal families of yarns threaded through a cubic lattice. We develop an analytic framework that converts the crossing pattern topology into continuous yarn centreline geometries, which we then leverage to fabricate volumetric weave specimens. Each crossing is encoded by a matrix that defines the offsets of the three yarns at a vertex. These are formulated to preserve the plain weave topology in every plane, where each pair of yarn families interlaces as in a planar plain weave. Eight configurations in four opposite pairs exist, yet all are related by rotations and translations, so that the fully alternating volumetric plain weave has a single topology. We adopt sinusoidal yarn trajectories and show that the crossing matrix defines their phases. We select two solutions: in-phase planar zigzags and out-of-phase circular helices. Both are members of a family of elliptical helices that also admits a free choice of handedness for each yarn. We then derive the conditions under which yarns intersect between vertices. In-phase yarns never intersect, whereas helical yarns of equal handedness intersect at a critical offset of $\sqrt{2}λ/16$, with $λ$ the wavelength of the cubic lattice. No assignment of handedness avoids these intersections. Finally, we fabricate volumetric plain weaves by 3D printing and manual assembly from cotton cord. The framework provides a direct basis for generating weave geometries for simulation and fabrication.

comments
21 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.12091 ↗

In non-archimedean numerical analysis, a verified $p$-adic approximation can determine an absolute value, and hence downstream probabilistic rankings and classification decisions, with mathematical exactness long before the underlying number is fully resolved. We turn this observation into rigorous finite-precision certificates for norm-based readouts of amplitude families. For a common error radius, a nonempty resolved set already fixes every exact maximizer, ties included, at the sharp integer absolute precision $v_*+1$, and conditioning on that set yields an exact total-variation identity separating unresolved $p$-adic mass from real rounding error. For aggregates of $p$-adic exponentials, we give a centered-moment certificate with an explicit remainder bound: on rational data it runs in exact rational arithmetic without individual exponential evaluations, attains its minimal bound at an active phase, and resolves every nonzero aggregate at high order; we also obtain an aggregate perturbation bound free of summand-count factors. For multiclass $p$-adic classifiers that decode by minimizing the norm of a class discriminant, we prove a necessary and sufficient certification condition and show that the sharp common precision threshold is $v^{(2)}+1$, governed by the second-largest discriminant valuation, so the winning discriminant need not itself be resolved. We apply these certificates to discrete $p$-adic path-integral actions on uniform affine chains, deriving explicit action centers and proving exact output-independence at zero effective quadratic coupling. Pseudocode and a reproducible reference implementation accompany the theory.

comments
27 pages
fields
Mathematical Physics, Numerical Analysis, Number Theory
pdf ↗ page arXiv:2611.12254 ↗

We study the asymmetric simple exclusion process on the half-line with particle insertion and no particle removal at the boundary. We point out that there exist two distinct multiple contour integral formulas for the transition probability between two finite particle configurations containing the same number of particles. We recall one of these formulas from the literature and prove a second, new formula by showing that it satisfies the evolution equation using a coordinate Bethe ansatz calculation and verify that the initial condition is implemented by the contour integrals. As an application we sum this formula over all final configurations and obtain an integral formula for the probability that the number of particles is conserved up to a given time. The proofs use symmetric rational functions and their properties together with contour deformations.

comments
18 pages
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.12258 ↗

We introduce a Physics-Informed Neural Network approach for the data-driven reconstruction of the symmetries and conservation laws of Newtonian dynamical systems, based on the geometrization of the dynamics through the Eisenhart-Duval lift. Within the Eisenhart-Duval lift, the symmetry conditions reduce to the linear Killing or Conformal Killing equations of the extended metric. We combine a Hamiltonian neural network, which reconstructs the potential function from the data, with a random-feature neural network, which solves the symmetry conditions for the collineations of the extended geometry. From the learned vector fields we construct the Lie algebra and, through Noether's theorem, the corresponding conserved quantities, while the derivation of the curvature invariants for the extended geometry provide allow us to perform an independent consistency test. We apply the method to the one-dimensional Ermakov-Pinney equation and to the one-dimensional harmonic oscillator, with and without a quartic perturbation, by using different level of noise in the phase-space data. For the Ermakov-Pinney equation, the three Killing vectors of the flat extended plane, and the corresponding nonlocal conservation laws, are recovered for, while for the harmonic oscillator, the ten conformal Killing vectors which form the $so(3,2)$ Lie algebra are determined for noise levels up to $10\%$. When the quartic term is added, the broken symmetries are identified as approximate symmetries.

comments
21 pages, 14 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.12401 ↗

Using the new notion of a scalable (right) monoid-heap, the quantity calculus in [1] is generalized to include quantities that may not be possible to multiply as well as both (weak) rates and products of quantities. Several examples are given of applications in metrology and physics

comments
27 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.12428 ↗

Direct-product spacetimes offer a tractable route to exact solutions in gravity theories beyond general relativity. We study $n$-dimensional direct-product spacetimes of $(m_1+m_2)$, $(2+m)$, and $(2+\ldots+2)$ type in linear gravity, general pure quadratic-curvature gravity, and one of the recently proposed higher-dimensional extensions of conformal gravity, allowing the two-dimensional subspaces to have nonconstant curvature. We classify the resulting solution spaces and determine how the allowed geometries depend on the gravitational theory and, in quadratic gravity, on the curvature couplings. Metrics containing two-dimensional part(s) of nonconstant curvature are governed either by algebraic conditions on a curvature profile or, in one special class of quadratic gravity, by a differential equation. Relations governing metrics with only constant-curvature $m$-dimensional subspaces are purely algebraic. We further examine conformal relations to linear-gravity solutions, generalized Petrov types, and compatibility with electromagnetic sources. Particularly noteworthy is that standard static black-hole geometries are absent from the direct-product sector of the considered form of conformal gravity for $n>4$. Four- and six-dimensional cases are analyzed in detail, and explicit analytic solutions illustrating the resulting structure are presented whenever possible.

comments
28 pages, 11 tables, RevTeX4
fields
Mathematical Physics
pdf ↗ page arXiv:2611.12483 ↗

Which complex classical paths contribute to a real-time Feynman path integral? Picard-Lefschetz theory answers this question with the intersection numbers of the thimbles, which are notoriously hard to compute in infinite dimensions. We show that resurgence provides a practical alternative. We compute the asymptotic series of the real and complex classical paths to high order, with Feynman diagrams and with a transport recursion for the cumulants, and read off the adjacency of the classical paths from the divergent tails of the series with Borel-Padé methods. The South-East rule then turns adjacency into relevance. For a particle meeting a Rosen-Morse barrier, we identify the relevant complex classical paths in front of and behind the barrier, including the complex path that carries quantum tunnelling, follow ordinary and higher-order Stokes phenomena as the final point moves, and verify the predictions with the exact propagator. The resummed series reproduce the propagator with exponential accuracy. Finally, we outline how the expansion extends to relativistic path integrals governed by a Hamiltonian constraint.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.12510 ↗

We describe the projective orbits of complex spinors from the point of view of the momentum map. We treat the irreducible spin modules in odd dimensions 1,3,5,7,9,11 and the half-spin modules in even dimensions 2,4,6,8,10,12,14, which are the only cases with finitely many orbits. In the Clifford–Fock model, we construct representatives as sums of pure basis spinors, and the coefficients are chosen so that the representative is a critical point of the squared norm of the momentum map. The resulting momentum values in a fixed Weyl chamber distinguish the orbits. Completeness follows from Vinberg's theory of graded Lie algebras and stabilizer actions, independently of the classical spinor classifications. We recover the classical counts of 1,1,1,2,3,5 orbits in the odd cases and 1,1,1,2,2,4,9 in the even cases, and compute the projective dimension of every orbit. In dimension fourteen we also determine the closure order of the orbits, using the fact that the minimum of the squared momentum norm increases strictly under degeneration.

fields
Mathematical Physics, Representation Theory
pdf ↗ page arXiv:2611.12549 ↗

We introduce a class of two-dimensional tensor network states obtained by categorifying matrix product states. This procedure leads us to consider bond spaces provided by a 2-vector space associated with the 2-cells of the underlying lattice. Tensor network representations are then defined as module categories over the free monoidal category on a monoidal signature encoding the lattice geometry. We prove a fundamental theorem stating that two representations generating the same states with suitable open boundary conditions are equivalent as module categories. Finally, we introduce a notion of 2-injectivity, a categorified analogue of the injectivity condition for matrix product states.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.12658 ↗

We study eigenstate fluctuations of the particle number in the nearest-neighbour free-fermion model on the periodic cubic lattice $(\mathbb{Z}/L\mathbb{Z})^d$. For every fixed dimension, every particle number, every subvolume, and every normalized energy eigenstate, we prove a bound of order $NL^{d-1}$ for the particle-number variance. The corresponding eigenstate-thermalization estimate is of order $L^{d-1}/(Nη^2)$ for fluctuations of relative size $η$. In particular, at positive particle density the bound decays as the inverse linear size. The proof decomposes the centered particle-number operator according to one-particle energy transfer and treats the zero- and nonzero-transfer components separately. The nonzero-transfer part is controlled by a sharp resonance bound, proved from Mann's theorem on relations among roots of unity, while the zero-transfer part is estimated by a Hilbert-Schmidt argument. These bounds are optimal in every dimension: the maximal nonzero-gap multiplicity has order $L^{d-1}$, and suitable many-body eigenstates realize matching variance lower bounds and show that the concentration bound cannot be improved in estimates uniform in the tolerance parameter.

comments
29 pages LaTeX, no figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.12701 ↗

We study a dense $N$-soliton condensate for the infinite Toda lattice in the limit $N \to \infty$. In contrast to previous mathematical studies of soliton gases where the norming constants are assumed to be deterministic or infinitesimal, we consider initial scattering data where both the discrete eigenvalues and the norming constants are independent random variables. The norming constants $γ_j$ are allowed to be arbitrarily large under a mild moment condition $\mathbb{E}[γ_j^ν] < \infty$ ($ν> 1$). Our main result is divided into two parts. First, we develop a probabilistic Riemann–Hilbert framework to show that the system self-averages: despite large, independent fluctuations in the initial data, the random Toda lattice variables converge deterministically to an effective continuum model at a polynomial rate $\mathcal{O}(N^{-δ})$ for $0 < δ< 1/2$. Second, by performing the Deift–Zhou nonlinear steepest descent analysis of the continuum problem, we obtain the complete leading-order macroscopic description of the lattice across the entire space-time plane. The solution decomposes into five distinct finite-gap regimes, characterized explicitly by modulated elliptic and genus-2 waves with an error of order $\mathcal{O}(1/\ln N)$. In contrast to the straight characteristic rays typical of standard soliton gas limits, the interfaces separating these five macroscopic regimes in the space-time plane are genuinely non-linear curves; in particular, the boundary of the modulated genus-2 region is completely non-linear. Finally, under our assumptions, we establish the Nonlinear Dispersion Relations for the Toda soliton condensate and prove that the macroscopic ensemble averages are determined by the soliton gas density of states.

fields
Mathematical Physics, Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.12748 ↗

We propose a unified architecture for two-qubit gates in neutral-atom quantum processors which allows the implementation of the complete set of two-qubit gates. Our approach rests on a single resource that unlocks the entire gate set: an XXZ interaction with tunable anisotropy, combined only with single-qubit operations. We introduce a Rydberg-atom realization of the tunable XXZ interaction and combine it with optimally controlled global microwave pulses to implement the B, QFT, iSWAP, and $\sqrt{\mathrm{iSWAP}}$ gates, as well as a continuous gate family interpolating from CZ to iSWAP via the B gate. This work allows the implementation of any two-qubit gate natively in neutral-atom platforms, enabling flexible switching between instruction sets to reduce circuit depth and compilation overhead in quantum algorithm implementation.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.12779 ↗

We study the occupation probabilities $p_i=|u_i|^2$ of a normalized bulk eigenvector in the GUE Rosenzweig-Porter model $A_N=B_N+τ_NG_N$, with $τ_N^2=N^{1-γ}$ and $1<γ<2$. Conditioning on an eigenvalue at a regular bulk energy $E$ through the normalized one-eigenpair Kac-Rice law, we derive an exact finite-$N$ projective density and reduce its asymptotic analysis to a Hubbard-Stratonovich integral over $2\times2$ Hermitian matrices, which we evaluate by the saddle-point method. The resulting occupation field is governed by a self-consistent Lorentzian profile with effective resonant size $K_N(E)\asymp N^{2-γ}$ and local exponential fluctuations. We prove the asymptotics of all generalized inverse participation sums and identify a transition at $q=1/2$. We also obtain a two-branch thickened amplitude-counting spectrum. At the two ends of the occupation field we prove marked Poisson point-process limits: the largest components have Gumbel fluctuations, whereas the smallest component has an exponential limit on the scale $N^{-1-γ}$. Finally, for every fixed $q>0$ the largest component contributes an asymptotically vanishing fraction of the inverse participation sum, showing that these fixed-$q$ statistics do not freeze. The statements are quenched, uniformly on a high-probability regularity event for the diagonal disorder, and hence also hold in the annealed setting.

comments
37 pp
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.12858 ↗

Number Theory42

Stieltjes's conjecture on Legendre polynomials asserts that no two distinct Legendre polynomials can share a nonzero root. This question is, surprisingly, connected to a number of disparate mathematical areas. From the point of view of spectral geometry, this question concerns zero-sets of spherical harmonics. A disk counterpart to the conjecture is a famous theorem of Siegel on nonexistence of nonzero common roots of Bessel functions, proved using transcendence theory. A weak version of the conjecture is implied by the dynamical Mordell–Lang conjecture. We prove, using a $2$-adic analytic approach à la Skolem, that for a root $α\neq 0$ of $P_l$ the set $\{n\in \mathbb{N}:\ P_n(α)=0\}$ has cardinality at most $2l$. In particular, this set is finite.

comments
19 pages
fields
Number Theory, Spectral Theory
pdf ↗ page arXiv:2611.09312 ↗

We study a family of polynomials that are very closely related to the Swinnerton-Dyer polynomials. As main result, we determine a recursion relation for the coefficients of this family of polynomials. We briefly explain our own and others' interest in this family of polynomials.

fields
Number Theory
pdf ↗ page arXiv:2611.10034 ↗

In this paper, we study the map $Θ$ which sends each $x\in[0,1]$ to the number whose continued fraction digits are the first Pierce expansion digit of $x$ and the gaps between two consecutive Pierce expansion digits of $x$. We investigate the regularity of $Θ$ and $Θ^{-1}$, including the optimal Hölder exponent of $Θ^{-1}$, and the local and Hausdorff dimensions of the push-forwards of the Lebesgue measure under $Θ$ and $Θ^{-1}$. We also study the differentiability of $Θ$ at rational and irrational points, and calculate the Hausdorff dimension of the set of points at which $Θ$ has an infinite derivative.

comments
26 pages
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2611.10081 ↗

We construct an elliptic deformation $\mathcal{Q}_{a,b;q,p}(x)$ of positive rational numbers $x$ by attaching Schlosser's small elliptic weights $w_{a,b;q,p}(s,t)$ to prefixes of Stern–Brocot words. On positive integers $n$ it gives Schlosser's elliptic numbers $[n]_{a,b;q,p}$. Parameter shifts realize $x \mapsto x+1$ and $x \mapsto x/(x+1)$, while a reciprocal parameter transformation gives an inversion formula. The Gaussian degeneration recovers the $q$-deformed rationals of Morier-Genoud and Ovsienko. The regular and negative elliptic continued fractions agree, since they evaluate the same word with the same ordered weights. The numerator and denominator satisfy weighted Farey recursions and, for rationals greater than $1$, are the closure polynomials, or quiver $F$-polynomials, of the associated oriented type-$A$ quivers. Finally, we express the vertex weights as normalized elliptic Euler expressions of balanced virtual torus representations.

comments
21 pages, 2 figures
fields
Number Theory
pdf ↗ page arXiv:2611.10104 ↗

Forty years ago, Gross and Zagier proved a remarkable formula computing the central derivative of the Rankin–Selberg $L$-function of a cusp form $f$ of weight $2$ and a character of the class group of an imaginary quadratic field, satisfying the so-called Heegner condition, and deduce that the nonvanishing of the central derivative implies the nonvanishing of the corresponding Mordell–Weil rank. This formula was later generalized in various contexts and degrees, for example, by S. Zhang for $f$ of higher even weights; and by Yuan–Zhang–Zhang for $f$ a Hilbert cusp form of parallel weight $2$ over an arbitrary totally real field $F$ and $χ$ a Dirichlet character of an arbitrary CM extension $E/F$, allowing arbitrary ramification. In this article, we prove a Gross–Zagier type formula in the context of doubling method, for $f$ a Hilbert cusp form over $F$ and $χ$ a Hecke character of $E$ of general weights under a balancing condition, again allowing arbitrary ramification. Indeed, we even formulate a general conjecture which we call the motivic arithmetic inner product formula, for cohomological automorphic representations of $\mathrm{GL}_{2r}$ over $E$ of hermitian type of balanced weights.

comments
88 pages; comments are welcome!
fields
Number Theory, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.10478 ↗

We establish a general framework relating local vanishing densities of order $1$ to logarithmic growth of divisor moments on regular arithmetic curves. As applications, we recover classical divisor moment estimates for polynomial values and establish their function field analogue. Furthermore, under GRH, we obtain a result on divisor moments for polynomials in the Fourier coefficients of non-CM cuspidal eigenforms with trivial nebentypus and trivial inner twist. The Fourier coefficients need not be integers, and the polynomials need not be squarefree. Under additional analytic hypotheses, we also allow a Sato–Tate angle restriction.

comments
35 pages
fields
Number Theory
pdf ↗ page arXiv:2611.10489 ↗

We establish a generating trace formula for multicharacter ideal-type $L$-values associated with rank-one Drinfeld modules. For a sign-normalized Hayes module with free period lattice, the formula realizes the $L$-values at weights $n\equiv s\pmod{q^{°_\infty}-1}$ as a trace over the ordinary Hilbert class field. We further characterize the polynomials in the exponential variable $X$ arising in multicharacter lattice generating identities over arbitrary function rings. Their coefficients are given explicitly via the shtuka basis, which gives concrete control over their supports and degrees. This completely settles an open problem of Pellarin and Perkins: these polynomials are all constant if and only if $s<2q$. The results on coefficients apply to curves of arbitrary genus, infinite places of arbitrary degree, and nonprincipal period lattices.

comments
32 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.10495 ↗

Let $g(n)=(-1)^{ω(n)}$, where $ω(n)$ denotes the number of distinct prime factors of $n$. We prove that, for every sufficiently large integer $N$, each ordered additive sign pattern $(g(a),g(N-a))=(s,t)$ occurs at least $N/(128(\log N)^3)$ times. We also prove that, for every $N\ge18$ and every $s,t\in\sgnset$, there is at least one integer $1\le a<N$ such that $(g(a),g(N-a))=(s,t)$. In addition, we establish a one-quarter asymptotic formula for almost all target integers. Finally, we discuss Goldbach-type problems for the ordinary Möbius function and formulate related questions.

comments
36 pages
fields
Number Theory
pdf ↗ page arXiv:2611.10499 ↗

Combining the frameworks of Chamizo–Iwaniec and Chamizo–Ubis with the recent character-sum and exponential-sum estimates of Bellotti and Kerr, we improve the error term in Gauss's mean value formulas for class numbers of binary quadratic forms from $O(N^{21/32+\eps})$ to $O(N^{55/84+\eps})$. If no Dirichlet $L$-function vanishes in $\mathrm{Re}\,s>7/8$, the exponent becomes $2274811/3487744$; under the Generalized Riemann Hypothesis for quadratic Dirichlet $L$-functions, it becomes $118/181$.

fields
Number Theory
pdf ↗ page arXiv:2611.10606 ↗

The modular method is a powerful tool to study generalized Fermat equations. Trivial solutions often become an obstruction to the method. While using hypergeometric motives to construct Galois representations, some of these solutions give rise to newforms with complex multiplication. In the present article, assuming a standard conjecture in Darmon's program, we prove that asymptotically any newform with complex multiplication cannot be related to a non-trivial primitive solution. This allows to discard all such newforms, including those associated to trivial solutions.

comments
12 pages, 5 figures and 2 tables
fields
Number Theory
pdf ↗ page arXiv:2611.10667 ↗

Assume the generalized Lindelöf hypothesis. Let $u$ be an even Hecke–Maass cusp form on $\mathrm{SL}_2(\mathbb{Z})\backslash\mathbb{H}$, normalized in $L^2$ with respect to hyperbolic area, with Laplace eigenvalue $1/4+T^2$. For every fixed $ψ\in C_c((0,\infty);\mathbb{C})$ and every $\varepsilon>0$, we prove that \[ \int_0^\infty ψ(y)|u(i y)|^2\frac{d y}{y} =\frac{6}π\int_0^\infty ψ(y)\frac{d y}{y} +O_{ψ,\varepsilon}(T^{-1/4+\varepsilon}) \] as $T\to\infty$, uniformly in $u$. In particular, the restriction mass equidistributes on every fixed compact segment of the imaginary axis in $\mathbb{H}$.

comments
Comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.10676 ↗

We aim to study whether the Weil form can detect a zero of the Riemann zeta function away from the critical line using two functions with increasingly narrow, widely separated supports. We prove that the Riemann hypothesis is equivalent to the Cauchy-Schwarz inequality on every such pair at all sufficiently large separations, provided the component widths decrease subexponentially. A zero to the right of the critical line forces the normalized cross term to exceed an exponential at arbitrarily large separations, with any exponent smaller than the horizontal displacement of that zero. In particular, reciprocal-width intervals suffice. Our proof combines a short-support positivity estimate, a smooth partition of fixed test functions and a pole obstruction for a one-sided Laplace transform. We also express the cross term through prime powers in a moving multiplicative interval. The resulting criterion specifies a uniform arithmetic inequality whose proof would establish the Riemann hypothesis.

fields
Number Theory
pdf ↗ page arXiv:2611.10726 ↗

Let $λ$ denote the Liouville function, and put \[ I_λ(X)=\int_0^1\left|\sum_{n\le X}λ(n)e^{2πi nα}\right|\,dα. \] In this paper, we prove that \[ \limsup_{X \to \infty} \frac{\log I_λ(X)}{\log X} \ge \frac{1}{3}. \]

comments
8 pages
fields
Number Theory, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.10790 ↗

Let $N_{\mathrm{odd}}(X)$ and $N_{\mathrm{even}}(X)$ denote the numbers of integers $0\leq n< X$ for which the ordinary partition function $p(n)$ is odd and even, respectively. The Parkin–Shanks conjecture predicts that $N_{\mathrm{odd}}(X)$ and $N_{\mathrm{even}}(X)$ are both asymptotic to $X/2$. Bellaïche and Nicolas proved that $N_{\mathrm{even}}(X)\gg \sqrt{X} \log \log X$, while Zheng, building on work of Ono and Swaminathan, recently proved that $N_{\mathrm{odd}}(X)\gg \sqrt{X}$. We improve both bounds simultaneously by proving $\min\{N_{\mathrm{odd}}(X), N_{\mathrm{even}}(X)\}\gg X^{3/4}/(\log X \log \log X)$.

comments
15 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.10899 ↗

For every global field and every fixed degree, we prove that the structure constants defining nonsplit central simple algebras form a diophantine set. We formulate a local witness principle separating reliable localization, exact localization, and local detection. Adapted Kummer and Artin–Schreier presentations provide a common construction of witnesses through a uniform radical formula and ramification matching. This gives an independent proof of the non-characteristic case, which also follows from Morrison's nonnorm theorem, and treats the characteristic-degree case by the same method. We recover prime-degree nonnorm definability and give applications to rootless polynomials, anisotropic quadratic forms in all characteristics, and generalized Severi–Brauer varieties.

fields
Number Theory
pdf ↗ page arXiv:2611.10924 ↗

We study completed local shallow Hecke algebras acting on residual automorphic forms attached to projective augmented modules for $\GL_2(\Q_p)$. For odd primes $p$, we prove that the maximal ideal has nilpotence exponent $O(p^{r/2})$ on the level-$r$ generalized eigenspace. For $p\ge5$, if the corresponding Hecke eigenspace in the residual smooth dual has finite length as a $\GL_2(\Q_p)$-representation, then the completed local algebra is noetherian of Krull dimension at least two. If, in addition, its cotangent space has dimension at most two, then it is a formal power series ring in two variables. The nilpotence bound follows by conjugating level subgroups. To deduce the dimension bound, we replace the Fourier pairing in the classical nilpotence method with an inequality comparing the dimension of each finite-level generalized eigenspace with that of its Hecke eigenspace. We apply these results to modular curves and definite quaternion algebras.

fields
Number Theory
pdf ↗ page arXiv:2611.11142 ↗

The Rankin constant $γ_{n,k}$ measures the largest discriminant of a densest rank $k$ sublattice of a lattice in $\R^n$ over all such lattices of rank $n$ and their exact values are mostly open. For a general lattice $L\subset \R^n$ of rank $n$, the problem of determining its Rankin invariant $γ_{n,k}(L)$ is to find the discriminant of such a densest sublattice. There are no general formulas to compute the discriminant of any arbitrary rank $k$ sublattice. This paper specializes to the case of ideal lattices arising from ideals of number fields, and provides two approaches to study Rankin constants: first, we propose a systematic approach to approximate the minimum discriminant by introducing subideal lattices and proving a closed-form formula to compute $γ^{ideal}_{n,k}(L)$, the ideal Rankin invariant of the ideal lattice. Subsequently, we establish necessary conditions on the underlying number field for the existence of an ideal lattice admitting an optimal subideal lattice with a prescribed minimum discriminant. Secondly, we consider ideal lattices with arbitrary sublattices. We compute $γ_{9,2}$ and improve the current known bounds of the Rankin constants $γ_{5,2}$, $γ_{7,2}$ and $γ_{9,3},γ_{9,4}$, and provide an algebraic construction of the lattice that was used in dimensions $5$ and $7$.

fields
Number Theory
pdf ↗ page arXiv:2611.11190 ↗

With recent interests on the statistics of commuting integer matrices, we study the related problem on the statistics of the set of centralizer of a matrix. We provide asymptotics and bounds on the size of such set when restricted to integer matrices of bounded height.

comments
8 pages
fields
Number Theory, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2611.11287 ↗

For every prime power $q>2$, integer $n\ge2$ and $1\le r\le 2n-1$, we construct an $\mathbb F_{q^{2n}}$-maximal curve $T_{q,n,r}$ with Kummer equation \[ z^{q^n+1}=η^{-R}y(1-y^{q-1})^R, \qquad \frac{q^r-1}{q-1},\] where $η\in\mathbb F_{q^{2n}}^*$ satisfies $η^{q^n}=-η$. For fixed $q,n$, these are cyclic covers of the projective line over a single field, indexed by the integer $r$. Writing $δ=\gcd(q^n+1,R)$, we prove that the genus is $(q-1)(q^n+1-δ)/2$ and that $T_{q,n,r}$ is covered by the Hermitian curve $\mathcal H_{q^n}$ over an algebraic closure if and only if $\min(r,2n-r)$ divides $n$. For $1<r<n$ and $δ=1$, the full automorphism group is cyclic of order $(q-1)(q^n+1)$, and distinct values of $r$ give curves that are nonisomorphic over an algebraic closure despite having the same genus and full automorphism group. We also give explicit equations and genera for all their Galois subfields. When $n\ge 4$ is a power of two, this produces families over a fixed field whose members are not covered by $\mathcal H_{q^n}$.

comments
21 pages, comments are welcome; will be revised further
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.11298 ↗

In this paper, we obtain an effective bounds for the ideal membership certificate in polynomial rings over almost all rings of S-integers, thereby generalizing results of Aschenbrenner and Evertse and Gyory. We also establish an effective refinement of a result of Xiao, building on earlier work of Levin and Corvaja and Zannier. In particular, we provide explicit bounds for both the number and the total degrees of the exceptional hypersurfaces arising in an inequality that bounds the greatest common divisor of multivariable polynomials evaluated at almost S-units under consideration. As an application of our results, we obtain an effective refinement of a theorem of Corvaja and Zannier: Let $(F_n)_n$ and $(G_n)_n$ be two linear recurrence sequences and $\mathcal{N}$ be the set of positive integers $n$ such that $F_n/G_n$ is an integer. Hadamard quotient theorem, conjectured by Pisot and proven by Van der Poorten states that if the set $\mathcal{N}$ coincides with $\mathbb{N}$ then $\left(F_n/G_n\right)_n$ is itself linear recurrence sequence. Corvaja-Zannier proved that if $\mathcal{N}$ is infinite set, then there exists a nonzero polynomial $P(X)$ such that $\left( P(n)F_n/G_n\right)_n$ agrees with a linear recurrence sequence for all $n$ in a suitable arithmetic progression. We give an explicit bound $C$, depending explicitly on the parameters of the recurrence sequences such that, the conclusion holds if $\mathcal{N}$ contains at least $C$ elements.

comments
64 pages
fields
Number Theory
pdf ↗ page arXiv:2611.11341 ↗

We study smooth approximations to Dirichlet character sums and zeta sums. The uniform upper-bound consequence of the Granville–Soundararajan conjecture, when imposed on all nonprincipal characters including imprimitive ones, implies the Riemann hypothesis for every primitive nonprincipal Dirichlet \(L\)-function. The proof uses characters induced to moduli divisible by all small primes. In the other direction, assuming the Riemann hypothesis for \(L(s,χ)\), we establish the conjectured approximation uniformly for \(q^a\le x\le q\), where \(0<a\le1\) is fixed, with \(y=(\log q+(\log x)^2)(\log\log q)^C\) for every fixed \(C>6\). In this range both the character sum and its smooth restriction, and hence their difference, are exponentially small relative to the number of \(y\)-smooth integers coprime to \(q\). We establish the corresponding approximation for \(\sum_{n\le x}n^{-it}\) under the Riemann hypothesis for the zeta function, uniformly for \(T^a\le x\le T\) and \(2T\le t\le5T\). We also show that the full zeta-sum smooth-approximation conjecture implies the Lindelöf hypothesis.

comments
12 pages
fields
Number Theory
pdf ↗ page arXiv:2611.11389 ↗

We tackle Shapiro's conjecture for exponential polynomials where the coefficients are polynomials, and show that it follows from Schanuel's conjecture. More concretely, given exponential polynomials $f$ and $g$ with infinitely many common zeros, we show that Schanuel's conjecture implies that there is an exponential polynomial $h$ vanishing precisely at all the common zeros of $f$ and $g$.

comments
31 pages, 3 appendices
fields
Number Theory, Logic
pdf ↗ page arXiv:2611.11404 ↗

We prove uniform asymptotics for the 2-Selmer cardinality in the congruent number family $y^2=x^3-D^2x$ with twisting parameter $D$ restricted to long arithmetic progressions.

fields
Number Theory
pdf ↗ page arXiv:2611.11413 ↗

For $k \geq 1$ let $f_k = \sum_{Ω(n)=k} 1/(n\log n)$, where $Ω$ counts prime factors with multiplicity, and let $g_k$ be the same sum restricted to odd $n$. Lichtman showed that $f_k \to 1$, with a global minimum at $k=6$, and Gorodetsky, Lichtman and Wong that $f_k = 1 - 2^{-k}(a_1 k^2 + O(k \log(k+1)))$. We prove that $f_k < f_{k+1}$ for every $k \geq 6$, and that $g_k > g_{k+1}$ for every $k \geq 1$. The two statements come from one analytic distinction. Writing $\sum_k P_k(s) z^k = ζ(s)^z H(s,z)$, at $s=1$ the point $z=2$ lies on the first singular circle of $H$, and strictly inside the first singular circle of the product with the prime $2$ removed. We show that this distinction decides the direction in general. If the complement of a set of primes $\mathcal{P}$ is thin and its least element is at least $3$, the corresponding sums eventually decrease, so the second theorem is one case of a general phenomenon. The inequalities used at the last step of the first theorem are certified by interval arithmetic.

code
github.com/jaideepsaipadhi/erdos-sums-almost-primes ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 1865453, checked 2026-11-10 build details
comments
28 pages. Interval-arithmetic certificates and verification scripts at https://github.com/jaideepsaipadhi/erdos-sums-almost-primes
fields
Number Theory
pdf ↗ page arXiv:2611.11418 ↗

For random integer polynomials $P$ of arbitrary degree we prove that for $100\%$ of elliptic surfaces $y^2=x^3-P(t)^2x$ the average 2-Selmer rank of the fibers is 3. Consequently, for $100\%$ these random elliptic surfaces we establish a lower bound for the proportion of fibers attaining algebraic rank $0$ and $1$.

fields
Number Theory
pdf ↗ page arXiv:2611.11432 ↗

Let $E/\mathbb{Q}$ be an elliptic curve with abelian two-division field. We prove that finiteness of ${\mathrm Sel}_{2^\infty}(E/\mathbb{Q})$ implies $L(E,1)\ne0$. The proof follows the quadratic twist deformation approach of OpenAI: Beilinson–Kato elements are interpolated over the cyclotomic $\mathbb{Z}_2$-extension and over families of quadratic twists, and congruences in the resulting group ring transfer non-vanishing from the twists to $E$. The integral control of this interpolation is governed by one cohomological $μ$-invariant, which depends only on $E[2]$ and vanishes for abelian two-division fields. Together with Kato's cyclotomic divisibility and the fixed lattice in his construction, it bounds the denominator by a fixed power of $2$, independently of the twisting primes and the family dimension. Congruences among coefficients of a half-integral-weight form, in the style of Ono–Skinner, construct the required twist families.

fields
Number Theory
pdf ↗ page arXiv:2611.11566 ↗

A natural number $n$ has the $Δ$ property if some difference of complementary divisors of $n$ is the sum of two such differences; equivalently, if some split graph has a factor graph containing an $n$-simple triangle. In additive terms, $n$ has the $Δ$ property exactly when the positive part of the factor-difference set of $n$, introduced by Erdős and Rosenfeld, is not sum-free. The set $\mathbb{N}(Δ)$ of such numbers is closed under multiplication by squares, and it was conjectured that it contains infinitely many $Δ$-primitive perfect squares. We prove this conjecture, and show that these squares can be chosen to avoid any prescribed finite set of primes but $3$.

fields
Number Theory
pdf ↗ page arXiv:2611.11574 ↗

We prove the étale-de Rham direction of the $C_{\st}$-conjecture for compactly supported cohomology of smooth partially proper rigid analytic varieties over local fields of mixed characteristic. More precisely, we recover filtered de Rham cohomology and (under a finite-rank assumption) Hyodo–Kato cohomology from compactly supported $p$-adic pro-étale cohomology as derived Hom (in a category of Arithmetic Topological Vector Spaces) with values in $\B_{\pdr}$ and $\B_{\pFF}$ respectively (period rings related to $\B_{\dr}$ and $\B_{\st}$ whose higher Galois cohomology vanishes). The proof uses, via the geometrized basic comparison theorem, Poincaré duality for Hyodo–Kato and (filtered) de Rham cohomology, explicit extension calculations for period sheaves, and fully-faithfulness of the passage from Galois equivariant perfect complexes on the Fargues–Fontaine curve to Arithmetic Topological Vector Spaces.

comments
Comments welcome !
fields
Number Theory
pdf ↗ page arXiv:2611.11589 ↗

We obtain a number of new results on the arithmetic of linear algebraic groups over higher-dimensional fields. In particular, we resolve some key open questions over 2-dimensional global fields, such as the finiteness of the genus of spinor groups of quadratic forms of dimension $\geq 10$. We also extend various finiteness results to new classes of fields, including function fields of $p$-adic surfaces. Our arguments rely in a crucial way on new finiteness results for unramified cohomology.

fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.11631 ↗

We present new information-theoretic protocols for $s$-server, doubly-efficient private information retrieval (PIR) in sublinear server time and one extra bit of space on the servers, for every constant $s \geq 2$. On an $n$-bit database, each of the $s$ PIR servers first builds and stores a preprocessing data structure consisting of $n+1$ bits (which is unique to each server, and after which the server may discard the original database). Then, each server answers a PIR query in time $T_s(n)$, by reading at most $T_s$ bits of its data structure and sending them to the user. In the two server setting ($s=2$), our PIR protocols achieve $T_2 = n^{0.82}$, matching the server time of the state-of-the-art schemes of Henzinger and Ragavan (EUROCRYPT 2026) while shrinking their storage from $O(n\sqrt{\log n})$ to $n+1$ bits. With $s \geq 3$ servers, our PIR protocols retain the $n+1$ bits of storage and additionally improve on the server time of all prior information-theoretic $s$-server schemes with $n^{1+o(1)}$ storage: for example, achieving $T_3 = n^{0.74}$ and $T_{10} = n^{0.61}$ (previously $n^{0.79}$ and $n^{0.75}$). Asymptotically, as the server count $s$ grows, we shrink the number of servers required to achieve a given server-work exponent from $s^{3.9}$ to $s$. Our results draw inspiration from matching-vector techniques (Efremenko, STOC 2009), which we generalize to handle degree-two computations in the exponent. Using this generalization, we build doubly-efficient PIR from the new intermediate abstraction of Fourier-sparse cone-delta functions. Then, we construct such Fourier-sparse cone-delta functions via a connection to modular forms and complex analysis: if a Fourier-sparse cone-delta function does not exist, then there exists a modular form which has too many roots, contradicting the valence formula.

fields
Number Theory
pdf ↗ page arXiv:2611.11859 ↗

We give a direct analytic evaluation of the Euler sharp sums $ζ^\sharp(2,\{1\}^{d-3},\overline{2})$ for all even integers $d\ge4$, expressing them in terms of ordinary multiple zeta values of depth at most two. The proof reduces these sharp sums to a harmonic-number series and evaluates it using a generating-function identity, thereby proving the even-depth case of a conjecture of Xu and Zhao.

comments
8 pages
fields
Number Theory
pdf ↗ page arXiv:2611.11972 ↗

Let $χ$ be a quadratic Dirichlet character and let $Λ(χ, s)$ be its associated completed $L$-function. The super-positivity property, introduced by Yun–Zhang (2017), asserts that $Λ^{(m)} \left( \frac{1}{2}, χ\right) \geq 0$ for all $m \geq 0$. We show that a certain positivity property of its Dirichlet theta function $θ(t, χ)$, namely that $θ(t, χ)>0$ for all $t \geq 1$, implies the super-positivity property for $χ$. We then investigate a refined form of the above property: we conjecture that the sequence $\{ Λ^{(2m)}\left(\frac{1}{2}, χ\right )\}_{ m \geq 0}$ is always eventually increasing and has at most one turning point, and we prove these assertions again when $θ(t, χ)>0$ for $t \geq 1$.

fields
Number Theory
pdf ↗ page arXiv:2611.12152 ↗

We prove that the algebra generated by the values of Mahler M-functions at algebraic points admits a decomposition as the tensor product, over Q, of a countable family of linearly disjoint algebras. Consequently, the study of linear and algebraic relations among such values reduces to the corresponding problem within each of these smaller algebras. Our proof relies on recent advances of the authors on Mahler's method in several variables. As an application, we obtain a complete description of the algebraic relations among the values of the Fredholm series and their derivatives at nonzero algebraic points. This fully resolves an old problem originating in Mahler's work.

fields
Number Theory
pdf ↗ page arXiv:2611.12396 ↗

The nontrivial zeros of the Riemann zeta function lie at the heart of analytic number theory. Through the explicit formulas, they govern the distribution of prime numbers: the closer all nontrivial zeros lie to the critical line $\Re(s)=\frac12$, the more uniformly the primes are distributed. The Riemann Hypothesis-asserting that all nontrivial zeros satisfy $\Re(s)=\frac12$-is equivalent to the optimal error bound $O(\sqrt{x}\log x)$ in the Prime Number Theorem. Beyond number theory, the zeros of $ζ(s)$ and its derivative $ζ'(s)$ are deeply intertwined: the horizontal distribution of $ζ'$-zeros near the critical line encodes information about the spacing of consecutive $ζ$-zeros. This paper establishes some results concerning the nontrivial zeros of the Riemann zeta function.

comments
26
fields
Number Theory
pdf ↗ page arXiv:2611.12438 ↗

We prove Motohashi's conjecture on primes of the form $u^2+v^2+1$, with Iwaniec's corrected constant. Let $b$ denote the characteristic function of the positive integers representable as a sum of two squares. Then, as $x\to\infty$, \[ \sum_{p\le x}b(p-1) =κ\Spr\frac{x}{(\log x)^{3/2}} +O\!\left(\frac{x}{(\log x)^{3/2}\sqrt{\log\log x}}\right), \] where $κ$ is the Landau–Ramanujan constant and $\Spr=\prod_{p\equiv3\,({\rm mod}\,4)}\bigl(1-1/(p(p-1))\bigr)$. The proof combines auxiliary prime factors with a mean square estimate for bilinear sums. We obtain the minor arc bound through harmonic switching and high moments, replacing arithmetic divisibility conditions by independent projective lines. We remove the auxiliary weights using Selberg's sieve.

comments
44 pages
fields
Number Theory
pdf ↗ page arXiv:2611.12467 ↗

We prove weighted cancellation under small-value conditions on Hecke eigenvalues of finitely many non-CM holomorphic newforms. We also obtain many squarefree integers of each sign with fixed normalized amplitude, simultaneously small Hecke eigenvalues, and a fixed bound on the number of prime factors, uniformly in growing reduced residue classes. Our questions are motivated by Xi's noncorrelation conjectures and the mixed-moment estimates of Jiang and Lau. Their estimates imply that small Hecke eigenvalues can occur together with non-small Kloosterman values. Our result retains this property with a fixed prime-factor bound, both signs, and the residue conditions. Using OpenAI's zero-free half-plane theorem for Dirichlet $L$-functions, we give an example with at most $83$ prime factors, normalized amplitude at least $10^{-21}$, and moduli $M\le C^{11/200}$.

comments
52 pages
fields
Number Theory
pdf ↗ page arXiv:2611.12500 ↗

We classify the genera of primitive positive definite ternary quadratic forms in the extremal cases of Lehman's level and discriminant conditions. The genera are parametrized by their level, discriminant, and genus conductor, which also distinguishes local forms having the same isotropy. Using the correspondence with quaternion orders of level $(N_1,N_2)$, we express their weighted representation numbers and class numbers in terms of generalized modified Hurwitz class numbers. The formulas allow arbitrary admissible prime power exponents and include the additional genera obtained by Watson's transformation. As an application, we determine all $255$ one-class genera in these families and give an explicit representation formula for each. Of these formulas, $110$ concern nonsquarefree $N_1N_2$.

fields
Number Theory
pdf ↗ page arXiv:2611.12528 ↗

We study linear and algebraic independence of Hasse–Weil $L$-functions of abelian varieties over $\mathbb{Q}$, with Dirichlet series as coefficients. For nonzero varieties that are pairwise non-isogenous over $\overline{\mathbb{Q}}$, we prove that their $L$-functions with arbitrary Dirichlet twists, together with all their derivatives and $1$, are linearly independent when the coefficient series use only primes from a set of natural density zero. For untwisted $L$-functions, this independence is equivalent to the condition that the varieties are pairwise non-isogenous over $\mathbb{Q}$. If the individual monodromy groups are connected, the result for varieties that are pairwise non-isogenous over $\overline{\mathbb{Q}}$ extends to larger coefficient rings: the prime supports of coefficients are unrestricted outside a prescribed set of positive upper natural density and meet it in a set of natural density zero. We also characterize algebraic independence of untwisted $L$-functions in terms of the multiplicities of the simple isogeny factors of the varieties. The proofs combine an arithmetic-function lemma of Kaczorowski–Molteni–Perelli with Frobenius density arguments and require no analytic continuation or automorphy.

comments
23 pages
fields
Number Theory
pdf ↗ page arXiv:2611.12541 ↗

In this paper, we propose a comparison of relative trace formulas to study the Gan–Gross–Prasad conjecture. We unfold the relative trace formulas, match their regular orbits, and formulate the corresponding fundamental lemma and smooth transfer conjecture. Finally, we prove the fundamental lemma for the unit element of the Hecke algebra.

fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2611.12724 ↗

For every fixed integer $k\geq2$ and every fixed nonzero integer $h$, we prove that, as $x\to\infty$, \begin{equation*} \sum_{x<n\leq2x}Λ(n)τ_k(n+h) \sim C_{k,h}x(\log x)^{k-1}, \end{equation*} where $τ_k$ is the $k$-fold divisor function and $C_{k,h}>0$ is a constant depending only on $k$ and $h$.

fields
Number Theory
pdf ↗ page arXiv:2611.12756 ↗

For finite sets in a commutative semigroup, Gyarmati, Matolcsi and Ruzsa proved \[ |A_1+\dots+A_n|^{n-1}\ \le\ \prod_{i=1}^n|A_1+\dots+A_{i-1}+A_{i+1}+\dots+A_n| . \] They asked whether in an arbitrary group \[ |A_1\cdots A_n|^{n-1}\ \le\ \prod_{i=1}^n\ \max_{a\in A_i}\,|A_1\cdots A_{i-1}\,a\,A_{i+1}\cdots A_n| , \] where each omitted set is replaced by the largest slice obtained by fixing one of its elements. Nair, Namayandeh and Zhu proved that this inequality does not hold when $n=4$ and $G=D_4^{14}$, of group order $8^{14}$. We develop its double-coset mechanism and construct counterexamples in many other groups. For $n=4$, the smallest group found has order $518\,400$, namely $A_6^2\times C_2^2$; no absolute minimality is claimed. For $n=6$ there is a witness in a group of order $1728$, for $n=10$ a class-three $3$-group of order $243$ suffices, and for $n=4$ a single class-two $2$-group of order $2^{23}$ works. We also obtain torsion-free examples. The violation ratio $R_n=|A_1\cdots A_n|^{n-1}/\prod_iN_i$ is greater than one exactly when the inequality fails; explicit four-set constructions attain $R_4\approx1.29$ in $A_8^2$, and a larger ratio of about $1.43$ is reported for $A_{10}^2$. For every $n\ge4$, the inequality holds in all direct powers of $G$ precisely when $G$ is abelian. For $n\ge2$ the optimal exponent $θ_n$ is the infimum of $\log(\prod_iN_i)/\log|A_1\cdots A_n|$ over products of size at least two. We obtain $2\leθ_n\le n-1.0768$, and an infinite family in $C_3*C_3$ shows $θ_n\le n-1-δ$ for every $δ<5-2\log_25\approx0.3561$ and all sufficiently large $n$.

fields
Number Theory
pdf ↗ page arXiv:2611.12776 ↗

We classify modular Nahm sums with a rational symmetric positive-definite two-by-two matrix and rational shifts. Up to coordinate exchange, every modular datum belongs to three explicit rational-point families, is a product of two modular rank-one sums, or is one of thirty-four exceptional triples on twelve matrices. The list consists of Zagier's rank-two examples, the Vlasenko–Zwegers additions and split products; no further data occur. The proof first bounds the joint degree of the distinguished Nahm point by four, using an initial degree bound of twenty-four and exact local exclusions at the prime 7. Explicit height and exponent bounds then give exhaustive arithmetic classifications in degrees one through four. Exact polynomial elimination determines all rational shifts, and published identities of q-series establish modularity of the survivors. The degree bound is sharp. The finite steps are accompanied by exact certificates, verification programs and independently implemented checks. Computational companion: https://github.com/johnngy44/math/releases

comments
249 pages. Computational companion archived at doi:10.5281/zenodo.24062300
fields
Number Theory
pdf ↗ page arXiv:2611.12868 ↗

Probability39

The satisfiability conjecture was one of the most important open problems in discrete probability. It was resolved recently first by Carenini~\cite{GCarenini}, and shortly after by OpenAI~\cite{k-sat-OpenAI}, among other 370 problems solved by its internal model. The conjecture concerned the satisfiability property of random instances of the k-SAT problem. It posits the existence of a fixed value for the clause-to-variables ratio around which the probability that the formula is satisfiable drops sharply from nearly one to nearly zero as the ratio increases. While the case of large constant $k$ was resolved a decade ago by Ding, Sly and Sun~\cite{ding2015proof,ding2022proof} using the heavy machinery of the second moment method, the case of general $k$ eluded proof until ~\cite{GCarenini} and~\cite{k-sat-OpenAI}. In this short note we provide a ''human-friendly'' and detailed exposition of the OpenAI's resolution of the conjecture.

fields
Probability
pdf ↗ page arXiv:2611.10139 ↗

We provide a geometric construction of the radial Dunkl and Heckman-Opdam processes for arbitrary root systems and arbitrary nonnegative real root multiplicity parameters. This is a broad class of processes including the classical Bessel process, Dyson Brownian motion, and the Dyson Bessel process. We find that, when $x_t$ is a certain anisotropic Markov diffusion process in a symmetric space $G/K$ or its tangent space at the origin, invariant under an appropriate $K$-action, the evolution in the space of orbits can be described as a radial Dunkl or Heckman-Opdam process (respective to whether the diffusion is on the tangent space or $G/K$ itself). These processes can have arbitrary nonnegative real root multiplicities, analogous to arbitrary values of $β$ in Dyson Brownian motion. In a freezing limit, analogous to $β\to \infty$ for Dyson Brownian motion, these processes become motion by mean curvature of the orbits. A connection to finite free probability is also discussed, in which we provide a geometric interpretation of certain properties related to finite free position.

fields
Probability
pdf ↗ page arXiv:2611.10190 ↗

We consider a critical monotype Bellman-Harris branching particle system on $E=R^d$ or $E=[0,\infty)^d$, started from a homogeneous Poisson field with Lebesgue intensity. Particles follow a conservative Hunt process with transition semigroup $(P_t)_{t\ge 0}$, have independent lifetimes with distribution $Γ$, and reproduce at death with generating function $f(s)=s+c(1-s)^{1+β}$. We assume Lebesgue invariance and uniform bounds $P_t1_K=O(t^{-q})$ for compact $K$. We also impose a localization condition: the expected number of particles in a fixed compact set at time $t$ descended from ancestors initially outside suitable regions of volume $O(t^q)$ can be made arbitrarily small, uniformly for $t\ge 1$. For spread-out lifetimes of finite mean, the system converges to a nontrivial limit of Lebesgue intensity when $qβ>1$ and becomes locally extinct when $qβ\le 1$. For nonarithmetic lifetimes satisfying $\barΓ(t)\sim c_1t^{-γ}$, $0<γ\le 1$, the threshold is $qβ=γ$: the limit is Poisson above it, local extinction holds below it, and a nontrivial subsequential limit exists at equality. We verify the hypotheses and determine recurrence-transience regimes for symmetric and anisotropic stable processes, symmetric uniformly elliptic diffusions, generalized squared-Bessel products on $[0,\infty)^d$, and symmetric bilateral Bessel-type diffusions on $R^d$ and their nonsingular linear images. Finally, we derive quantitative sufficient conditions for survival of total mass in semilinear equations with absorption, including time-dependent diffusion rates. Here survival means that the limiting total mass is strictly positive. For a hyperbolic diffusion, this holds for every $β>0$ in the absorption term $-v^{1+β}$.

comments
58 pages
fields
Probability
pdf ↗ page arXiv:2611.10339 ↗

In this paper, based on the concept of step-weighted distribution, we introduce a minimum-deformation approach to constructing comonotonic and moment-matching approximations for sums of lognormal random variables. The proposed approach aims to minimize the Pearson deformation of a starting comonotonic approximation subject to moment-matching constraints. We establish several results concerning the existence and uniqueness of minimum-deformation comonotonic approximations and propose a method for determining the step quantiles and weights. In particular, when the number of steps is one greater than the moment-matching order, we show that the joint optimization problem can be reduced to an optimization problem involving only the partition points. The proposed framework accommodates moment matching of any prescribed finite order, and numerical experiments demonstrate its application to approximations matching the first five moments of the original sum. The numerical results also show that minimizing the Pearson deformation does not necessarily improve the approximation accuracy of risk measures, which depends on both the starting comonotonic approximation and the choice of partition points and correction weights.

fields
Probability
pdf ↗ page arXiv:2611.10531 ↗

We characterize relaxed dynamics for which any finite family of strong state solutions, together with their relaxed inputs, can be approximated by the prescribed controlled dynamics, ground-stably in law. Relaxed inputs include parametrizations of relaxed controls over the unit interval. Unlike relaxed controls, these parametrizations determine action couplings. The proposed relaxed dynamics is driven by a single cylindrical Brownian motion in a Hilbert space. For each relaxed input, its state is the unique strong solution of the corresponding equation. The collection of these states, over all relaxed inputs, satisfies the approximation requirement. Conversely, suppose one assigns to each relaxed input a continuous adapted state process on a fixed probability space. Pairwise approximation forces the assignment to be the strong solution map of the same dynamics, for a unique cylindrical Brownian driver. In fact, even for a state map indexed by (non-parametrized) relaxed controls, the relevant relaxed control class admits coherent parametrizations under separability and finite-family approximation assumptions, and the same type of dynamics is recovered again.

comments
38 pages, submitted to the Annals of Probability
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2611.10590 ↗

In this paper, we discuss the relationship between spectral gaps of Ornstein–Uhlenbeck/$L^2$ operators on Gaussian path space and the underlying Volterra kernel $F$. This framework includes fractional Brownian motion $B^H$ with Hurst index $H\in(0,1)$. For the fractional Wiener measure $μ_H$, the logarithmic Sobolev inequality with respect to the Ornstein–Uhlenbeck Dirichlet form holds for $H\geq\frac12$, whereas the corresponding weak Poincaré inequality fails for $0<H<\frac12$. The damped/$L^2$ Dirichlet forms satisfy logarithmic Sobolev inequalities for every $H\in(0,1)$.

fields
Probability
pdf ↗ page arXiv:2611.10618 ↗

We study Euler–Maruyama approximation of the driftless one-dimensional SDE $dX_t=σ(X_t)\,dW_t$ when $σ$ vanishes at the origin and weak uniqueness fails because solutions may remain at zero for an arbitrary time. The central object is the logarithmic coefficient profile $q(Q)=-\logσ(e^{-Q})$. Under a two-sided logarithmic increment condition, with both indices in $(0,1/2)$, we show that weak-solution selection is governed by a deterministic iteration clock: if $N_q(Q)$ is the number of iterates of $q$ needed to reach a fixed reference depth and $hN_q(\log(1/|x_h|))\to d$, then the Euler scheme started from $x_h$ converges to the fundamental zero-sojourn diffusion delayed by $d$. This single theorem yields the common-index generalized-power law $d=θ/|\logα|$ when $h\log\log(1/|x_h|)\toθ$, an effective translation-number formula for periodically modulated logarithmic profiles, a two-index delay window, and a sharpness construction in which, for one coefficient and one initialization family, the cluster set is the entire delay window. Thus the macroscopic selection mechanism is the iteration count of the logarithmic coefficient profile; the explicit double-logarithmic law of the homogeneous power case is its common-index closed form.

comments
20 pages, 1 figure. Companion to arXiv:2610.13800
fields
Probability
pdf ↗ page arXiv:2611.10643 ↗

The classical Strassen theorem characterizes convex order through martingale representations under the assumption of finite first moments. We show that a natural reformulation of the theorem remains true on the real line for distributions without finite or even well-defined means. We further investigate the higher-dimensional setting, where this equivalence fails in general. Martingale representations are nonetheless guaranteed in higher dimensions when every nonzero linear projection of the second marginal has undefined mean.

fields
Probability
pdf ↗ page arXiv:2611.10878 ↗

These open lecture notes provide a broad introduction to measure-theoretic probability and stochastic processes, with a focus on applications. Topics include probability spaces, conditional expectation, generating and characteristic functions, Markov chains in discrete and continuous time, convergence of random variables, Brownian motion, stochastic calculus, stochastic differential equations and their connection to partial differential equations, jump diffusions, stochastic control, optimal stopping, and Monte Carlo methods. Most chapters include exercises, and solutions are provided. The notes were written for a two-quarter course for first-year PhD students in applied mathematics, and should also be useful to graduate students in statistics, engineering, economics and finance. The LaTeX source is freely available on GitHub under a CC BY-SA 4.0 license, and readers are encouraged to fork the notes and contribute corrections, improvements, and new material.

comments
Lecture notes, approx. 320 pages. LaTeX source: https://github.com/mattlorig/intro-probability-stochastic-processes
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2611.10948 ↗

We obtain lower bounds on spectral gap/upper bounds for mixing rate for arbitrary $n$-state (not necessarily reversible) primitive Markov chains which have exponent $-O(n)$ rather than $-O(n^2)$, a significant improvement on the order obtained from classical arguments. Our improvements come from using the irreducibility distance and chainable index (which are at most linear in $n$) rather than the primitivity index (which can be near $n^2$). This also yields corresponding bounds for arbitrary nonnegative primitive matrices.

fields
Probability, Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2611.10951 ↗

We study the phase field crystal equation $\partial_tu=Δ[(1+Δ)^2u+u^3-\varepsilon u]+σ\partial_x\dot W$ on $[0,π]$ with the boundary conditions $\partial_xu=\partial_x^3u=\partial_x^5u=0$ at $x=0,π$, perturbed by a conservative space-time white noise. This sixth order equation is the standard model for crystal growth at atomic length scales and diffusive time scales, and the conservative noise is the form of thermal fluctuations used in the physics literature. We prove that for every initial condition in $H^1$ there exists a unique global mild solution, continuous in space and time, which preserves the mean and whose supremum has finite moments of all orders. We determine its Hölder regularity: away from $t=0$, it is Hölder continuous in time with any exponent smaller than $1/4$, and $C^1$ in space with a spatial derivative which is Hölder continuous with any exponent smaller than $1/2$. Finally, using Malliavin calculus and a localization argument, we prove that for $σ\neq0$ the law of $u(t,x)$ is absolutely continuous with respect to the Lebesgue measure for every $t>0$ and every $x$. A specific feature of the model is a second neutral mode of the linear operator, besides the constant mode, which requires a separate treatment in the a priori estimates.

fields
Probability
pdf ↗ page arXiv:2611.11014 ↗

Reaction networks provide a natural model for analog computation in which inputs and outputs are encoded by molecular abundances. Much of the work on analog computation with chemical reaction networks (CRNs) has focused on deterministic mass-action systems. In DNA- and protein-based circuits, however, low copy numbers can make intrinsic fluctuations significant, motivating the use of stochastic models. In this paper, we develop a framework for computation with stochastic CRNs at the level of stationary means. Specifically, we construct elementary arithmetic modules for identification, addition, and multiplication, and analyze their mean-level correctness and convergence rates. We focus on these three modules because they are simple enough to analyze explicitly while already exhibiting the new issues raised by stochastic mean-level computation. Unlike in deterministic systems, the computed value cannot be read from a single output measurement. Instead, readout requires Monte Carlo estimation, with error arising from transient bias as the system approaches stationarity and intrinsic sampling noise that persists even at stationarity. We therefore study the convergence rates of output means, variances, and autocovariances to their stationary values, as well as the stationary fluctuations governing sampling error. We also show that this readout cost can depend strongly, and sometimes unexpectedly, on the architecture of the computation. In particular, comparing linear-chain and binary-tree implementations reveals that binary trees can greatly reduce stationary variance for addition, but can instead produce exponentially larger variance for multiplication.

comments
50 pages, 1 figure
fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2611.11069 ↗

Bar-Lev and Letac (2025) introduced the concept of chainability of infinitely divisible distributions on $\mathbb R$. In this note, we show that a simpler notion of chainability can be used for infinitely divisible distributions on $[0,\infty)$. We derive some properties and give a probabilistic interpretation in terms of so-called size-biased distributions. As an application, we discuss simulation from size-biased distributions associated with an important class of tempered stable distributions.

fields
Probability
pdf ↗ page arXiv:2611.11109 ↗

We give a framework for transporting vectors along Markov processes that may have jumps, without assuming a manifold or other specific geometric structure. We prove existence and uniqueness of the resulting transport. In doing so, we develop a theory of vector bundles defined quasi-everywhere, in which the vectors live, and an axiomatic framework for energy forms that determine the bundle and the transport.

fields
Probability, Differential Geometry
pdf ↗ page arXiv:2611.11134 ↗

In this article, we study heavy-tailed alternatives to Gaussian-process surrogates, namely Student-$t$ processes, $α$-stable processes and Gaussian processes with heavy-tailed noise. These are Gaussian scale mixtures, and the position of the mixing variable decides whether the tails can be learned from a single realization. For process-level mixtures with a free amplitude, the profile likelihood of the mixing law is data-free and is maximized by the Gaussian law, the plug-in predictive is a data-free transformation of the Gaussian-process predictive, and no estimator can be consistent for the mixing law over the model along one path. For observation-level mixtures with symmetric $α$-stable noise, the tail index is identifiable. Further, for one-dimensional inputs under fixed-domain asymptotics with $α_0<2$ and compact hyperparameter sets, a cross-fitted plug-in estimator and the Laplace marginal-likelihood estimate computed at the global posterior mode attain the efficiency bound of the model with a known regression function, also for Matérn-$5/2$ sample paths. We also characterize small-sample failures of the Laplace approximation as folds of a posterior-mode branch and give a diagnostic. Finally, in a repeated Bayesian optimization study, observation-level tails reduced regret under gross outliers, as did Student-$t$ noise, and no degradation was detected under Gaussian noise.

comments
Extended 4 November 2026 version, with supplementary material included
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.11188 ↗

We prove Gaussian limits for the type measure of the giant component in sparse inhomogeneous random graphs. Countable types yield convergence in a weighted Hilbert space under boundedness, irreducibility, supercriticality, and a uniform tail condition on the empirical type weights. For types on a finite dimensional closed Riemannian manifold, smooth kernels yield convergence in a negative Sobolev space for any Borel type distribution. We allow deterministic types and first order kernel perturbations; independent type sampling adds an independent Gaussian term. The proof combines a seeded exploration identity, Hilbert space martingale limits, tail estimates, and inversion of the branching operator outside the giant. Finite types with random parameters are covered. A heat kernel example gives explicit variances for all spectral modes.

fields
Probability
pdf ↗ page arXiv:2611.11193 ↗

Continuing Feichtinger's generalized stochastic process theory, we analyze harmonic and monogenic representations of white noise in Euclidean spaces. We define its convolution with square-integrable functions. Using the weighted Sobolev regularity of the white noise, we establish a high-dimensional Sokhotski-Plemelj formula for the white noise density. Furthermore, we embed these representations into new weighted Bergman spaces, proving that the weighted Bergman norms of the harmonic representations are bounded by the white noise's weighted Sobolev norms.

fields
Probability, Functional Analysis
pdf ↗ page arXiv:2611.11244 ↗

We investigate the upper tail of $\inf_{t\in\mathcal T}X(t)$, where $X$ is a centred Gaussian process (GP) with continuous sample paths on a nonempty compact metric space $\mathcal T$. As suggested by the findings of [1], the exponential rate is governed by an optimal-measure problem, while the exact prefactor depends on the local geometry of the corresponding contact set. In the full-contact regime, we strengthen the known Gumbel max-domain of attraction property of the distribution of $\inf_{t\in\mathcal T}X(t)$ by establishing the von Mises condition. For fractional Brownian motion on $[a,b]$, $0<a<b$, with Hurst index $H\in(0,1/2)$, we also determine the order of the logarithmic correction to the leading Gaussian exponential. For finite contact sets, we distinguish dominated, smooth-critical, and rough-critical regimes and derive exact asymptotics of $P\{\inf_{t\in\mathcal T}X(t)>u\}$ as $u\to\infty$ under suitable local assumptions. We illustrate our findings with examples including fractional Brownian motion and the fractional Brownian sheet.

fields
Probability
pdf ↗ page arXiv:2611.11285 ↗

When does the stationary density of a $d$-dimensional diffusion process driven by standard Brownian motion uniquely determine its drift? In general, it does not: the $d$ drift components enter the stationary Fokker-Planck equation only through a single scalar divergence. We consider drifts whose component functions only depend on a subset of their input variables, and encode this dependence with a directed graph. We exclude 2-cycles, which admit rotations that leave the stationary density invariant, but otherwise allow arbitrary graphs, including those with feedback cycles. We show that if the stationary density is sufficiently $s$-concave, e.g., strictly log-concave, then the drift is uniquely determined among graph-structured drifts in a weighted Sobolev space. For drifts with linear self-regulation, a single locally strictly convex level set of the stationary density is sufficient to identify the drift in the region it encloses. Both results follow from Raychaudhuri equations. Excluding 2-cycles allows treating nontrivial rotational and symmetric terms simultaneously, extending the scope of the corresponding Bochner- and Reilly-type arguments. We illustrate the results by recovering the Hill-type regulation of a stochastic genetic repressilator from samples of its stationary distribution.

fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.11288 ↗

We study the least common multiple of a random subset of $\{1,\ldots,n\}$ when the selection follows a correlated Bernoulli process with memory. The copying rule preserves the marginal retention probabilities and creates a genealogical forest. At fixed density, the logarithmic least common multiple exhibits a fluctuation phase transition at the memory parameter $a=1/2$. The boundary limits depend on how genealogical families are distributed among the divisibility classes carrying the leading arithmetic weight. Our proofs combine the von Mangoldt representation with a reduction to large primes. At fixed density, an exact expansion separates an innovation martingale from a memory term. An asymptotic projection onto the retained count identifies the contribution of memory. Marked point-process convergence and estimates for rare genealogical families give the boundary limits.

comments
36 pages,1 figures. Comments are welcome
fields
Probability, Number Theory
pdf ↗ page arXiv:2611.11301 ↗

Inspired by previous work of Nualart, Ledoux, Peccati, Nourdin, and others, we establish quantitative fourth moment theorems for random variables in a fixed Wiener–Itô chaos and for sums of two Wiener–Itô chaoses in the $W_p$-Wasserstein distance for $1\leq p<\infty$.

fields
Probability
pdf ↗ page arXiv:2611.11408 ↗

We derive quantitative free fourth-moment bounds for sums of two Wigner chaoses of opposite parity under mirror symmetry. The bound contains an explicit remainder consisting of internal contractions of the two kernels. In particular, vanishing of this remainder together with the fourth free cumulant implies convergence to the standard semicircular law. If the higher-order kernel is cyclically symmetric, the internal contractions can be moved to an endpoint and we obtain an explicit fourth-root bound without a remainder. For fully symmetric kernels we obtain a square-root bound under the $W_2$-Wasserstein distance. Using the operator-norm support estimate for Wigner integrals, we also extend these bounds to every $W_p$-Wasserstein distance , where $1\le p<\infty$.

fields
Probability
pdf ↗ page arXiv:2611.11415 ↗

These notes (which grew out of some lecture notes prepared for the first Aarhus Summer School in Analysis and Probability) are an introduction to the parabolic Anderson model (PAM), or otherwise stated the stochastic heat equation $\partial_{t} u \,=\, \tfrac{1}{2}Δ\, u \,+\, β\, u\,\dot{W}$. In this system, a multiplicative random potential $\dot{W}$ drives the solution away from the smooth spreading of the classical heat flow and toward intermittency. Namely one observes that mass concentrates, as time grows, on a few tall and widely separated peaks. Through the Feynman-Kac representation this analytic phenomenon has an equivalent probabilistic reading as the localization of a directed polymer in a random environment. We first develop this picture on the flat space $\mathbb{R}^{d}$, covering the construction of the driving noise, well-posedness of the equation, and two-sided bounds on the moment Lyapunov exponents that quantify intermittency. We then turn to the more original goal of the monograph: understanding how these phenomena, and the exponents attached to them, change when $\mathbb{R}^{d}$ is replaced by a genuinely geometric background, such as a sub-Riemannian manifold or a fractal set. Throughout, the emphasis is on concepts, main results, and the intuition behind their proofs, rather than on exhaustive technical detail.

comments
Those lecture notes are still considered as a draft, comments are welcome
fields
Probability
pdf ↗ page arXiv:2611.11431 ↗

Krone's two-stage contact process is an interacting particle system in which each site on a grid can be in one of three possible states: 0 (empty), 1 (young individual), and 2 (adult individual). Only adults can multiply, and their offspring is initially young, before growing up after an exponential time. There are two death rates, one for adult trees, and a higher one for young trees. The process is additive and has an additive dual, but unlike the contact process it is not self-dual. Answering a question of Krone, for the process on the $d$-dimensional integer grid, Foxall proved that survival of finite populations is equivalent to nontriviality of the upper invariant law. Using a completely different method, we generalise this result to processes on countable groups and along the way also establish sharpness of the phase transition for a general class of additive interacting particle systems.

fields
Probability
pdf ↗ page arXiv:2611.11441 ↗

In this paper we study the generalized zero-range processes considered in [20, 11, 12] with boundary driving. In these processes mass is moved between neighboring sites with rates depending only on the departure site. For a wide class of such models, the equilibrium stationary states are known to be of product form. We show that for such models, the boundary-driven generator can be decomposed into a sum of generators acting on single sites when integrating against (possibly inhomogeneous) products of the equilibrium marginals. We exploit this structure to derive new results for the harmonic models introduced in [15]. In particular, we prove that the propagation of mixture measures in [19] is still valid on graphs with asymmetric edges. On the chain geometry with asymmetric edges, we identify a class of models for which the NESS is given precisely by the NESS of the symmetric harmonic model on the chain. In addition to these results for harmonic models, we also present a new class of asymmetric models on the chain for which the NESS can be found explicitly and exhibits shock behavior. The large deviations for the density profile corresponding to these NESS are stated and proved.

fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.11485 ↗

We extend the discrete uniform, hypergeometric and binomial distributions to the surreal numbers, allowing infinitely many outcomes, chips and trials. A uniform distribution on $\mathbb{N}$ gives each outcome probability $1/ω$; on the eventually periodic sets we define the needed sizes explicitly, obtaining a probability that is regular and strictly monotone. For an urn with infinitely many chips and finitely many draws, the hypergeometric distribution is within an infinitesimal of the binomial. With infinitely many trials, and under a hypothesis on factorials of omnific integers that we show can be satisfied, we prove a surreal de~Moivre–Laplace theorem, and we show that the hypergeometric distribution with infinitely many draws is locally normal with a finite-population correction. Near its center, it is relatively close to the binomial distribution if and only if the sampling fraction is infinitesimal, an exact form of a familiar rule of thumb. For rare successes we prove, without any hypothesis on factorials, a surreal Poisson limit theorem and describe urns with finitely many red chips, where the binomial approximation fails beyond the first success.

comments
28 pages, 0 figures
fields
Probability, Logic
pdf ↗ page arXiv:2611.11591 ↗

For Dirichlet Liouville Brownian motion with $0<γ<2$, the Gaussian response of a finite vector of logarithmic eigenvalues determines a conditional Green energy. We weight this energy by the current spectral density in the fixed reference space. The resulting self-consistent evolution is a porous-medium equation for the canonical spectral form. We construct its positive probability flow, prove an energy identity, and pass from the regularized response forms to the Green limit. The energy identity yields strong convergence of the Gaussian gradients and of the conditional response drifts. A superposition argument then realizes the flow as a McKean–Vlasov weak diffusion.

fields
Probability
pdf ↗ page arXiv:2611.11766 ↗

We prove that every weak limit of monotone convolution powers is monotonically infinitely divisible. In contrast, we prove that every probability measure on $\mathbb{R}$ can occur as a weak limit of monotone convolutions of an infinitesimal triangular array. We also discuss similar limit theorems for multiplicative monotone convolution on the unit circle.

comments
11 pages
fields
Probability, Operator Algebras
pdf ↗ page arXiv:2611.11968 ↗

We establish quantitative bounds on pairwise edge correlations for the random-cluster model with cluster weight $q\in[0,1]$ on arbitrary finite connected graphs. We give two explicit bounds that retain the dependence on the activities of the two specified edges and hold uniformly over the activities of all remaining edges. We also obtain a refinement of one of these bounds using connectivity information from the graph with the two specified edges removed. These results sharpen the bound obtained by a direct application of Lorentzian polynomial theory. At $q=0$, the model is supported on connected spanning subgraphs. In particular, for the uniform probability measure on these subgraphs, the joint inclusion probability of two distinct edges is at most $10/9$ times the product of their marginal inclusion probabilities.

comments
15 pages
fields
Probability
pdf ↗ page arXiv:2611.11993 ↗

We consider the stochastic 2D Euler and mSQG equations on the torus, with $L^2$ initial data and driven by rough Kraichnan transport noise, for which we construct weak solutions enjoying anomalous regularity and dissipation properties. Moreover, we show that weak solutions in this regularity class are pathwise unique, thus establishing probabilistically strong well-posedness. We further obtain the scaling limit from these equations to the deterministic Navier–Stokes/mSQG equations, with respect to positive Sobolev norms. The proofs rest on the analysis of energy spectrum of the vorticity and on a uniform weighted discrete Poincaré inequality on the lattice, the latter being crucial for making the positive norms accessible.

comments
45 pages
fields
Probability
pdf ↗ page arXiv:2611.12003 ↗

Flow-based and diffusion-based models have become the principal means of learning and sampling high-dimensional probability distributions, from images and video to proteins, molecules and physical fields, and increasingly language. Each carries a simple law to the law of the data along a curve of probability measures, and behind the variety of their names lie three geometries, those of the state space on which the data live, of the space of probability measures through which the curve passes, and of the space of paths traced by the generating process. A single analytic idea runs through the subject. Every score identity used to train a diffusion model is an integration by parts, on the noise, on the data or on Wiener space, and Malliavin calculus extends this to nonlinear and infinite-dimensional diffusions. We develop these foundations with full definitions and follow them through normalising flows, flow matching and few-step maps, diffusion models and their convergence theory, conditioning, Schrödinger bridges and stochastic control, and their extension to manifolds, Lie groups, discrete and function spaces and jump processes. We close with statistical physics, renormalisation and, more speculatively, holography, in which the radial direction of anti-de Sitter space can play the role of flow time. A table of the main methods and a collection of open problems complete the survey.

fields
Probability
pdf ↗ page arXiv:2611.12107 ↗

We study properties of optimal trajectories for the quasipotential that governs large deviations of queue lengths in generalised Jackson networks (GJN). The trajectories are shown to satisfy Hamilton equations. The Hamiltonian is identified. Optimal trajectories and associated costs are found for networks with two and three stations. A conservation law for adjoint variables is discovered to the effect that certain components are maintained along an optimal trajectory. A process is proposed for finding optimal trajectories and computing their costs in general GJN.

comments
27 pages, 4 figures
fields
Probability
pdf ↗ page arXiv:2611.12283 ↗

The vertical edge profile of a labelled plane tree $t$ is the collection of integers counting the number of oriented edges from label $i$ to label $j$ for every possible pairs of labels $(i, j)$. In a previous work by the second author, it was shown that a process constructed from the vertical edge profile forms a Markov chain for a wide class of models of random labelled plane trees where edge label increments are constrained to lie in $\{-1, 0, 1\}$. The purpose of this paper is twofold. First, we continue the study of Markov properties of the vertical edge profile. In particular, we derive general formulas for the transition kernel and the initial distribution of a class of Markov chains related to the vertical edge profile. Second, we apply these results to the probabilistic enumeration of trees with a prescribed vertical edge profile. These applications yield a unified probabilistic derivation of several enumeration formulas. In particular, we recover some results established Bousquet-Mélou and Chapuy for binary trees and Cayley trees. These enumeration formulas admit a remarkable factorized form, already noted in previous works. The probabilistic methods developed here explain this phenomenon by showing that these factorizations arise naturally from the Markov structure underlying the vertical edge profile.

comments
33 pages, 7 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.12525 ↗

This paper investigates the mixing of passive scalars advected by a randomized two-vortex model on $\mathbb{T}^2$, in which the vortices interact through a regularized Biot–Savart kernel and are driven by independent Brownian motions. We establish quenched exponential mixing for the Lagrangian flow, characterized by the exponential correlation decay of mean-zero $H^s$ observables. The proof proceeds by establishing ergodicity of the associated two-point Markov process. We combine a uniform contraction estimate with controllability arguments to verify the Lyapunov drift and minorization conditions, allowing us to apply Harris-type theorem.

fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.12535 ↗

The main result of this paper is the proof that the Paley–Wiener excess of the ${\rm Sine}_β$ process almost surely equals $\lfloor \sqrt{2/β}\rfloor$ for all $β>0$. We also derive the loop equations for the resolvent of the ${\rm Sine}_β$ point process and use them to obtain accurate bounds on the moments of the associated Stieltjes transform.

fields
Probability, Complex Variables
pdf ↗ page arXiv:2611.12602 ↗

We construct spatial measure-valued Cannings processes on the \emph{continuum} hierarchical group $Ω_N^\infty$ of order $N\in\N$ (an uncountable topological group with an ultrametric distance). These processes arise as the continuum-space limit of spatial Cannings processes on the \emph{discrete} hierarchical group $Ω_N$ of order $N\in\N$ (a countable topological group with an ultrametric distance) analysed in \cite{GHKK14}. On $Ω_N$, each site represents the \emph{geographic location} of a colony of individuals, each carrying a \emph{type} drawn from a compact type space $\K$, and the state in each colony is a probability measure on $\K$ describing the type distribution in that colony in the large-colony-size limit of individual-based models. The continuum-space processes on $Ω_N^\infty$ take values in the set of locally finite measures on $Ω_N^\infty \times \K$ and are to be thought of as describing a population of individuals, each equipped with a geographic location in $Ω_N^\infty$ and a type in $\K$, and each being subjected to \emph{migration} and three mechanisms of \emph{resampling}: (1) Fleming-Viot resampling at single sites; (2) Cannings resampling at single sites; (3) Cannings resampling and uniform reshuffling in balls around single sites (corresponding to consecutive hierarchical levels). The reshuffling adds to the migration, resulting in an \emph{effective migration} that is the superposition of the two relocation mechanisms.

comments
129 pages, 4 figures
fields
Probability
pdf ↗ page arXiv:2611.12641 ↗

Programming language researchers have developed a wide array of tools to reason about probabilistic programs, but it remains unclear how to apply these proof techniques to continuous-time stochastic processes. To bridge this gap, we propose a verification method for properties of continuous-time stochastic processes by reasoning about them as standard programs. To demonstrate our approach, we define a continuous semantics for a probabilistic imperative language $\mathrm{pWhile}^{\mathrm{dt}}$ by taking the Kuratowski limit of the standard semantics, which collects limit points of the standard program semantics as the time-step approaches zero. Then, we present a Hoare-style logic that uses loop invariants and decreasing functions to verify properties of continuous programs. To establish soundness, we identify a broad class of assertions that are preserved from the standard semantics to the continuous semantics. To demonstrate our approach, we verify properties of ten continuous-time stochastic processes modeled in $\mathrm{pWhile}^{\mathrm{dt}}$, including variants of Brownian motion and a stochastic hybrid system.

fields
Probability
pdf ↗ page arXiv:2611.12761 ↗

For arbitrary noncommutative polynomials in independent GUE matrices, we prove that the empirical eigenvalue measure converges weakly in probability to the Brown measure of the corresponding polynomial in free semicircular variables. We also prove convergence of the entire eigenvalue set in Hausdorff distance and convergence of the spectral radius, both in probability. Equivalently, these matrix conclusions hold for arbitrary $*$-polynomials in independent complex Ginibre matrices. Independently, we prove that the support of the Brown measure of every polynomial in free semicircular variables equals its operator spectrum. The proof of weak convergence combines a criterion based on the second moment of the Brown measure with complex Gaussian rotation and convexity. The support theorem uses linearization and rigidity of matrix Dyson equations. We also prove absolute continuity for nonconstant polynomials without adjoints in free circular variables. A matrix Dyson equation recovers Brown measures of arbitrary semicircular polynomials through regularized logarithmic potentials. For drift-corrected nondegenerate elliptic free random walks, it yields quantitative convergence of potentials in the interior of the limiting domain and weak convergence of Brown measures to that of free multiplicative Brownian motion.

comments
Preliminary version, 78 pages
fields
Probability, Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.12785 ↗

We study fluctuations of empirical distributions of normalized codegrees under independent vertex sampling from deterministic or random weighted parent networks. We establish a quantitative multivariate normal approximation for sampled biclique counts. Under additional graph-limit and sparsity assumptions, we establish convergence of the finite-dimensional distributions of the empirical codegree process indexed by smooth test functions. We further establish functional convergence on Hölder balls, with a smoothness threshold depending on network sparsity and vertex sampling probabilities. We verify our assumptions for classes of graphon-generated random graphs and give counterexamples showing that the smoothness conditions cannot in general be weakened.

comments
51 pages, 3 figures
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.12853 ↗

Dynamical Systems35

Associative memory models classically describe retrieval as convergence to stored patterns, but the theory of sequential retrieval remains comparatively limited. We develop a two-timescale input-driven Hopfield network in which fast associative retrieval is modulated by a slow feedback variable evolving over a prescribed memory-transition graph. This yields autonomous, graph-constrained transitions while preserving analytical tractability. Using slow-fast and geometric singular perturbation theory, we characterize memory fixation via memory manifolds and identify the geometric regions that govern stability loss and escape from retrieved memories. We further derive reduced slow dynamics and explicit criteria for transition onset, self-sustained retrieval, and collapse, expressed through escape times, gain thresholds, and fixed points. Together, these results provide a tractable framework for analyzing feedback-driven sequential retrieval in Hopfield networks.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.09995 ↗

We develop the response theory of the equilibrium state of a large heterogeneous network of weakly coupled uniformly expanding circle maps. The thermodynamic limit of such a network is governed by a Self-Consistent Transfer Operator (STO) acting on measures fibred over a graphon $W$, as introduced in \cite{MPT2025}. We prove that in the weak coupling regime the unique attracting fixed point $φ^\star(α)$ of the STO depends on the coupling strength in a Lipschitz, and then differentiable, way in a scale of fibrewise Sobolev spaces, and we derive a linear response formula. Our main result is that at zero coupling the response factorises: its derivative along the fibre $z$ equals $\barW(z)\,\Up$, where $\barW$ is the degree function of the graphon and $\Up=-(\Id-P)^{-1}[P(H_ρρ)]'$ is a universal profile depending only on the local dynamics and on the coupling function. To first order the heterogeneity of the statistical response across the network is therefore dictated by the degree profile alone, and the finer topology is invisible; the susceptibility of a node is proportional to its degree, so hubs respond most. The topology enters at higher order through a tree expansion: the perturbative coefficients of the equilibrium, defined unconditionally by an explicit recursion, are combinations --- with universal coefficient functions --- of the rooted homomorphism densities of trees with $m$ edges. We prove that the first two coefficients are the genuine asymptotic ones, the second producing the mean degree of the neighbours of $z$. We also obtain a response formula for perturbations of the graphon itself, Green–Kubo expressions for observables, and the prediction that in a finite network the linear susceptibility of a node is proportional to its normalised degree.

fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2611.10167 ↗

We study Turing instability in a closed Nutrient-Phytoplankton-Zooplankton-Detritus (NPZD) ecosystem model with nutrient recycling, formulated as a reaction-diffusion system without an explicit time-delay. The detritus compartment represents the biomass during the recycling process and acts to introduce a time delay in this process. Total biomass in the system is conserved, leading to a closed model. Although spatial diffusion typically promotes stability, our focus is on understanding how different diffusion rates for different species can destabilize steady states and give rise to spatial patterns. To address this, we first perform linear stability analysis to identify conditions under which Turing instability may occur. We then validate these theoretical predictions through numerical simulations. Our approach develops both intuition and rigorous analysis of how diffusion influences instabilities in the context of a conservative system, offering a comprehensive framework for understanding pattern formation in multi-species plankton ecosystems.

comments
30 pages, 13 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.10221 ↗

Each Collatz step changes a positive integer by roughly half: odd inputs go up and even inputs go down. We vary the directions while keeping the step size. Write x=2^m k (k odd), and let S be a set of positive integers. Define T_S(x)=(3x+1)/2 if m=0, 3x/2 if m is in S, and k otherwise. The map T_S^- differs only at odd x, which it sends to (x+1)/2. The usual Collatz map is T_emptyset. Assuming the independence of 2-adic valuations along odd-to-odd steps yields random-walk models with drifts (1+rho(S))log_2(3)-2 for T_S and rho(S)log_2(3)-2 for T_S^-, where rho(S) is an explicit series. Every T_S^- is contracting; T_S is contracting exactly when rho(S)<log_3(4/3), approximately 0.2619. We prove density results, classify interval sets S, and give a criterion ensuring every T_S^- orbit reaches 1 or (2,3). For seven contracting maps T_S, three with rho(S)=1/4 just below the threshold, computations show that every n<2^34 (n<1.668*10^10 for S={1}) reaches one of at most five cycles; stopping-time statistics match the model to 3-5 digits. We study branching maps, where any member of a family may be applied at each step. Boundedness of a family implies boundedness of each member; in particular, boundedness of {T_emptyset,T_{3}} would imply that no Collatz orbit diverges. For {T_emptyset,T_{1}}, a rule depending only on x mod 32 has positive drift (10/17)log_2(9/8) for almost every 2-adic starting point. Thus almost all n have reachable sets containing values larger than n^1.05; residues modulo 2^L, L<=10, cannot prove unboundedness. Finally, we define unified maps in which valuations also determine the direction at odd inputs. The cases x=1 mod 4 govern their behavior: if they go down, every block is dominated by the corresponding Collatz map (and a census finds only the cycles (1), (2, 3) and (3, 5) with smallest element below 10^9); if they go up, the maps behave like T_S.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.10311 ↗

We establish quenched level-2 large deviation estimates for empirical measures of measurable skew products with compact metric fibers over an invertible ergodic measure-preserving transformation on a Polish space. Our hypotheses are formulated through lower and upper energy functions, which describe the exponential decay of conditional measures of fiber Bowen balls. Under almost-sure fiber specification, we prove lower bounds for open sets. Upper bounds for closed convex sets require only the upper energy condition, and upper semicontinuity of fiber entropy removes the convexity restriction. When these hypotheses hold with a common energy function \(T\), we obtain a quenched level-2 large deviation principle with a good rate function \(I_T(ρ)=\int T\,dρ-h_ρ(F)\) on invariant measures with the prescribed base marginal, and \(+\infty\) otherwise. We also derive quenched level-1 large deviation principles for bounded continuous observables and a quenched Laplace principle. As an application, we consider skew products that are Anosov and topologically mixing on fibers. For Gibbs equilibrium states associated with random potentials $f$ having integrable two-sided Bowen variation, we construct bounded strictly positive common energy functions by coboundary corrections. This construction identifies the large deviation rate on invariant measures as \(π_F(f)-h_ρ(F)-\int f\,dρ\), where \(π_F(f)\) denotes the fiber topological pressure.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.10350 ↗

In this paper, we study Birkhoff and von Neumann type ergodic theorems for $\mathbb Z^2$-measure preserving systems along irrational directions. This leads us to a further investigation of directional ergodicity and weak mixing. Additionally, we show that our framework (dynamical definitions) is equivalent to the spectral definitions of directional ergodicity and weak mixing introduced by Robinson, Rosenblatt and Şahin \cite{RRS2023} for $\mathbb Z^2$-actions. We note that in their recent paper \cite{RS2026}, Robinson and Şahin established the equivalence between dynamical and spectral directional weak mixing for $\mathbb Z^2$-actions using an approach fundamentally different from the one employed in the present paper.

comments
38 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.10409 ↗

We formulate discrete dynamics internally in the topos Cond of condensed sets. For an endomorphism $f\colon X\to X$, we construct orbit quotients, backward histories, preimage trees, and periodic loci as objects evaluated on profinite parameter spaces. The framework recovers global-section dynamics, fully faithfully embeds compact Hausdorff systems, characterizes the invertible extension, and is compatible with inverse limits. It organizes $p$-adic congruence towers and shows, for a Cantor-type non-Archimedean Julia set, that classical periodic points can be dense although the internal periodic locus is not isomorphic to the compact condensed Julia set.

comments
32 pages. Published in Memorias de la Sociedad Matemática Mexicana 10 (2026) 87-122. Journal volume: https://memorias-smm.matem.unam.mx/contenidos/2026.pdf
journal
Memorias de la Sociedad Matemática Mexicana 10 (2026) 87-122
fields
Dynamical Systems, Category Theory, Number Theory
pdf ↗ page arXiv:2611.10438 ↗

Mechanism-AI coupled dynamical systems are increasingly used to study complex biological systems. However, uncertainty associated with noisy, sparse, and partially observed data limits their reliability. This paper presents a systematic mathematical formulation for treating these uncertainties from the perspective of optimal transport and information geometry. We formulate the uncertainty quantification problem as the minimization of an energy functional on a probability density space equipped with a Riemannian metric, with the loss evaluated through a differential equation, and give a unified description of the gradient flows of the energy functional under specific metrics, such as the Wasserstein and Fisher-Rao metrics. Furthermore, we present corresponding numerical methods for solving these gradient flows using abstract adjoint sensitivity analysis. The formulation connects a range of Bayesian inference methods for dynamical systems; numerical experiments compare posterior approximation and predictive uncertainty under a common computational budget. Moreover, it also provides a geometric perspective on dynamical modeling and the study of heterogeneity evolution.

fields
Dynamical Systems, Metric Geometry, Probability
pdf ↗ page arXiv:2611.10563 ↗

Let $T$ be a measure preserving $\Z^2$-action on a Lebesgue probability space $(X,μ)$ and let $L\subseteq\R^2$ be a $1$-dimensional subspace. For a rational subspace $L$, direction $L$ weak mixing corresponds to weak mixing for the measure preserving transformation $T^{\vv_0}$, where $\vv_0$ is a primitive vector in $\Z^2$ generating $L$. For an irrational direction $L$, we study two different definitions of direction $L$ weak mixing, and show that they are the same: ``Dynamical'' direction $L$ weak mixing is defined to be the absence of any direction $L$ Kronecker factors. These factors are defined in terms of almost periodicity along a finite width direction $L$ strip in $\Z^2$. ``Spectral'' direction $L$ weak mixing is defined as the absence of any direction $L^\perp$ line segments $I\subseteq\T^2$ with positive spectral measure. We also give a spectral characterization of the directional Kronecker property defined in \cite{liuxu}, and provide examples of $\Z^2$-actions $K$ that are direction $L$ Kronecker.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.10761 ↗

We revisit the Bendixson criterion for attractors, originally proposed by R.A. Smith for the finite-dimensional case and subsequently extended by M.Y. Li and J.S. Muldowney to Banach spaces. First, we give a concise proof of the criterion for general dynamical systems (semiflows, mappings, cocycles) in metric spaces using Čech cohomology. This approach allows for a significant weakening of previously known conditions while simultaneously resolving existing misunderstandings. Second, for compact invariant sets of semiflows that are topologically one-dimensional and possess zero first cohomology (e.g., attracting a superset with zero first cohomology), we prove that any chain recurrent point within the invariant set must be an equilibrium. In the proof, we construct a global strict Lyapunov function using Whitney-Bebutov sections. Third, we generalize and refine R.A. Smith's theorem concerning the finiteness of the set of fixed points for analytic mappings, as well as M.L. Cartwright's theorems on to almost periodic flows.

fields
Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2611.10918 ↗

We study the positivity of sequences $f$ that satisfy a third-order holonomic recurrence $f(n+3)= P_2(n) f(n+2) + P_1(n) f(n+1) + P_0(n) f(n)$ whose coefficients $P_0$, $P_1$ and $P_2$ are rational functions in $\R(x)$. We provide a sufficient condition on $P_0$, $P_1$ and $P_2$ for the recurrence to admit a solution all but finitely many terms of which are positive, and whose positivity is robust under small perturbations of the initial values. This sufficient condition is also a necessary condition for a subclass of the recurrences. By developing the proof of this sufficient condition, for another subclass of the recurrences, we show that it is decidable whether all the terms of a given sequence are positive for any initial values outside an exceptional plane. It is common to construct a positivity certificate, which guarantees the positivity of a solution, to show this kind of decidability. In this paper, we construct a new type of positivity certificate via the $S$-scaled difference $f(n+1) - S(n) f(n)$ for a suitable $S \in \R(x)$. This result partially improves the work by Ibrahim and Salvy.

comments
23 pages, 1 figure
fields
Dynamical Systems
pdf ↗ page arXiv:2611.10920 ↗

For $p_c\in(0,1)$, the frequency shift $Σ(p_c)\subset\{0,1\}^{\N}$, introduced by Becker and Baraviera, is the closure of the shift orbits of the set of sequences in which a symbol $1$ is followed by $1$ exactly when the density of ones up to that position does not exceed $p_c$. We show that $Σ(p_c)$ is never sofic and never has the (weak) specification property. For $p_c=\frac{k}{k+1}$, with $k\ge1$, we describe $Σ(p_c)$ completely: $Σ(\frac12)$ is the coded system generated by $\{0^m1^m\}_{m\ge1}$, while for $k\ge2$ the shift $Σ(\frac{k}{k+1})$ is not transitive, but every invariant probability measure is supported on the coded system generated by $\{0^m1^{km}\}_{m\ge1}$. For every $k \ge 1$, the topological entropy of $Σ(\frac{k}{k+1})$ is $\frac{\log2}{k+1}$, and, using the Climenhaga–Thompson criterion, we prove that $Σ(\frac{k}{k+1})$ is intrinsically ergodic.

comments
15 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.10995 ↗

We consider a predator-prey system with logistic prey, Holling type II response and a prey refuge fluctuating randomly within a band, driven by a bounded transformation of an Ornstein-Uhlenbeck process. Bounded noise yields a deterministic compact set attracting forward uniformly in the realisation, alongside the random pullback attractor, and we compare the two. The smallest such deterministic set, the minimal uniform attracting set, is the kernel of the control system in which the accessible fraction is any measurable band-valued function, and it meets the coexistence region exactly when the upper worst-case invasion exponent of the predator is positive, whereas the pullback attractor is governed by the ergodic invasion exponent, which decides the predator's fate pathwise. When the predator becomes extinct, the closure of the union of the fibres of the pullback attractor equals the minimal uniform attracting set if and only if the upper worst-case exponent is nonpositive, and otherwise the inclusion is strict and the latter is invariant under no realisation. When the predator persists, the essential closure of the union of the fibres contains, for every frozen environment in which the predator invades, the equilibrium or a periodic orbit of the frozen system, and every state the control system can reach from them. The predator is uniformly persistent when the lower worst-case exponent is positive and almost surely not when it is negative. The ergodic exponent lies below its deterministic counterpart by an amount comparable to the curvature of the response times the variance of the accessible fraction.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.11026 ↗

The Garden of Eden theorem relates surjectivity to a weak injectivity condition for cellular automata on amenable groups. Li extended the Myhill implication to expansive actions of countable amenable groups with weak specification. We consider two simultaneous relaxations: the group is replaced by a cancellative amenable semigroup, and expansiveness by m-expansiveness. The loss of ordinary expansiveness removes homoclinic rigidity, so we introduce a proximal analogue of pre-injectivity. Our main result shows that, for a surjective action of an infinite countable cancellative left-amenable semigroup on a compact metric space, m-expansiveness plus weak specification forces every continuous equivariant map injective on each proximal set to be surjective. The proof uses entropy detection at a fixed scale, a strict entropy gap from weak specification, and finite multiplicity to produce proximal pairs from uniformly close points. We also give a one-dimensional variant under shadowing and examples clarifying the assumptions.

comments
46 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.11161 ↗

Let $\Gb$ be the group of germs of planar diffeomorphisms, fixing the origin, which preserve the standard b-symplectic form. The group acts on itself, under the usual left-right action and we identify, in the generic case, a simple representative of each orbit, depending on a non-vanishing, univariate, function. We then study the action of $\Gb$ on b-symplectic vector fields. For those fields that do not vanish at the origin, we establish a flow-box type theorem, while, for those that do vanish there, we show that the study of their conjugacy classes reduces to a classification of functions. We present this classification, when the origin is a regular point for these functions, while if it is a critical point, we present the orbits of their 2-jets. Finally, we address the problem of whether an element of $\Gb$ can be realised as the time-1 map of a b-symplectic vector field.

comments
23 pages, keywords: b-symplectic plane, classification of dynamical systems
fields
Dynamical Systems, Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2611.11171 ↗

Well-calibrated forecasting for non-linear dynamical systems is essential in science and engineering applications such as fluid dynamics and weather prediction. We present a forecasting method combining probabilistic machine learning with the structured linear dynamics of Koopman mode decomposition. Within this framework, the observation, linear dynamics, and state reconstruction operators are constructed using standard machine learning architectures, producing predictive distributions via the pushforward of injected noise samples. The model is trained using a proper scoring rule, the continuous ranked probability score, to directly target calibrated, accurate forecasts. The approach is validated on two non-linear ordinary differential equation examples and two partial differential equation examples, vortex shedding and cavity flow, using both large and small, noisy datasets. Results demonstrate that known Koopman eigenfunctions and spectra can be identified and used for accurate forecasting. The model can also produce multi-modal predictive distributions, demonstrated for a trajectory initialised on the boundary between two basins of attraction. Uncertainty is captured by the sample ensemble spread, with spread–skill ratios close to one over the training horizon in several experiments, although for extended rollouts and noisy datasets, the ensemble may become under- or over-dispersed. In low-noise experiments, temporal rollout is generally accurate for at least twice the training horizon, and up to twenty times in some cases. Approximation quality is comparable to a deep ensemble approximation over the training horizon, but at a reduced computational cost and with better robustness in identifying Koopman eigenvalues.

comments
31 pages plus appendices. 18 figures and 5 tables
fields
Dynamical Systems
pdf ↗ page arXiv:2611.11257 ↗

Noise-induced transitions between metastable states are central to many nonlinear stochastic dynamical systems, and most probable transition pathways provide an effective means of revealing the underlying transition mechanisms. In this work, we develop an Onsager–Machlup framework for degenerate stochastic dynamical systems driven by multiplicative Gaussian noise. We first derive the Onsager–Machlup action functional for the additive-noise case using the Girsanov transformation, and then extend the result to multiplicative noise through a Lamperti-type transformation. The resulting functional provides a variational characterization of the most probable transition pathway, from which we derive the associated Hamilton–Pontryagin boundary value problem. We further recast the variational problem as an equivalent optimal control problem and propose a neural-network-based numerical method for computing the most probable transition pathways. Numerical examples are presented to illustrate the theoretical framework and demonstrate the effectiveness of the proposed computational approach.

comments
34 pages, 4 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.11270 ↗

World models learn internal simulators of environment dynamics for prediction, planning, and control, yet learning them from limited, noisy, and partial observations remains challenging. While much progress has focused on pixel-based observations, many physical systems instead provide vector-valued measurements that reveal only part of the underlying state. We introduce K-PWM, a probabilistic world model for prediction and control under partial observation. K-PWM couples Koopman-bilinear latent dynamics with a nonlinear observation decoder and performs probabilistic latent-state inference through the learned model via extended Kalman filtering and smoothing, without a separately trained inference network. Its bilinear structure enables exact propagation of the maintained Gaussian belief through the latent transition and efficient rollouts for uncertainty-aware model predictive path integral (MPPI) control. For training K-PWM, we present a generalized expectation conditional maximization (GECM) procedure with closed-form updates for the generators, noise covariances, and latent prior, complemented by gradient-based decoder learning. A Koopman-consistent initialization selects the latent dimension from data and initializes the action-dependent dynamics. With limited training data, K-PWM achieves lower long-horizon prediction error than the evaluated baselines on partially observed Gymnasium MuJoCo systems, while substantially reducing training time relative to the strongest prediction baseline. On high-dimensional MuJoCo Menagerie robots, it achieves competitive tracking accuracy with low per-step computation times, demonstrating potential for real-time deployment. These results support structured probabilistic dynamics as a data- and compute-efficient approach to world modeling and control under partial observation.

comments
Accepted at NeurIPS 2026
fields
Dynamical Systems
pdf ↗ page arXiv:2611.11521 ↗

A purely data-driven method grounded in the theory of adiabatic spectral submanifolds (aSSMs) was recently used to model and control nonlinear soft robotic simulators. Here, we extend the methodology to learn aSSM-reduced models from data collected from hardware soft robotic platforms. Specifically, we learn a five dimensional (5D) aSSM-reduced nonlinear ordinary differential equation (ODE) that accurately models the dynamics of a soft-helicoid trunk robot. We then use this ODE in a model predictive control scheme to demonstrate real-time precision control across various challenging closed-loop trajectory-tracking tasks, ranging from 2D to 3D trajectories with static and dynamic constraints. We find that our methodology enhances accuracy and precision across all control tasks compared to available data-driven linear methods and model-free reinforcement learning. While we focus here on a soft-helicoid trunk robot, our methodology relies solely on hardware data and is therefore applicable to a broader class of soft robotic systems.

comments
Submitted to npj Robotics. 44 pages, supplementary information included
fields
Dynamical Systems
pdf ↗ page arXiv:2611.11709 ↗

Reinforcement learning (RL) requires large amounts of interaction data or a reliable simulator, both hard to obtain for nonlinear soft robotic hardware. Recent work shows that a time-scale separation inherent to soft robot dynamics justifies their reduction to low-dimensional invariant manifolds, known as adiabatic spectral submanifolds (aSSMs). We demonstrate that an aSSM-reduced model, a simple polynomial ordinary differential equation learned purely from pre-collected data, can serve as an RL training environment. On a pneumatically actuated soft arm, we train a trajectory-tracking policy in 3 hours on a six-dimensional aSSM-reduced model and deploy it without fine-tuning, whereas reproducing this policy training extrapolates to 3 years of hardware interaction. Our policy tracks dynamic targets with 40% lower error than otherwise identical policies trained on a 4.8-million-parameter recurrent neural network (RNN) or a 1.7-million-parameter transformer, which take 13 and 100 hours to identify, against 5 minutes for our mathematically justified 6,924-parameter model.

comments
25 pages, 6 figures, 3 extended data figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.11718 ↗

Liverani–Saussol–Vaienti (LSV) maps form a family of piecewise differentiable dynamical systems on $[0,1]$ depending on a parameter $a>0$. These maps are expanding away from a neutral fixed point. In this paper, we study Schmidt games for nonautonomous compositions of LSV maps with arbitrary parameter sequences in a compact subinterval of $(0,\infty)$. For every countable set $P\subset[0,1]$, we prove that the set of points whose orbit closure is disjoint from $P$ is absolute winning on $[0,1]$. Our proof combines a potential game argument with an interval tree constructed from successive returns.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.11758 ↗

We study expansive solutions of the $N$-body problem with homogeneous potentials of degree $-p$, where $p>0$. We establish asymptotic rigidity for arbitrary solutions with admissible profiles. For general admissible profiles and $0<p<2$, we obtain convergent power-log expansions whose exponents are governed by the leading profiles. In the hyperbolic case, we derive a more explicit analytic representation for all $p>0$, extending Chazy's Newtonian result. Together with the author's recent results [Wu, 2026], this yields a bijective parametrization of hyperbolic solutions near infinity by their asymptotic velocities and offsets. We also establish the existence of free-time minimizing solutions with arbitrary prescribed initial configurations and admissible asymptotic profiles for $0<p<2$, covering the hyperbolic, parabolic and hyperbolic-parabolic regimes. In the hyperbolic case, the result extends to all $p>0$, including possibly collisional initial configurations in the strong-force regime $p \ge 2$. Furthermore, we prove that when $p \neq 2$, every solution with an admissible asymptotic profile is eventually a free-time minimizer.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.11945 ↗

Additive separation of the Hamilton-Jacobi equation depends on the Hamiltonian and on the canonical variables, and this paper introduces a five-input Poisson-bracket operator whose values on canonical pairs reproduce the Levi-Civita separability expressions. On a symplectic product structure its off-diagonal values are intrinsic, since they equal a symplectic pairing of the sector Hamiltonian fields and measure the Frobenius obstruction of a Lagrangian distribution, and their vanishing yields a local separation theorem. Because the operator is cubic in the Hamiltonian, its perturbation expansion is exact and defines a linearised separability operator and a defect functional. For Hamiltonians with a cyclic angle, the linearised operator divided by the squared rotor frequency is an angle derivative of the Melnikov integrand, so that the defect integrated along a homoclinic orbit decides the first-order splitting of the separatrix. Closed-form defects are obtained for the polar-nodal normal forms of satellite theory and, through a covariance of the operator on level sets, for Kerr geodesics. Used for coordinate selection, the defect singles out the separating focal distance of the Euler two-centre problem as its unique nondegenerate minimum, and for axisymmetric potentials it shows that the prescriptions of Sanders and Vasiliev are two weightings of the same Stäckel residual. The residual selector and Binney's shell-orbit fit improve both actions over the median prescription for 48 and 50 of 50 orbits in a flattened logarithmic potential, whereas the operator selector lowers the 90th-percentile action spread of 50 orbits in a Miyamoto-Nagai potential from 2.90% to 0.91%.

comments
48 pages, 4 figures, 2 tables. Submitted to Physica D. Code and data: https://doi.org/10.5281/zenodo.24048471
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2611.12015 ↗

Over the past decade, a growing body of work has established that implicit biases in learning dynamics fundamentally shape the solutions found by neural networks, governing their learned features and generalisation performance. However, despite these strides in deep learning theory, far less is known about representation learning in generative models based on dynamical systems, from normalising flows to diffusion. Importantly, empirical evidence suggests that continuous-time generative models can be prone to mode collapse, yet a learning theory explaining such biases remains elusive. To address this, we use tools from dynamical systems and operator theory to express the gradient flow of a general class of stochastic differential equations as a composition of linear operators, allowing us to relate collapse to low-rank biases in generative models. In variational inference and flow-matching tasks, we show that this bias can manifest in two different mechanisms: i) where collapsed models are stable fixed points of the gradient flow, or ii) in sequential feature learning, where smaller modes take progressively longer to be learned, producing an effective collapse for a fixed training budget. Together these findings point to a trade-off between feature learning and collapse, suggesting an operator view as a step towards a unified framework for understanding the learning dynamics of dynamical systems-based generative models.

comments
Accepted at NeurIPS 2026
fields
Dynamical Systems
pdf ↗ page arXiv:2611.12156 ↗

This paper develops a systematic framework for constructing finite-energy functions on the Sierpiński gasket using Lipschitz maps and various classes of contractions. Several properties of the constructed functions are investigated, including the min–max property and bounds for their energy. Several examples of finite-energy functions, along with their graphical representations, are provided to illustrate the functions constructed using the proposed framework. It is further shown that finite energy does not necessarily imply membership in the domain of the Laplacian. The framework is then applied to a class of fractal interpolation functions on the Sierpiński gasket, for which necessary and sufficient conditions for finite energy are established under suitable contractivity assumptions.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.12174 ↗

We obtain rates of convergence in the weak invariance principle for certain classes of slowly mixing sequential dynamical systems. In particular, for systems satisfying a Functional Correlation Bound with rate $n^{-γ} \ (γ>1)$, we establish an explicit bound in the Wasserstein-$r$ metric for $1\le r<γ+1$ whenever the variance grows at a sufficiently fast polynomial rate. The proof is based on Bernstein's ``big block–small block" method. Examples covered by our result include sequential heterochaos baker maps and sequential LSV maps. In particular, for random LSV maps over an ergodic base, we obtain rates in the quenched weak invariance principle.

comments
21 pages, comments welcome
fields
Dynamical Systems
pdf ↗ page arXiv:2611.12263 ↗

We study the $θ$-intermediate dimension of the minimal set of the classical $C^{1+δ}$ Denjoy map, an orientation-preserving diffeomorphism of the circle not conjugate to a rigid rotation. This follows on from work of Kra and Schmeling, who showed how the box and Hausdorff dimensions may differ, depending on the Diophantine properties of the rotation number. The $θ$-intermediate dimension interpolates between these two dimensions. We use the well-understood gap structure of the irrational rotation map to develop a covering strategy to get upper bounds on the lower $θ$-intermediate dimension, and use results of Banaji to show that these upper bounds are sharp for $θ$ in an interval.

comments
40 pages, 2 figures
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.12323 ↗

A periodic orbit of an implicit discrete system can persist when the implicit function theorem no longer guarantees a smooth successor. We develop a joint Lyapunov-Schmidt reduction of the periodic equations and the determinants marking singular transitions. In unrestricted smooth one-parameter families, the generic event is a single evolution fold on a continued orbit. Simultaneous normal forms describe its interactions with saddle-node and period-doubling bifurcations, locating the singular transitions and, under backward regularity, determining the diverging multipliers. The results cover arbitrary periods and periodically non-autonomous systems. Exact realisations and applications to labour-market equilibrium, machining and implicit integration illustrate the theory.

comments
27 pages, 1 figure
fields
Dynamical Systems
pdf ↗ page arXiv:2611.12327 ↗

In this paper, we show that every totally minimal system admits a point whose orbit along the primes is dense. Moreover, assuming the Dickson-Hardy-Littlewood conjecture, we show that in any totally minimal distal system, the orbit along the primes of every point is dense.

fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.12395 ↗

We prove a geometric and dynamical criterion excluding minimal sets contained in the regular locus of a holomorphic foliation on a compact complex surface. In particular, we prove that every Jouanolou foliation of degree at least two has no exceptional minimal set. We also give an explicit lower bound, growing linearly with the degree, for the number of singularities in every regular leaf closure of a Jouanolou foliation. This bound persists under small perturbations, as does the existence of a nonempty open saturated set whose leaves accumulate at all singularities. Under finite pullback unramified over the singular set, the bound is multiplied by the degree of the normalised component over the base leaf. Together with a general persistence theorem, this yields nonempty analytic open sets of foliations on every smooth projective surface with arbitrarily large uniform lower bounds on the number of singularities in their regular leaf closures. On double-plane K3 surfaces, we obtain foliations with ample canonical bundle and explicitly describe and count their singularities.

fields
Dynamical Systems, Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.12402 ↗

We prove that every projection of a planar self-similar measure $μ$ is equivalent to Lebesgue measure on its support if the rotations satisfy a simultaneous Diophantine condition with exponent $τ$ and $μ$ has finite $s$-energy for some $1+2τ\le s<2$. Under strong separation, we prove the fibre measures have exact dimension $\dim_Hμ-1$. For self-similar sets $E$ with $\dim_H E>1+2τ$, the same rotation condition implies uniformly positive projection lengths and fibres of dimension $\dim_H E-1$ at Lebesgue-almost every point of each image without separation assumptions. The absolute continuity and fibre dimension theorems extend to non-coordinate projections of products under a joint Diophantine condition with exponent $τ$ on the logarithmic contraction ratios. These imply for all self-similar sets $K,L\subset\mathbb R$ satisfying this condition and $\dim_HK+\dim_HL>1+2τ$, every sum $uK+L$, $u\ne 0$, has positive length, and $\dim_H(L\cap(y-uK))=\dim_HK+\dim_HL-1$ for Leb. a.e. $y\in uK+L$. The proof combines the $L^1$ Gaussian smoothing approach used in the higher dimensional case with averaging at random stopping scales with a Brownian martingale bound using Itô calculus.

comments
36 pages
fields
Dynamical Systems, Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.12607 ↗

We show for certain skew products built over any infinite minimal nilsystem, the frequencies present in the nilsystem are not always enough to govern recurrence for the whole system. This strengthens and generalizes a theorem of Glasscock, Koutsogiannis, and Richter.

comments
15 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.12722 ↗

The parameterization method yields efficient and accurate reduced-order models for nonlinear dynamical systems, but existing procedures that compute them assume polynomial vector fields on vector spaces. Constrained multibody systems instead obey differential-algebraic equations on matrix Lie groups such as $\mathbb{R}^3 \times SO(3)$ and $SE(3)$. Minimal parameterizations of these groups lead to non-polynomial equations that must be approximated or recast before reduction, and current implementations require the nonlinearities as explicit multilinear maps, which are cumbersome to construct for assembled multibody systems. This work develops a parameterization framework for constrained multibody systems on matrix Lie groups. Rigid and floating frame of reference bodies use rotation-matrix components or Euler parameters, while geometrically exact beam elements use an Euler-Rodrigues representation that eliminates the logarithmic map and expresses the exponential map polynomially, retaining screw-motion interpolation. The reduced-order models satisfy linear joint constraints exactly, and a rotation-preserving parameterization keeps the configuration on the Lie group to machine precision. The parameterization method is formulated directly in terms of the assembled residual, so that only residual evaluations and their derivatives are required. Truncated Taylor arithmetic delivers all Taylor coefficients of a given order from a single residual evaluation, and a non-intrusive coupling to codes with real-valued residuals is demonstrated with the multibody code Exudyn. Numerical examples show accurate prediction of backbone curves, forced response curves, and internal resonances at substantially reduced computational cost.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.12726 ↗

We study the motion of a pair $(p_1,p_2)\inΣ\timesΣ$ of point vortices with equal magnitude and opposite signs on a closed oriented Riemannian surface $(Σ,g)$. Given a closed geodesic that satisfies a non-degeneracy condition we construct a one-parameter family of periodic solutions $(p_1^\varepsilon,p_2^\varepsilon)$, $0<\varepsilon<\varepsilon_0$, of the Hamiltonian dynamical system for point vortex pairs whose trajectories converge towards the geodesic curve. The two vortices lie on opposite sides of the geodesic, are separated of order $\varepsilon$ and have period $2π\varepsilon$. The proof is based on a differentiated expansion of the Riemannian distance in Fermi coordinates, an augmented Lyapunov–Schmidt reduction, and an intricate contraction argument in scaled variables. The reduced normal equation is governed by the Jacobi operator of the closed geodesic, and the first order correction to the normal center of the dipole is characterized by an inhomogeneous Jacobi equation involving the curvature and the regular part of the Green function of the Laplace-Beltrami operator.

comments
26 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.12743 ↗

Permutation entropy, introduced by Bandt and Pompe in 2002, measures the complexity of a dynamical system through the ordinal patterns of its trajectories. Bandt, Keller and Pompe established that for measure-preserving, piecewise monotone interval maps with finitely many monotonicity intervals, the normalized order-$n$ permutation entropy $H_n^{\mathrm{perm}}(f)/n$ converges to the Kolmogorov–Sinai entropy. Although this result has subsequently been extended to broader classes of maps, whether normalized permutation entropy always converges has remained unknown. We show that convergence can fail, and indeed that nonconvergence is generic. More precisely, for a generic continuous Lebesgue measure-preserving map $f:[0,1]\to[0,1]$, we prove that \[ \liminf_{n\to\infty}\frac{H_n^{\mathrm{perm}}(f)}{n}=0, \qquad \limsup_{n\to\infty}\frac{H_n^{\mathrm{perm}}(f)}{n\log n}=1. \] Thus, despite the generic vanishing of Kolmogorov–Sinai entropy, permutation entropy exhibits oscillations between vanishing linear growth and the maximal possible asymptotic growth. We also construct an explicit Lebesgue measure-preserving interval map with countably many monotonicity intervals for which the normalized permutation entropy has lower limit zero and upper limit infinity. This demonstrates that nonconvergence can occur even within the countably piecewise-monotone setting, beyond the scope of the convergence theorem of Gutjahr and Keller, relying on conditions concerning the lengths of the pieces.

comments
17 pages, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.12789 ↗

Information Theory35

Resource-constrained IoT devices cache learned models for real-time decisions, but frequent updates incur substantial bandwidth, energy, and service overhead. Because decision-relevant model differences need not grow with elapsed time, we define Age of Intelligence (AoInt) as a model-version-relative, client-specific, and action utility distortion, and formulate synchronization as a tradeoff between stale-decision regret and refresh cost. Furthermore, we develop Kullback-Leibler-aware AoInt Synchronization (KL-AoIntSync), which accumulates output-distribution changes using client-specific unlabeled probes, whereas Parameter-aware AoInt Synchronization (Param-AoIntSync) uses a server-broadcast scalar parameter change. Then, we establish pathwise guarantees with fixed client distributions, action sets, and utilities. The numerical results show that calibrated Param-AoIntSync reduces joint synchronization cost by 6.15% relative to an Instant-Parameters policy while performing comparably to KL-AoIntSync.

fields
Information Theory
pdf ↗ page arXiv:2611.09935 ↗

We study how two geometries of mass on a finite graph interact: the information geometry of the generalized entropy $F_q$ used for regularized transport, and the arithmetic of divisors governed by the Riemann–Roch theorem of Baker and Norine and by the Jacobian. Because the correction term of $F_q$ is affine, $F_q$-regularization at strength $γ$ is Tsallis regularization at temperature $γ/q$. Over the reals, chip-firing connects all configurations of equal degree, so the Jacobian enters transport only through integrality. We introduce the transport defect, the worst-case cost of steering $d$ chips towards a target by chip-firing, and prove $1/d\leδ_{\TV}(D)\le(d-r(D))/d=(g-1-r(K-D))/d\le\min(1,g/d)$ whenever $g\ge1$; vertex multiplicities give a lower bound and an equality criterion. A regularized topological gap $Γ_{q,γ}(D,E)$ tends to the chip-move defect as $γ\to0$, lies in an explicit window, has a high-temperature slope given by Tsallis coupling entropies, and admits a positive regime if and only if $g\ge1$. Dual potentials certify exactly the convex relaxation of a linear system; the remainder is an integrality gap. Zeros in optimal plans occur only for $q>1$, by a mechanism different from the sign change of $Γ$. Exact computations on $1784$ divisor classes find the rank bound $(d-r(D))/d$ attained in $1769$ of them, an observed frequency. Experiments on honeycomb and Erdős–Rényi networks with $10^2$ to $10^5$ nodes test the statements on regularized plans, not $Γ$; over $10^3\le n\le10^5$ their transport costs are consistent with growth like $n^{1/2}$ and $\log n$, respectively.

comments
50 pages
fields
Information Theory
pdf ↗ page arXiv:2611.09968 ↗

Conventional channel estimation for multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) relies on the pilot interpolation without explicitly identifying the sparse delay-angle (DA) components. To exploit DA sparsity while maintaining backward compatibility with existing MIMO-OFDM systems, we propose a cross-domain channel estimation scheme for multiuser MIMO-OFDM (MU-MIMO-OFDM) systems. The scheme exploits the circular convolution structure in the DA domain to identify candidate DA pairs by correlating delay-domain observations with DA pilot responses. These pairs and the known pilots then define a time-frequency (TF) dictionary for refining the DA coefficients from TF observations through least-squares or sparsity-regularized fitting. The refined coefficients and candidate pairs reconstruct the aggregate channel across antennas and subcarriers aligning with the geometric channel model. Numerical results show approximately 10 dB and 7 dB lower normalized mean-square error than the conventional OFDM estimation schemes for integer and fractional delay and angle indices, respectively.

fields
Information Theory
pdf ↗ page arXiv:2611.10052 ↗

Whether almost perfect nonlinear (APN) permutations exist in even dimension $n\ge 8$ is a long-standing open question, the big APN problem. The only example known in even dimension, on six bits, was found from a quadratic APN function that is not itself a permutation, by Carlet–Charpin–Zinoviev (CCZ) equivalence. It is therefore natural to test APN functions for CCZ-equivalence to a permutation. This amounts to finding two complementary $n$-dimensional subspaces among the zeros of the Walsh transform, which lie in $\mathbb{F}_2^{2n}$. A known necessary condition only uses their projections to $\mathbb{F}_2^n$ and cannot decide every case. We give an exact test for functions whose Walsh supports are affine, including all quadratic functions. It reconstructs the subspaces from their projections, through searches for subspaces of $\mathbb{F}_2^n$ and for constrained bilinear maps. On the benchmarked functions in dimension twelve, it lists them $39$ to $55$ times faster than the generic search of the commonly used sboxU library. We then study the functions $x^3+a^{-1}\mathrm{Tr}(a^3x^9)$, which Göloğlu and Pavlů proved not to be CCZ-equivalent to permutations when $4$ divides $n$. With their result, our computations show that this holds for every even $n\le 24$. In dimension $18$ the necessary condition is satisfied, and the new test decides the case. We conjecture this for every even dimension. We also compile $25$ classes of quadratic APN functions in dimension ten from published instances, with equivalence certificates. No function in these classes or in their switching closure is CCZ-equivalent to a permutation. All code and data are public.

fields
Information Theory
pdf ↗ page arXiv:2611.10269 ↗

Multiple robots operating in shared workspaces must adjust their speed, direction, and trajectories to coordinate with one another and respond to changing tasks and disturbances. The available maneuver freedom depends on the dynamics, uncertainty, and safety margins, even for a fixed fleet size and workspace. However, robot count, workspace occupancy, and task throughput do not quantify how much the fleet can vary its motion or how reliably these variations can be observed. We develop a mobility information capacity (MIC) framework that jointly characterizes these two aspects. Mobility information is defined as the mutual information between a joint maneuver sequence and its noisy trajectory observation, and MIC maximizes this quantity under maneuver-resource constraints. For a linear Gaussian maneuver-to-observation model with feedback dynamics, we characterize the finite-horizon information benchmark and derive its stationary long-horizon spectral limit, accounting for heterogeneous mobility gains, colored uncertainty, and temporally coupled maneuver costs. We further map workspace-boundary, inter-robot separation, and actuator chance constraints into coupled maneuver-covariance restrictions and derive conditions under which covariance optimization reduces to resource allocation across mobility modes. Finite joint maneuver codebooks are then constructed through individual risk screening and noise-whitened trajectory separation, with bounds linking sequence recovery error and achieved information to the capacity benchmarks. An aerial-robot simulation study evaluates spectral convergence, safety-aware allocation, finite-codebook identification, and fleet-size scaling. The resulting framework complements occupancy and task-throughput measures by quantifying the maximum observable maneuver freedom supported by a mobility system.

comments
12-page main article and 4-page supplementary material
fields
Information Theory
pdf ↗ page arXiv:2611.10298 ↗

Relative greedy weights were introduced by Li and Liu in [19] as a measure of information leakage in coordinated two-party wire-tap channels of type II when the adversary follows a greedy strategy. Their definition can be viewed as a relative version of the CEZ greedy weights, which are only locally greedy. In this paper, we revisit the concept of greediness and relative greediness introducing new measures, and we discuss other perhaps more relevant applications of relative greedy weights than the coordinated two-party wire-tap channel of type II. We pay special attention to bottom-up greedy weights, which correspond to an adversary with an ultimate greedy approach, and we present families of nested codes for which such weights are larger than the relative CEZ greedy weights.

fields
Information Theory
pdf ↗ page arXiv:2611.10567 ↗

Hybrid active-passive extremely large-scale reconfigurable intelligent surface (XL-RIS) architectures mitigate the double-hop path loss of passive RIS while enabling near-field spatial energy focusing, but impose a computationally intensive mixed discrete-continuous beamforming design problem under strict radio-frequency (RF) power constraints. This paper investigates a hybrid XL-RIS-assisted downlink multi-user multiple-input single-output (MU-MISO) system in the near-field regime. The joint optimization of the base station (BS) precoder, discrete XL-RIS phase shifts, and active-element amplification gains is addressed via a discrete coordinate ascent (DCA)-based alternating optimization (AO) framework, in which discrete variables are updated through local index-domain searches and the BS precoder is derived in closed form via a noise-aware minimum mean-square error (MMSE) criterion. To reduce the per-sample computational cost for XL-RIS apertures, a deep unfolding (DU) framework is proposed as a low-complexity alternative, unrolling a fixed number of Riemannian gradient ascent steps on the sum-rate objective and recovering the discrete phase configuration via quantized phasor projection, with one learnable step size per layer trained in a self-supervised manner. Numerical results under near-field spherical-wave channel models confirm that the DU framework achieves sum-rate performance close to the AO scheme with substantially lower and nearly constant runtime, and that both schemes consistently outperform manifold optimization under discrete hardware constraints.

comments
13 pages, 8 figures
fields
Information Theory
pdf ↗ page arXiv:2611.10569 ↗

This paper studies multiple-input multiple-output (MIMO) free-space optical (FSO) quantum communication systems employing polarization-encoded discrete-variable quantum key distribution (DV-QKD), based on entanglement swapping, with the goal of extending secure communications beyond the reach of a direct link. The FSO channels are subject to atmospheric absorption, diffraction, beam wander, pointing errors, and turbulence-induced fading, while background noise and detector imperfections degrade the performance. An eavesdropper controlling the channels and the relay is also considered. To analyze the performance of the considered system, both hops MIMO channels are decomposed into parallel spatial eigenchannels via singular value decomposition (SVD), photon loss is modeled using Kraus operators, and a threshold-detector model is developed for the relay. Based on these models, closed-form per-eigenchannel expressions for the relay gain are derived, which are then used to obtain expressions for the quantum bit error rate (QBER) and the secret key rate (SKR). Numerical results demonstrate that entanglement swapping maintains a low QBER over longer distances than direct transmission, extending the communication range beyond the noise-limited cutoff of the direct link, at the cost of a lower SKR at short distances. The crossover distance beyond which entanglement swapping prevails is determined mainly by the background noise and the detector technology, and it is demonstrated to increase with MIMO configurations. Moreover, the reach gain is shown to be maximized for a midpoint relay. Finally, since each swapping event requires a single-pair emission from both sources, a near-deterministic entangled-photon source is required, which spontaneous parametric down-conversion sources do not provide at practical key rates, whereas MIMO substantially relaxes this requirement.

comments
13 pages, 8 figures
fields
Information Theory
pdf ↗ page arXiv:2611.10743 ↗

Let $q=p^n>3$ be an odd prime power and let $g:\F_q\to\F_q$ be an even perfect nonlinear (PN) function with $g(0)=0$. We construct almost perfect nonlinear (APN) functions $G_{λ,M}(x)=g(x)+M(x)+λ(x^{q-1}-1)$, where $λ\in\F_q^*$, $-λ\notin g(\F_q)$, and $M$ is an $\F_p$-linearized permutation polynomial. These one-point modifications of $g+M$ have boomerang uniformity one, the smallest possible value for APN functions in odd characteristic. We give complete differential and boomerang spectrum formulas and obtain closed-form evaluations for selected constructions based on Coulter–Matthews monomials and Dembowski–Ostrom polynomials. For $q>7$, comparison of differential spectra establishes CCZ-inequivalence to all APN monomial families listed in the paper and every APN binomial in the original Ness–Helleseth family or its extension by Zeng et al. We characterize CCZ-equivalence within our construction, showing that any two linearly inequivalent even PN functions over the same field yield CCZ-inequivalent APN functions. We obtain three pairwise CCZ-inequivalent APN functions with boomerang uniformity one over $\F_{p^{15\ell}}$ for every $\ell\ge1$, six over $\F_{p^{120r}}$ for every $r\ge1$, and unbounded numbers of such classes in characteristic three. We further prove that CCZ-equivalence and EA-equivalence coincide for functions at Hamming distance at most $m$ from a PN function, provided that $m(m+1)<q-q/p$. We also show that all our APN functions have the maximal possible algebraic degree $n(p-1)$. Finally, we exhibit both CCZ-equivalent and CCZ-inequivalent APN pairs with boomerang uniformity one at Hamming distance one.

fields
Information Theory
pdf ↗ page arXiv:2611.10766 ↗

We study the robustness of two state-of-the-art BP-based qLDPC decoders, Relay-BP and beam search, designed for independent noise when applied to spatially correlated noise with unchanged single-mechanism error probabilities. We generate correlated errors with a hidden Gaussian Markov random field, which lets us control the strength and range of the correlation while keeping every marginal error probability exact. This setting complements correlation-aware decoding: it asks how existing decoders perform when their assumed joint error model is mismatched. Across multiple tested circuits and code instances that we simulated, we observe that correlations can change logical error rates by orders of magnitude, reduce the finite-size distance advantage, and alter the relative ranking of Relay-BP, beam search, and BP-OSD. On one of the two tested circuits, Relay-BP and beam search become worse than BP-OSD, and increasing relay memory or beam width does not compensate for the degradation. Configuration analysis indicates that correlation primarily increases the probability of trapping configurations that are known to challenge these decoders; at matched error weight, correlated errors still cause decoding failures several times more often than i.i.d. errors. Finally, supplying the decoders with the marginals conditioned on the hidden field recovers most of the lost performance in the tested settings identifying prior mismatch as a major contributor to performance degradation under correlation.

fields
Information Theory
pdf ↗ page arXiv:2611.10796 ↗

We extend the quantum-channel optimization of Alrabiah and Guruswami to $q$-ary constant-composition codes. We study explicit channel and flag constructions that recover selected classical asymptotic upper bounds, including the Ben-Haim–Litsyn, moving-subspace and Horn-channel bounds. We give two equivalent formulations, Gram and flag, and prove stability of the obtained upper bounds under permutation transport and generalized shortening. A hierarchy defined by bounding the output-state ranks within each flag improves strictly between consecutive levels at every composition and every positive distance below the Plotkin threshold. We provide finite matrix parametrizations of these bounds (i.e., the number of variables does not depend on the length of codes under consideration). Numerical optimization rapidly produces improvements over the known asymptotic upper bounds throughout all tested nonbinary parameter ranges. For rational input data, each finite level admits near-optimal feasible rational descriptions of polynomial length. Their feasibility can be checked exactly and their objective values computed to any prescribed accuracy in polynomial time; the associated threshold problem with a prescribed gap belongs to $\mathsf{PromiseNP}$.

comments
45 pages, 1 figure, 5 tables
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.10827 ↗

Accurate first erroneous position (FEP) identification is key to improving the error-correction performance of successive cancellation flip (SCF) decoding. However, FEP identification remains challenging with a limited number of re-decoding attempts. To address this issue, we propose decision-boundary normalization (DBN) to improve FEP identification and develop a novel DBN-SCF decoding algorithm. DBN normalizes the magnitude of each decision log-likelihood ratio (LLR) by the standard deviation predicted by the Gaussian approximation (GA) for the corresponding bit-channel. This allows a single normalized threshold to be shared across bit-channels within each code configuration, giving it a consistent statistical meaning and avoiding per-channel calibration. DBN-SCF decoding selects candidate flip positions from the information set in the natural successive cancellation (SC) decoding order using a threshold, without sorting. Moreover, DBN-SCF decoding achieves better error-correction performance with a limited number of re-decoding attempts. It also requires lower average decoding complexity than existing SCF decoding methods at a comparable level of error-correction performance.

fields
Information Theory
pdf ↗ page arXiv:2611.10846 ↗

Quantum synchronizable codes protect quantum information against Pauli errors and against misalignments of the block boundaries. Almost all known constructions use cyclic codes, because the channel shifts the transmitted block cyclically. We study what happens when the algebraic shift of the code differs from the physical one. When one uses a twisted padding, constacyclic codes synchronize at no cost, and they are the only polycyclic codes with this property for a linear padding. For the other polycyclic codes, we measure the cost of each misaligned position, and we show that the phase damage it causes can be corrected as erasures. Using annihilator duality, we extend the construction to quasi-polycyclic codes, in which the cost is confined to a single block. We prove that the usual quasi-cyclic families have a distance bound that does not grow with the length, and show that quasi-polycyclic codes over repeated-root trinomials overcome it, giving synchronizable codes with larger dimension and distance than the known synchronizable codes of the same length.

fields
Information Theory
pdf ↗ page arXiv:2611.10903 ↗

We study the optimal sampling and transmission policies for a transmitter communicating with n gossiping receivers with the objective of tracking a source's status over time using a semantic freshness metric: Version Age of Information (VAoI). The transmitter observes the version changes in the source, and can acquire a new information version by paying a sampling cost. The receivers gossip, allowing information exchange among each other without direct transmission. Gossiping can save on transmission cost, but it may propagate stale version information, necessitating transmitter intervention. With imperfect communication links, we formulate an infinite horizon average cost Markov Decision Process (MDP) in order to jointly optimize receivers' VAoIs, sampling and transmission costs in a time slotted fully connected (FC) gossip network. We first solve the MDP using Relative Value Iteration (RVI) algorithm. Then, we prove that the sampling decision has a threshold structure in the transmitter VAoI. Further, under reliable gossiping links, we show that transmission and idling has an VAoI-difference threshold structure with minimum VAoI activation. Numerical results obtained using RVI show that the optimal policy consistently outperforms natural baselines. These results characterize how source sampling, direct transmission, and receiver gossip should be jointly coordinated for cost-aware semantic freshness in gossip networks.

comments
Potential IEEE journal publication
fields
Information Theory
pdf ↗ page arXiv:2611.10952 ↗

In extra-large multiple-input multiple-output (XL-MIMO) systems, near-field users experience spherical wavefront propagation, offering higher spatial resolution than far-field plane-wave models, but complicating signal detection and interference cancellation. Under line-of-sight conditions, we propose a weighted-rate successive interference cancellation (WR-SIC) scheme whose ordering metric exploits the enhanced spatial degrees of freedom of near-field propagation to prioritize users with stronger channels. An iterative detection and decoding (IDD) scheme with LDPC coding is then developed. Simulations in hybrid near- and far-field deployments show that the proposed WR-SIC and IDD schemes improve bit-error and sum rates over existing schemes

comments
6 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2611.11038 ↗

Direct-to-cell (DtC) satellites serve unmodified LTE phones today from low Earth orbit, where the satellite's motion creates Doppler shifts of tens of kHz. Since large offsets such as these cannot be compensated adequately by the user equipment (UE), the satellite pre-compensates the Doppler shift of each beam, but it can do so for only one reference point in the beam. A UE elsewhere in the beam still has to compensate a residual offset; previous field studies report residuals of up to 10 kHz, beyond the $\pm$7.5 kHz that the 15 kHz subcarrier spacing can resolve. In this paper we corroborate this effect with our own detailed measurements of Starlink transmissions and further correlate ineffective handover performance to inadequate residual offset compensation. We analyze the Doppler compensation problem with detailed standard-specific simulations and propose a compensation method at the UE, based on the location of the UE with respect to the beam reference point used for the Doppler compensation and the known satellite location, that improves the efficiency of handover. With UE cell-specific pre-compensation, the neighbors are identified, read correctly and handed over to in time rather than lost to radio-link failure.

fields
Information Theory
pdf ↗ page arXiv:2611.11065 ↗

Near-field communications have emerged as a promising technology for future sixth-generation (6G) networks. However, designing energy-efficient hybrid beamfocusing schemes for multiuser (MU) systems remains challenging due to the non-convex quality-of-service (QoS) constraints and hardware limitations of hybrid architectures. In this paper, we investigate a hybrid massive multiple-input multiple-output (MIMO) architecture for a near-field sub-THz MU downlink system employing a large uniform circular array (UCA) at the base station. A QoS-aware transmit power minimization problem is formulated for energy-efficient beamfocusing and addressed through a two-stage penalty-driven joint optimization (PDJO) framework, where auxiliary variables are introduced to reformulate the QoS constraints into second-order cone (SOC) constraints. Furthermore, a near-field polar-domain codebook is developed via joint angle- and distance-domain sampling. We establish that the fully digital (FD) beamfocuser lies within the column space of the proposed codebook, enabling hybrid precoder design to be formulated as a multiple measurement vector (MMV)-based sparse approximation problem. The formulated problem is then solved using a low-complexity simultaneous orthogonal matching pursuit (SOMP) algorithm under hardware and transmit power constraints. Simulation results demonstrate that the proposed framework achieves spectral- and energy-efficiency performance close to the ideal FD beamfocusing scheme while providing a favorable trade-off between hardware complexity and system performance.

fields
Information Theory
pdf ↗ page arXiv:2611.11097 ↗

Let $\mathcal{C}_k$ be the doubly extended Reed–Solomon code with parameters $[q+1,k,q-k+2]_q$, where $q\ge3$ is a prime power and $2\le k\le q$. We prove a conjecture of Wu and Zhou by showing that the minimum-weight codewords of $\mathcal{C}_k$ do not form a $q$-ary $3$-design when $2\le k\le q-1$. Using shortening, we extend this obstruction to every nonempty weight class with $3\le w<q+1$. We also establish that each individual nonempty positive-weight class of $\mathcal{C}_k$ forms a $q$-ary $2$-design if and only if $\gcd(k-1,q-1)=1$. Consequently, every nonempty positive-weight class below full support has exact $q$-ary design strength $2$ when this coprimality condition holds, and $1$ otherwise.The three-design obstruction follows by applying a classical subset-product character identity to a marginal covering count for three prescribed nonzero symbols. The comparison between weights rests on a covering-count formulation of the classical MDS coset-weight relations. For every linear $[n,k,d]_q$ MDS code with $2\le k\le n-1$, this formulation shows that the $q$-ary $2$-design property at any one nonempty positive weight is equivalent to the same property at every nonempty positive weight.More generally, for $2\le t\le\min\{k,d\}$, we prove that the $q$-ary $t$-design property at any $t-1$ distinct nonempty positive weights forces it at all nonempty positive weights.

comments
18 pages
fields
Information Theory
pdf ↗ page arXiv:2611.11219 ↗

We improve the probabilistic lower bounds on the rates of hash codes and list-recoverable codes. For perfect $q$-hashing, we prove $R_q>B_q$ for every $q\geq 3$. Our main result concerns non-perfect hashing. For every $q\geq 4$, we prove $R_{q,3}>B_{q,3}+\frac{1}{250000}.$ In particular, the case $q=9$, combined with the Tetra code, strictly improves the Körner-Marton lower bound $R_3\geq \frac14\log(9/5)$ for trifferent codes. We also extend the method to $(p,2,3)$-list recovery. For every $q\geq 4$ and $0\leq p<\frac{q-2}{12(q-1)}$, we prove $R_q^{\mathrm{LR}}(p)>B_q^{\mathrm{LR}}(p)$. For every fixed $0\leq p<1/18$, the rate improvement is bounded below by a positive constant independent of $q\geq 4$. The same holds for every fixed $0\le p<1/12$ when $q$ is sufficiently large.

comments
22 pages
fields
Information Theory
pdf ↗ page arXiv:2611.11262 ↗

In set reconciliation, two parties holding sets $A, B \subseteq [n]$ with $|A \triangle B| \le d$ seek to recover their symmetric difference from short $\mathbb{F}_2$-linear sketches, which is equivalent to recovering a $d$-sparse vector $x = \mathbf{1}_{A \triangle B} \in \mathbb{F}_2^n$ from its syndrome $Hx \in \mathbb{F}_2^m$. While the information-theoretic counting bound requires $L(n,d) := \log \sum_{i=0}^d \binom{n}{i} = d\log(n/d) + Θ(d)$ bits, existing polynomial-time schemes either use at least $d\lceil\log(n+1)\rceil$ bits (algebraic sketches, leaving an $Ω(d\log d)$-bit gap) or incur a multiplicative $(1+δ)L(n,d)$ overhead (peeling-based sketches), raising the question of whether $L(n,d) + O(d)$ bits is achievable with fast updates and decoding. We construct a public-coin randomized $\mathbb{F}_2$-linear sketch of length $L(n,d) + O(d) + λ\log^{O(1)} n$ that recovers each fixed input of weight at most $d$ with probability at least $1 - 2^{-λ}$, with $\log^{O(1)} n$ update time and $d\exp(O((\log\log n)^2)) = dn^{o(1)}$ worst-case decoding time. In particular, for $n \le 2^{\operatorname{polylog}(d)}$ and $λ\le d^{1-Ω(1)}$, this achieves $L(n,d) + O(d)$ bits with $\operatorname{polylog}(d)$ update time and $d^{1+o(1)}$ decoding time. Our construction encodes $d$ permuted rows via randomly scaled Pinsketch syndromes and sketches the resulting bit array column by column. Decoding columns sequentially from prefix predictions cancels recovered rows and exposes undecided rows as decoder-side hints, reducing each column to a hinted sparse recovery problem that we solve via a recursive sketch, HintSketch.

fields
Information Theory
pdf ↗ page arXiv:2611.11409 ↗

An analytical and optimization framework for the joint design of communication and control (JDCC) in a center-fed pinching-antenna system (C-PASS) is proposed. Within this framework, the mathematical coupling between data throughput and closed-loop control cost is characterized for JDCC. The analysis captures the mutual interference between concurrently transmitted data and control streams during uplink state uploading and downlink command delivery. Based on this coupling, an achievable communication-control performance region is established for C-PASS. Accordingly, a throughput maximization problem is formulated to jointly optimize digital and pinching beamforming subject to control-cost constraints. To address this problem, an alternating optimization algorithm is developed based on constraint reformulation and resource decomposition. The proposed framework reveals how control requirements shape achievable data throughput, guiding the joint beamforming design. Numerical results demonstrate that 1) the proposed C-PASS design achieves 110.2\% higher frame-average throughput than conventional PASS, and 2) the proposed concurrent data-control transmission protocol increases frame-average throughput by up to 66.7\% over separated transmission.

fields
Information Theory
pdf ↗ page arXiv:2611.11412 ↗

Wireless foundation models learn reusable representations across tasks, configurations, and deployment environments. Their pretraining requires environmental breadth, yet wireless datasets often sample few sites densely. We introduce Channels4World, a scene-centered dataset of 100,000 distinct outdoor RF scenes and a procedural method for generating them. Each scene links a generated environment and RF material assignments to 32 base-station (BS) positions, 16,384 UE positions, and aligned variable-length multipath and ordered interaction records at 3.5 and 7~GHz. The corpus comprises 52.43 billion physical BS-UE pairs, 104.86 billion frequency-specific evaluations, and a 29.14-TB packaged payload. Scene identity aligns geometry, placements, channels, and interactions across frequencies, allowing environmental breadth and within-scene observation density to vary independently. The public release offers predefined subsets at multiple scales and separate access to corpus components. A deterministic 90K/10K scene-level train-test split keeps both frequencies and all scene components together. We characterize morphology, RF materials, and transceiver placement across three generation profiles. Controlled propagation and path-retention analyses show that diffraction materially affects retained-link availability and multipath structure, while the retention policy reduces storage substantially with little loss in represented aggregate power. Under matched training exposure, models trained on broader scene collections perform better on held-out scenes, although an equal-episode control shows that scene count alone cannot explain the gain. By making environmental breadth explicit and controllable, Channels4World supports the development and evaluation of wireless foundation models for generalization across deployment environments.

comments
21 pages, 7 figures, 7 tables
fields
Information Theory
pdf ↗ page arXiv:2611.11428 ↗

It is well-known that one can recover a function $f$ bandlimited to $[-δ,δ]$ ( $0<δ<π$) from its finite sample data $f(j),-n\le j\le n$, with an approximation error exponentially decaying to zero as $n$ tends to infinity. Various regularized Shannon sampling formula have been proposed to achieve such exponential approximation. So far the best rate has been $$ O\biggl(\frac1{\sqrt{n}}\exp(-(π-δ)n)\biggr). $$ We establish that the optimal recovery algorithm in the worst-case scenario achieves an approximation error $ρ_{n,δ}$ satisfying $$ c_* \frac1{\sqrt{n}}(\tan\fracδ4)^{2n+1/2}\le ρ_{n,δ}\le C^* \frac1{\sqrt{n}}(\tan\fracδ4)^{2n+1/2}, \quad 0<δ\leqπ,\quad n\geq1, $$ where $c_*,C^*$ are positive constants independent of $n$ and $δ$. This result identifies the best possible exponential rate to reconstruct bandlimited functions from two-sided finite oversampling data. In other words, $$ ρ_{n,δ} \asymp \frac{\tan\fracδ4}{\sqrt{n}}\exp\bigl(-c_δ(π-δ)n\bigr), $$ where $c_δ$ is strictly decreasing on $(0,π]$ and $$ \lim_{δ\toπ^-}c_δ=1,\ \lim_{δ\to 0^+}c_δ=+\infty. $$ We also make the new finding that one can also reconstruct $f$ bandlimited to $[-δ,δ]$ with exponentially decaying error from one-sided sample data $f(j)$, $1\le j\le n$, and the sharp rate of approximation error $ρ_{n,δ}'$ of the optimal algorithm is $$ ρ_{n,δ}' \asymp \sqrt{δ/π}\sin^n(δ/2). $$

fields
Information Theory, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.11461 ↗

Private local decoding imposes a stringent constraint on compression: the codeword bits used to recover a source symbol must reveal nothing about the remaining symbols beyond what the recovered symbol itself reveals. For memoryless sources, this constraint is known to be compatible with entropy-rate compression. We show that the same holds for any stationary ergodic source over a finite alphabet. Specifically, every rate above the entropy rate is achievable with exact privacy and error-free local decoding on a set of source sequences whose probability tends to one. In contrast, we exhibit non-ergodic sources for which private local decoding incurs a strictly positive rate penalty.

comments
22 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2611.11501 ↗

The Karhunen-Loève transform of a window of a stationary autoregressive process of any order $p$ is described through its poles, extending the Algebraic Diversity framework, which selects a transform by the matched group. For simple roots every basis vector is a sum of at most $p$ sinusoids, at the frequencies where the spectrum equals the eigenvalue, plus modes decaying from the ends. The window covariance differs from a member of the class diagonalized by the type-II discrete cosine transform by a closed-form matrix of rank $2p$, exactly when no pole is zero, so the eigenvalues interlace spectrum samples on the cosine grid, and the coding-gain loss of the cosine transform is an exact function of that matrix with computable bounds: for the $8\times8$ Markov block of image coding at pole $0.95$ it is below 1.2 percent. By Kronecker's theorem the rank is at most $2\max(p,q)$ for rational spectra; a moving-average window departs in its Hankel corners, and an integrated (ARIMA) window departs by low rank from the type-VII sine class, exact for the random walk. The exact symmetry is generically the reflection and contains a wreath product for interleaved windows; the dihedral group of the even extension is matched approximately, the dominant pole's sign choosing cosine or sine. The two groups give the transform a fast form: a parity fold, half-length cosine cores and a cascade of at most $p$ first-order Cauchy stages, exactly $p$ for a minimal AR($p$) model. The first-order case recovers results obtained by other means.

comments
v1: 38 pages, 7 figures
fields
Information Theory, Numerical Analysis
pdf ↗ page arXiv:2611.11624 ↗

A fixed finite binary Ising model has only finitely many admissible complex belief propagation fixed points, even at degenerate parameter values. Families of positive fixed points obtained by varying external fields can nevertheless have nontrivial topology. We study this distinction through the external-field projection. For a fixed field, we prove finiteness by bounding the pole orders of the magnetizations on a hypothetical complex solution curve. The generic degree on the support graph then bounds the total local multiplicity. A graph has a single smooth real line as its full positive response for every choice of positive couplings, base field, and strictly positive sweep direction exactly when it contains no two vertex-disjoint connected subgraphs of cycle rank at least two. Two such subgraphs suffice to create a circular component. For a plane obtained by varying two vertex fields, connected simple bipartite cubic graphs with one uniform coupling and a universal bound on the fixed fields realize every genus. The minimum number of vertices grows logarithmically in the genus, by a matching algebraic upper bound on Betti numbers. Finally, we certify the complete field discriminant of an eighteen-vertex product model and recover its torus component's genus from the counts of distinct roots on all field cells. The three main theorems, including the logarithmic size bounds, are formally verified in Lean 4 with Mathlib.

code
github.com/ywatanabex/bp-response-geometry-lean ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 4d0ae2b, checked 2026-11-10 build details
comments
37 pages, 3 figures. Lean 4 formalization and interval certificates at https://github.com/ywatanabex/bp-response-geometry-lean
fields
Information Theory, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.11713 ↗

In a frequency-hopping (FH) system, to reduce interference to the received signal, each user's frequency hopping sequence (FHS) shall have wide-gap property. In this paper, we update the upper bounds on the minimum gaps of optimal uniform wide-gap frequency hopping sequences (WGFHS) with parameters $(v,s,λ;e)$ where $v=ks, k\ge 3, λ=k$ and $s\ge k(k-1)+1$ is odd. We completely prove the existence of such WGFHSs for $k\le 3$.

fields
Information Theory
pdf ↗ page arXiv:2611.11747 ↗

Accurate characterization of the instantaneous signal-to-interference-plus-noise ratio (SINR) is important for reliability-sensitive cell-free massive multiple-input multiple-output (CF-mMIMO) systems. This paper proposes a joint estimation method for link-specific large-scale fading coefficients (LSFCs) and a common Nakagami-$m$ shape parameter using power and downlink SINR measurements. A tractable SINR distribution is first derived under global zero-forcing (GZF) precoding, Nakagami-$m$ fading, and link-level fractional power control (FPC). Based on the derived probability density function (PDF), a model-driven neural network (NN) is developed to solve the resulting maximum-likelihood estimation (MLE) problem. Simulations show that the reconstructed SINR distributions obtained with the estimated parameters closely match the empirical distributions. With $2 \times 10^{5}$ samples, the proposed method achieves an LSFC root-mean-square error (RMSE) of approximately 1.0 dB and an $m$ RMSE of approximately 0.085.

fields
Information Theory
pdf ↗ page arXiv:2611.11849 ↗

How many observations are needed to estimate a common rotation in two-dimensional overcomplete independent component analysis? We study equally spaced mixing columns with known source count, common source law, and column norm. For a fixed non-Gaussian fourth-order Gram-Charlier source law, the rotation is identifiable modulo the column spacing. Yet the sample size for fixed relative angular accuracy grows exponentially with the source count. We characterize this sample size, up to absolute constants, by the reciprocal of the squared Hellinger distance between two rotations separated by half the column spacing. An explicit radially weighted phase estimator attains this scale uniformly over the rotation family, using the observation radius to prevent cancellation in the mean of an angular harmonic. We also determine the exact exponential decay rate of single-observation total variation for the same pair. This gives bounds on the sample size exponent; its exact value remains open. Finally, a noisy binary-source example shows how an exact zero line of the observed characteristic function can have an exponentially small normal derivative.

fields
Information Theory
pdf ↗ page arXiv:2611.11852 ↗

We study noninteractive simulation from a finite correlated source. Alice and Bob observe independent copies of the source and generate outputs without communication. We give a quantitative construction for arbitrary finite output alphabets: for every fixed source, a joint law that is simulable with arbitrarily many samples can be approximated using a number of samples polynomial jointly in the output alphabet sizes and the inverse accuracy. We first study binary outputs. A one-sided Wright–Fisher comparison gives a source-dependent explicit exponent and a finite-head Gaussian-threshold representation. We then handle arbitrary finite output alphabets through averaged influence regularity, simplex-preserving Gaussian moment lifting, and a common Gaussian projection for all correlated-prefix states. The sample exponent is independent of the output alphabet sizes. For a concrete biased binary source we certify an explicit exponent below $19$.

fields
Information Theory
pdf ↗ page arXiv:2611.11974 ↗

Bit-interleaved coded modulation (BICM) is widely used in multiple-input multiple-output (MIMO) wireless systems. However, separating MIMO data detection from channel decoding and only exchanging per-bit soft information discards correlation information among the bits within each transmit vector. We show that the resulting information loss limits the performance of practical one-shot receivers. Even though iterative detection and decoding (IDD) can recover most of this loss, IDD significantly increases receiver complexity and latency. In order to reduce this loss, we propose COrrelation-Informed Logits (COIL), a soft-output format that combines per-bit soft information with pairwise coupling logits for correlated bits. We show how to incorporate these coupling logits into a conventional belief-propagation-based channel decoder, which enables correlation-aware decoding in a one-shot receiver without IDD. We evaluate COIL in a MIMO-BICM system with a conventional low-density parity-check code. For a 4x4 MIMO orthogonal frequency-division multiplexing (OFDM) system, a one-shot linear minimum mean-square error (LMMSE) receiver with COIL outperforms a conventional one-shot unbiased LMMSE receiver by 1.3dB and operates within 0.8dB of four-iteration IDD, while requiring only a single pass through the data detector.

comments
Submitted to a journal
fields
Information Theory
pdf ↗ page arXiv:2611.12223 ↗

Existing analytical studies of fluid antenna multiple access (FAMA) are largely confined to Rayleigh fading, independent-port assumptions, or asymptotic selection metrics, leaving the fundamental outage behavior under realistic fading and spatial correlation conditions uncharacterized. This paper fills this gap by presenting the first exact and asymptotically tight outage analysis of interference-limited FAMA systems under spatially correlated Nakagami-$m$ fading. By explicitly modeling the joint statistics of the desired and interference powers across fluid-antenna ports, \textcolor{black}{we first formulate the outage probability in terms of the joint desired-signal and interference distributions and then derive an explicit integral expression under a tractable single-reference-port spatial correlation model.} Building on this result, we establish a rigorous diversity-order characterization revealing that the achievable diversity is jointly dictated by the fading severity and the spatial correlation rank imposed by the finite antenna aperture, rather than by the nominal number of ports. To enable accurate and tractable performance evaluation beyond the asymptotic regime, we further introduce a Gamma-matched outage approximation that preserves both the exact diversity order and the array-gain constant. The resulting closed-form expression provides an accurate characterization over a wide range of signal-to-interference ratio (SIR) thresholds and offers clear physical insight into the role of spatial correlation in FAMA systems. Extensive Monte Carlo (MC) simulations confirm the tightness of the exact analysis, the sharpness of the asymptotic results, and the accuracy of the proposed approximation.

comments
16 pages, 9 figures, accepted in IEEE TWC
fields
Information Theory
pdf ↗ page arXiv:2611.12247 ↗

As a fundamental cryptographic primitive, secret sharing distributes a secret among multiple parties and allows certain authorized parties to recover the secret while preventing unauthorized parties from knowing the secret. However, local leakage from each party member allows an adversary to learn partial information from each share, which is not guaranteed by traditional security. In this paper, we study bounds on the reconstruction threshold of Shamir's secret sharing scheme over prime fields against arbitrary 1-bit local leakage. We show that, for all sufficiently large $n$ and every prime $p>n$, the $(n,t)$-Shamir's scheme is $\exp(-Ω(n))$-resilient whenever $t/n\geq 0.489$, for any choice of distinct nonzero evaluation points. Our proof refines the dual-code list recovery analysis and combines complementary Fourier estimates according to the support sizes and biases of the leakage functions, yielding an improved explicit reconstruction threshold bound.

fields
Information Theory
pdf ↗ page arXiv:2611.12325 ↗

Traditional communication resource allocation optimizes operational metrics such as rate, latency, energy efficiency, and reliability. Motivated by goal-oriented semantic communication, we develop a generalized allocation framework that transforms operational rewards through reference-dependent user utilities and evaluates them via expected utility, cumulative prospect theory (CPT), or related decision criteria. The formulation separates operational rewards, user-side valuations, and system-level decision criteria under uncertainty. We characterize utilities incorporating QoS/service reference levels, deficit sensitivity, post-reference saturation, and loss aversion. Weighted sum-reward maximization, proportional fairness, $α$-fairness, and stochastic expected utility maximization emerge as exact special cases, while soft QoS-aware allocation follows from a deficit-penalty generalization. For deterministic orthogonal systems, we derive utility-weighted marginal-reward KKT conditions characterizing global optimality under concave composite objectives. For nonorthogonal and stochastic systems, we develop successive convex approximation (SCA) algorithms and establish stationary-point guarantees under explicit smooth and composite nonsmooth assumptions, including a CPT branch-stationarity result under eventual nondegenerate ordering identification. For globally solved penalized problems, we derive an $O(1/λ)$ bound on excess aggregate soft-QoS deficit, and on the deficit itself whenever a QoS-feasible allocation exists. Additionally, we establish an $O(1/ε^2)$ outer iteration bound for the smooth fixed-step SCA best-response residual. Numerical examples demonstrate how reference points, marginal utility slopes, channel quality, and resource budgets influence active users and allocation policies.

comments
This paper has been submitted for publication
fields
Information Theory
pdf ↗ page arXiv:2611.12480 ↗

If a quantum state is known only approximately, how much can the expectation of an observable change? We answer with the worst-case expectation over all states within a sandwiched Rényi divergence budget of a reference state, for every order $α\in [1/2,\infty]$. Convex duality gives this value as a one-dimensional optimization over a sandwiched Schatten norm, running from a fidelity risk at $α= 1/2$, through the entropic risk at $α= 1$, to a quantum conditional value-at-risk at $α= \infty$. The main result is a classicalization theorem: the quantum problem coincides with the classical one for a probability measure $ω_α$ on the spectral interval of the observable, constructed from Heinävaara's tracial joint spectral measure and given by Stahl's theorem at $α= 1$. The Hoeffding, Bernstein and Markov–Krein bounds of classical probability thereby apply to the quantum problem, and yield Pinsker-type inequalities with Bernstein-type refinements. The measure $ω_α$ is the Born measure only at $α= 1/2$; for $α> 1/2$, noncommutativity of the observable with the state strictly lowers its variance below the Born variance, and with it every variance-sensitive bound: a quantum deflation.

comments
55 pages
fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2611.12738 ↗

Algebraic Geometry33

Fake quadrics are minimal complex surfaces of general type with $b_1=0$ and $e=4$. The paper gives a short introduction to their arithmetic construction, aimed at low-dimensional topologists, and studies their holomorphic and antiholomorphic quotients and their fundamental groups. The running example in the paper comes from a quaternion algebra over a totally real cubic field. The lattice is generated by three explicit pairs of matrices. A holomorphic involution gives (after resolving the singularities) a simply connected minimal complex surface of general type with $p_g=0$ and $K^2=4$, a smooth $4$-manifold homeomorphic but non-diffeomorphic to $CP^2$ blown up $5$ times. An antiholomorphic involution gives a smooth four-manifold homeomorphic to $S^4$, with a knotted torus as branch locus.

comments
11 pages
fields
Algebraic Geometry, Geometric Topology
pdf ↗ page arXiv:2611.09603 ↗

We prove that a finite group acting birationally on a non-trivial Severi–Brauer surface $S$ over a field $\mathbb{K}$ of positive characteristic not equal to $3$ is isomorphic either to a subgroup of group of biregular automorphisms of $S_{\mathbb{K}^{per}}$ or to a subgroup of $μ^3_3$, where $μ_3$ is a cyclic group of order $3$ and $\mathbb{K}^{per}$ is the perfect closure of a field $\mathbb{K}$. Combined with results about classification of finite subgroups of the group of biregular automorphisms of $S$, this gives a classification of finite subgroups of the group of birational automorphisms of $S$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.09981 ↗

We study obstructions of deformations of foliated complex analytic structures. We describe obstructions in terms of Cech resolutions. From foliated complex analytic families in Part I and unfolded complex analytic families in Part III, we deduce the integrability conditions. We identify infinitesimal deformations and obstructions in terms of Dolbeault resolutions or Dolbeault type bicomplexes from the integrability conditions. Then we describe the correspondences of infinitesimal deformations and obstructions between Cech resolutions, and Dolbeault resolutions or Dolbeault type bicomplexes.

fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.10069 ↗

We present an adaptive visualization framework and its implementation in the julia package AdaptiveVisualization.jl. Our algorithm visualizes functions using an adaptive sampling procedure that concentrates the evaluation budget at interesting regions of the domain. We illustrate our package on our main application: visualizing parameter spaces of enumerative problems.

comments
13 pages, 16 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.10131 ↗

Let phi_m be the monic Chebyshev polynomial characterized by phi_m(t + t^-1) = t^m + t^-m. We study the geometric automorphism groups of the smooth projective models of y^n = phi_m(x) and y^p - y = phi_m(x). We classify the hyperelliptic family in genus at least two, in characteristic zero and odd characteristic. For every m >= 5, with p not dividing m in positive characteristic, we determine the projective stabilizer of the roots of phi_m together with infinity. For tame Kummer covers, we describe the normalizer of the cyclic deck group and compute it explicitly for m >= 6. It is the full group when m > 2n. If m >= 3 and n > 2m, the full group has order 2n in characteristic zero and in every characteristic prime to 2nm. The proof uses the dihedral Galois closure of the map to the y-line and Dickson's subgroup classification. In odd characteristic, we also classify all Artin-Schreier curves in the family with genus at least two. For m >= 3 prime to p >= 5, the group has order 2p. In characteristic three, exactly five degrees are exceptional. We give the groups and their actions, and treat the quadratic cases separately.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.10255 ↗

We investigate the nefness of the direct image sheaves of relative adjoint bundles under weakly semi-stable Kähler morphisms between complex spaces. We show that the direct image sheaves are locally free and that their tautological line bundles are metrically nef, strengthening the previously known results on torsion-freeness and certain weak positivity.

comments
22 pages
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.10391 ↗

We study the wall-crossings for K-moduli spaces of (3,3)-curves on $\mathbb{P}^1\times\mathbb{P}^1$. Together with the boundary polarized Calabi–Yau moduli space, these spaces interpolate between the GIT moduli space of (3,3)-curves and the Baily–Borel compactification of the moduli space of K3 surfaces arising as cyclic triple covers of $\mathbb{P}^1\times\mathbb{P}^1$ branched along such curves. As applications, we describe the corresponding birational models in the Hassett–Keel–Looijenga program and realize the K-moduli space of degree one del Pezzo surfaces through explicit wall-crossings.

comments
38 pages, 3 tables, 1 figure; comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.10415 ↗

In arXiv:2409.03960 an approach to the question of extendability of projective varieties via degeneration to ribbons was introduced, and in arXiv:2503.12661 it was used to give a new proof of optimal results on the extendability of general non-prime $K3$ surfaces and the classification of non-prime Fano threefolds. In this article we treat the prime case. We give a new proof of the optimal results on the extendability of general prime $K3$ surfaces of every genus, of the classification of prime Fano threefolds of Picard rank one due to Fano, Iskovskikh and Mukai, and of the irreducibility of their Hilbert schemes. This involves degenerations of $K3$ surfaces to ribbons on embedded rational normal scrolls, called $K3$ carpets. We compute exactly the cohomology of the twisted normal bundle of these $K3$ carpets, instead of computing coranks of Gaussian maps of the canonical curve sections. The key challenge is to analyze the coboundary map of the sequence relating the normal bundle of the $K3$ carpet to the normal bundle of the scroll. We give a deformation theoretic interpretation of this map. Given such a $K3$ carpet and its hyperplane section, which is a canonical ribbon, we show that the coboundary map corresponds to the obstruction to lifting a first order deformation of the underlying scroll fixing the underlying rational normal curve to a first order deformation of the $K3$ carpet fixing the canonical ribbon. To compute the obstruction, we use a result on extensions of non-split ribbons on any curve to a unique $K$-trivial carpet in a canonical way.

comments
34 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.10426 ↗

The goal of this article is the classification of affine bundles with fixed linearisation type over a compact complex manifold $X$. More precisely, let $E$ be a fixed holomorphic vector bundle over $X$ and $\mathcal{E}$ the associated locally free sheaf. We will assume that there exists an effective divisor $D$ on $X$ such that $H^1(X,\mathcal{E}(D))=0$. This condition is always satisfied when $X$ is a projective complex manifold. We define in a natural way the moduli stack of affine bundles on $X$ whose linearisation is isomorphic to $E$, and we prove that this moduli stack is isomorphic to the quotient stack $\big[H^0(X,\mathcal{E}(D)_D)/H^0(X,\mathcal{E}(D))\ltimes \mathrm{Aut}(E)\big]$ of the complex vector space $H^0(X,\mathcal{E}(D)_D)$ by the semi-direct product of the automorphism group $\mathrm{Aut}(E)$ (which is always an affine algebraic group) by the complex vector space $H^0(X,{\cal E}(D))$. Our isomorphism is obtained by constructing explicitly comparison functors $\mathscr{A}$, $\mathscr{T}$ between the two stacks and explicit natural isomorphisms $\mathscr{A}\circ\mathscr{T}\stackrel{\simeq}{\longrightarrow} \mathrm{id}$, $\mathrm{id} \stackrel{\simeq}{\longrightarrow}\mathscr{T}\circ\mathscr{A}$.

comments
24 pages
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.10879 ↗

The Colliot-Thélène conjecture on quadratic forms asserts that any rationally isotropic nondegenerate quadratic form over a semilocal regular domain with $2$ invertible is isotropic. We prove the Colliot-Thélène conjecture for semilocal regular domains that are geometrically regular over a discrete valuation ring with $2$ invertible. In particular, this includes unramified regular local rings of mixed characteristic $(0,p)$, where $p\neq 2$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.10978 ↗

We establish a Lefschetz alternative for real characters on smooth complex quasi-projective varieties, extending Simpson's classical theorem beyond the compact Kähler setting. More precisely, for a nonzero real character of the fundamental group of a smooth connected complex quasi-projective variety, either the character factors through a holomorphic fibration onto a Riemann orbifold with connected general fiber, or every level set of an associated primitive function on the corresponding covering is connected and its inclusion induces a surjection onto the fundamental group of the covering. Our approach combines logarithmic holomorphic $1$-forms with a geometric flow construction to overcome the difficulties arising from noncompactness. Meanwhile, we prove a quasi-projective analogue of the Napier–Ramachandran theorem, showing that an epimorphism onto $\Z $ whose kernel is not finitely generated must factor through a hyperbolic Riemann orbifold. As applications, we derive several new restrictions on the structure of quasi-projective groups.

fields
Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2611.11195 ↗

For a bounded coherent complex of graded modules over the Raynaud ring $R$, we compare three descriptions of finite torsion: Ekedahl's pieces $A_f^2$ and $A_{\SSpart}^1$ of the biduality filtration, the nilpotent and semisimple parts of the torsion of the Illusie–Raynaud cœur, and the corresponding parts of the finite torsion $t^1$ of Ekedahl's diagonal cohomology. We show that finite torsion in bidegree $(0,i+1)$ measures the failure of the $i$th flat Artin–Mazur formal group to be smooth; we deduce that all flat Artin–Mazur formal groups of a Mazur–Ogus variety are smooth. For a smooth projective surface, we identify the three possible dual pairs in terms of the $p$-primary torsion of the geometric Néron–Severi group and the local-local and local-étale parts of the finite Picard quotient.

comments
14 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.11269 ↗

Let $Y$ be the product of a minimal resolution of a binary dihedral surface singularity with an equivariant line, with volume-preserving scalar action. We identify its stable equivariant descendant Gromov–Witten theory and its free energies in genus at least two with the sign-sector topological recursion of the degenerate type-$D$ relativistic Toda spectral curve. The $R-$matrix calibration is determined at a partial large-radius limit, where the trivalent exceptional curve retains a nonzero Kähler parameter, while the remaining parameters vanish. The limiting theory on the mirror side is a sum of twisted point theories and the local $(-2,0)$ curve theory. Moreover, we identify the equivariant K-group supported on the surface zero section with an integral relative homology group of the mirror. Explicit cycles for the dual tautological bundles realize their Gamma central charges and all stable Gamma-framed descendants.

fields
Algebraic Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.11300 ↗

We classify complex nilmanifolds of dimension three by describing the Teichmüller and moduli spaces of left-invariant complex structures for every real six-dimensional nilmanifold.

fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.11407 ↗

Let $Φ:D^b(X)\to D^b(Y)$ be a derived equivalence between smooth projective complex varieties, and let $h=c_1(L)$ for an ample line bundle $L$ on $X$. For $z\in\mathbb{C}$, transporting the cup-product action and evaluating at $e^{zh}$ gives a homomorphism of graded algebras $Θ^\bullet_{F,z}:H^\bullet(Y,\mathcal O_Y)\to H^\bullet(X,\mathcal O_X)$, where $F$ is the cohomological transform of $Φ$. We prove that $Θ^\bullet_{F,i}$ is an isomorphism in degrees one and two. In particular, $X$ and $Y$ have the same number of holomorphic two-forms. The proof in degree two uses the Hodge-Riemann bilinear relations on $X$ and on $X\times X$. We also prove derived invariance of all Hodge numbers when $K_X$ is trivial and the conjugate of a holomorphic volume form belongs to the subalgebra of $H^\bullet(X,\mathcal O_X)$ generated in degrees one and two. In even dimension, the evaluation isomorphism allows us to compare the ranks of cup product by powers of symplectic two-forms on the Hochschild diagonals. These ranks determine the Hodge numbers individually.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.11708 ↗

We prove the 0-cycle form of the generalized Bloch conjecture for smooth projective models of subgroup quotients of multiple double covers of projective space, with smooth branch hypersurfaces and reduced simple normal crossings branch divisor. Our integral character criterion yields, in every dimension at least four, simply connected varieties of general type with 0-cycle Chow group \(\mathbb{Z}\), canonical volume four, and no birational product decomposition. We also determine optimal integral supports for componentwise product quotients and character decompositions of degree zero Chow groups. Within this covering class, we classify the minimum volume models and compute their pluricanonical map degrees.

comments
30 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.11829 ↗

Let $X$ be a smooth variety over a field $k$ of characteristic 0. We show that (two versions of) the Zariski sheaves of regular $k$-linear logarithmic differential forms on $X$ (in the most naïve sense, i.e. sums of products of logarithmic differentials) have Gersten property (and therefore coincide). It turns out that the values of these sheaves are free abelian groups. As a consequence, for any integer $n>0$, these sheaves modulo $n$ also have Gersten property. The proof is an elementary application of the Voevodsky's $(-1)$-machinery and consists of assembling several well-known results.

comments
8 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.11933 ↗

We give a criterion for the contracted product $E \times^G X$ to have a singular Picard scheme, where $E$ is an elliptic curve, $G \subset E$ is a finite subgroup scheme, and $X$ is a projective $G$-normal curve, in the sense of Brion. We show that every smooth projective surface with a singular Picard scheme and a positive-dimensional automorphism group scheme arises in this way. We also illustrate the criterion by constructing two new families of surfaces with singular Picard schemes, arising from $G$-normal curves $X$ for $G = \mathbb{Z}/p\mathbb{Z}$ and $G = \boldsymbolα_p$, respectively. As a special case of $G = \mathbb{Z}/2\mathbb{Z}$, we recover Igusa's classical example. Finally, we compute all infinitesimal group schemes which appear as $\operatorname{Pic}^0_S/(\operatorname{Pic}^0_S)_{\mathrm{red}}$ for all (quasi)-bielliptic surfaces $S$. This completes the description of the singular Picard schemes of smooth projective surfaces of Kodaira dimension zero.

comments
Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12201 ↗

We prove that the canonical derivative of the Fano normal function has rank ten at the Fermat cubic threefold. This yields a direct proof of its generic maximal rank, a result also implied by a general theorem of Gao–Zhang. Our approach combines Hain's equivariance principle with an explicit representation-theoretic computation and the nonvanishing of the Griffiths infinitesimal invariant established by Collino–Naranjo–Pirola.

comments
15 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12276 ↗

We determine the minimum higher Milnor and Tjurina numbers of isolated complex polynomial singularities with fixed ambient dimension and multiplicity. A Fermat polynomial of multiplicity $m$, perturbed by the $(m+1)$-st power of a linear form, attains both minimum sequences at every order. These values remain the minima at each prescribed total degree $d>m$; the homogeneous case $d=m$ has a separate Tjurina formula. The proof expresses the Tjurina defect through multiplication in the filtered Milnor algebra and uses the monomial strong Lefschetz theorem to attain the resulting rank bound. We also determine the associated graded higher Tjurina algebras of this family and show that they are unchanged by terms of order at least $m+2$.

comments
24 pages
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.12289 ↗

Over an algebraically closed field of characteristic five, we prove that a log del Pezzo surface of Picard rank one contains no cylinder if it is not log liftable. We also characterize Du Val del Pezzo surfaces that contain no cylinder in positive characteristic.

comments
Comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12341 ↗

In this article, we connect the local Lipschitz geometry of a normal surface singularity with a rational homology sphere link to the analytic semigroup $S_{an}(\tilde{X})$ associated with a convenient resolution. Under certain restriction, we provide an explicit computational characterization of the Lipschitz rate $q_v$ associated with an irreducible exceptional curve $E_v$ in terms of the semigroup. We also show that removing the restriction we get examples when $q_v$ cannot be determined from the semigroup. Interestingly enough, this phenomenon already happens for rational singularities. Indeed, we exemplify that the inner rates of rational singularities are not topological.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12380 ↗

We describe the module of logarithmic derivations along the discriminant of a stable polar representation of a reductive algebraic group. It splits into derivations along the fibres of the quotient map and a free summand lifted from logarithmic derivations along the associated branch divisor. This gives a uniform extension of previous results on full adjoint discriminants. We prove that, for visible stable polar actions of semisimple groups with finite generic stabilizer, the discriminant is a free divisor. For stable periodic gradings of arbitrary order with semisimple degree-zero group, we construct explicit Saito matrices from the infinitesimal action and the gradients of basic invariants, which yields determinantal equations for several exceptional discriminants. In particular, starting with exceptional Lie algebras, we provide examples of free discriminants of degrees 60, 120, 126 and 240 for inner gradings and a degree-72 example for an outer one.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12413 ↗

We effectively compute all intersection numbers of the form $λ_gψ^d$ on moduli spaces of genus $g$ admissible covers with one point of full ramification and two additional branch points with arbitrary profile. We encode these invariants in appropriate generating functions, which we relate to the Hamiltonians of the KdV hierarchy.

comments
48 pages + appendices, 10 figures
fields
Algebraic Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.12450 ↗

Building on Bryan–Katz–Leung, Hua–Toda and Kawamata, we study deformations of contraction algebras and the local geometry of the scheme of associative algebra laws. Let $A$ be the basic contraction algebra of a completed projective flopping contraction of a smooth complex threefold. We construct a finite free polynomial family that is constant and semisimple away from the origin, with the original curve projectors fixed. For each restricted positive root $β=(β_i)$, with coordinates indexed by the retained vertices, the split generic fibre has $n_β$ matrix blocks of size $\sum_iβ_i$, and the labelled projector $e_i$ has rank $β_i$ on each block. Here $n_β$ is the corresponding genus-zero Gopakumar–Vafa invariant. If the geometric generic fibre of a finite free associative formal deformation of $A$ is semisimple, it has the same matrix factors, and any lifts of the original projectors have the same ranks on those factors. The scheme of associative algebra laws is smooth at $A$. The closure of the corresponding semisimple orbit is its unique irreducible component through $A$. The proof uses the curve divisors of Katz–Morrison and Nabijou–Wemyss, presentations of the universal contraction quotient and its cocenter, and the orbit method of Jelisiejew–Smoktunowicz. These presentations prove the geometric Hua–Toda flatness assertions. In the geometric families considered here, the relative contraction algebra, its centre and its cocenter are finite free over arbitrary complete Noetherian local complex bases. On a smooth open neighbourhood of $A$ in the scheme of algebra laws, the centres and cocenters form dual vector bundles compatible with arbitrary base change. For the type $D$ algebras $D_{n,2}$ with $n\ge2$, the centre morphism gives counterexamples to the smoothness assertion in Conjecture 1.4(2) of Jelisiejew–Smoktunowicz.

comments
99 pages, 2 figures. Computational code is included as ancillary files
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12490 ↗

We prove a local cohomological bound $RΓ_{\mathrm{pro\acute et}}(X,\mathcal F)\in D^{[0,\dim X]}$ for a pro-étale sheaf with a derived $p$-complete integral lattice whose modulo $p^m$ reductions are filtered colimits of finite local systems on an affinoid topologically of finite type over $C$. For $G=\mathrm{GL}_n(F)$, with $n\geq2$ and $F/\mathbb Q_p$ finite, we apply these local bounds to variants of Scholze's Jacquet–Langlands functor $\mathrm{JL}_\mathscr{B}(Π):= RΓ_{\mathrm{pro\acute et}}(\mathbb{P}^{n-1}_C,\mathcal{F}_Π\otimes^{L, \square}_{\mathbb{Q}_p}\mathscr{B})$ for $\mathscr{B}\in\{\mathbb{Q}_p, \widehat{\mathscr{O}}, \mathbb{B}_J\}$ and Banach or compact-type LB representations $Π$ of $G$, obtaining $\mathrm{JL}_{\mathscr{B}}(Π)\in D^{[0,2(n-1)]}$ for each choice of $\mathscr{B}$. We also prove that for arbitrary continuous principal series $I(η)=(\mathrm{Ind}_B^Gη)^{\mathrm{cont}}$, we have $\mathrm{JL}(\mathrm{Ind}_B^Gη)\in D^{[0, n]}$, while $\mathrm{JL}_{\widehat{\mathscr{O}}}(I(η)),\mathrm{JL}_{\mathbb{B}_J}(I(η))\in D^{[0, n-1]}$.

comments
35 pages, no figures
fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.12608 ↗

We disprove three conjectures appearing in Van den Bergh's plenary ICM survey, posed by De Deyn and Van den Bergh, which concern the interplay between non-commutative crepant resolutions (NCCRs) and the stringy Euler characteristic. Our counter-examples are applications of a new McKay correspondence for reductive groups that we prove in this paper, extending the classical McKay correspondence for finite groups. We obtain explicit formulas for the stringy $E$-functions of reductive quotients in terms of the Weyl group action and stringy $E$-functions of toric varieties; we also obtain an equivalent formula expressed as an integral of the age function over Weyl-fixed loci of a compact real torus. For symmetric representations, our expressions are related to arithmetic Tutte polynomials, yielding combinatorial formulas for the stringy Euler characteristic.

fields
Algebraic Geometry, Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.12679 ↗

We prove that the pluricanonical map of a complex projective threefold of general type with canonical singularities and positive geometric genus is birational in every degree at least fourteen. The bound is sharp.

comments
39 pages, comments are welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12717 ↗

We study the perfect loop space $LX$ of a proper scheme $X$ over a local field $F$. We show that if $X$ contains a rational curve, then $LX$ is not ind-representable, even in a very weak sense. We also show that if $X$ admits a proper model $\mathfrak{X}$ over the integers $\mathcal{O}$ of $F$, whose geometric special fiber does not contain rational curves, then $L^+\mathfrak{X} \stackrel{\sim}{\to} LX$ is an isomorphism via the natural map, where $L^+\mathfrak{X}$ denotes the perfect positive loop space (jet scheme) of $\mathfrak{X}$. In particular, $LX$ is a scheme in this case.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12719 ↗

We give proofs of Hodge semiampleness and b-semiampleness without using o-minimality. We establish a geometric semiampleness criterion for line bundles on proper algebraic spaces. Let $(X,D)$ be a log smooth pair with $X$ a proper algebraic space. For an integral polarizable pure variation of Calabi–Yau type on $X\setminus D$ with unipotent local monodromy, let $L$ be its extended highest Hodge line. If $L$ is numerically integrable and has torsion combinatorial monodromy, then $L$ is semiample. We also prove semiampleness of extended Griffiths lines. We construct normal projective period compactifications on which a positive power of the Griffiths line extends to an ample line bundle. As an application, we prove that the moduli b-divisor $\mathbf{M}$ of a projective lc-trivial fibration over a normal algebraic variety is b-semiample, provided that the generic boundary is effective. Suppose further that the geometric generic pair is klt and its boundary is big, with nonzero coefficients in a fixed finite set $I\subset(0,1)\cap\mathbb{Q}$. Then $c\mathbf{M}$ is b-Cartier and b-free for an integer $c>0$ depending only on the relative dimension and $I$. We extend b-semiampleness to analogous projective fibrations over normal complex analytic bases, assuming a global relative polarization and an invertible log pluricanonical sheaf pulled back from the base.

comments
57 pages. All comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12744 ↗

We introduce the formalism of cluster models, a class of log Calabi-Yau varieties obtained from smooth quasi-affine toric varieties by iterated affine blowups along non-toric codimension 2 centers determined by a really full rank quiver. Cluster models include the truncated cluster varieties of Gross, Hacking, and Keel with respect to really full rank quivers, all really full rank acyclic cluster varieties, and all open toric subvarieties of $\mathbb{C}^n\times(\mathbb{C}^*)^m$. We then construct mirrors to cluster models via iterated Weinstein handle attachments to toric mirrors, so that the corresponding skeleta acquire compact pieces, and we prove homological mirror symmetry for all cluster models, compatibly with freezing, deleting, and contracting vertices of the quiver. This extends toric mirror symmetry and its naturalities beyond the cotangent bundle. In particular, we obtain homological mirror symmetry for all really full rank acyclic cluster varieties. We develop this package with a view towards conjectures of Marsh, Rietsch, and Williams about mirror symmetry for Grassmannians and closed positroid varieties. Motivated by these, we also conjecture that open positroid varieties are self-mirror. Assuming a natural ansatz, we prove this for a class of positroid varieties that includes nontrivial cells in every Grassmannian and all cells in finite-type Grassmannians. Towards this end we introduce a new combinatorial input, the notion of weak $k$-booleanness for permutations and braids.

comments
54 pages, 8 figures. Comments welcome!
fields
Algebraic Geometry, Combinatorics, Representation Theory, Symplectic Geometry
pdf ↗ page arXiv:2611.12751 ↗

We prove the sharp lower bound $vol(X) \geq 1/420$ for every smooth complex projective threefold $X$ of general type.

comments
118 pages, comments are welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12786 ↗

We prove motivic mirror symmetry for full-rank sink-recurrent cluster varieties. We allow skew-symmetrizable principal parts and invert all frozen variables. The rational geometric motive of such a variety is isomorphic to the additive orbifold motive of the mirror stack of Hu and Shende. This gives comparisons of cohomology, higher Chow groups, and algebraic $K$-theory with rational coefficients. The proof combines quantum deformation with the splitting of these motives into Tate summands. For really full-rank skew-symmetric seeds, a finite étale morphism realizes the comparison. We also study this geometric comparison in families over the projective line.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.12863 ↗

Statistics Theory25

We consider the problem of estimating a small probability $p = P(X \in A)$ by importance sampling with auxiliary density $g$, where $X$ is drawn according to some density $f$. We establish a simple necessary and sufficient condition for the consistency of the importance sampling estimator in triangular schemes where the dimension, the densities $f$ and $g$ and the set $A$ may evolve. It allows to refine the results of Chatterjee and Diaconis [Ann. Appl. Probab. 28 (2018), no. 2, 1099-1135] by establishing the exact minimal sample size required for consistency. Moreover, it allows to study the regime $p \to 0$ which, despite being the relevant mathematical regime for rare-event estimations, has received very little attention so far. We perform an in-depth study of the hyperplane case $A = \{x: x^\top u \geq α\}$ with Gaussian densities, showing that in this case, the optimal importance sampling density considerably improves consistency compared to the standard Monte Carlo estimator. However, we conclude the paper with moment considerations which suggest that, whenever the Monte Carlo and optimal importance sampling estimators both converge, convergence may occur faster for the Monte Carlo estimator.

fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.10094 ↗

We study variational inference in the presence of distributional symmetry, focusing on the interaction between two distinct group actions on a sample space: a symmetry action that leaves a reference distribution invariant, and a transport action that generates a parametric variational family by pushforward. By analyzing the algebraic structure of the total transformation group generated by both actions and the induced adjoint representation of the symmetry group on the transport Lie algebra, we establish that the Riemannian gradient of the Kullback–Leibler divergence at the true transport parameter is constrained to lie in the trivial representation of the symmetry group. Consequently, symmetry forces the gradient to vanish along all non-trivial representations. Combining this representation-theoretic constraint with parameter identifiability yields an orthogonal decomposition of the transport Lie algebra into three interpretable subspaces: an identifiability kernel (along which the objective is locally constant), a bias subspace (where the gradient may be nonzero due to model misspecification), and a symmetry-breaking subspace (where the gradient is forced to vanish by symmetry alone). Finally, we characterize the residual bias directions in terms of distributional mismatch between the base model and the standardized target, and derive an explicit Stein-type moment-matching condition that eliminates this bias, extending the location-scale results of (Margossian and Saul, 2025) to general Lie group transformation families.

fields
Statistics Theory
pdf ↗ page arXiv:2611.10111 ↗

We study robust estimation of elliptical factor models with abnormal observations and without requiring the existence of any positive moments. In particular, a divide-and-conquer (DC) estimator averages orthogonal projectors onto the full column spaces of small data blocks, and we rigorously establish its probability bound that allows weak and heterogeneous factors. The derived convergence rate is comparable to that of classical principal component estimators, up to the proportion of anomalies. Building on our DC estimator, we propose a split-sample tail- and anomaly-robust (STAR) estimator for the factor number using sample medians of successive projected coordinate ratios, which is shown consistent under mild conditions. Subsequent factor and common component estimation is also discussed, with the rates of convergence spelled out. Remarkably, given an upper bound on the true factor number, our suite of procedures are free from tuning, require no tail-dependent truncation threshold nor solving an optimization problem, admit parallel block computations, and hence has the same computational complexity as the classical principal component methods. Extensive experiments corroborate our theoretical findings, where DC and STAR are comparable and often outperform state-of-the-art competitors. We also illustrate our methods on a portfolio return dataset.

comments
55 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.10358 ↗

Many scientific responses take values in Riemannian manifolds, with predictors that are scalar- and/or manifold-valued. A regression analysis in such settings must provide accurate prediction with hypothesis testing for individual coefficients. Yet no current manifold-regression framework accommodates both predictor types and enables per-coefficient hypothesis tests. We propose Riemannian Ordinary Least Squares (ROLS) as a tangent space conditional-mean model, which is the ordinary least squares (OLS) analogue for Riemannian manifolds. ROLS is well-defined under an explicit injectivity condition that keeps the logarithm maps single-valued, with cut-locus conditions for branch-sensitive cases outside it. Within the local geometric setting it admits a closed-form estimator, an $O(n^{-1})$ excess prediction-error bound with explicit curvature bias, and asymptotic $t$- and Wald tests for individual coefficients. With synthetic simulations and three real-data case studies, ROLS is shown to be competitive with the state-of-the-art baselines. In addition, the per-coefficient tests agree with effects reported in literature. We envision ROLS to be a standard tool for manifold-valued regression with coefficient-level inference to support scientific discovery, which can be interpreted in the same way as Euclidean OLS. The source code is available at https://github.com/XiaoyuChenPub/ROLS.

journal
Xiaoyu Chen, Yujing (Zipan) Huang, Yingyan Zeng. Riemannian Ordinary Least Squares. Advances in Neural Information Processing Systems (NeurIPS), 2026
fields
Statistics Theory
pdf ↗ page arXiv:2611.10459 ↗

We study group-conditional conformal risk control (CRC) for disjoint and overlapping groups under bounded monotone losses. For disjoint groups, we establish exact finite-sample conditional risk control, two-sided bounds on the group-restricted risk, and fundamental limitations arising from local support and calibration-rank granularity. For overlapping groups, we study two exactly valid approaches: group-restricted calibration followed by union deployment, and direct calibration of the deployed prediction-set family. We characterize the union's limiting reconciliation gap, identify conditions for its disappearance, and establish sharp lower bounds for structured losses in specified product-form models. We also demonstrate a strict size advantage for direct calibration in an ordinal model. Experiments show that direct calibration can reduce prediction-set size, but its efficiency depends on group structure, loss type, and shape fitting. Results on historical diabetic-retinopathy scores further illustrate these tradeoffs. Overall, local support, reconciliation slack, and threshold heterogeneity determine efficiency, with neither approach uniformly dominating.

comments
68 pages, including 40 pages of appendices
fields
Statistics Theory
pdf ↗ page arXiv:2611.10472 ↗

Let $C$ be a uniformly sampled $n$-element subset of a finite population $D$ of size $N$, and let $U_C$ be the complete U-statistic of order $k$ built from a bounded kernel on the $k$-subsets of $D$. We prove a product inequality for the uniform distribution on $\binom{D}{n}$ and deduce from it the comparison $ \log \mathbb{E}\left[e^{θ(U_C-\mathbb{E}U_C)}\right] \le \frac{n}{k}\log \mathbb{E}\left[e^{\frac{kθ}{n}(Y-\mathbb{E}Y)}\right]$, where $Y$ is a single kernel value taken at a uniformly sampled $k$-subset of $D$. This yields Hoeffding, Bennett and Bernstein inequalities for $U_C$ with effective sample size $n/k$ in place of the $\lfloor n/k\rfloor$ available so far. The gain is negligible when $n$ is much larger than $k$, but it approaches a factor of two in the exponent when $k$ is close to $n$.

comments
8
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.10551 ↗

We consider the problem of sequential anomaly identification with sampling constraints, where multiple independent data sources are observed over time, but only a limited subset can be sampled at each instant. The objective is to identify the anomalous sources while controlling the probabilities of at least one false alarm and at least one missed detection below prescribed levels. An identification policy must jointly determine when to stop sampling, which sources to declare anomalous, and how to allocate observations across sources under the sampling constraints. We seek policies that minimize the expected time to decision to a first-order asymptotic approximation as the error probabilities vanish. The observations from each source follow an unknown density belonging to one of two disjoint sets, corresponding to regular and anomalous behavior. Focusing on a nonparametric framework, which allows greater flexibility in modeling regular and anomalous statistical behavior, we establish general conditions for asymptotic optimality and provide a unified characterization of asymptotically optimal policies for composite hypothesis testing under sampling constraints. Simulation results illustrate the performance of the proposed policies, and the robustness of the nonparametric framework.

comments
64 pages, 9 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.10921 ↗

Blinded sample size re-estimation aims to mitigate uncertainty in nuisance parameters at the design stage while preserving the integrity of the trial. It allows the required sample size to be updated without revealing treatment assignments and thereby reduces the risk of an inappropriate sample size. Although numerous procedures have been proposed for different outcome types, a unified framework is still lacking. We therefore develop a general framework for blinded sample size re-estimation based on nuisance parameters. Within this general framework, we develop robust methods to reduce the influence of extreme observations. The proposed framework combines asymptotically linear estimators for the parameter of interest with robust Z-estimators for nuisance parameters, thereby unifying a broad class of existing procedures through different choices of estimating functions. We also propose a general principle for constructing nuisance parameters that can be estimated from blinded data. The proposed framework is supported by asymptotic theory showing that the type I error rate converges to the nominal level under regularity conditions. Simulation studies demonstrate that the proposed method maintains reliable type I error control across a range of settings, including contaminated data and small pilot sample sizes. Compared with existing blinded and unblinded methods, the proposed framework is more flexible and less sensitive to outliers. A clinical trial application illustrates its practical utility.

comments
47 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2611.10957 ↗

A financial market can appear mainly dependent on its own shocks under a variance account and mainly dependent on external shocks under a cumulative-response account. We establish how these opposite diagnoses arise from the same propagation system. For a given cumulative magnitude, squaring gives greater weight to responses concentrated across sources and time. Source priorities can therefore reverse even in stable Gaussian systems with known parameters. Heavy tails raise a separate question: whether the reported shares have a fixed population basis. One innovation with an infinite second moment removes the full network's finite covariance input. We characterize when normalized shares nevertheless stabilize and construct rank-amplitude connectedness, a cumulative-deviation target without finite first or second moments. It can be consistently estimated under local dependence and identification conditions. With fitted dynamics and rank scatter fixed, changing attribution replaces 3.14 names in the daily Top 10 of forty stocks, selecting recipients with greater external persistence relative to their own adjustment. In five futures contracts, mean external share rises from 28.0% to 55.9%, and 70.9% of recipient-dates switch from own to external dominance.

fields
Statistics Theory
pdf ↗ page arXiv:2611.11350 ↗

Many $U$-statistics of row-column exchangeable arrays become degenerate at natural null hypotheses: their convergence rates change and their limiting laws may or may not remain Gaussian. We establish conditions under which inference based on the classical unbiased variance estimator is uniformly valid across these changes, without knowledge of the degeneracy order. It is known that $U$-statistics can be decomposed into orthogonal projections indexed by bipartite graphs. Under uniform fourth-moment assumptions, we establish that the standardized statistic is asymptotically Gaussian and the classical unbiased variance estimator is ratio-consistent, as long as a certain measure of concentration for projections indexed by disconnected graphs tends to zero. Under compactness of the normalized projections, both properties hold if and only if the proportion of variance contributed by disconnected graphs tends to zero. The necessity of this condition follows from a general limit theorem for these $U$-statistics, in which each graph contributes to a Wiener chaos of order equal to its number of connected components. We note that the row-column jackknife variance estimator, although nonnegative, does not generally give a studentized statistic with a standard normal limit in degenerate regimes. We illustrate our theory with an application to estimation and testing based on a distance from product form, exhibiting Gaussian and non-Gaussian limits at various rates depending on the model. We also propose a conservative inference procedure that does not require a Gaussian limit, valid under additional moment and projection conditions.

fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.11388 ↗

We study semi-supervised estimation of the full-lifetime Mann-Whitney probability under right censoring using finite covariate-only samples from two populations. A model-assisted estimator is constructed by adjusting censored pair comparisons with differences between labeled and auxiliary feature means. Resource weights minimize first-order variance within the working projection class. Under joint independent censoring and regularity conditions, we establish consistency and asymptotic normality through a four-pool influence representation that accounts for censoring distributions estimated from the same labeled records. Consistent variance estimation from all four sample pools yields Wald confidence intervals. The efficiency analysis relates variance reduction to projected comparison signals and auxiliary sample sizes and characterizes the gap to the semiparametric bound. A fixed-horizon extension accommodates half-weighted ties and the terminal mass induced by capping follow-up. Simulations show increasing precision gains with auxiliary sample size under moderate or strong projected signals, with finite-sample losses in some settings with zero or weak projected signals. A five-year Rotterdam breast-cancer comparison illustrates precision gains and variability across label allocations when auxiliary samples are formed by controlled outcome withholding.

fields
Statistics Theory
pdf ↗ page arXiv:2611.11456 ↗

Gaussian processes form a popular and flexible class of prior distributions with principled uncertainty quantification, but the Gaussian likelihood on which the corresponding posterior relies makes them highly sensitive to outliers and contaminated observations. We study Gaussian process regression when among the $n$ observations, $m$ of these are possibly contaminated. A generic framework to obtain posterior contraction rates in this setting is considered, from a frequentist perspective as the sample size $n$ and the number of corrupted observations $m$ grow. We adopt a generalized Bayes approach in which the log–likelihood is replaced by a robustified version; we discuss various choices thereof, such as one recently proposed by Altamirano et al. that preserves conjugacy. We investigate the minimax rate of estimation under adversarial contamination in terms of the Sobolev smoothness $β$ of the regression function and $m$. The question of building adaptive procedures to both $β$ and $m$ is investigated, and we show that a polynomial loss for adaptation must be paid in general. We instantiate our results for Matérn Gaussian process and deep ReLU network priors. Numerical experiments for existing and new robust algorithms are provided, illustrating the practical applicability of our results.

comments
87 pages, 8 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.11582 ↗

This paper studies the detection of an impulsive fault of unknown time and input channel in a linear system with unknown initial state and Gaussian measurement noise. First, we show that the generalized likelihood ratio test, after the initial state is eliminated by projection onto the parity space, is the zero-solution test of a weighted lasso with an unpenalized nuisance block; the regularization parameter is the test threshold, and for unknown noise variance the same holds for the square-root lasso. Second, we show that the null distribution depends on the system only through a Gram matrix, so that the threshold is computed exactly and offline, and we compare it with closed-form bounds. Third, we characterize the fraction of a fault that survives the projection: we give it in closed form through observability Gramians, we show that it converges to a geometrically decaying profile for strictly stable systems, and that, for systems with unit-modulus modes, it grows linearly with the fault time as a fraction of the record length. Numerical studies, including a two-input, two-output example, illustrate the results.

comments
10 pages, 6 figures. Extended version of a paper submitted to ECC 2027
fields
Statistics Theory
pdf ↗ page arXiv:2611.11625 ↗

We study the problem of learning directed acyclic graphs from observational data in nonlinear models and provide finite-sample, nonasymptotic statistical guarantees in these models. Although widely studied, statistical guarantees for gradient-based methods in nonlinear models are missing from the literature. Under a generalized linear model for each node, we analyze a global nonsmooth objective combining an exact acyclicity constraint with a quasi-minimax concave penalty, which can be optimized via standard gradient-based solvers. We establish finite-sample guarantees under this model, including the most widely used logistic and Poisson models. Experiments corroborate structure recovery accuracy and computational performance, including both standardized data and negative controls as baselines.

fields
Statistics Theory
pdf ↗ page arXiv:2611.11667 ↗

Local and Bayesian approaches to optimal experimental design specify information about the regression parameters through a nominal value and a prior distribution, respectively. A practical question is whether accounting for parameter uncertainty justifies replacing a locally optimal design. We investigate when locally D-optimal designs remain Bayesian D-optimal in single-factor Poisson, gamma and logistic regression on the unit interval. Analytical arguments and numerical comparisons under normal and uniform slope priors examine how prior form and dispersion affect the optimal support and the Bayesian D-efficiency of retaining a local design.

comments
10 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2611.11785 ↗

Symmetry can reveal the structure of a signal, but detecting it becomes difficult when observations are noisy and randomly transformed. We study how to infer symmetry directly from multi-reference alignment data with additive isotropic Gaussian noise of known variance, without aligning the observations or knowing how the transformations were sampled. For cyclic symmetry, we identify a simple statistical signature that yields tests with exact finite-sample error guarantees. We demonstrate their performance even at very low signal-to-noise ratios. Dihedral symmetry presents a deeper challenge: we show that, for some signals, invariant moments below a sharp order threshold cannot distinguish reflectional from purely rotational symmetry. For generic signals, however, this distinction emerges much earlier. We use these insights to develop tests for dihedral symmetry with asymptotic error control under explicit nondegeneracy conditions. Together, the results clarify what we can learn about symmetry from noisy, unaligned data and suggest a path toward symmetry inference in cryo-EM.

fields
Statistics Theory
pdf ↗ page arXiv:2611.11872 ↗

Log-optimal e-variables at fixed horizons, also called numéraires, have been conjectured to ``almost'' form an e-process for exponential-family null hypotheses. A related open question is whether an e-process can attain the optimal e-power at every horizon up to a bounded loss. Given a final horizon, we study the minimax regret of e-processes relative to the numéraires at all times up to it. For the Gaussian location null and the composite alternative of Gaussian distributions with a smaller variance and an unknown location, we show that the minimax regret in the worst case over the location grows like the iterated logarithm of the final horizon. A single e-process attains this rate at every horizon. This growth answers the question negatively. It also refutes the conjecture if ``almost'' means a regret bounded uniformly over horizons. For this Gaussian location problem, we thus exhibit the frontier precisely: the minimax regret is bounded if and only if the alternatives have at least the variance of the null.

comments
9 pages + 18 appendix; AI-generated Lean formalization available at https://adriencorenflos.github.io/formalization/log-optimal-e-processes, with discussion in the appendix
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.11874 ↗

We study conditional coverage and geometric efficiency of conformal highest-density sets. The excess volume of such a set over the conditional highest-density set, the smallest set with the required conditional coverage, splits into a coverage error and an excess mass. We show that, among procedures whose volume is accurate up to a constant, the coverage error has the minimax rate of nonparametric regression on the covariate, and that the excess mass has the squared minimax rate of conditional density estimation. The usual split conformal construction calibrates these sets with a single threshold, which corrects the bias of the density estimate only on average over the covariate. We prove that its coverage error can then be of the order of the slower density rate. We therefore propose two-stage calibration, which estimates the coverage of the super-level sets of a density estimate by a regression on the covariate and uses this estimated coverage as the conformity score. Since these sets are fixed at each covariate value, their coverage is as smooth as the conditional density, and, under mild regularity conditions, the coverage error attains the regression rate even when the density estimate is inconsistent. The shape of the set still depends on the accuracy of the density estimate: sup-norm accuracy controls it at the minimax excess-mass rate, whereas accuracy in an integrated norm, even of minimax order, does not. With a local polynomial density estimate, two-stage calibration attains both minimax rates up to logarithmic factors. Simulations and an application to bike-sharing demand illustrate the results.

fields
Statistics Theory
pdf ↗ page arXiv:2611.11909 ↗

Feature subsampling is used to accelerate gradient-boosted trees, yet standard approaches fix the feature count in advance and largely ignore the split-gain evidence accumulated during training. We introduce CRAFT-GBM (Confidence-Ranked Adaptive Feature Tracking), a native LightGBM extension that uses this evidence to adapt which—and, by default, how many—features are searched each boosting round. CRAFT-GBM transforms root-split gains into bounded observations and constructs joint time-uniform bounds valid under adaptive, non-stationary training histories. In its default endogenous mode, after initialization, CRAFT-GBM retains exactly the features that cannot yet be ruled out as best, letting the selected feature-set size $K_t$ emerge from training history rather than a pre-specified fraction. With probability at least $1-δ$, every feature with the largest expected gain is retained jointly across all rounds after initialization. When a feature fraction $f$ is specified instead, CRAFT-GBM ranks features by their interval point estimates and provides an approximate top-$K$ guarantee for feature budget $K_f$. We implement CRAFT-GBM within LightGBM while preserving its native feature-bundling representation, and evaluate it across 14 public and synthetic dataset families and four noise-augmented settings. In the fully endogenous setting, CRAFT-GBM reduces per-fit training time by 39.74\% with 1.04\% lower test loss in the geometric mean across all 18 RQ1 experiments. Under pre-specified feature fraction $f$, Exogenous CRAFT-GBM also yields aggregate training-time reductions up to 13.52 percentage points larger than random feature subsampling, with no increase in aggregate test loss relative to full-feature LightGBM. Accumulated training evidence can thus support adaptive feature search with statistical guarantees while retaining the practical advantages of native gradient boosting.

fields
Statistics Theory
pdf ↗ page arXiv:2611.11914 ↗

We develop a general methodology based on the Feature Space Decomposition framework for establishing explicit, instance-specific sharp rates for the expected estimation error of convex-constrained least squares estimators in the sequence model, without requiring estimates of localized Gaussian mean widths. We apply this methodology to $\ell_q$ ellipsoids, $\ell_1$ balls, and $kB_1^N\cap B_\infty^N$, obtaining matching upper and lower bounds in the nondegenerate regime. Our methodology also extends beyond Gaussian noise to symmetric noise distributions satisfying a Poincaré inequality. We also provide an elementary proof of the instance-specific sharp rate for isotonic regression for any well-specified signal and any noise level. Combining this result with Han's asymptotic reduction, we further obtain explicit instance-specific sharp convergence rates in probability for isotonic regression in Gaussian linear regression under general signal-dependent asymptotics conditions.

fields
Statistics Theory
pdf ↗ page arXiv:2611.11959 ↗

Uncertainty quantification in prediction is a central problem in statistics and machine learning. Conformal prediction provides a flexible approach to constructing prediction sets with valid marginal coverage under exchangeability. In this paper, we investigate conformal prediction for both one-step and multi-step forecasting from a single stationary time series, addressing temporal dependence and the additional challenges of joint prediction across multiple horizons. We propose a kernel-based framework, called Time series Residual Analysis for Calibration with Kernels (TRACK), for estimating conditional quantiles of residual scores and constructing prediction sets from rolling-window forecasters. The framework accommodates heterogeneous uncertainty across horizons and accounts for dependence induced by rolling estimation, while allowing predictor memory and forecast horizons to grow with the sample size. Our finite-sample bounds quantify how temporal dependence and overlapping score windows affect calibration and coverage. We further derive bounds for conditional quantile estimation and pointwise conditional coverage discrepancy. The guarantees extend to more general predictors that admit an accurate rolling-window approximation. We also derive matching minimax bounds over classes of known score maps, clarifying how overlapping score windows affect calibration accuracy. Experimental results from simulations and applications to wind energy generation and bike sharing demand show that our methods improve regional conditional coverage while maintaining competitive interval widths.

comments
32 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.12004 ↗

Parametric inference based on distribution functions is useful when a model is naturally specified through its cumulative distribution function or when a tractable density is unavailable. We study minimum cumulative power divergence estimation, obtained by comparing a parametric distribution function with its empirical counterpart. For a fixed positive tuning parameter and a fixed finite integration measure, we establish the existence of a consistent sequence of local solutions to the estimating equations and derive its asymptotic normality. The resulting covariance has a sandwich form whose components involve derivatives of the distribution function and the covariance kernel of the multivariate empirical process. We specialize the construction to copulas using Lebesgue measure on the unit cube, and distinguish estimation with known margins from estimation based on ranks. In the latter case, the covariance incorporates the effect of estimating the marginal distributions. The relationship with the copula divergences of Eguchi and Kato is made explicit: the power loss is closely related, whereas the integration measure determines a different estimation criterion. A simulation design for Gumbel, Clayton, and Frank copulas examines the estimation of Kendall's tau under correct specification, family misspecification, and contamination by independence. The simulations show competitive clean-data accuracy but no general robustness advantage over the empirical-copula-weighted alternatives under independence contamination.

comments
23 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.12203 ↗

In this work we consider i.i.d. observations from a multiplicative deconvolution model, i.e. generated by $Y= X\varepsilon$, where $X$ and $\varepsilon$ are independent strictly positive random variables. The goal is to statistically infer the unknown signal $X$. Starting from the scenario where the probability density $f_\varepsilon$ of the error is known, we revisit local estimation strategies for several quantities of interest including the probability density function f and the survival function $S^X$ of the signal $X$. We use these results to propose a thresholded plug-in estimation technique for linear functionals in situations where the distribution of the error $\varepsilon$ is unknown, while having some additional data at our disposal. This estimation procedure combines the reconstruction of the unknown Mellin transform of $f$ as well as its regularized inversion by a spectral cut-off. We establish oracle-type upper bounds and discuss rates of convergence in explicit scenarios including estimating $f$ and $S^X$ pointwise. In addition, we develop a fully data-driven choice of the cut-off parameter via model selection, which is able to obtain the oracle risk up to a constant without any previous knowledge of the error distribution. The results are illustrated in a simulation experiment, where we compare different classes of distributions in settings with known and unknown $f_\varepsilon$.

fields
Statistics Theory
pdf ↗ page arXiv:2611.12516 ↗

We prove $F_{\mathrm{weighted}}(2,2,3)<11/6$ for minimum-Frobenius-norm least-squares regression with two input and two output coordinates, improving the upper bound $15/8$. More precisely, a universal $\varepsilon_0>0$ satisfies $\mathcal T_3\le(5/6-\varepsilon_0)E$ for every finite residual frame. The proof combines an exact scalar certificate, rigidity of equality in planar selection, and a compactness argument that controls disappearing weights. Together with the known lower bound, this gives $13/8\le F_{\mathrm{weighted}}(2,2,3)<11/6$. No numerical value of $\varepsilon_0$ is claimed.

fields
Statistics Theory
pdf ↗ page arXiv:2611.12550 ↗

We study near-purity screening and dominant-atom estimation in softmax mixtures, whose components share a common set of category features. A mixture is called $\varepsilon$-pure if one of its mixing weights is at least $1-\varepsilon$. We introduce the Trace of Latent Covariance Criterion ($\mathrm{TLC}^{2}$), a direct estimator of the trace of the covariance matrix of the latent mixing measure, constructed without estimating its atoms or weights, or knowing the number of components. Unlike existing moment-based approaches, our estimator is constructed for the softmax family and does not require knowledge or estimation of the feature distribution. We establish finite-sample guarantees for $\mathrm{TLC}^{2}$, showing that it achieves a parametric convergence rate up to an additive approximation error of order $p^{-1/2}$, without requiring minimum separation between mixture atoms. We also study estimation of the dominant atom in near-pure mixtures by fitting a single softmax component. We prove that the resulting maximum likelihood estimator has an error bound consisting of the usual parametric term and a bias term governed by the weighted distances between the dominant and remaining atoms, revealing adaptation to the geometry of the mixture. Finally, we extend near-purity screening and dominant-atom estimation to ensembles of softmax mixtures with shared atoms and mixture-specific weights. We apply $\mathrm{TLC}^{2}$ separately to each ensemble member to screen for near-purity without knowing the number of components. Under additional assumptions, clustering the resulting dominant-atom estimators yields finite-sample guarantees for estimating the shared atoms. An application to the Million Song Dataset illustrates how the estimated softmax directions reveal interpretable structure in the data.

fields
Statistics Theory
pdf ↗ page arXiv:2611.12647 ↗

Functional Analysis23

In this paper, we give characterizations of Li–Yorke chaos, mean Li–Yorke chaos and distributional chaos for weighted backward shifts acting on general Fréchet sequence spaces over directed trees. As corollaries, we obtain explicit characterizations in the setting of Köthe spaces $λ_p(A,V)$, where $p\in\{0\}\cup[1,\infty)$ and $V$ is a directed tree. In particular, we obtain criteria for the case of the classical Banach spaces $\ell^p(V)$, $p\in[1,\infty)$, and $c_0(V)$.

comments
47 pages, 3 figures
fields
Functional Analysis, Dynamical Systems
pdf ↗ page arXiv:2611.10053 ↗

Given a Hermitian matrix $A_0$ and a real subspace $W$ of Hermitian matrices, we study the matrices $A_0+W_0$, $W_0\in W$, of minimal spectral norm, which we call $W$-minimal. The main motivation is the Hermitian matrix completion problem, where $W$ is spanned by the Hermitian matrix units corresponding to the unspecified entries. Our main tool is the moment of a subspace $S\subseteq\mathbb{C}^n$ relative to $W$, a compact convex subset of $\mathbb{R}^r$, $r=\dim(W)$, which we relate to the joint numerical range and to the $k$-dimensional field of a family of matrices. We compute the subdifferential of $\|A_0+W(x)\|$ in terms of the moments of the eigenspaces of the extreme eigenvalues of $A_0+W(x)$, and we obtain several equivalent characterizations of $W$-minimality: in terms of eigenvectors, of moments, of subdifferentials and of norm one functionals that annihilate $W$. When the identity belongs to $W$, every $W$-minimal matrix has balanced spectrum, and minimality is equivalent to the moments of the eigenspaces of the maximum and minimum eigenvalues having nonempty intersection; we show that this characterization fails if $I\notin W$. We illustrate the results with several examples, and we prove that the adjacency matrix of a connected graph is minimal for its completion problem if and only if the graph is complete bipartite.

comments
26 pages, 3 figures
fields
Functional Analysis
pdf ↗ page arXiv:2611.10323 ↗

For every real $N$-dimensional subspace of $L_2$, we construct one orthonormal basis such that, for every $1\le v\le N$, at most $Cv\log(eN/v)$ positively weighted samples discretize the squared $L_2$ norm of all $v$-term combinations. Random rotations also give simultaneous weighted $L_p$ estimates and a sharp $C\log(eN)$ bound for the squared $L_2$ norm of the pointwise maximum. For prescribed coefficient classes, a change of measure yields sampling recovery estimates from $Cv\log^3(2v)$ samples under a lower Riesz inequality and a common square-integrable pointwise bound.

comments
34 pages
fields
Functional Analysis, Numerical Analysis
pdf ↗ page arXiv:2611.10402 ↗

For a subordinated Schrödinger operator, we introduce a quantity that plays a role analogous to the bottom of the spectrum of a Schrödinger operator, and establish analytic criteria for subcriticality, criticality and supercriticality of a subordinated Schrödinger operator.

comments
28 pages
fields
Functional Analysis, Probability
pdf ↗ page arXiv:2611.10614 ↗

We investigate sharp constants and asymptotic properties of a pointwise inequality of Bourgain–Brezis–Mironescu type in dimension \(n\geq2\), involving Riesz potentials and Spector's nonlinear fractional differential operator \(\mathcal D^α\) of order \(0<α<1\). For every \(n\geq3\) and \(0<α<1\), we determine the optimal constant without symmetry restrictions and prove that it is attained by smooth radially monotone functions centered at the evaluation point. The proof combines geodesic-flow invariance, kernel monotonicity, and circular rearrangement. In dimension two, we establish the leading-order asymptotic behavior of the optimal constant and derive an explicit formula in the radial class. We further refine the pointwise limit established by A. Claros and C. Pérez [Bourgain–Brezis–Mironescu formula for Riesz potentials, Adv. Math. 503 (2026), Art. 111226] by obtaining an explicit first-order correction with a quadratic remainder uniform in the spatial variable. Finally, we strengthen their convergence-in-measure result on compact subsets for functions in \(W^{1,1}(\mathbb R^n)\) by establishing almost-everywhere convergence as \(α\to1^-\), without passing to a subsequence.

fields
Functional Analysis
pdf ↗ page arXiv:2611.10656 ↗

The adjoint of an operator plays the central role in Hilbert space operator theory. In particular, dilations of Hilbert space contractions, extension of commuting Hilbert space isometries to Hilbert space unitaries, orthogonal decompositions of contractions and functional models for commuting isometries are heavily dependent on the presence of adjoint. In this paper, we develop a theory of Banach space Wold isometries with right-complemented ranges by showing explicit constructions of Berger-Coburn-Lebow model and unitary extension for such isometric tuple without the help of adjoint. We also show that a Słociński type decomposition is possible for such a commuting tuple of Banach space isometries. Each of our results generalizes the corresponding result in the Hilbert space theory.

comments
29 pages
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.11536 ↗

Multi-factor approximations of rough volatility kernels affect the characteristic exponents used in Fourier-based derivative valuation. We derive an adjoint representation for the first-order sensitivity of the rough Heston characteristic exponent with respect to its memory kernel, with model parameters and the input variance curve held fixed. The Volterra–Riccati functional $\mathcal L_T(K,z)$ admits a local real-analytic extension, jointly in the kernel perturbation and the transform parameter. The Fréchet derivative of this extension with respect to the kernel in $L^1$ is represented by integration against a continuous sensitivity kernel $B_K(u,z)$, obtained from a backward linear Volterra equation and independent of the perturbation direction. This representation resolves the leading-order contributions of kernel perturbations across memory lags. On the structural kernel class, which contains the fractional kernel and its multi-factor approximations and has empty interior in $L^1$, the extension yields Hadamard directional differentiability and a first-order expansion with a quadratic $L^1$-remainder for all sufficiently close structural kernels, uniformly on compact subsets of the strip of transform parameters. The same sensitivity kernel yields multi-factor weight and decay-rate derivatives. Numerical experiments at multi-factor reference kernels assess the finite-resolution implementation and illustrate how the lag distribution of positive perturbations with equal $L^1$ mass affects the first-order response.

fields
Functional Analysis, Numerical Analysis
pdf ↗ page arXiv:2611.11652 ↗

We determine the eccentricity of every vertex in the orthograph of mutual strong Birkhoff-James orthogonality for arbitrary finite-dimensional C*-algebras and for the algebra K(H) of compact operators on an infinite-dimensional separable Hilbert space. This gives a more detailed description of the orthograph introduced by Arambašić et al. (Banach J. Math. Anal. 14 (2020), 1751-1772). As an application, we characterize scalar multiples of unitary elements among invertible elements of finite-dimensional C*-algebras in terms of eccentricity alone. We also show that M_3(C) is the only finite-dimensional C*-algebra whose orthograph has a non-trivial connected component of radius 3.

fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.11703 ↗

Let $\mathcal{L}$ be the Lipschitz space of a tree. In this paper, we establish a complete characterization of the weighted composition operator $W_{ψ,\varphi}$ to be Fredholm on $\mathcal{L}$. Applying our characterization, we describe the connection between the Fredholmness of $W_{ψ,\varphi}$ and that of the composition operator $C_\varphi$.

fields
Functional Analysis
pdf ↗ page arXiv:2611.11737 ↗

We introduce Forelli-Rudin type operators on the open unit ball of $\ell^2$. The weighted $L^p$-$L^q$ boundedness of these operators are completely characterized for all $p,q\in[1,\infty]\times [1,\infty]$, and every Schatten class between the weighted $L^2$ spaces are also completely characterized. Meanwhile, we derive trace formulas for corresponding operators, which cannot be obtained from their finite-dimensional counterparts by formally replacing the dimension parameter with infinity. These results are not only infinite-dimensional extensions of those obtained by Cheng, Fang, Wang, and the second author (2017), Zhao and Zhou (2022), and Ding (2022). They also reveal new phenomena that are unique to infinite dimensions and arise from the geometric and measure theoretic differences between finite- and infinite-dimensional spaces. The key ingredient of our proofs is that we also establish the Forelli-Rudin type estimates in infinite dimensions, which may shew some night on the function theory in the infinite-dimensional unit ball.

fields
Functional Analysis
pdf ↗ page arXiv:2611.11984 ↗

The classical Whitney theorem on real-analytic approximation is a fundamental result in finite-dimensional analysis and geometry. Extending this theory to general infinite-dimensional Banach spaces involves longstanding open problems. This paper is the first part of our study of Whitney-type real-analytic approximation on Banach spaces, focusing on the $C^0$ and $C^1$ cases. We prove that a real Banach space admits a separating polynomial if and only if it admits a polynomial topological embedding into a real Hilbert space. We also introduce classes of mappings that locally factor through polynomial maps into finite-dimensional spaces and develop methods of real-analytic approximation for these classes. Using these tools, we establish fine $C^0$ and $C^1$ real-analytic approximation theorems for broad classes of Banach spaces, including nonseparable ones. As applications, we resolve several open problems, including those concerning Whitney-type extensions with real analyticity off closed sets, real-analytic approximation preserving Lipschitz constants, and the real-analytic equivalence of diffeomorphic open subsets of Hilbert spaces.

fields
Functional Analysis
pdf ↗ page arXiv:2611.12181 ↗

For a complex Banach algebra $\mathscr A$ with unit and $n\in\mathbb N$, let $\mathcal C_n(\mathscr A)$ be the set of all elements whose spectrum has at least $n$ connected components, and let $d_σ(\mathscr A)=\sup\{n;\;\mathcal C_n(\mathscr A)\neq\varnothing\}$ be the spectral depth of $\mathscr A$. We characterize nonemptiness of $\mathcal C_n(\mathscr A)$ in terms of orthogonal idempotents, compute $d_σ(\mathscr A)$ for finite-dimensional algebras, and show that every class $\mathcal C_n(\mathscr A)$ is open. For operators on an infinite-dimensional complex Banach space $X$ these classes are dense in $\mathscr B(X)$, which implies that $\mathcal C_\infty(\mathscr B(X))$ is a dense $G_δ$-subset of $\mathscr B(X)$. By contrast, we exhibit a commutative Banach algebra whose spectral classes are all nonempty and none of which is dense. For self-adjoint operators on a Hilbert space, we obtain sharper perturbation results, with positive semi-definite perturbations of prescribed rank producing spectra with exactly $n$ components. We show that a quasinilpotent weighted forward shift $S_w$ on $X$ admits a nilpotent rank-one operator $F$ such that the spectrum of $S_w+αF$ has infinitely many components for every nonzero $α$.

fields
Functional Analysis
pdf ↗ page arXiv:2611.12208 ↗

A vector metric space carries a distance with values in an ordered vector space $E$; a sequence converges if its distances to the limit are dominated by a sequence decreasing to zero in $E$. We show that, for Archimedean $E$, every $E$-valued vector metric space has a completion if and only if order Cauchy sequences in $E$ converge and $E$ has the diagonal property of order convergence (SDP): for every double sequence $(a^k_n)$ with $a^k_n\downarrow_n0$ there are indices $n_k$ and $e_k\downarrow 0$ with $a^k_{n_k}\le e_k$. In vector lattices this is the classical diagonal property of Kantorovich, equivalently the strong Egoroff property. We show that its standard characterisations remain valid in Archimedean ordered vector spaces, and that it holds if and only if convergence in every $E$-valued vector metric space satisfies the iterated limit axiom. For an ordered Banach space with a closed normal cone, all completions exist if and only if the norm is $σ$-order continuous; if the cone has an interior point, all vector metrics are then scalar. By a theorem of Veksler and of Hager and van Mill, for compact Hausdorff $K$ either $K$ is an almost $P$-space and $C(K)$-valued vector metrics are scalar, or there are countable $C(K)$-valued vector metric spaces without completion. A product of ordered vector spaces with (SDP) and nonzero cones has (SDP) if and only if there are fewer than $\mathfrak b$ factors, extending a result of Hager and van Mill for $\mathbb{R}^A$. We also prove permanence results for direct summands and uniformly dense vector lattice covers of pre-Riesz spaces.

fields
Functional Analysis, General Topology, Logic
pdf ↗ page arXiv:2611.12365 ↗

Vector metric spaces in the sense of Çevik and Altun take values in a vector lattice, but their axioms use only the order of the value space. We develop the theory for vector metrics with values in an Archimedean pre-Riesz space $E$, i.e.\ an ordered vector space admitting a bipositive order dense embedding $i$ into a vector lattice $Y$. We ask when an $E$-valued vector metric $d$ and the vector-lattice-valued metric $i\circ d$ have the same convergent and Cauchy nets and sequences. Relatively uniform convergence transfers along every cover. For nets, $\mathrm{o}_3$-convergence transfers if and only if the cover has an intrinsic domination property. This property holds for pervasive covers, by a result of Kalauch and van Gaans, for uniformly dense covers and in finite dimensions; it fails for an example of Kalauch and van Gaans. Sequential convergence transfers under a countable domination property implied by uniform density, but not under pervasiveness. For uncountable $Γ$, the vector lattice $\mathbb{R}\mathbf 1\oplus c_{00}(Γ)$ is pervasive in its Dedekind completion $\ell^\infty(Γ)$ without the transfer, while for countable $Γ$ the transfer holds; the difference is explained by order separability. In finite dimensions, with a closed generating cone, all these convergences coincide with norm convergence in every cover. For $C^1[0,1]$-valued integral metrics, positivity of the kernel on the diagonal forces all order convergences to coincide with $L^1$-convergence. For the Volterra kernel $(t-s)_+$, by contrast, $L^1$-convergence, relatively uniform convergence and order convergence are pairwise different, and we describe each explicitly.

fields
Functional Analysis
pdf ↗ page arXiv:2611.12376 ↗

We resolve the symmetric Gaussian isoperimetric conjecture in the plane: every minimizer of Gaussian perimeter among centrally symmetric sets of prescribed Gaussian measure is a centered ball, a symmetric strip, or the complement of one of these sets. A quadrant-reflection argument reduces the problem to unconditional sets. The planar structural results of Barchiesi, Cagnetti and Julin then leave only a noncircular strictly convex stationary oval. We exclude this oval by an explicit volume-preserving and perimeter-decreasing linear deformation, which geometrically corresponds to an "unconditional squeezing". More generally, without requiring any symmetry assumptions, we show that any noncircular closed embedded $λ$-self-shrinker is always unstable via linear deformations. We also record a reduction to the unconditional case in dimension three, using an orthogonal equipartition theorem of Musin.

comments
18 pages
fields
Functional Analysis, Differential Geometry
pdf ↗ page arXiv:2611.12456 ↗

We construct quantum channels by averaging unitary shift conjugations with respect to $κ$-additive probability measures on measurable abelian groups. The channels act on the duals of operator algebras generated by shifts and bounded measurable multiplication operators. They preserve $κ$-additivity of quantum states and admit a weak-$*$ integral representation on this class. If the averaging measure vanishes on singletons, every output state is singular. In the appendix, we also establish the corresponding Fubini's theorem for $κ$-additive measures.

comments
13 pages, 1 figure
fields
Functional Analysis
pdf ↗ page arXiv:2611.12537 ↗

The aim of this paper is to establish sharp asymptotic bounds on the Gelfand numbers of weighted Wiener spaces $\mathcal{A}^r_θ$ measured in $L_q$. This is done by using results for Gelfand numbers of sequence spaces and applying them to each layer of a hyperbolic cross to obtain results for Gelfand numbers between different (weighted) Wiener spaces. These can then be used to establish bounds in $L_q$ by combining them with known results and techniques for Besov spaces. This significantly narrows a gap in the current research, since the Gelfand numbers provide a lower bound on the (non-linear) sampling numbers, whereas upper bounds on this quantity have been studied in multiple papers via an upper bound given by the best m-term approximation.

fields
Functional Analysis
pdf ↗ page arXiv:2611.12558 ↗

We prove that tempered distributions on \(\mathbb R^{2n}\) whose supports satisfy a common strict cone condition form a unital associative algebra without zero divisors under twisted convolution \(\star\). The supports may be noncompact, and the associated Weyl maps need not be bounded. As applications, we show that the parabolic algebra and the norm-closed algebra generated by positive translations and modulations have no zero divisors, confirming Levene's conjecture. We also obtain a zero-product theorem for Toeplitz operators on the one-dimensional Fock space with bounded symbols whose distributional Fourier transforms satisfy a common strict cone condition. The proof of the distribution theorem uses Schwartz smoothing between distributional Weyl maps to convert a hypothetical zero product of nonzero distributions into a smooth function \(h\not\equiv0\) satisfying the same cone condition and \(h\star h=0\). The cone bound implies the \(Q\)-support condition, meaning that some linear functional is bounded above on \(\operatorname{supp}h\) and has compact upper level sets there. Truncating \(h\) near the maximum of this functional and applying the support identity for compactly supported twisted squares rule out \(h\star h=0\). For the operator applications, uniformly bounded Weyl-conjugation averages identify twisted convolution with bounded operator composition under the common cone condition.

comments
64 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.12631 ↗

For a complex Banach space \(X\), we characterise dimension-free \(R\)-sectoriality of the Walsh operator, the Ornstein–Uhlenbeck operator, the Laplacian, and the Poisson operator by the vector-valued Stein inequality. For each family, the dimension-free \(R\)-bound of the resolvents on the negative real axis equals the Stein constant. Consequently, the resolvent estimate on the negative real axis already implies uniform \(R\)-sectoriality at an angle strictly smaller than \(π/2\). We furthermore prove that the full and dyadic Stein properties are equivalent and that they are independent of the exponent \(1<p<\infty\) entering their definition.

comments
29 pages, 1 figure
fields
Functional Analysis
pdf ↗ page arXiv:2611.12645 ↗

This paper investigates the solvability of infinite-dimensional differential-algebraic equations (DAEs) on Hilbert spaces. We focus on irregular systems for which the operator pencil is not surjective onto the full state space, but only onto a subspace determined by the algebraic constraints. We establish a Lumer-Phillips-type generation result for this class of systems, showing that dissipativity together with a partial surjectivity condition yields a contraction semigroup on the dynamic subspace. The resulting wellposedness conditions are compared with existing solvability results. We further extend the analysis to systems in which hidden algebraic constraints restrict the dynamics to a proper closed subspace of the dynamical subspace. Under an additional structural condition, we show that the resulting constrained system is $E$-radial on suitably chosen spaces. We also demonstrate that semigroup generation does not, in general, imply $E$-radiality on the original state spaces. This provides a Weierstraß-type decomposition useful for controller design. The framework is illustrated by some examples.

fields
Functional Analysis, Optimization and Control
pdf ↗ page arXiv:2611.12721 ↗

We construct separable $\mathcal L_\infty$-spaces with Kalton's property $Q$, which, to the best of our knowledge, are the first known examples of this kind. Our technique employs the Bourgain–Pisier construction and a quantitative analysis of metric types in limits of finite-dimensional $η$-admissible embeddings. The argument rests on two complementary estimates: approximate radial centres yield asymptotic separation of tree increments, while an admissibility inequality yields asymptotic gain, leading to concentration on Kalton's interlacing graphs. This leads to an abstract criterion for property $Q$ in terms of asymptotic separation $AS_θ$ and asymptotic gain $AG_α$. We illustrate the limitations of this criterion with Johnson–Lindenstrauss spaces. Our examples exclude uniform embeddings of the unit ball of $c_0$, strengthening in a nonlinear direction the classical Bourgain–Delbaen phenomenon. As an application, every separable Banach space embeds isometrically into a separable $\mathcal L_\infty$-space whose unit ball is not a uniform retract of the unit ball of its bidual.

comments
39 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.12764 ↗

Let $\mathcal H$ be a reproducing kernel Hilbert space of holomorphic functions on the unit disc, and assume $\mathcal H$ is invariant under the forward and backward shifts. We show that if the forward shift on $\mathcal H$ is concave, then $\mathcal H$ is a complete Nevanlinna–Pick space. This gives an affirmative answer to the concavity part of Shimorin's question \cite{Sh02} and extends his theorem on the complete Nevanlinna–Pick property of Dirichlet-type spaces with superharmonic weights.

fields
Functional Analysis
pdf ↗ page arXiv:2611.12778 ↗

We study isometric extensions from positive and full unit spheres of $C^\infty([0,1],\mathbb F)$, where $\mathbb F\in\{\mathbb R,\mathbb C\}$. We equip these spaces with a translation-invariant metric that induces the usual Fréchet topology, is unbounded, has convex balls, and has strictly increasing distances from zero along nonzero rays. Every surjective isometry of the pointwise positive unit sphere extends uniquely to a complex-linear surjective isometry of the complex-valued space. Restriction gives the unique real-linear isometric extension on the real-valued space. On the full unit sphere, every surjective isometry extends uniquely to a real-linear surjective isometry. The positive-sphere maps are compositions with the identity or an admissible reflection. The full-sphere maps also allow constant unimodular factors and, over the complex field, conjugation. We also classify the surjective ambient isometries. A counterexample shows that these metric properties alone do not guarantee positive-sphere extension. Under an explicit anchor condition, we classify surjective isometries of finite-order jet-positive spheres for maximum-type anchored metrics and prove that they extend uniquely to complex-linear surjective isometries. The classification allows any permutation of the anchored coordinates, combined with the identity or reflection on the highest-derivative component. The condition holds for every anchor when $m=1$ or $m=2$.

comments
33 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.12794 ↗

Classical Analysis and ODEs17

For any positive integer n and any two monic real Hurwitz polynomials of degree n, every convex combination of the two is Hurwitz stable if and only if there exists a common numerator of degree n that makes both endpoint transfer functions strictly positive real. We give a unified proof based on convex separation, contact interpolation, and analytic properties of weakly positive real functions.

fields
Classical Analysis and ODEs, Complex Variables
pdf ↗ page arXiv:2611.09940 ↗

In recent years, a new multivariate hypergeometric series, known as the comb function, has attracted attention in physics, particularly in the study of conformal blocks in conformal field theory. This function can be regarded as a further generalization of Appell's function $F_2$ and Saran's function $F_K$. However, except for a few known formulas, little is known about its properties. In this paper, we study its fundamental properties from a mathematical perspective, such as the region of convergence, reduction formulas, an Euler-type integral representation, and decomposition formulas. Some directions for future research and connections with other multivariate hypergeometric series originating from physics are also mentioned.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.09965 ↗

The third order hypermetric $ρ(x,y,z)$ in $\mathbb{R}^n$ is given by the Euclidean distance of the point $(x,y,z)\in(\mathbb{R}^n)^3$ to the diagonal $Δ^{(3)}=\{(x,x,x):x\in\mathbb{R}^n\}$ of $(\mathbb{R}^n)^3$. In this paper, we consider local and nonlocal fractional versions of bilinear differential operators generated by the geometry induced by $ρ(x,y,z)=ρ(0,x-y,x-z)$ instead of the usual $|(x-y,x-z)|$, where $|\cdot|$ denotes the Euclidean norm in $\mathbb{R}^{2n}$. In doing so, we obtain a fractional nonlocal version $\mathbb{D}^s(f,g)$, $0<s<1$, of the Dirichlet bilinear operator $\nabla f(x)\cdot\nabla g(x)$ which converges to this classical form when the fractional parameter approaches its endpoint $s=1$. We consider both the kernel approach and the Fourier multiplier version.

comments
16 pages
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2611.10709 ↗

We study the Littlewood–Paley $g$-functions associated with symmetric submarkovian semigroups and Hilbert-valued functions. For every $1<p<\infty$ and $2\le q\le\infty$, we prove \[ \norm{G_q^T(f)}{L_p(Ω)} \lesssim\max\{p',\sqrt p\}\norm{f-F(f)}{L_p(Ω;\mathcal{H})}, \] with the sharp order $\max\{p',\sqrt p\}$, where the implicit constant is independent of $p,q$, the underlying space $Ω$, the semigroup $(T_t)_{t>0}$, and the Hilbert space $\mathcal{H}$. Compactly supported radial functions show that, for each fixed $q>2$, the large-$p$ order cannot be replaced by $p^{1/q}$ in a dimension-free heat estimate. In particular, for the case $q=2$, we answers affirmatively the question posed by Xu in his \emph{JFA} paper (2022) \cite[Problem~7]{XuJFA}. For every finite $q>2$, our lower bound gives a negative answer to the dimension-free question in Xu's \emph{JEMS} paper (2025) \cite[Problem~1.8(i)]{XuJEMS}, already for real scalar functions. Together, the upper and lower bounds establish the sharp dimension-free order $\max\{p',\sqrt p\}$ for Hilbert-valued functions.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.10710 ↗

We show that there exists a Schauder basis $\{e^{i λ_n t}\}_{n \in \mathbb{N}}$ with real frequencies in $L^2(-π,π)$ which is not a Riesz basis.

comments
22 pages
fields
Classical Analysis and ODEs, Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.10799 ↗

For every nonempty finite set $S$ of $N$ positive integers we prove $-\min_{x\in\mathbb{T}}\sum_{s\in S}\cos(2πsx)\gg (N/\log(2N))^{1/4}$. The proof uses a reversible phase kernel whose one-step and two-step laws are close in total variation. Comparison of rows and a height cutoff produce a partition into pieces of bounded mean. A Fourier rounding estimate then forces many additive triples to cross the partition. Two choices of phase density yield bounds in terms of negative mass and an exact conditional-pair defect, respectively. A logarithmic refinement gives a log-free bound at low triple density. At fixed positive triple density the log-free bound is a corollary of known boundary estimates. We give a separate spectral proof using an integer difference count and a theorem of Yip.

fields
Classical Analysis and ODEs, Number Theory
pdf ↗ page arXiv:2611.11144 ↗

We establish on $R^n\times R^m$ a Fefferman–Stein type distribution function inequality in which the nontangential maximal function of the product Poisson extension is controlled by the Lusin area integral function: \[ |\{N>λ\}|\le C\left(|\{A>λ\}|+λ^{-2}\int_{\{A\leλ\}}A^2\,dx\right). \] The central idea is to establish a local $L^2$ estimate for the radial maximal function. This yields a new proof of the corresponding one-parameter inequality, avoiding Green's formula and the treatment of sawtooth regions, and extends to the multiparameter setting.

comments
13 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.11186 ↗

This paper establishes an uncertainty principle on the mixed space $\mathbb{T}^m \times \mathbb{R}^n$ for $n \ge 2$. Leveraging the paraboloid restriction theorem on $\mathbb{Z}^m \times \mathbb{R}^n$ derived from Barron's global-in-time Strichartz estimates for the semi-periodic Schrodinger equation, we construct measurable sets $S \subset \mathbb{T}^m \times \mathbb{R}^n$ and $A(R,δ) \subset \mathbb{Z}^m \times \mathbb{R}^n$ that form a strong $L^2$ annihilating pair, satisfying the uniform inequality $\|f\|_{L^2(\mathbb{T}^m \times \mathbb{R}^n)} \le 3(\|f\|_{L^2((\mathbb{T}^m \times \mathbb{R}^n)\setminus S)} + \|\widehat{f}\|_{L^2((\mathbb{Z}^m \times \mathbb{R}^n)\setminus A(R,δ))})$ for all $f \in L^2(\mathbb{T}^m \times \mathbb{R}^n)$, where the measures of $S$ and $A(R,δ)$ can be made arbitrarily large while the constant 3 remains unchanged. As an application, we derive a two-time observability inequality for the semi-periodic Schrodinger equation under a support condition on the phase-modified solution at the first observation time.

comments
11 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.11361 ↗

For every real $α\neq0,1$, we show that the bilinear Hilbert transform \[ H_α(f_1,f_2)(x) =\text{p.v.}\int_{\mathbb{R}} f_1(x-αy)\,f_2(x-y)\,\frac{\mathrm{d} y}{y} \] fails to map $L^1(\mathbb{R})\times L^1(\mathbb{R})$ to $L^{1/2,\infty}(\mathbb{R})$ when restricted to characteristic functions of sets of positive finite measure. The counterexample is quantitative and can be realized by sets that are finite unions of intervals of a common arbitrarily small length.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.11401 ↗

We use tools from high dimensional probability to analyze random configurations of balls in the context of Fourier decoupling and we answer a question on the structure of superlevel sets in the setting of decoupling due to Guth.

comments
24 Pages
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.11700 ↗

We solve the Bochner–Krall problem posed by Krall in 1938, extending the classification beyond regular orthogonal sequences. We classify monic polynomial sequences for which multiplying each polynomial by the variable gives a linear combination of that polynomial and the polynomials of the immediately preceding and following degrees, and whose members are eigenpolynomials of one fixed nonscalar differential operator of arbitrary finite order with polynomial coefficients. Orthogonality is not assumed. The general formulation allows sequences to start at any fixed degree. In every degree beyond a fixed threshold, each sequence agrees, up to an invertible affine change of variable and monic normalization, with a Hermite, Laguerre, Jacobi or Bessel family, the monomial basis, or a finite rational Darboux transform of a Laguerre or Jacobi family. In the positive-definite case, we determine the representing measures, prove their uniqueness and specify the admissible endpoint masses. No boundedness assumption on the support or asymptotic conditions on the recurrence coefficients are imposed.

comments
44 pages
fields
Classical Analysis and ODEs, Mathematical Physics
pdf ↗ page arXiv:2611.11742 ↗

Let $Γ=\{1,\dots,d\}$, $d\geq 2$. For each $j\in Γ$, let ${\ell}_{j}\geq 1$ be an integer and let $α_{j}\in (1/2,1)$. We obtain a pointwise estimate for the integral \begin{equation*} \int_{\mathbb{S}^{d-1}}\prod_{j\in Γ} |x^{\ell_{j}}_{j}-ξ_{j}|^{-α_{j}} d σ(x), \end{equation*} in the region \begin{equation*} \{ξ\in \mathbb{R}^{d}: ξ_{j}\neq 0,\;j\inΓ,\;\; \sum\nolimits_{j\in F}|ξ_{j}|^{2/\ell_{j}}\neq 1,\; F\subseteq Γ\}. \end{equation*} These estimates are used to prove a Stein-Tomas type restriction theorem for the oscillatory integral operator $Tf(x)=\int_{\mathbb{R}^d}e^{\dot{\imath}h(x,y)}f(y)dy$, with the phase $h(x,y)=\sum\nolimits_{j\inΓ} a_{j} x_{j}^{\ell_{j}} y_{j}^{m_{j}}$, where, for each $j\in Γ$, $a_{j}\neq 0$ is a real number and $m_{j}>1$ is an integer.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.11942 ↗

We study the $2\times 2$ matrix orthogonal polynomials $\mathbf{P}_N$ on the real line with respect to the varying weights $\mathrm{e}^{-N\mathbf{Q}(z)}\mathbf{B}(z)$, where $\mathbf{Q}$ and $\mathbf{B}$ are real symmetric matrix polynomials that commute with a Hermite-type matrix weight, $\mathbf{Q}$ is not scalar and $\mathbf{B}$ is positive definite. We are motivated by the non-Abelian Toda deformation of the Hermite-type weight, in the sense of Deaño, Morey and Román. The weight depends on $N$ through a matrix exponential that is not scalar, so that its two eigenvalues have different exponential rates. The matrix orthogonality reduces to two scalar orthogonality problems on the real line, with a varying weight that has an essential singularity at the origin. Assuming that the associated equilibrium measure is one-cut regular, we obtain the strong asymptotics of $\mathbf{P}_N$ and of $\det\mathbf{P}_N$ by the Deift-Zhou steepest descent method. Our main result is the limiting zero distribution of the entries of $\mathbf{P}_N$. These zeros are complex in general, and they accumulate on a curve where the contributions of the two eigenvalues of the weight have the same size. When this curve crosses the real segment that attracts the zeros of $\det\mathbf{P}_N$, the zeros of the entries display a critical behavior, and a positive fraction of them accumulates on this segment.

comments
47 pages, 1 figure
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.12262 ↗

We prove a positive power translation-continuity estimate for the local bilinear circular maximal operator on the real line. More precisely, there is $η>0$ such that the operator applied to a translation difference in either input maps $L^8(\mathbb{R})\times L^8(\mathbb{R})$ to $L^4(\mathbb{R})$ with norm $O(|h|^η)$. This answers Question 6.3 in Borges's survey on bilinear spherical averages. The main step is a frequency-localized estimate for arbitrary bounded inputs. A $TT^*$ argument converts it into a linear maximal problem on the plane, associated with pairs of circles. We verify the corrected multi-parameter cinematic curvature condition of Chen, Guo, and Yang by proving an irreducibility and infinitesimal independence statement for the resulting quartic curves. Uniform algebraic sublevel estimates control the degeneracies. Interpolation also gives continuity for all finite exponents $2<p,q<\infty$, with output exponent $pq/(p+q)$.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.12273 ↗

We study the zeros of solutions of complex linear differential equations of arbitrary order $n\ge2$ with exponential-sum coefficients. Using the initial-value space $\mathbb{C}^n$ to parametrize the solutions, we show that solutions with initial vectors outside a complete pluripolar cone of Lebesgue measure zero share an explicit common leading term for the global zero count and a common joint limit in radius and angle. The rescaled radial distance from the disk boundary has an exponential limiting distribution, while the rescaled angular deviations from each main ray are Gaussian. Inspired by logarithmic tracts in the Eremenko-Lyubich class $\mathcal{B}$, we pull exterior sectors back conformally to countably many curvilinear strips extending in finitely many directions and obtain zero-counting asymptotics in each strip, although the coefficients may lie outside this class. Moreover, the asymptotic formula for the global zero count and the joint limit in radius and angle persist under arbitrary entire perturbations of strictly smaller weighted exponential type.

comments
76 pages, 12 figures
fields
Classical Analysis and ODEs, Complex Variables
pdf ↗ page arXiv:2611.12670 ↗

We show that there does not exist a constant $c<1$ such that ${\lVert f\ast f\rVert}_{L^{2}}^2\le c\,{\lVert f\ast f\rVert}_{L^{1}}{\lVert f\ast f\rVert}_{L^{\infty}}$ holds for every nonnegative $f\in L^1(\mathbb{R})\cap L^2(\mathbb{R})$.

comments
8 pages, 2 figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.12685 ↗

Second order $q$ difference equations arise in various areas such as basic hypergeometric series, orthogonal polynomials and the analytic theory of special functions. When the independent variable is scaled by powers of $q$ ($0<q<1$), such equations display asymptotic behaviour that differs markedly from their differential or classical difference counterparts. Our purpose is to give a complete, self contained treatment of linear, second order $q$ difference equations with divergent formal solutions, including explicit error bounds, exact resummations and Stokes phenomena.

comments
22 pages, 2 figures, 1 table
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.12688 ↗

Representation Theory17

Let $V$ be a finite-dimensional unitary representation of a finite group $G$ and, for unit vectors $v$, let $Φ(v)$ be the mean of $|\langle v,gv\rangle|^2$ over $g\in G$. We show that $v$ is a local maximum of $Φ$ if and only if the subrepresentation generated by $v$ is irreducible. Thus local maximization of $Φ$ extracts irreducible subrepresentations of $V$ directly, with no character or isotypic projection specified in advance. The proof is elementary: Schur averaging reduces it to a singular-value calculation. The values and dimensions of the connected components of the local-maximum set determine the degrees and multiplicities of the irreducible constituents, and for $H\leq G$ the intersections of the $G$- and $H$-local-maximal loci encode branching multiplicities. We also determine the critical landscape and give a normalized gradient iteration whose generic limit generates an irreducible subrepresentation.

fields
Representation Theory
pdf ↗ page arXiv:2611.09972 ↗

We consider simple simply-connected algebraic groups $G$ over the complex numbers, and a principal $A_1$-subgroup $A \leq G$. We show that for most types of $G$ all its irreducible representations $V(λ)$ ($λ$ a dominant weight) are determined by their restrictions to $A$ up to graph automorphisms. The exceptions are groups $G$ of type $A_l$ with $l \geq 5$ and $G$ of type $D_l$ with $l = 4^m$ and $m \geq 2$.

fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2611.10163 ↗

For each partition $λ$ of $n$ we construct an explicit basis of the unipotent Specht module $S^λ$ of $\mathrm{GL}_n(\mathbb{F}_q)$, defined recursively over horizontal strips. Each basis vector is $g\,x_τ$, where $τ$ is a semistandard tableau of shape $λ$, $x_τ$ is obtained from a Steinberg-type vector by alternately applying a permutation matrix and a Fourier sum over a unitriangular group, and $g$ runs over an explicit set of coset representatives. Grouping the basis by the standardization of $τ$ gives exactly $q^{\mathrm{maj}(s^T)}$ vectors for each standard tableau $s$, which is the numerical form of the Dipper-James standard basis problem. The same family is a basis over every field containing a nontrivial $p$th root of unity, including fields whose characteristic divides $|\mathrm{GL}_n(\mathbb{F}_q)|$, and a subfamily chosen layer by layer gives a basis of the simple quotient $D^λ$. We also give a basis of the $U$-fixed vectors of $S^λ$ and computed values of $\dim D^λ$ for $\mathrm{GL}_n(2)$.

comments
32 pages
fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2611.10813 ↗

We generalize the silting theorem of Buan and Zhou to extended module categories. For a $(d+1)$-term silting object $\mathbf{P}$ over a proper $d$-truncated non-positive dg algebra $A$, we construct a $(d+1)$-term silting object $\mathbf{Q}$ over the $d$-truncated dg endomorphism algebra $B$ of $\mathbf{P}$. The $s$-torsion pairs induced by $\mathbf{P}$ and $\mathbf{Q}$ yield equivalences of Brenner-Butler type between the torsion class on either side and the torsion-free class on the other. There is also a dg algebra homomorphism from $A$ to the $d$-truncated dg endomorphism algebra of $\mathbf{Q}$, which is a quasi-isomorphism if and only if $\operatorname{Hom}(\mathbf{P},\mathbf{P}[i])=0$ for all $i\leq-d$. Moreover, we describe Auslander-Reiten theory in ${d\text{-}\operatorname{mod}\!B}$ in terms of that in ${d\text{-}\operatorname{mod}\!A}$.

comments
26 pages, comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2611.10849 ↗

An Eaton triple consists of a finite dimensional real inner product space, a closed subgroup of its orthogonal group, and a closed convex cone that meets every orbit and satisfies an extremal inner product inequality. In the literature on group majorization and invariant norms it is a standing hypothesis that the triple admits a reduced triple, obtained by restriction to the span of the cone. We prove that this is always the case: the axioms force the span of the cone to be a section of a polar representation, and Gichev's orbit intersection theorem applies. The reduced group is a finite reflection group, crystallographic when the group is connected; Eaton cones are its closed chambers, unique up to the group action; and a compact linear group admits an Eaton cone if and only if its representation is polar with a finite reflection group as Weyl group. For connected groups we construct a Lie triple system on the space, determined by the inner product and the orbits alone, for which the cone is a Weyl chamber; unlike Dadok's orbit equivalence with a symmetric space, it involves no choices.

comments
23 pages
fields
Representation Theory, Differential Geometry, Functional Analysis
pdf ↗ page arXiv:2611.10859 ↗

Trace formula is an important method to study the Langlands program. Arthur obtains the existence of stable trace formula for connected reductive group. In this paper, we will give the explicit invariant trace formula of GL(3). For general reductive groups, Arthur gave an inductive proof of the existence of the invariant trace formula and provided explicit examples for GL(2). For GL(3), we successively compute the invariant distributions, give all the Fourier kernels for the GL(2) cases, and finally obtain the concrete invariant trace formula.

comments
58 pages
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.11135 ↗

We treat a symmetrized mixed-oscillator deformation family of the orthosymplectic Lie superalgebras $\mathfrak{osp}(N|2n)$, $N,n\geq1$, with even mixed coefficients $β_{u,i}$ and one odd square-zero parameter. We derive the deformed bracket from an oscillator realization, show that its coefficient is determined by the realization, and exhibit an explicit odd primitive, normalized by its vanishing on $\mathfrak{sp}(2n)$. Every odd primitive differs from it by a unique inner derivation. For $N=1$ this is the case $\mathfrak{osp}(1|2n)$ treated earlier. With multiple odd parameters the deformed bracket is the sum of the single-parameter deformations and is again trivial. The trivialization, however, is not additive: it is the product of the single-parameter trivializations followed by a nonsymplectic change of the bosonic generators. The main results are formalized in Lean~4, with the algebras constructed by generators and relations; what is not formalized is stated in the appendix.

code
github.com/ritsumei-aoi/osp-odd-deformations ∎ Lean project (blueprint/lakefile.lean, blueprint/lean-toolchain) builds, no sorry at 2806694, checked 2026-11-10 build details
comments
20 pages. The Lean 4 formalization is available at https://github.com/ritsumei-aoi/osp-odd-deformations
fields
Representation Theory
pdf ↗ page arXiv:2611.11153 ↗

Motivated by the problem of Gragg and Kung on characterizing finite groups with consistent subgroup lattices, we investigate how the consistency of the subgroup lattice $L(G)$ constrains the structure of the underlying finite group $G$. To this end, we first establish several equivalent characterizations of consistency for lattices of finite length in terms of operation-preserving subposets and forbidden sublattices. More interestingly, for complete atomistic lattices of finite length, we introduce the consistency exchange property (CEP) for the canonical closure operator and show that consistency is equivalent to CEP, and that CEP is strictly weaker than the Steinitz-Mac Lane exchange property. We then apply this framework to semidirect products $G=V\rtimes_α C_m$, where $V$ is an elementary abelian $p$-group, $m$ is square-free and $p\nmid m$. Writing $d=o(α)$ and letting $C_α=\langleα\rangle$, we prove that $L(G)$ is consistent if and only if either $d=1$, or $d$ is prime and $V$ is isotypic as an $\mathbb F_pC_α$-module. For prime $d$, this latter condition is equivalent both to the irreducibility of the minimal polynomial of $α$ over $\mathbb F_p$ and to $\mathbb F_p[α]$ being a field. More generally, we verify that if $G=V\rtimes_θH$ where $H$ acts faithfully on $V$ and $p\nmid |H|$, then $L(G)$ is consistent if and only if either $H$ is trivial, or $H$ is cyclic of prime order and $V$ is isotypic as an $\mathbb F_pH$-module. We thus obtain a complete solution to the problem of Gragg and Kung for this class of coprime semidirect products.

comments
44
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2611.11154 ↗

Let $G$ be a connected reductive group split over $\mathbb{Z}$. The Kottwitz homomorphism identifies the group of connected components of the loop group of $G$ with the group $Ω$ of length zero elements of the extended affine Weyl group. We show that this homomorphism always has a homomorphic section, and that the section can be chosen inside the normalizer of $T$ in $G(\mathbb{Z}[t,t^{-1}])$. We then ask whether the section can be chosen to preserve an affine pinning. This is possible if no simple factor of $G$ is of type $B_{2m}$ or $C_{2m}$. It is impossible for $(SL_2\times Sp_{2n})/μ_2$ and $(SL_2\times Spin_{2n+1})/μ_2$ when $n$ is even. We show that the obstructions for $G$ and for its Langlands dual group are dual to each other, and we compute them by a lattice computation with a Coxeter element. As an application, we show that the component group of the centralizer of any semisimple element lifts to the centralizer. Under the same condition on the simple factors, the lift can be chosen to preserve a pinning of the neutral component.

comments
35 pages
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2611.11363 ↗

We introduce the notion of derived standardly stratified algebras as a connective dg analogue of standardly stratified algebras. To this end, we extend the Dlab–Ringel standardization method to algebraic triangulated categories and show that every basic proper derived standardly stratified algebra arises from this extended method. We establish Ringel duality for derived standardly stratified algebras using silting objects. More precisely, the Ringel dual is again derived standardly stratified, and the corresponding perfect derived categories are related by mutually quasi-inverse contravariant triangle equivalences. We also show that, over an algebraically closed field, a proper derived standardly stratified algebra is smooth if and only if its derived standard modules are exceptional. Finally, we prove that dg algebras given by finite acyclic graded quivers with arrows of non-positive degrees and homogeneous relations are derived standardly stratified with respect to every total order on the vertices.

fields
Representation Theory
pdf ↗ page arXiv:2611.11434 ↗

Let $\mathbf{k}$ be an algebraically closed field of characteristic $p>0$. Let $R=W_2(\mathbf{k})$ be the ring of Witt vectors of length $2$. In this note, we are concerned with the study of representations of the first Weyl algebra that are finite-rank free $R$-modules ($R$-lattices). Our main result shows that given an $R[x]$-lattice $V$, it admits a left module structure over the Weyl algebra (equivalently, an $R$-linear connection) if and only if all of its indecomposable summands have the form $R[x]\otimes_{R[x^p]}N$, where $N$ is an indecomposable $R[x^p]$-lattice of rank divisible by $p$. We also classify, up to isomorphism, all lattices over the $p$-Weyl algebra (defined by $[y,x]=p$) for which the action of $x$ modulo $p$ is regular nilpotent.

comments
Preliminary version, 8 pages, all comments welcome
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2611.11575 ↗

Let $D_n^\varepsilon$ denote the Dynkin diagram of type $D_{n+1}$ with the endpoint $\varepsilon$ of its long branch frozen, and let $\mathcal{M}(D_n^\varepsilon)$ be the mutation class of any orientation of this diagram under mutations at mutable vertices. For each $Γ\in\mathcal{M}(D_n^\varepsilon)$, we define an inverse monoid $M_Γ$ by generators and relations determined by $Γ$. We prove that $M_Γ\cong M_{μ_k(Γ)}$ for every mutable vertex $k$. Consequently, every quiver in this mutation class yields a presentation of the inverse Artin monoid of type $D_n$. Our argument establishes mutation invariance for the presentations of inverse Artin monoids of both types $A_n^\varepsilon$ and $D_n^\varepsilon$.

fields
Representation Theory
pdf ↗ page arXiv:2611.11880 ↗

We prove that all $W_1$-equivariant multilinear operations on the Witt Lie algebra $W_1$ are Lie polynomials. We study this question in terms of Wronskian Lie brackets and Novikov products, which are abstractions of the Lie bracket $[a,b]:=ab'-ba'$ and the nonassociative product $a\circ b=ab'$ one can define on a commutative differential algebra. In terms of these notions, our main result asserts that the operad of Wronskian Lie algebras is isomorphic to the operad of equivariant multilinear operations on~$W_1$; we also prove a parallel result for the operad of Novikov algebras, characterizing it as the operad of affine equivariant multilinear operations on $W_1$. Two immediate consequences of our work are a characterization of Lie polynomials in free Novikov algebras and a computation of the degree zero homology of the operadic twisting of the Novikov operad. Finally, while it is known that over a field of zero characteristic, a Novikov algebra embeds into its differential envelope, we show that the same is not necessarily true for Wronskian Lie algebras.

comments
21 pages, this supersedes the preprint https://arxiv.org/abs/2609.08538 of two of the authors
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2611.11900 ↗

We construct finite-dimensional symmetric algebras admitting nonprojective self-orthogonal modules from Frobenius algebras equipped with a module satisfying explicit stable and homological conditions. The resulting modules have complexity three, and their stable endomorphism algebras are isomorphic to the algebra of dual numbers over the ground field. The construction combines a variable input with a fixed auxiliary factor carrying the required twisting, and preserves the input through specified quotient and corner constructions. The proof combines derived induction, an obstruction to perfect factorization, and a cone construction over a Gorenstein triangular matrix algebra. For a symmetric algebra and a self-orthogonal generator, we describe the derived category of the opposite endomorphism algebra through a recollement with a two-term $2$-symmetric dg algebra. For our counterexamples, it is formal and quasi-isomorphic to an explicit four-dimensional dg algebra. Applications to cyclic coverings of a quantum exterior algebra yield connected examples with explicitly determined numbers of simple modules. The construction works over every field containing an element of infinite multiplicative order.

comments
50 pages
fields
Representation Theory, Category Theory, Rings and Algebras
pdf ↗ page arXiv:2611.12176 ↗

We classify the connected finite-dimensional gentle algebras of finite global dimension whose global-dimension spectra under derived equivalence are not intervals of integers. These are precisely the algebras with AAG invariant $[(2,4g)]$, where $g\geq2$, whose canonical line field is induced by a nowhere-vanishing vector field. Their spectrum is $\{2g,2g+2,\ldots,4g\}$. For each $g\geq2$, there are exactly two such derived-equivalence classes, distinguished by their Arf invariant. The geometric foundation is a realisation theorem for prescribed polygon weights in arbitrary genus. For an AAG invariant $[(m_i,n_i)]_{i=1}^b$ arising from such an algebra, the global dimensions attained in its AAG fibre form the integer interval $[\max_i\lceil n_i/m_i\rceil,\max_i n_i]$. By controlling the complete line-field invariant through local ribbon-graph constructions, we determine the spectrum in every derived-equivalence class.

fields
Representation Theory
pdf ↗ page arXiv:2611.12492 ↗

We classify all noncritical levels $k$ for which the simple affine vertex algebra $L_k(\mathfrak{g})$ is quasi-lisse, for every finite-dimensional complex simple Lie algebra $\mathfrak{g}$. We prove that Fiebig's equivalence between the corresponding noncritical blocks of category $\mathcal{O}$ identifies the relevant parabolic Wakimoto modules and the homomorphisms from the corresponding universal affine vertex algebras. Combining this compatibility with a characterization of semisimple points in associated varieties, we establish that for coprime positive integers $p,q$, $L_{-h^\vee+p/q}(\mathfrak{g})$ is quasi-lisse if and only if $L_{-h^\vee+p/\gcd(q,r)}(\mathfrak{g})$ is quasi-lisse, where $r$ is the lacing number of $\mathfrak{g}$. The classification at the resulting levels is obtained using Drinfeld–Sokolov reduction, singular vectors and relations in the reductions of the maximal ideals of $V^k(\mathfrak{g})$. We also determine the associated varieties at the quasi-lisse levels for all $\mathfrak{g}$ of rank at most six and for $E_7$ and $E_8$.

comments
126 pages, latex
fields
Representation Theory, Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2611.12723 ↗

Let $G$ be a sporadic simple group, $k$ a field of positive characteristic and assume $B$ is a block of $kG$ with non-trivial defect. In this paper we prove the first Hochschild cohomology group $\mathrm{HH}^1(B)$ is non-vanishing. Furthermore, we prove that for every wild block with abelian defect of a sporadic simple group, we have that $\mathrm{HH}^1(B)$ is a solvable Lie algebra of derived length two, with non-zero maximal toral rank.

comments
21 pages, comments welcome
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2611.12844 ↗

Geometric Topology15

In this paper, we compute the group of homotopy equivalences of closed, smooth, simply connected $6$-manifolds whose integral homology groups are isomorphic to whose of the complex projective space $\mathbb C \mathrm P^3$, building on computations of their mapping class groups.

comments
17 pages
fields
Geometric Topology, Algebraic Topology
pdf ↗ page arXiv:2611.09976 ↗

A group action on a topological space induces an action on the space's representation variety. We determine the fixed point sets of this latter action for semifree group actions on surfaces and circle bundles over surfaces. We also discuss implications for mapping tori of periodic maps.

comments
42 pages, 6 figures
fields
Geometric Topology
pdf ↗ page arXiv:2611.10276 ↗

We realize Hironaka's generalized lantern relations by lifting positive braid factorizations. For a nonpencil real line arrangement with no parallel lines, we construct a family of branched coverings on the regular fibers of a blown-up pencil of spheres. The motion of the branch points gives a factorization of a power of the full twist into least liftable powers of half-twists. The Artal-Carmona-Cogolludo-Marco Zariski pair gives two such factorizations of the same braid for a single simple branched covering of the disk. Their lifts are Hurwitz inequivalent even up to simultaneous conjugation by page homeomorphisms. The corresponding Milnor fibers fill the same planar contact three-manifold and have the same incidence matrix. They are homeomorphic and lie in distinct strong symplectic deformation classes.

comments
13 pages
fields
Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2611.10328 ↗

We investigate two kinds of polynomials associated with pseudo-Anosov maps. Each kind consists of three polynomials that are conjugacy invariants of pseudo-Anosov mapping classes and these polynomials contain more information than pseudo-Anosov stretch factors. The first kind is defined by the train track representatives. The second kind is obtained from the first kind by incorporating additional data that encode the transitions among the unpunctured singularities of the invariant foliations. The Birman-Brinkmann-Kawamuro polynomials coincide with those of the second kind. As an application, we prove that the Birman-Brinkmann-Kawamuro polynomials are conjugacy invariants of pseudo-Anosov mapping classes which is also proved by Dodge-Kawamuro, independently.

comments
32 pages, 17 figures
fields
Geometric Topology, Dynamical Systems
pdf ↗ page arXiv:2611.10381 ↗

For a given positive triple of flags, we associate an open set, called a parallel domain, in the symmetric space of $SL_3 (\mathbb{R})$ whose boundary is parametrized by three spacelike geodesics of the pseudo-Riemannian symmetric space $SL_3 (\mathbb{R})/GL_2 (\mathbb{R})$. This construction is a higher-rank analog of how three points in the ideal boundary of the hyperbolic plane have an associated ideal triangle. As an application, using the fact that positive triples determine a representation of the ideal triangle reflection group into $SL_3(\mathbb{R})$, we show that these parallel domains are fundamental domains for the group action in the symmetric space. Moreover, using the explicit construction and combinatorial properties of the Farey tessellation, we compute the asymptotics for the critical exponent in the symmetric space and the Hilbert critical exponent as the triple ratio of the triple of flags goes to infinity.

comments
44 pages, 9 figures, comments welcome!
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2611.10823 ↗

We prove a generation theorem for the homology of certain Koszul complexes which naturally arise as the $E^1$ pages of the stable Rasmussen spectral sequence of torus links. Combining this theorem with recent work of Ballinger, Gorsky, Hogancamp, and Wang, we compute the stable Khovanov-Rozansky $\mathfrak{gl}_N$ homology of torus links and determine its Poincaré series, resolving conjectures of Gorsky, Oblomkov, and Rasmussen and their $\mathfrak{gl}_N$ analogs, over $\mathbb{Q}$. Using these results, we determine the Khovanov homology of $T(n,n-1)$ and $T(n,n)$ over $\mathbb{Q}$, confirming conjectures of Shumakovitch and Turner and of the first author, which in turn allows us to compute the Khovanov skein lasagna module of $\overline{\mathbb{CP}^2}$ over $\mathbb{Q}$.

comments
21 pages
fields
Geometric Topology, Commutative Algebra, Quantum Algebra
pdf ↗ page arXiv:2611.10885 ↗

We construct absolute mod-two gradings on framed real monopole Floer homology, for real 3-manifolds such that the image of the fixed point set in the quotient is nullhomologous. This allows us to fix the sign of Miyazawa's degree invariant. Our construction uses a mod-two index-theoretic correction term, the Arf invariant.

comments
35 pages, 5 figures
fields
Geometric Topology
pdf ↗ page arXiv:2611.10927 ↗

We study which groups arise as fundamental groups of complements of affine Hurwitz curves. In every such group the product of the meridians is central and maps to the vector of component degrees in homology; this rules out, for instance, the Baumslag-Solitar groups $\operatorname{BS}(p,q)$ with $\lvert p\rvert\neq\lvert q\rvert$, and the groups of links with at least two components and vanishing linking numbers. O. V. Kulikova circumvented this obstruction for $\operatorname{BS}(2,3)$ by passing to the non-Hopfian group $\operatorname{BS}(2,3)\times\mathbb{Z}$, which Vik. S. Kulikov's doubling algorithm realizes in degree $768$. We give an explicit braid monodromy factorization of degree 12 with this group. The corresponding curve is not isotopic to an algebraic curve, yet it is obtained from a union of three quartics in a pencil by a single twist along a circle. More generally, for every closed braid $\hatβ$ we realize $π_1(S^3\setminus\hatβ)\times\mathbb{Z}$ by an explicit Hurwitz curve, again a twist of a union of quartics in a pencil. In the other direction, a Hurwitz curve with group $\operatorname{BS}(k,k+1)\times\mathbb{Z}$ has degree at least $4$, as every Hurwitz curve consisting of a conic and a line is H-isotopic to an algebraic one, after separation of its critical points. Finally, we show that certain semiholomorphic germs, among them those realizing the generalized Borromean rings, are braided surfaces but not Hurwitz curve germs.

comments
39 pages
fields
Geometric Topology, Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2611.11092 ↗

We show that the amenable category is monotone with respect to the domination relation for geometric $4$-manifolds and their connected sums.

comments
11 pages
fields
Geometric Topology, Algebraic Topology, Group Theory
pdf ↗ page arXiv:2611.11247 ↗

We use the knots-quivers correspondence to prove that the colored HOMFLY-PT polynomial of a rational knot has a tail and give an explicit formula for calculating the tail in terms of the quiver.

comments
43 pages, 13 figures
fields
Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2611.11685 ↗

In this paper, we show that a proper continuous open discrete map from the open unit ball $B^n$ onto a domain in $\R^n$ with $n\geq5$ is a homeomorphism whenever its branch set is compact. This answers Vuorinen's question affirmatively in every dimension $n\ge5.$ In dimension four, we also show that, under the additional assumption of quasiregularity, the map is a quasiconformal homeomorphism. Together with the three-dimensional theorem of Kauranen, Luisto and Tengvall, these results answer the quasiregular question posed as Problem~7.66 in the collections of Barth–Brannan–Hayman and Hayman–Lingham in every dimension $n\ge3$.

fields
Geometric Topology, Algebraic Topology, Complex Variables
pdf ↗ page arXiv:2611.11844 ↗

We prove that there are infinitely many Hitchin $\operatorname{SL}^\pm(3, \mathbb Z)$-representations of a Coxeter $n$-gon($n \geq 9$) group whose boundary parameters are fixed. We construct infinitely many Hitchin $\operatorname{SL}^\pm(3, \mathbb Z)$-representations of a specific Coxeter $6$-gon or $8$-gon corresponding to positive integral points of a generalized Markoff equation.

comments
13 pages
fields
Geometric Topology, Number Theory
pdf ↗ page arXiv:2611.11930 ↗

We study traces of quantum modular cocycles at fixed points of hyperbolic elements $γ\in\operatorname{SL}_2(\mathbb{Z})$, formulate an algebraicity conjecture for these traces, and prove it for the cocycles associated to 1-dimensional state-integrals. In addition, we analyse a finite TQFT associated with $γ$ and conjecture that its invariants for 3-manifolds agree with the traces of their $\mathfrak{sl}_2$ quantum modular cocycles. The finite TQFTs predict a yet-to-be-defined motive with cohomology equipped with a $\mathbb{Z}/2\mathbb{Z}$-degree grading and a $\mathbb{Z}$-weight grading coming from a version of the Riemann hypothesis, which suggests a similar grading should exist for an extension of the Kauffman bracket skein module, for the framed $\operatorname{SL}_2(\mathbb{C})$ Floer cohomology of Abouzaid–Manolescu, and for the quantum modular cocycle. This leads to surprising additive identities among algebraic units, which we confirm for the complement of the simplest hyperbolic knot $4_1$, as well as for $S^1 \times Σ_g$ for a closed genus $g$ surface.

comments
31 pages, 7 figures
fields
Geometric Topology, Number Theory
pdf ↗ page arXiv:2611.12257 ↗

Bers proved that any genus $g$ hyperbolic surface admits a pants decomposition of length bounded above by a function of its genus. The goal here is to provide an explicit upper bound for the sums of lengths which is on the order of $(g \log(g)) ^{3/2}$.

comments
20 pages, 5 figures
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2611.12473 ↗

We prove that every rationally null-homologous Floer simple knot in a closed, oriented, irreducible three-manifold with nonzero Thurston norm is unknotted. The proof combines a cut-and-reglue comparison for extremal Floer groups with Binns's theorem on Floer-minimal knots in balanced sutured manifolds.

fields
Geometric Topology, General Topology
pdf ↗ page arXiv:2611.12522 ↗

Group Theory15

Properties $[T_k]$ and finiteness properties $FP_k(\mathbb{Q})$ and $F_k$ are refinements of the following fundamental notions for groups: Kazhdan property T in the first case, and finite generation/presentation in the last two cases. Under suitable hypotheses on the thickness, we prove that every twin building lattice of $(k+1)$-spherical type $(W,S)$, where $k\geq 1$, has property $[T_k]$ and is of type $FP_k(\mathbb{Q})$. If $(W,S)$ is classical, that group is even of type $F_k$. To the best of the author's knowledge, this produces the first examples of infinite finitely presented simple groups with property $[T_k]$ for some $k\geq 2$, and the first examples of finitely presented simple Kazhdan groups that are Frobenius stable and not Frobenius approximable. Along the way, we establish new criteria for property $[T_k]$ for groups acting on CW complexes that extend results of Dymara–Januszkiewicz and Grinbaum-Reizis–Oppenheim. As a key step in our proofs, we determine high acyclicity and, in classical type, high connectivity properties for the opposite complex of a Moufang twin building of $(k+1)$-spherical type and suitable finite thickness.

comments
64 pages. No use of AI at any stage, except for sporadic use of the spellcheck "Writefull" on Overleaf
fields
Group Theory
pdf ↗ page arXiv:2611.10101 ↗

Let $H$ be a multiplicatively written monoid with identity element $1_H$. The family $\mathcal{P}_{\mathrm{fin},1}(H)$ of all finite subsets of $H$ containing $1_H$ is a monoid with identity $\{1_H\}$ under the setwise multiplication induced by $H$. We prove that $\operatorname{Aut}(\mathcal{P}_{\mathrm{fin},1}(H)) \cong \operatorname{Aut}(H)$ whenever $H$ satisfies either of the following two conditions: (1) $H$ is commutative, cancellative, and contains an invertible element of infinite order; (2) $H$ is an abelian group which is not isomorphic to the Klein four-group.

comments
10 pages
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.10645 ↗

Motivated by Problem 13 posed by Araújo, Araújo and Kinyon \cite{Araujo2025} concerning marginal elements, subsemigroups and marginal equivalences associated with commutator words in completely regular semigroups, in this paper we investigate the two commutator words $ ω_1(x,y)=x^{-1}y^{-1}xy$ and $ ω_2(x,y)=(yx)^{-1}xy$ on completely regular semigroups. We prove that their marginal equivalences $\sim_{ω_r}$ ($r=1,2$) coincide and are congruences. More precisely, for a completely regular semigroup $S$, we show that $a\sim_{ω_r}b$ ($r=1,2$) if and only if $a^0=b^0=p$ and $b^{-1}a\in Z(pSp)$, where $Z(pSp)$ is the center of the monoid $pSp$, and so both words have the same set of marginal elements: \[ M_ω(S) =\bigcup_{p\in E(S)} \bigl(Z(pSp)\cap H_p\bigr), \] where $E(S)$ is the set of idempotents in $S$. We also characterize when this set is a subsemigroup and establish alternative descriptions of the common marginal congruence and marginal elements.

comments
10pages
fields
Group Theory
pdf ↗ page arXiv:2611.10680 ↗

We construct a non-homogeneous local representation of the braid group $B_n$ by tracking the labels of individual strands through successive crossings. Each generator acts through a $2\times2$ block whose position is determined by the crossing and whose coefficients depend on the ordered labels of the participating strands. Starting with the ansatz \[ M_{xy}=\begin{pmatrix}a_x&a_y\\ b_{xy}&c_{xy}\end{pmatrix}, \] for $n\geq3$, the cubic braid relations for arbitrary ordered triples of strands determine $c_{xy}=0$ and $b_{xy}=(1-a_x)/a_x$ in the nondegenerate branch. The moving-label rule leads to an explicit semidirect-product representation, for which we prove the Artin relations and use exact evaluations of the resulting symbolic matrices. In the special homogeneous specialization, where $a_x=a$ for every strand label $x$, the resulting matrix representation is diagonally equivalent to unreduced Burau. We prove that a non-homogeneous specialization of our representation detects Bigelow's explicit nontrivial $B_5$ Burau-kernel commutator. Thus the strand-dependent coefficients distinguish a nontrivial braid that is invisible to the classical Burau representation. This separation provides evidence that the non-homogeneous strand-tracking construction is a promising candidate for a faithful Burau-type representation.

fields
Group Theory, Mathematical Physics, General Topology
pdf ↗ page arXiv:2611.10850 ↗

The field of mechanistic interpretability is well-suited to collaborative projects between mathematicians and AI researchers. This work describes one such project. We trained a small transformer to learn the language of the Coxeter group affine A2, best known as the symmetries of the tiling of the Euclidean plane by equilateral triangles. We then formulated and proved a word-theoretic conjecture about affine A2 after observing the attention patterns of the trained model.

comments
13 pages, 13 figures, accepted as a poster at the 6th workshop on Mathematical Reasoning and AI; NeurIPS 2026, Atlanta; This version is updated from the camera-ready version which can be found at https://mathai-2026.github.io/cfp/ and https://openreview.net/forum?id=lYImtIt4tA
fields
Group Theory, Representation Theory
pdf ↗ page arXiv:2611.10936 ↗

The Herzog–Schönheim conjecture states that if a group is partitioned into finitely many, and at least two, cosets of subgroups, then two of these subgroups have the same index. We prove the conjecture for all solvable groups, finite or infinite. Sun's bound on unions of cosets, applied in a quotient, is combined with divisibility restrictions on local indices relative to the subgroup generated by the $p$-elements, where $p$ is the largest prime divisor of the order of a minimal counterexample. These restrictions are obtained by counting fixed points in a primitive solvable quotient. This suffices except at the prime $7$, where the counting bound narrowly fails and an additional overlap argument is needed. The proof has been formalized in Lean~4 with mathlib.

fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.11002 ↗

We prove that every Higman$\unicode{x2013}$Thompson group $G_{n,r}$, with $n\ge2$ and $r\ge1$, has property $R_\infty$. In particular, every automorphism of Thompson's group $V = G_{2,1}$ has infinitely many twisted conjugacy classes. These results answer questions of Olukoya and of Lins de Araujo, de Oliveira-Tosti and Santos Rego. We also prove that a homeomorphism under which no eventually periodic sequence has a finite orbit has a locally finite centralizer in $G_{n,r}$.

fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2611.11294 ↗

We prove that every finite soluble group whose Sylow subgroups have nilpotency class at most two is an involutive Yang–Baxter group ($\IYB$-group). This answers a question of Cedó and Okniński \cite{CedoOkninski2025}. The main method of the $\IYB$-structures has been reflected in \cite{MengBallesterJimenez2026}.

comments
10 pages
fields
Group Theory
pdf ↗ page arXiv:2611.11451 ↗

In every fixed positive degree, we show that the cohomology of finite simple groups, algebraic groups and quantum groups, with coefficients in simple modules, can have arbitrarily large dimension. In particular, we disprove Guralnick's conjecture.

fields
Group Theory, Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.11677 ↗

Let $G$ be a finite group and let $N$ be a proper non-trivial normal subgroup of $G$. We say that $(G,N)$ is an \textit{automorphically equivalent pair} if for every element $x\in G\setminus N$, the elements in the coset $xN$ belong to the same orbit under the action of ${\rm Aut}(G)$. This generalizes the concept of a Camina pair and constitutes a particular type of equal order pair. In this note, we determine all automorphically equivalent pairs in the class of finite abelian groups.

fields
Group Theory
pdf ↗ page arXiv:2611.11746 ↗

The Schur exponent conjecture is a long-standing conjecture in group theory, which asserts that $\operatorname{exp}(\mathrm{M}(G))\mid\operatorname{exp}(G)$ for every finite group $G$, where $\mathrm{M}(G)$ denotes the Schur multiplier of $G$. In this article, we prove that the Schur exponent conjecture holds for finite $p$-groups $G$ of nilpotency class at most $2p-2$ when $p$ is an odd prime. Our approach is to establish upper bounds on the exponent of $γ_{s+1}(G)$ for $s\in\mathbb{N}$. Using this approach, we further establish exponent bounds for Schur multipliers, nonabelian exterior squares, and tensor squares of $G$ of arbitrary nilpotency class, improving some existing bounds. Moreover, we show that Moravec's Bogomolov multiplier exponent conjecture holds for finite $p$-groups of nilpotency class at most $2p-1$. Havas conjectured that, for every prime $p>3$, there exists a finite $p$-group of exponent $p$ and nilpotency class $2p-1$ for which the Schur exponent conjecture fails. We show that the Schur exponent conjecture still holds for finite $p$-groups of nilpotency class at most $2p-1$ generated by at most three elements. For four-generator groups of exponent $p$ and class at most $2p-1$, we prove that $\mathrm{M}(G)\cong C_{p^2}^{\,b}\times C_p^{\,a}$ for some $a\ge0$ and $b\in\{0,1\}$.

comments
21 pages
fields
Group Theory
pdf ↗ page arXiv:2611.11865 ↗

We prove that the trace-class special unitary group, equipped with the trace-norm topology, is extremely amenable but is not a Lévy group, answering questions posed by Pestov. The failure of the Lévy property follows from a uniform non-concentration estimate for every nontrivial compact subgroup. Extreme amenability is established through a transverse spectral-gap estimate and trace-norm duality, yielding asymptotic invariance of Lipschitz observables under each fixed finite-dimensional special unitary subgroup. A limiting argument then gives fixed points for continuous actions on arbitrary compact Hausdorff spaces. We also formulate an abstract criterion for extreme amenability based on asymptotic quadratic invariance along a dense chain of compact subgroups. Neither argument uses concentration results for other Schatten exponents.

comments
15 pages
fields
Group Theory, Functional Analysis
pdf ↗ page arXiv:2611.11944 ↗

In this article we prove a well-known conjecture due to M. Gromov that if two infinite finitely generated torsion free nilpotent groups $Γ$ and $Λ$ are Quasi-isometric, then their Mal'cev Completions are isomorphic as Lie groups. We prove this result in more general set-up. We prove that if two infinite finitely generated torsion free nilpotent groups $Γ$ and $Λ$ are Integrable Measure Equivalent, then the Mal'cev completions of $Γ$ and $Λ$ are isomorphic as Lie groups. Equivalently, using Y. Shalom's result we prove that two infinite countable torsion free nilpotent groups $Γ$ and $Λ$ are Integrable Measure Equivalent if and only if $Γ$ and $Λ$ are quasi-isometric if and only if the Mal'cev Completions of $Γ$ and $Λ$ are isomorphic as Lie groups. Moreover, we discuss some applications of our main theorem to lifting of quasi-isometric embedding from $Γ$ to $Λ$ to a homo-morphism between their Mal'cev completions, and betti numbers of nilpotent groups.

comments
27 pages
fields
Group Theory, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.12009 ↗

Let $k$ be any commutative ring of characteristic $0$. We construct an example of a countably presented Gorenstein projective module over the algebra of Thompson's group $F$ with coefficients in $k$, that is not Benson cofibrant. In particular, we provide a negative answer to a conjecture proposed by Dembegioti and Talelli. The construction uses a general method that produces totally acyclic complexes of flat modules and is based on the computation of the (co-)cohomology of $F$ by Brown and Geoghegan.

fields
Group Theory
pdf ↗ page arXiv:2611.12357 ↗

By Sylow's theorem, the number of Sylow $p$-subgroups of a finite group is congruent to $1$ modulo $p$, but not every such integer occurs. Frobenius extended the congruence to the number of subgroups of order $p^a$ for every $a\ge0$. Kulakoff and Hall showed that this number is congruent to $1$ or $1+p$ modulo $p^2$ whenever $p^{a+1}$ divides the group order. A positive integer is a Frobenius $p$-number if it is the number of subgroups of order $p^a$ of some finite group for some $a$. There are integers congruent to $1$ modulo $p^2$ which are not Frobenius $p$-numbers, and it remained open whether there are also such integers congruent to $1+p$ modulo $p^2$. We show that no finite group has exactly $106$ subgroups of order $5^a$ for any $a\ge0$.

comments
12 pages
fields
Group Theory
pdf ↗ page arXiv:2611.12790 ↗

Rings and Algebras15

We prove that summability characterises precisely when a topological MV-algebra can be realized as the unit interval of a lattice-ordered topological abelian group, thereby providing a topological lifting of both Mundici equivalence and DiNola–Lettieri equivalence. Applications include a Birkhoff–Kakutani-type metrisation theorem, a second-countability criterion, and a topological extension of a key continuity lemma from the proof theory of first-order Łukasiewicz logic—following Baaz–Metcalfe's hypersequent approach to approximate completenesss—and provides an $A$-valued topological semantics for the approximate strong completeness of~$\mathbf{G}\text{Ł}\forall$, where $A$ ranges over summable topological MV-algebras.

comments
48 pages. An earlier version of this paper was posted on Zenodo: https://doi.org/10.5281/zenodo.23973268
fields
Rings and Algebras, General Topology, Logic
pdf ↗ page arXiv:2611.10087 ↗

We consider two extensions associated with a nonzero finite-dimensional symplectic module $V$ over a complex semisimple Lie algebra $\mathfrak{s}$, and study their rigidity. The toral extension adjoins a derivation acting as the identity on $V$ and trivially on $\mathfrak{s}$; the Heisenberg extension uses the invariant symplectic form on $V$ to define a central bracket. For the toral extension, we compute the first and second adjoint cohomology groups in terms of $\operatorname{End}_{\mathfrak{s}}(V)$, and obtain rigidity precisely when $V$ is irreducible. These results hold for arbitrary nonzero finite-dimensional modules. For the Heisenberg extension, we express the second adjoint cohomology as the kernel of a map combining the symplectic centralizer with an equivariant Jacobi map. A Killing-form argument shows that every multiplicity-free sum of irreducible symplectic modules gives an algebraically rigid Heisenberg extension. We also treat constructions with independent toral generators or Heisenberg centers. Repeated summands lead to explicit nonrigid examples, including a deformation to $\mathfrak{sl}_3$. The proofs use invariant cochains and recover several previously studied families.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.10747 ↗

The commuting graph (CG) of a finite-dimensional Lie algebra over a field of characteristic zero forgets the linear structure, and a non-trivial center creates redundant vertices. We introduce linear structure graphs (LSGs), whose vertices are the nonzero vectors of a vector space and whose edge set is stable under linear operations. Each vertex generates a finite ascending sequence of subspaces, which defines its LSG-depth; this depth governs connectivity. We characterize LSGs of depth at most 1 and show that the CG of a Lie algebra with trivial center has depth at most 1 if and only if the algebra is a commutative transitive Lie algebra (CTLA). The reduced commuting graph (RCG) restricts the CG to a complement of the center; it is well defined up to LSG-isomorphism, preserves the connectivity, diameter and number of components of the CG, and is compatible with direct sums. Finally, we characterize almost abelian Lie algebras (AALAs) by their RCGs.

comments
32 pages, no figure
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2611.10788 ↗

We determine the interval between the varieties generated by the nonempty and full power semirings of a semigroup satisfying \(xy\approx x^2\). It has two elements for a one-element semigroup, three for a nontrivial left-zero or null semigroup, and seven otherwise, without any finiteness assumption. In the seven-element case the interval is \([\Rvar,\Rvar^0]\), where \(\Rvar=\Mod_{\rm ai}\{xy\approx xz\}\) and \(\Rvar^0\) is its zero-adjunction variety. Every word absorption valid in \(\Rvar\) but not in \(\Rvar^0\) is equivalent over \(\Rvar^0\) to one of six relative identities. We give exact absorption criteria and finite bases for all seven varieties. Three have basis rank two and four have basis rank three; their two-generated free algebras have orders \(15\), \(24\), or \(35\). We also count the finite-rank free algebras of both endpoints.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.11082 ↗

We introduce self-module Lie bialgebras as a common framework for bialgebra structures associated with different types of Manin triples of Lie algebras. A self-module Lie algebra is a Lie algebra with a specified representation on its underlying vector space; equivalently, it is an NS-Lie algebra expressed in different notation. We define a generic Manin triple as a finite-dimensional Lie algebra equipped with a nondegenerate bilinear form and two complementary isotropic Lie subalgebras, and establish the equivalence among standard generic Manin triples, suitable matched pairs of Lie algebras, families of matched pairs of self-module Lie algebras and self-module Lie bialgebras. The framework recovers Lie, pre-Lie and anti-pre-Lie bialgebras as special cases and admits examples outside these three families. We also introduce the self-module Lie Yang-Baxter equation and show that its solutions yield self-module Lie bialgebras and admit the $\mathcal{O}$-operator characterization. Finally, we obtain solutions in semi-direct product self-module Lie algebras, including constructions arising from self-bimodule pre-Lie algebras.

comments
28 pages, 1 figure, 1 table
fields
Rings and Algebras
pdf ↗ page arXiv:2611.11168 ↗

Let $C$ be an algebraically closed field of characteristic zero, and let $K=C(x)$ with $σ(x)=x+1$. We show that every closed subgroup $G\subseteq\GL_n(C)$ with cyclic component group $G/G^\circ$ can be realized as the \PV{} group of a system $σY=A(x)Y$. Here $G^\circ$ denotes the identity component of $G$. Moreover, we can choose the coefficient matrix to have the formal expansion $A(x)=h+O(x^{-2})$ at infinity, where $h\in G(C)$ is semisimple. This gives an affirmative answer to the conjecture of van der Put and Singer in their monograph \emph{Galois Theory of Difference Equations} (Lecture Notes in Mathematics, vol.~1666). The original results in this paper were entirely generated by ChatGPT 6 and the MechMath Agent Team (MMAT) developed by the Key Laboratory of Mathematics Mechanization, AMSS, CAS. The author reviewed and simplified the initial proofs and verified the correctness of the results.

comments
14 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.11397 ↗

Let $\mathbb{F}$ be a field, and let $A_1,\cdots,A_m$ be pairwise commuting $n\times n$ matrices. For $m\geq3$ and $n\geq2$, we prove \[ \dim_{\mathbb{F}} \mathbb{F}[A_1,\cdots,A_m] \leq \left\lceil C_m(n-1)\right\rceil \quad\text{with}\quad C_m=\frac{Γ(m)}{Γ((m+1)/2)^2}. \] In particular, three commuting matrices generate an algebra of dimension at most $2n-2$.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.11550 ↗

We introduce a framework for measuring the depth of classification failure relative to a chosen invariant. A \emph{shadow map} records visible structure while suppressing finer information; lift packages recover this information in successive layers, and lift height measures the depth through which classification ambiguity persists. Canonical reduction removes redundant stages and yields an essential notion of lift height. For nilpotent groups, the lower central series provides a natural commutator lift tower, with lift height controlled by nilpotency class and decreasing under refinement of the shadow. The associated graded structure gives a Lie-theoretic interpretation of the successive commutator layers. The main examples show that classification depth is genuinely unbounded. Over any field of characteristic different from two, and for every positive integer, there exist nilpotent Lie algebras with the same fixed four-dimensional abelianisation whose commutator lift packages agree through the prescribed number of layers but differ at the next layer. Moreover, such separation can occur at arbitrarily large degree even when the complete underlying lower-central graded vector space is fixed. Thus neither a fixed shadow nor the dimensions, or even the underlying vector-space structure, of the lower-central graded object impose a uniform bound on the depth at which new commutator information may appear.

comments
28 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.11611 ↗

For each integer $n\ge5$, we construct a hereditary artinian ring of finite representation type with Coxeter diagram $I_2(n)$. Both of its diagonal division rings are two-generated over the field $\mathbb{Q}(ζ)$, where $ζ$ is a primitive root of unity of order $n-2$. The construction is based on a chain of quantized Weyl relations and a shift automorphism. We give one-sided bases for the corresponding division ring extensions and compute the right dimension sequence of the bimodule. The resulting ring has exactly $n$ isomorphism classes of indecomposable finitely generated right modules.

comments
7 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.11619 ↗

Becker's conjecture asserts that a rational composition of sums of $d$-th powers of size $[r,s,n]$, with $d>2$, requires $n \ge rs$. We show that this formulation fails over every characteristic-zero field in odd degree, and in every degree over a suitable finite extension of $\Q$. Over formally real fields in even degree, however, we prove that every polynomial composition satisfies $n\ge rs$.

comments
6 pages
fields
Rings and Algebras, Number Theory
pdf ↗ page arXiv:2611.11750 ↗

We study group gradings on triangular algebras relative to a well-ordered basis, with multiplication $x\circ_λy=xy+λyx$. For $λ\notin\{0,\pm1\}$, every grading on a finite-dimensional triangular algebra is isomorphic to an elementary grading. In infinite dimension, the same conclusion holds for the algebra of finite-range maps, for the finite-map algebra on a basis of order type $ω$, and for closed gradings on the full triangular algebra. The infinite-dimensional results also hold for $λ=1$ in characteristic different from $2$. For intermediate algebras whose finite-range ideal is graded, we obtain an elementary description relative to a unitriangular basis. The proofs construct neutral associative idempotents with singleton diagonal supports. We also prove that the radical of the full triangular algebra is graded for every nonzero $λ$, and that gradings on the finite-range algebra and closed gradings on the full algebra have finite support under the classification hypotheses.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.11767 ↗

Let $\mathcal{DP}_{n}^{-}$ denote the monoid of all order-decreasing partial isometries on a chain with $n$ elements, and let $\mathcal{ODP}_{n}^{-}$ denote the submonoid of $\mathcal{DP}_{n}^{-}$ consisting of all order-preserving partial isometries. In this paper, for each $1\leq r\leq n$, we determine minimal generating sets of the ideals $\mathcal{ODP}^{-}(n,r) =\{ α\in \mathcal{ODP}^{-}_{n} : \lvert \im(α) \rvert \leq r \}$ of $\mathcal{ODP}^{-}_{n}$ and $\mathcal{DP}^{-}(n,r) =\{ α\in \mathcal{DP}^{-}_{n} : \lvert \im(α) \rvert \leq r \}$ of $\mathcal{DP}^{-}_{n}$, thereby determining their ranks. Furthermore, we give presentations for the monoids $\mathcal{ODP}^{-}_{n}$ and $\mathcal{DP}^{-}_{n}$.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.12150 ↗

We construct an example of a non-Archimedean valued skew field k, with elements a and b of distinct absolute value such that there are no p, q $\in$ k[x] (x a central indeterminate) such that (x -b)(x -a) = pq, p similar to x -a, and q similar to x -b. The obstruction lies in the non-existence of a solution in k to Sylvester's equation at -tb = 1. We also disprove a 1963 result by Cohn (also reproduced in Cohn's 2006 monograph), by constructing a domain with similar elements a and b with a an atom and b not a product of atoms (resp., a product of two atoms, one of them central).

fields
Rings and Algebras
pdf ↗ page arXiv:2611.12297 ↗

We show that universal algebra, and the theory of natural dualities in particular, provides a uniform framework for the dualities between median algebras and bounded poc sets and their Boolean topological variants. We identify the Roller compactification of a CAT(0) cube complex with the profinite completion and the natural extension of the median algebra of its vertices. We then develop the order-theoretic perspective, which leads to a characterization of the profinite completion by the property that its intervals are the canonical extensions of the original ones. Since the basepoint orders of a median algebra have no top in general, we introduce conditional canonical extensions, show that they are unique, and realize them inside the profinite completion. Finally, a transfer theorem carries universal sentences from the finite quotients of a median algebra to its profinite completion, and we close with open questions on a correspondence theory between median algebras and their bounded poc sets.

fields
Rings and Algebras, Group Theory, Logic
pdf ↗ page arXiv:2611.12469 ↗

We study Lie algebras graded by the generalized root system $AG_2$, which is obtained from $G_2$ by adjoining the doubles of its short roots, over fields of characteristic different from $2$ and $3$. We show that every such Lie algebra with a grading subalgebra of type $A_2$ is, modulo its center, the Tits-Kantor-Koecher Lie algebra of a structurable algebra equipped with an idempotent $t$ satisfying $t+\overline{t}=1$. Conversely, every structurable algebra with such an idempotent gives rise to an $(AG_2,A_2)$-graded Lie algebra. We describe the corresponding Peirce decomposition and characterize the additional algebraic structure required for an $(AG_2,G_2)$-grading. Using the classification of central simple structurable algebras, we determine the central simple examples when the characteristic is also different from $5$. Finally, we compare our constructions with the theory of Tits hexagons. For the central simple examples in which all root spaces are non-zero, we determine which ones are Tits-hexagonalizable; in certain cases, this imposes an additional balancing condition on the idempotent.

comments
55 pages
fields
Rings and Algebras, Group Theory
pdf ↗ page arXiv:2611.12536 ↗

Complex Variables12

The dimension conjecture in CR geometry is proved for an arbitrary real-analytic hypersurface. More precisely, we prove that the dimension of the algebra of infinitesimal holomorphic automorphisms of a germ of a holomorphically nondegenerate hypersurface in $\mathbb{C}^N$ in this class does not exceed $N^2+2N$. This number is exactly the corresponding dimension for any nondegenerate hyperquadric in the same ambient space. Moreover, equality holds if and only if the germ is equivalent to a hyperquadric.

fields
Complex Variables
pdf ↗ page arXiv:2611.10314 ↗

We construct a zero-free meromorphic function \[ f(z)=\sum_n\frac{c_n}{z-a_n},\qquad c_n>0,\qquad |a_n|\to\infty,\qquad \sum_{a_n\ne0}\frac{c_n}{|a_n|}<\infty, \] thereby disproving the Clunie–Eremenko–Rossi conjecture. The construction starts from a product of two rotated Airy functions. The zeros of this product are shifted simultaneously so that all residues of $f$ are positive. The poles lie on the rays $e^{\pm iπ/3}[0,\infty)$. The resulting function has order and lower order $3/2$, and the sum of its residues in the disc $|z|\le r$ is asymptotic to $\frac{4}{3π}r^{3/4}$.

fields
Complex Variables
pdf ↗ page arXiv:2611.10492 ↗

On a nonsingular locally Stein Riemann domain over a Stein space, we prove that holomorphic forms of top degree interpolate jets of any fixed order on every closed discrete set finite over the base. For unramified domains, this yields jet interpolation by holomorphic functions, answering a question of Colţoiu and Joiţa for nonsingular sources. More generally, we establish a twisted interpolation theorem over weakly pseudoconvex spaces admitting injective holomorphic immersions into projective space. We also give negative answers to the Levi problem over singular Stein spaces: the Coeuré-Loeb space yields a non-Stein locally Stein unramified Riemann domain over a normal Stein threefold, and a related construction gives a relatively compact, non-Stein locally Stein open subset of a normal Stein fourfold. Finally, the punctured anticanonical bundle of Fornaess' ramified surface is a holomorphically separable increasing union of Stein manifolds that is not Stein, answering a question of Vigna Suria.

comments
24 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.10807 ↗

We give a complete characterization of the holomorphic isometric embeddings $F:(\mathbb{D},k\,ds^2)\rightarrow (\mathbb{G}_2,ds^2)$ of the unit disk into the symmetrized bidisk with respect to the Bergman metric up to a scalar constant. We show that the isometric constant $k$ can take only the values $k=1$ and $k=3$. For $k=3$, we prove that $(2z,z^2)$ is the unique isometry up to a reparametrization. For $k=1$, we construct an isometric embedding which intersects the royal variety at a single point and does not admit a holomorphic lift to the bidisk via the symmetrization map. We further show that this isometric embedding is unique up to reparametrizations. Finally, none of the isometries are totally geodesic.

comments
26 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.10983 ↗

We compute the Bott–Chern and Aeppli cohomology groups of theta toroidal groups in arbitrary dimensions, obtaining explicit dimension formulas and bases in all bidegrees. For general toroidal groups, we determine the Hausdorff reductions of these cohomology groups and show that they coincide with those of theta toroidal groups. We also compute the Bott–Chern and Aeppli cohomology groups themselves in certain specific bidegrees, without passing to their Hausdorff reductions.

comments
40 pages
fields
Complex Variables, Algebraic Geometry, Differential Geometry, Group Theory
pdf ↗ page arXiv:2611.11184 ↗

For every $d\in[1,2]$, we construct a transcendental entire function $f$ whose finite singular value is contained in $\{-1,0,1\}$ and whose escaping set has Hausdorff dimension $d$. For $d<2$, the construction combines spiral corridors with quasiconformal folding. A narrowing Archimedean spiral gives dimension one, while a logarithmic spiral with adjustable width gives intermediate dimensions. The endpoint $d=2$ is realized by the exponential map. This gives an affirmative answer to a question of Bishop posed in 2018.

fields
Complex Variables
pdf ↗ page arXiv:2611.11385 ↗

We embed the Syracuse operator $T(n) = n/2$ (even $n$), $T(n) = (3n+1)/2$ (odd $n$) and the Collatz map $C(n)$ into $\mathbb{C}$ via entire functions of exponential type $π$: $f(z) = \frac{1}{4}(1 + 4z - (1 + 2z)\cos(πz))$ and $F(z) = \frac{1}{4}(2 + 7z - (2 + 5z)\cos(πz))$. We prove five results: (1) every integer periodic cycle $C \subset \mathbb{N}^+$ of $T$ is a strictly attracting Fatou cycle of $f$ with multiplier $μ_f(C) = 3^{N_{\mathrm{odd}}}/2^N = \prod_{n \in C\text{ odd}} \frac{3n}{3n+1} \in (0,1)$, and $μ_f(O_{1,2}) = μ_F(O_{1,4,2}) = 3/4 < 1$; (2) on the Fatou basin $B(O_{1,2})$, $g = f^{\circ 2}$ conjugates to $Φ_j(g(z)) = \frac{3}{4}Φ_j(z)$ with Koenigs Taylor jets $c_2(1) = -\frac{13}{2}π^2$ and $d_2(2) = -\frac{9}{2}π^2$; (3) the Schwarzian derivative is strictly negative on $\mathbb{Z}$ ($S(f)(n) \le 3π^2 - \frac{3}{8}π^4 \approx -6.9196 < 0$), and a repelling Julia 2-cycle $O_{\mathrm{rep}} \subset J(f)$ ($μ\approx 1.2148 > 1$) isolates $B(O_{1,2})$; (4) on $(\mathbb{Z}_2, μ_{\mathrm{Haar}})$, the 2-adic Lyapunov exponent $λ_{\mathrm{Haar}} = \frac{1}{2}\ln(3/4) \approx -0.143841 < 0$ equals $\frac{1}{2}\ln|μ_f(O_{1,2})|$; and (5) we certify 20 theorems in Lean 4 (anc/CollatzAttractor.lean, 0 sorry). These results establish local Fatou invariants and 2-adic ergodic averages for $f(z)$, leaving open whether every $n_0 \in \mathbb{N}^+$ lies in $\bigcup_{k \ge 0} f^{-k}(B(O_{1,2}))$.

comments
3 pages, 3 tables; includes ancillary Lean 4 formalization (anc/CollatzAttractor.lean, 20 machine-checked theorems, 0 sorry) and Python verification suite (anc/collatz_complex_core.py, anc/collatz_mass_verifier.py). Companion replication archive: https://doi.org/10.5281/zenodo.24060394 (Concept DOI: https://doi.org/10.5281/zenodo.24060393)
fields
Complex Variables, Dynamical Systems
pdf ↗ page arXiv:2611.11641 ↗

Let $π\colon X\toΔ$ be a proper holomorphic submersion from a smooth complex manifold onto the unit disc. Suppose that for every $t\inΔ^*$ the fiber $X_t$ is a compact Kahler manifold whose real first Chern class vanishes. We prove that the central fiber X_0 belongs to Fujiki's class $\cC$, that is, X_0 is bimeromorphic to a compact Kahler manifold.

fields
Complex Variables
pdf ↗ page arXiv:2611.11925 ↗

In this paper, we study the singularity structure of the analytic continuation of solutions to the equation $g(λw)=R(g(w))$, where $|λ|<1$ and $R$ is a rational function. We show that the analytic solution \(g\) near zero is branched, and that its analytic continuation yields an infinite-sheeted Riemann surface with various patterns of branch points. In one specific pattern, some branch points are delayed: they appear only when the analytic continuation reaches a particular Riemann sheet. Using this functional-equation framework, we extend the study to first-order nonlinear functional differential equations. We show that the continuation of certain special solutions near an attracting fixed point yields either single-valued or multivalued functions, with the unit circle as a natural boundary on every sheet.

comments
(38 pages, 5 figures)
fields
Complex Variables
pdf ↗ page arXiv:2611.12213 ↗

We establish the sharp unique continuation property for the Cauchy–Riemann operator $\bar{\partial}$ in higher dimensions. Let $0\inΩ\subset \C^n$ be a domain. Suppose $u \in W_{\mathrm{loc}}^{1,2}(Ω; \C^N)$ satisfies the differential inequality \[ |\bar{\partial} u| \leq V |u| \quad \text{a.e.~on } Ω \] with $V \in L_{\mathrm{loc}}^{2n}(Ω)$. If $u$ is $L^2$ flat at the origin, then $u \equiv 0$ on $Ω$.

comments
Comments are welcome
fields
Complex Variables
pdf ↗ page arXiv:2611.12449 ↗

Let $S_{f,n}$ and $K_{f,n}$ denote Schröder's methods of the first and second kind with given order $ n $ ($\geq 2 $) applied to an entire function $ f $. This article investigates the existence of the entire solutions $f$ whenever $ S_{f,n} $ and $ K_{f,n} $ are rational. Utilizing the Nevanlinna theory, we obtain the general form of entire solutions for such equations. It is proved that either of $ S_{f,n} $ and $ K_{f,n} $ is a non-identity rational map if and only if $f = p e^{q}$, for some polynomials $p$ and $q$. Additionally, we provide one recurrence relation of $K_{f,n}$ depending only upon $K_{f,n-1}$.

comments
24 pages
fields
Complex Variables, Numerical Analysis
pdf ↗ page arXiv:2611.12593 ↗

Let $p:\mathbb{C}\to\mathbb{C}$ be a monic polynomial of degree $n\geq 1$. In 1958, Erdős, Herzog, and Piranian conjectured that the length of the lemniscate $\{z\in\mathbb C:|p(z)|=1\}$ is maximized by $p(z)=z^n-1$. We prove this conjecture in every degree and show that equality holds precisely for $p(z)=(z-z_0)^n-e^{iθ}$, where $z_0\in\mathbb C$ and $θ\in\mathbb R$. The proof uses Möbius variations of the critical values and estimates for the inverse branches of $p$, supplemented by rigorous computer-assisted estimates in a finite range of degrees.

comments
63 pages, 5 figures. All comments are welcome!
fields
Complex Variables
pdf ↗ page arXiv:2611.12830 ↗

General Mathematics12

Let $G_m$ be a bounded Vilenkin group and put $R:=\sup_j m_j$. We prove the sharp uniform estimate $$\|K_n\|_1\leq \frac{17}{15\ln 2}\ln R,\qquad n\geq1,$$ for the Fejér kernels associated with the Vilenkin system. The constant $17/(15\ln2)$ is best possible. In the Walsh–Paley case $R=2$, the result reduces exactly to Toledo's sharp estimate $\sup_n\|K_n\|_1=17/15$.

fields
General Mathematics
pdf ↗ page arXiv:2611.09929 ↗

We introduce the notion of graded-edge Rakotch contraction mappings on a generalized metric space with a weighted graph. We prove that the successive iterate of every starting point converge uniformly to a common limit, which is the unique fixed point. We derive an explicit iteration-complexity bound and, under a relaxed triangle inequality, a geometric rate whose constant is the graph invariant. Finally, we illustrate the theory on an explicit real graded contraction that realizes the interior optimum, on a quadratic integral equation, and on finite weighted digraphs.

comments
21 pages, 4 figures
fields
General Mathematics
pdf ↗ page arXiv:2611.09996 ↗

Let $P_{a,b,u}(t)$ be Sharipov's even monic degree-$12$ third cuboid polynomial, with positive pairwise distinct rational parameters. We prove a uniform normal form for its complete factorization over $\mathbb{Q}$. Every factorization consists of at most two even quadratic factors, even irreducible factors of higher degree, and pairs of irreducible factors exchanged by $t\mapsto-t$. After dividing all degrees by the contribution of this symmetry, the normal form satisfies one degree equation, one sign equation, and an obligatory-factor alternative: an even irreducible factor of degree at least six, or an even irreducible quartic with positive rational-square constant term. The arithmetic input is a uniform construction over $\mathbb{Q}_2$, using Newton polygons, Hensel lifting, and a norm obstruction from $\mathbb{Q}_2(i)$. Valuations at all finite primes constrain rational factor constants to signed squares, while the real root equation gives exactly two simple negative roots of the auxiliary sextic. The normal form leaves exactly $22$ of the $76$ nontrivial partitions of $12$, thereby excluding $54$ complete irreducible degree patterns by one argument. Of these exclusions, $37$ follow from evenness alone and $17$ from the additional arithmetic restrictions. All local cases are proved explicitly, and an exact verification script accompanies the algebraic identities and exhaustive partition enumeration. The remaining patterns are necessary possibilities; their realization is not asserted, and full irreducibility remains open.

comments
24 pages, 2 tables; computer-assisted proof
fields
General Mathematics
pdf ↗ page arXiv:2611.10012 ↗

We further develop the theory of congruence speed for integer tetration in non-squarefree numeral systems, building on Appendix B of [M. Ripà and G. Di Pietro (2026), A compact notation for peculiar properties characterizing integer tetration, Notes on Number Theory and Discrete Mathematics, 32(3), 477-496]. For bases coprime to the radix, we establish an eventual floor-difference representation and determine the exact spectrum of attainable least periods. We construct explicit arithmetic progressions containing infinitely many prime bases with nonconstant congruence speed for every non-squarefree radix, thereby proving the coprime-infinitude conjecture posed in Appendix B. We also derive a uniform quadratic bound for the least coprime base with nonconstant congruence speed and establish exact natural densities of nonstabilizing bases, both among integers coprime to the radix and among those not divisible by its radical, together with the corresponding relative density among primes. Finally, we give necessary and sufficient conditions for the perfect-power congruence-speed identity (Equation (2.12) of the cited paper) to hold in arbitrary radices, determine the exact least eventual period when stabilization fails, and establish a separate criterion for the boundary case of the original parameter restriction.

comments
14 pages; Lean 4 formalization available
fields
General Mathematics
pdf ↗ page arXiv:2611.10018 ↗

We prove continuity for reflexive, bisymmetric binary operations that are strictly increasing in each variable, under certain algebraic conditions. In fact, for some algebraic weights we construct a weighted quasi-arithmetic representation of such functions without assuming continuity. An elementary construction gives the case $r=2/3$. More generally, a word equality whose polynomial difference has a unique simple zero $r\in(0,1)$ forces the representation with weight $r$; every algebraic $r$ with no other conjugate in $(0,1)$ arises this way. The proof uses an affine embedding and a dense-domain extension argument.

comments
25 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.10021 ↗

We study the prime supports that eliminate every representation of an even integer $N$ by two positive integers coprime to $6P$. Let $J(k)$ be the largest vanishing instance obtainable with at most $k$ factors of $P$ not dividing $N/2$. We prove $k(\log k)^2\ll J(k)\ll_\varepsilon k^{4+\varepsilon}$ for every $\varepsilon>0$. The upper bound follows by comparing a classical family of shifted-prime representations with a two-dimensional upper sieve for the loss at each additional factor. Retaining the same local density factor in both estimates yields a weighted survival criterion and positivity whenever the number of noncolliding factors above $N^θ$ is sufficiently small compared with $N^θ$, for fixed $0<θ<1/4$. An exact reduction separates a minimum prime cover into forced prime-pair contributions and a residual problem, and gives the lower bound for $J$ along powers of two. Residue occupancies characterize the extremal concentration at a first zero. Explicit discrepancy estimates show that supports with at most eleven factors cannot eliminate every representation when $N>2780460$, nor supports with at most seven noncolliding factors when $N\ge2266292$. Positivity for the complete support of primes up to $\sqrt N$ remains open.

comments
22 pages, 2 tables
fields
General Mathematics
pdf ↗ page arXiv:2611.10059 ↗

This paper is the third part of our detailed investigation of double sums where the inner sum is binomial but incomplete. We prove many identities for these double sums involving quotients of binomial coefficients and additional parameters. In addition, we evaluate some quadratic incomplete sums using Legendre polynomials.

fields
General Mathematics
pdf ↗ page arXiv:2611.10072 ↗

The determinant D(n) of a n x n Hessenberg - Toeplitz matrix is given as product of certain functions of its elements. A compact expression of D(n) is presented and recurrence relations involving determinants and matrix elements of the Hessenberg -Toeplitz matrices are found.

comments
5 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.10291 ↗

This study focuses on modeling tumor–immune interactions through a fractional-order prey–predator framework, where tumor cells act as prey and immune effector cells as predators. To capture the hereditary and memory effects inherent in biological systems, we employ the Hilfer–Katugampola fractional derivative, which flexibly interpolates between Riemann–Liouville and Caputo formulations. In addition, a circuit-based analogy is introduced to map tumor proliferation, immune regulation, and therapeutic interventions onto resistive, capacitive, and inductive elements, providing intuitive interpretation of the dynamics. Analytical investigations, including equilibrium analysis and stability criteria, are conducted across varying fractional orders. Numerical simulations reveal that lower fractional orders lead to delayed oscillations, prolonged tumor persistence, and increased sensitivity to treatment strategies compared with classical integer-order models. The integration of fractional calculus with circuit analogies offers novel insights into tumor–immune dynamics and supports the design of memory-aware therapeutic interventions.

comments
18 pages, 11 figures
fields
General Mathematics
pdf ↗ page arXiv:2611.10727 ↗

In this paper, we study a sequence $b_n$, posed by Fei Wang, which is defined by $b_1=\frac13$ and a convolution-type recursive relation. We derive the generating functions of $nb_n$ and of $b_n$, the latter of which is $\ln\frac{\operatorname{arctanh}x}{x}$, and represent $b_n$ as a moment integral over $[0,1]$ with a positive density. From this representation we prove that the sequence $b_n$ is positive and logarithmically convex, that the sequence $nb_n$ is strictly decreasing, and that the ratio $\frac{b_{n+1}}{b_n}$ is strictly increasing in $n\in\mathbb{N}$ with limit $1$, which answers Wang's problem. We also give a determinantal expression and closed-form formulas for $b_n$ involving Stirling numbers of the first kind and partial Bell polynomials. Finally, we prove that the function $\frac1{\arctan x}$ is logarithmically completely monotonic on $(0,\infty)$.

comments
23 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.11194 ↗

In this paper we study the rate of approximation by matrix transform means of a special subsequence of partial sums of Vilenkin–Fourier series in the spaces $L_p(G_m)$ $(1\le p<\infty)$ and $C(G_m)$.

comments
10 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.11329 ↗

Motivated by some recent works on the following composite functional equation: $$f(x^2+yf(z)) = xf(x)+zf(y), \quad x, y, z \in \R,$$ we solve two related functional inequalities. In each case the solutions are only the constant zero function and the identity on $\R$.

fields
General Mathematics
pdf ↗ page arXiv:2611.11403 ↗

Metric Geometry12

We prove that a $4$-polytope with nine vertices inscribed in the unit sphere $\mathbb{S}^{3}$ has volume at most $\frac{5}{24}\sqrt{10 + 2\sqrt{5}}$, and that, up to orthogonal transformations, equality holds only for the convex hull of a square and a regular pentagon inscribed in $\mathbb{S}^{3}$ in orthogonal $2$-planes through the origin. For the combinatorial type of this polytope, whose boundary complex is the join of a $4$-cycle and a $5$-cycle, we write the signed volume as the pairing, through the Hodge star, of the area vectors of the two cycles, and bound each area vector by finite Fourier analysis; the bound holds for every choice of nine points on the sphere. Since an optimal polytope is simplicial, by a result of Horváth and Lángi, it remains to exclude the other simplicial types, which we do by sum-of-squares certificates checked in exact arithmetic.

fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.10078 ↗

The minimum numbers of points in rational equal-weight spherical designs on the circle are $2304$, $4608$, $9216$, and $9216$ at strengths $4$, $5$, $6$, and $7$, respectively. We construct two nonisometric optimal designs at each strength. At arbitrary strength $t$, we obtain an explicit cardinality divisor $D_t$ with $\log D_t=(1/2+o(1))t\log t$. Applied to the antipodal pairs of a $4608$-point design, Gromov's torus construction gives a flat minimal immersion of $\mathbb{T}^2$ into $S^{4607}$ with $2304$ distinct integral frequencies, attaining Petrunin's sharp Euclidean normal-curvature bound.

comments
35 pages. Includes exact verification algorithms and construction certificates
fields
Metric Geometry, Combinatorics, Differential Geometry
pdf ↗ page arXiv:2611.10702 ↗

The Euclidean view-obstruction problem asks for the critical radius of balls centered at the half-integer lattice that meet every positive ray from the origin. Writing $Δ_n$ for its square, we determine $Δ_8=8/17$, $Δ_9=1087/1980$ and $Δ_{10}=7/11$ by computer-assisted proofs using Kahlon's seven-dimensional theorem.The upper bounds combine full-support subspace averaging, projected lattice coverings and exact finite certificates; dimension ten also requires a finite search through short integer relations. Explicit directions attain all three values, including a ten-dimensional direction previously listed by Gritsenko, Skoruppa and Zagier. In arbitrary dimension, we express their theta-block invariant in geometric normalization and derive the known bounds $c\log(n+1) \le n/12 - Δ_n \le C\log^3(n+1)$, with repeated coordinates allowed throughout. Thus $Δ_n \sim n/12$, while the deficit tends to infinity more slowly than every positive power of $n$. The supplementary archive contains the executable verifiers, exact certificates and archived verification records.

comments
24 pages. The source code and exact verification data accompany this paper in a separate archive available at https://zenodo.org/records/24037416
fields
Metric Geometry
pdf ↗ page arXiv:2611.10782 ↗

Talenti symmetrization rearranges functions on an open connected set $X\subset\mathbb{R}^N$, endowed with a measure $μ$ with continuous positive density, along the superlevel sets of a given function $f$. Talenti proved a Pólya–Szegő principle for it, provided that these sets are $μ$-isoperimetric, have connected boundaries, and are crossed by straight lines of steepest ascent. We show that, if $X$ is convex, these requirements are very rigid: they force the superlevel sets of $f$ to be either parallel half-spaces, or concentric balls, or complements of tubes around an affine subspace of codimension at least two. This identifies the only geometries in which Talenti's Pólya–Szegő principle can be applied. We also prove a family of weighted isoperimetric inequalities in convex cones, showing that complements of tubes around affine subspaces of every codimension at least two do occur.

comments
32 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.10890 ↗

The class of compact metric spaces (metric spaces which induce a compact topology), despite being an important class of metric spaces, is not closed under many natural constructions. For instance, infinite metric products of compact metric spaces will often fail to induce a compact topology, while on the other hand, the topological product of any family of compact metric spaces is always a compact topological space, evidencing a discrepancy between topological and metric products. The notion of metric compact Hausdorff space -- compact Hausdorff spaces equipped with a lower semi-continuous metric -- provides a class of spaces which keep track of metric data and topological data separately, thereby forming a complete and cocomplete category, while including all compact metric spaces. Our main contribution is that this inclusion can be characterised via universal property: the compact metric spaces are the exponentiable metric compact Hausdorff spaces with respect to a natural monoidal structure on the respective category.

comments
15 pages
fields
Metric Geometry, General Topology
pdf ↗ page arXiv:2611.10935 ↗

In this paper, the first construction of an entire class of two-dimensional fractal bodies that float in water in equilibrium is explicitly given. Their boundaries are described by planar fractal Zindler curves which are constructed using fractal projective hedgehogs. The areas of these bodies are seen to be well-defined and their expression is explicitly computed. To this end, a result concerning the continuity of the Lebesgue measure with respect to the Hausdorff metric for compact sets is given. Furthermore, the Hausdorff dimension $w$ of these fractal curves is shown to coincide with the Hausdorff dimension of the graph of a Weierstrass function associated to the corresponding fractal projective hedgehog. The fractal Zindler curves are proved to have halving chords of constant length that split both the area and the $w$-dimensional Hausdorff measure of the curve into exact halves.

fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2611.11309 ↗

The Hölder dimension of a metric space is the infimum of its Hausdorff dimension over all bi-Hölder changes of the metric. Colvin asked whether it can take noninteger values. We show that every metric space of finite upper box dimension has integer Hölder dimension. For a bounded subset of a Euclidean space, the dimension reduction is carried out by a global homeomorphism of the ambient space, built from randomly translated singular functions, which brings the Hausdorff dimension of the set arbitrarily close to its integer part.

comments
6 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.11482 ↗

We construct two countable complete bounded metric spaces at Gromov-Hausdorff distance $1/4$ with no midpoint and hence no shortest curve between them. The proof uses the local existence of optimal correspondences near a space with finitely many self-correspondences of distortion below a fixed positive threshold, each of which is the graph of a bijection.

fields
Metric Geometry
pdf ↗ page arXiv:2611.11527 ↗

We prove that no regular icosahedron in $\mathbb{R}^3$ has a point with rational coordinates on each of its twenty closed faces, in every position, size and orientation, reflections included. This answers a question of I. Bogdanov on MathOverflow. A field automorphism of $\mathbb{C}$ that sends $\sqrt5$ to $-\sqrt5$ reduces the problem to the following statement: for every complex orthogonal $3\times3$ matrix $T$ some real linear combination of $\mathrm{Re}\,T$ and $\mathrm{Im}\,T$ separates ten intervals determined by the faces. We prove this statement by a computer-assisted case analysis over rational parametrizations of rotation frames, in which every inequality is an exact polynomial bound over $\mathbb{Z}[\varphi]$, $\varphi=(1+\sqrt5)/2$; no floating-point arithmetic and no Lipschitz estimates are used. The whole argument, including the $48$ certificates, is formalized in the Lean 4 proof assistant with Mathlib and checked by the Lean kernel; the main theorem depends only on the standard axioms. The mathematical argument and the formalization were produced by AI systems (OpenAI Codex and Anthropic Claude) under the direction of the author; see the statement at the end of the paper.

code
github.com/MikhailLevit1987/icosahedron-rational-faces ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) could not be checked, checked 2026-11-10 build details
comments
8 pages. Lean 4 formalization: https://github.com/MikhailLevit1987/icosahedron-rational-faces (doi:10.5281/zenodo.24059256). The proof and the formalization were produced with AI systems; see the section "Use of AI tools"
fields
Metric Geometry
pdf ↗ page arXiv:2611.11577 ↗

We prove that the distance between the centers of mass $c(K)$ and $c(\partial K)$ of a convex body $K$ and its boundary $\partial K$, respectively, does not exceed $ D_n$ times the width of $K$ in the direction of the vector joining $c(\partial K)$ and $c(K)$. The constant $D_n$ is optimal and coincides with the sharp constant in the problem of bounding the distance between the orthogonal projection of the centroid of a convex body onto a hyperplane and the centroid of its orthogonal projection onto that hyperplane.

comments
16 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.11635 ↗

Positive reach underpins many results in computational geometry and topology. It is used for triangulation criteria, topological inference, and manifold learning. The geometric properties of these sets have therefore been studied intensely. In this paper we focus on the intrinsic metric properties of sets of positive reach. In particular we give an elementary proof of the fact that (closed) sets of reach at least $R$ are $\operatorname{CAT}(1/R^2)$. This fact was established earlier by Alexander and Bishop, using quite significant machinery. The fact that a space is $\operatorname{CAT}(1/R^2)$ offers many advantages, such as the uniqueness and continuity of sufficiently short geodesics, the existence of Fr{é}chet means and by extension the Rips based homotopy reconstruction of Hausmann is available.

fields
Metric Geometry
pdf ↗ page arXiv:2611.12468 ↗

We study coarse embeddings into Hilbert space and the asymptotic dimension of spaces of persistence diagrams and multiparameter persistence modules. We replace doubling, the usual hypothesis for landmark embeddings, by admissible tent covers of bounded multiplicity at every scale: stacking them across dyadic scales gives an explicit $1$-Lipschitz coarse embedding, with lower gauge $c\sqrt{τt}$, or nearly linear for slowly decaying weights, and the same covers bound the asymptotic dimension by the multiplicity. The spaces of persistence diagrams are not doubling but carry such covers, and for diagrams with $n$ points our covers improve the constant of the known landmark embedding by a factor exponential in $n$. Slice by slice, the construction embeds multiparameter modules with boundedly many bars per slice under the matching distance on any finite net of slices, a class that contains the modules with at most $n$ generators. Bounding bars or persistent Betti numbers instead of generators fails: two-parameter modules with one bar on every slice have infinite asymptotic dimension, and neither they nor the modules of bounded support and bounded rank admit a coarse embedding into Hilbert space, under the matching or the interleaving distance.

comments
23 pages, 3 figures
fields
Metric Geometry, Algebraic Topology
pdf ↗ page arXiv:2611.12866 ↗

Quantum Algebra11

For a compact matrix quantum group $G$ with a fundamental unitary representation $u$ of dimension at least two, the reduced operator norm of the self-adjoint main character satisfies $\left \|χ_u+χ_u^*\right \|_{C_r(G)}\geq2\sqrt2$. Within the category of free quantum groups of Kac type, it is known that the minimum $2\sqrt2$ is attained only by free unitary quantum groups. We establish this characterization in full generality, including the non-Kac setting: this minimum is attained if and only if $G$ is isomorphic to a free unitary quantum group $U_Q^+$ as compact matrix quantum groups.

fields
Quantum Algebra, Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.10299 ↗

We apply the theory of hypersurface support by Negron and Pevtsova to prove the naturality of cohomological support of the small quantum Borel groups, with respect to restriction to Levi subalgebras. This in turn implies naturality of cohomological support of the small quantum groups for modules that lift to Lusztig's big quantum group, for instance tilting modules. This allows us to make the recent conditional classification of tensor ideals of abelian type in the category of such tilting modules unconditional.

fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.10519 ↗

The deformed $W$-algebra $W_{q,t}(D_l)$ of type $D_l$ possesses an infinite family of commuting elements that can be viewed as a two-parameter deformation of the classical Hamiltonians for the KdV hierarchy of type $D_l$; these conserved charges are termed local integrals of motion (IMs). Concurrently, the quantum toroidal algebra $U_q(D_l^{"})$ of type $D_l$ admits four distinct representations via free field realizations, each corresponding to one of the four end nodes of the affine Dynkin diagram. Utilizing these representations, we associate an infinite set of commuting operators with each node, which we define as non-local integrals of motion. Both local and non-local integrals of motion act simultaneously on a shared Fock space consisting of $l+1$ free fields. We provide a direct, computational proof demonstrating that these local and non-local integrals of motion mutually commute.

comments
93 pages
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:2611.10580 ↗

We study stretched near-group fusion categories over $\mathbb{C}$ of type $G+k|G|$ for abelian groups $G$ and positive integers $k$, describing the structure of the double including fusion rules, modular data, and Frobenius–Schur indicators under a variety of assumptions. For cyclic $G$, when enough invertible objects exist in the double, we describe all associated de-equivariantizations which connect the existence of stretched near-group fusion categories to the existence of other stretched quadratic categories. All of our results apply to the case $k=1$. In particular, the known existence of $C_{m^2}+m^2$ near-group categories for all positive integers $m$ implies the existence of Haagerup–Izumi fusion categories for all cyclic groups. As a further application, we provide a general conductor bound severely restricting the existence of stretched near-group categories, and for infinitely many abelian groups $G$ of square order, among them $C_4\times C_2^{2j}$ with $j\geq2$, we show that a near-group fusion category $G+k|G|$ exists if and only if $k=0$.

comments
30 pages
fields
Quantum Algebra, Category Theory
pdf ↗ page arXiv:2611.11240 ↗

Marcolli, Chomsky, and Berwick (2025; henceforth MCB) formulate the Merge operation of Minimalism on a Hopf algebra of Connes-Kreimer type, and claim that language and physics obey the same algebraic structure. This paper separates their program into the working hypothesis H, that Merge on workspaces can be described as a Hopf algebra, and the claim P placed on top of it, that language and physics obey the same principle, and examines the validity of H. MCB employs two coproducts in formulating Merge, corresponding to two different translations of movement (Internal Merge): $Δ_d$, which deletes the lower copy, and $Δ_c$, which leaves a trace. MCB uses the former in syntax and the latter at the syntax-semantics interface, but $Δ_d$ is not coassociative, and $Δ_c$ is not connected under the gradings MCB gives and, moreover, not coassociative as long as the labels of traces are retained. Consequently, MCB's algebra is not a Hopf algebra, and the Birkhoff factorization is not a consequence of the Hopf-algebra theorem but of a weaker statement that requires neither coassociativity nor connectedness. There are four ways to recover a Hopf algebra, but none of them can distinguish different traces, and hence none is compatible with Heim-Kratzer-style formal semantics, which reads traces as indexed variables. Thus H does not hold at present, and under the current formulation, making Minimalism a Hopf algebra and preserving its connection with formal semantics are mutually exclusive. Finally, we indicate three directions in which algebraic Minimalism may proceed.

comments
15 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2611.11502 ↗

We determine Nichols algebras associated with several families of pale braidings over an algebraically closed field of characteristic $2$. For the rank-$4$ families under consideration, we obtain presentations by generators and relations, explicit monomial bases and dimension formulas. We also study families of arbitrary rank consisting of a two-dimensional pale block and several points, including cases with both vanishing and nonvanishing interaction parameters. Realizations as Yetter–Drinfeld modules over suitable finite abelian groups yield finite-dimensional pointed Hopf algebras by bosonization.

fields
Quantum Algebra
pdf ↗ page arXiv:2611.11672 ↗

Many important families of algebras $R$ in the areas of quantum groups, quantum topology and noncommutative algebra are root of unity quantum algebras, equipped with Frobenius centers $Z_{\mathrm{Fr}}(R) \subseteq Z(R)$ and quantum Frobenius maps ${\mathrm{Fr}} : R_{\mathrm{class}} \stackrel{\cong}{\longrightarrow} Z_{\mathrm{Fr}}(R)$. We explicitly classify the Frobenius automorphism groups ${\mathrm{Aut}}(R/Z_{\mathrm{Fr}}(R))$ and the ozone groups ${\mathrm{Oz}}(R):= {\mathrm{Aut}}(R/Z(R))$, and prove that all endomorphisms of $R$ fixing its Frobenius center $Z_{\mathrm{Fr}}(R)$ are automorphisms for all algebras $R$ that come from partial root of unity quantum cluster and upper quantum cluster algebras (which have been proved to encompass a vast majority of known quantum algebras). We prove three main theorems that give the above classification results from three different standpoints. As applications, we classify the Frobenius and ozone automorphism groups of all quantum function algebras of simple algebraic groups $G$ not of type $F_4$ or $E_8$ and all quantum unipotent cells at roots of unity for arbitrary symmetrizable Kac–Moody algebras.

comments
39 pages
fields
Quantum Algebra, Combinatorics, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.11699 ↗

Let $\mathcal{C}$ be a near-group fusion category of type $\mathbb Z/4\mathbb Z+k$. We show $k\in\{0,3,4\}$, which then gives a complete characterization of near-group fusion categories determined by $\mathbb Z/4\mathbb Z$.

comments
11 pages; comments welcome
fields
Quantum Algebra
pdf ↗ page arXiv:2611.12191 ↗

We prove that a simple, self-contragredient, rational, $C_2$-cofinite, integer-graded holomorphic vertex operator superalgebra of CFT-type has zero odd part. We first show that a hypothetical nonzero odd part would be a simple current of categorical dimension $-1$ over a strongly rational pointed VOA with four simple modules. We then prove that every nonvacuum simple current of a strongly rational VOA has strictly positive lowest conformal weight. This leads to a contradiction with Dong-Jiao-Xu's theorem on the positivity of categorical dimension.

comments
19 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2611.12417 ↗

We prove that every non-degenerate pivotal braided fusion category with property F is pseudo-unitary and weakly integral. In particular, every modular category with property F is weakly integral. Neither sphericality nor pseudo-unitarity is assumed. Passing to the Drinfeld centre extends the result to degenerate categories whose dimensions are positive on the intersection of the Müger centre with the adjoint subcategory; these include every braided fusion category with a pseudo-unitary Galois conjugate. Physically, the result connects the arithmetic of topological orders to the computational power of anyon braiding: non-integer squared total quantum dimension guarantees infinite braid group images, a necessary condition for universal quantum computation.

comments
11 pages, 2 figures
fields
Quantum Algebra
pdf ↗ page arXiv:2611.12836 ↗

We introduce a concept of counital comodule algebra $(B,δ_B,ε_B)$ over a Hopf ${\mathbb K}$-algebra $H$, where $δ_B: B\rightarrow B \otimes H$ and $ε_B: B\rightarrow {\mathbb K}$ are coaction and counit homomorphisms, respectively. This structure gives a canonical (counital) comodule algebra map $ι_B: B \rightarrow H$. In this paper, we study in details the case $B=O_q$, and $H$ is the quantum loop algebra ${\cal L}U_qsl_2$ for ${\mathbb K}={\mathbb C}$. Here, $O_q$ is the $q$-Onsager algebra with four presentations: (i) the $q$-Dolan-Grady type; (ii) the alternating type; (iii) the root vectors type; (iv) the Drinfeld type. For $(O_q,δ_{O_q},ε_{O_q})$, in fact a 3-parameter family of counital comodule algebras, we establish a Faddeev-Reshetikhin-Takhtajan (FRT) type presentation, which is written in terms of a K-operator satisfying a reflection algebra relation. The coaction $δ_{O_q}$ (resp. $ι_{O_q}$) sends the K-operator to a `dressed' K-operator (resp. K-matrix) using Ding-Frenkel type L-operators of ${\cal L}U_qsl_2$; the counit $ε_{O_q}$ sends the K-operator to the most general (non-diagonal) solution of the reflection equation. The FRT presentation allows to compute the image via $δ_{O_q}$ and $ι_{O_q}$ of the generating functions of $O_q$ for each presentation (ii)-(iv). Moreover, the images of Lu-Wang's generating functions of $O_q$ in the so-called Drinfeld second realization ${}^{Dr}\!{\cal L}U_qsl_2$ are obtained, as well as their images via the (ordinary) coproduct of ${}^{Dr}\!{\cal L}U_qsl_2$, which enhance two theorems by Przeździecki. Finally, we apply our FRT presentation to the construction of new type $q$-characters for ${\cal L}U_qsl_2$, in imaginary root vectors of $O_q$, refining those of Frenkel-Reshetikhin, and we explain representation-theoretic meaning of such refining.

comments
62pp
fields
Quantum Algebra, Mathematical Physics, Representation Theory
pdf ↗ page arXiv:2611.12874 ↗

Logic10

Pym's theorem [Pym62] states that a regular Borel probability measure on a locally compact group is idempotent if and only if it is the normalized Haar measure of a compact subgroup. The Idempotent Measure Conjecture, the definable-group counterpart of [GHK25, Conjecture (A)], proposes an analogous characterization: a global fim Keisler measure on a definable group is idempotent if and only if it is the unique global Keisler measure concentrating on a type-definable subgroup and invariant under translation by elements of that subgroup. We prove this conjecture for virtually solvable definable groups in arbitrary theories. More generally, we establish it for definable groups admitting a finite series of definable normal subgroups whose successive quotients are either virtually solvable or stably embedded with stable induced structure. Finally, we disprove [GHK25, Conjecture (A)] in its automorphism-group formulation in the theory of dense linear orders without endpoints.

comments
22 pages
fields
Logic
pdf ↗ page arXiv:2611.10100 ↗

Given a finite nonlocal game, can the players win with certainty? We prove that the existence of a perfect normal spatial strategy is $Σ^0_2$-complete, even when restricted to games of value one, so it cannot be decided even with an oracle for the halting problem. This is strictly harder than perfect play in the finite-dimensional and commuting-operator models, which are $Σ^0_1$-complete and $Π^0_1$-complete. Within the commuting model, the existence of a perfect normal strategy with a finite or semifinite von Neumann host is $Σ^0_2$-complete, whereas for every fixed type $\mathrm{III}_λ$ subtype it has the same $Π^0_1$-complete language as unrestricted commuting play. A trace thus costs one existential number quantifier: the hardness constructions force every perfect strategy to choose a finite clock period or a finite tree depth. Spatial $Σ^0_2$-completeness also holds when finite entanglement entropy is required, and both forms are formally verified in Lean. For every computable $0<α<1$, perfect spatial play with $\mathrm{Tr}\,h^α<\infty$ for the reduced density $h$ is $Σ^0_2$-complete as well; these conditions form a strict ladder between finite rank and finite entropy. We also prove $Σ^0_2$-completeness for one-shot zero-error communication with normal entanglement, and construct a finite channel with zero-error codes of a given size each of which needs infinite entanglement entropy.

code
github.com/Apsiape/perfect-play-arithmetical-hierarchy ∎ Lean project (lean/lakefile.lean, lean/lean-toolchain) does not build at 42f6035, checked 2026-11-10 build details
comments
106 pages, 1 figure. Archived with programs and Lean sources at doi:10.5281/zenodo.23962889. Theorem A is formalized in Lean 4 with no hypotheses: https://github.com/Apsiape/perfect-play-arithmetical-hierarchy
fields
Logic, Operator Algebras
pdf ↗ page arXiv:2611.10481 ↗

We determine the least cardinality of a set of reals that is not a weak $λ$-set, proving that it is $\max\{\mathfrak b,\mathfrak s\}$, where $\mathfrak b$ and $\mathfrak s$ are the bounding and splitting numbers. We prove that if $\mathfrak s<\mathfrak b$, then every first countable weak $λ$-space is a $λ$-space. We also show, relative to the consistency of $\mathsf{ZFC}$, that the existence of a weak $λ$-set that is not a $λ$-set is independent of $\mathsf{ZFC}+\mathfrak b=\mathfrak s$. In particular, we show that in the model obtained by adding $ω_2$ Cohen reals over a model of $\mathsf{CH}$, every weak $λ$-set is a $λ$-set. Finally, we construct an almost-normal MAD family under $\mathsf{CH}$ and show that no such family exists under $\mathsf{OCA}_{\mathrm T}+\mathfrak{ap}>ω_1$. Thus, the existence of an almost-normal MAD family is independent of $\mathsf{ZFC}$.

comments
27 pages, 2 figures
fields
Logic, General Topology
pdf ↗ page arXiv:2611.11025 ↗

We prove versions of (variations of) Erdős sumset and $B+B+t$ conjectures asked by Kra, Moreira, Richter and Robertson for semigroups equipped with pairwise commuting non-algebraic definable Keisler measures. Our results use model-theoretic methods involving the existence of \emph{many} coheir independent tuples in every definable relation of positive density.

fields
Logic, Combinatorics
pdf ↗ page arXiv:2611.11543 ↗

For each formula $\varphi$, we introduce the public announcement operator $U_\varphi$, which maps every model to its updated model under the public announcement of $\varphi$. We then study its algebraic and dynamic properties with a particular focus on commutativity, monotonicity, idempotence, fixed points, and stabilization. Among many results, we show the following. First, monotonicity of $U_\varphi$ is characterized by a family of preservation conditions and equivalence to an existential formula. Second, there exists a formula that achieves every nonzero ordinal as a stabilization rank—the first stage at which a model stabilizes—of some model. Finally and unexpectedly, extinction of every model under iterated announcements of $\varphi$ is equivalent to common unknowability, being always informative when true, and a fixed point view of the Moore sentence. Over S5, those are further equivalent to common unbelievability and being always informative. Other results include characterizations of commutativity and strong commutativity, idempotence as success, properties of fixed points, and finite and $ω$-stabilization. For analysis, we use PAL (state elimination) and BPAL (arrow elimination), clarifying their subtle differences.

comments
31 pages, 2 figures, 2 tables
fields
Logic
pdf ↗ page arXiv:2611.11911 ↗

Assuming the existence of a measurable cardinal, we produce generic extensions $V_1\subsetneq V_2$ of the universe with the same cardinals, cofinalities, and bounded subsets of $\aleph_ω$, such that $V_2$ is generated over $V_1$ by a cofinal $ω$-sequence in $\aleph_ω$, and $V_2$ is a minimal generic extension over $V_1$, i.e., every set of ordinals in $V_2\setminus V_1$ generates $V_2$ over $V_1$.

fields
Logic
pdf ↗ page arXiv:2611.12039 ↗

The definable closure of a real closed $H$-field $H$ in an ambient closed $H$-field extension $M$ is shown to be an immediate extension of $H$, except in two very special cases, where this is only true after adjunction to $H$ of a particular $H$-definable element of $M$ and then taking the real closure in $M$.

comments
25 pp
fields
Logic, Rings and Algebras
pdf ↗ page arXiv:2611.12495 ↗

Dynamic topological logic (${\bf DTL}$) combines topological and temporal modalities to express asymptotic properties of dynamic systems on topological spaces. A dynamic topological model is a triple $\left <X,f,V\right >$, where $X$ is a topological space, $f:X\to X$ a continuous function and $V$ a truth valuation assigning subsets of $X$ to propositional variables. Valid formulas are those that are true in every model, independently of $X$ or $f$. A natural problem that arises is to identify the logics obtained on familiar spaces, such as $\mathbb R^n$. Slavnov showed that any satisfiable formula could be satisfied in some $\mathbb R^n$ for $n$ large enough, but the question of how the logic varies with $n$ remained open. In this paper we prove that any fragment of ${\bf DTL}$ that is complete for locally finite Kripke frames is complete for $\mathbb R^2$. This includes ${\bf DTL}^\bigcirc$; it also includes some larger fragments, such as ${\bf DTL_1}$, where ``henceforth" may not appear in the scope of a topological operator. We show that satisfiability of any formula of our language in a locally finite Kripke frame implies satisfiability in $\mathbb R^2$ by constructing continuous, open maps from the plane into arbitrary locally finite Kripke frames, which give us a type of bisimulation. We also show that the results cannot be extended to arbitrary formulas of ${\bf DTL}$ by exhibiting a formula which is valid in $\mathbb R^2$ but not in arbitrary topological spaces.

fields
Logic
pdf ↗ page arXiv:2611.12499 ↗

A Ramsey quasi-order is a quasi-order $(\cal{R},\leq)$ such that $\cal{R}$ is a Polish space, $\leq$ is analytic and every analytic subset of $\cal{R}$ is Ramsey. In this paper, we study the transfer of the analytic Ramsey property via monotone quasi-open maps, which are closely related to a family of forcing projections between quasi-orders (ranging from weak projections to strong projections). We apply this framework to the class of topological Ramsey spaces by providing a detailed list of examples of strong projections between topological Ramsey spaces, and show that, for many of these examples, there is no weak projection in the reverse direction. We also exhibit pairs of topological Ramsey spaces that do not weakly project into each other. Finally, partially confirming a conjecture of Dobrinen, we show that every space in a large class of topological Ramsey spaces either strongly projects into the Ellentuck space or contains a dense set of atoms.

comments
122 pages, 1 figure
fields
Logic
pdf ↗ page arXiv:2611.12505 ↗

This paper solves a problem (SP) attributed to Solovay in the 1960s, which is to add an unbounded sequence to a singular cardinal $κ$ without adding bounded subsets to $κ$, while preserving $κ^+$. The solution applies to any cofinality of the singular cardinal, with the assumption that $κ$ is a strong limit needed for the case of uncountable cofinality. Unsuccessful attempts to solve (SP), mostly for the countable cofinality, have appeared in published papers by various authors.

fields
Logic
pdf ↗ page arXiv:2611.12848 ↗

Operator Algebras9

We prove the equivalence of topological and measurewise amenability for $σ$-compact locally compact groupoids with a Hausdorff unit space and a continuous Haar system. This in particular includes the second countable locally compact Hausdorff case. Our proof averages arbitrary Radon probability measures along strictly positive densities to obtain quasi-invariant measures. We overcome the lack of absolute continuity of the original measure with respect to its quasi-invariant substitute by also averaging the Reiter functions along the same density.

comments
11 pages, comments welcome
fields
Operator Algebras, Dynamical Systems
pdf ↗ page arXiv:2611.10010 ↗

We prove analogues of weighted laws of iterated logarithm and laws of logarithm for non-commutative martingales and independent random variables respectively. First we obtain a weighted LIL for non-commutative martingales, extending the sharp unweighted result of arXiv:2509.22037v2 to the case for polynomial weights, then by approximation to a broader class of functions. Then we proved a weighted law of logarithm for triangular array of weights and replacing the coefficient in the denominator by regularly varying functions with index $α$. We show that the normalised sums converge to 0 for $α> 1/2$ and for the case $α=1/2$, we obtain the sharp upper bound with constant $\sqrt{2}$.

comments
Comments are welcome!
fields
Operator Algebras, Functional Analysis, Probability
pdf ↗ page arXiv:2611.10387 ↗

Let $n\geq 2$ be an integer. Set $Γ_n=SL_2(\mathbb{Z})$ (respectively $PSL_2(\mathbb{Z})$) for $n$ even (respectively for $n$ odd). Then $Γ_n$ acts on $\mathbb{Z}^n$ through the restriction of the linear action of $SL_2(\mathbb{R})$ on $\mathbb{R}^n$. We prove that that the von Neumann algebra $L(\mathbb{Z}^n\rtimes Γ_n)$ is a solid factor. This generalizes the case $n=2$ proved by N. Ozawa.

comments
6 pages; comments are welcome
fields
Operator Algebras
pdf ↗ page arXiv:2611.10742 ↗

We establish several characteristic differences between the quantum symmetry groups of directed graphs and their associated graph $C^*$-algebras in the frameworks of Banica and Joardar-Mandal, respectively, considering the family of finite directed graphs without isolated vertices and without multiple edges.

comments
Preliminary version of the article, Comments are welcome
fields
Operator Algebras
pdf ↗ page arXiv:2611.11417 ↗

We give a general proof of the Rényi QNEC formulated using the Araki-Masuda weighted $L_p$ norms for all $p > 2$. This generalizes the algebraic proof of the QNEC applicable at $p=2$. Our approach utilizes a weighted version of a conditional $L_p$ norm which extrapolates the quantum expansion/ant-quantity. We elucidate some properties of the corresponding weighted conditional entropy both for half-sided modular inclusions and for general von Neumann subalgebras with a common cyclic and separating vector. The $p=2$ limit computes a conditional dynamical entropy originally defined in the context of black hole dynamics.

comments
35 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.11760 ↗

We complete a proof of the quantum null energy condition (QNEC) in the mathematical framework of Half-Sided Translations and Modular Inclusions (HST/HSMI) removing an assumption that applied to previous proofs. Here we establish a theorem, which when translated to a physical setting implies that the relative entropy comparing the state of fields outside a stationary black hole with a Hartle-Hawking (HH) state is always a convex function of the horizon cut. Previous proofs only applied when a purification with finite null energy was available. We also obtain a QNEC generalization in which the HH Hilbert space is replaced with one based on a weight which is plausibly of relevance to evaporating black holes in flat space.

comments
42 pages + appendices
fields
Operator Algebras
pdf ↗ page arXiv:2611.11920 ↗

For suitable proper étale groupoids, we study a part of the higher index that is invariant under Morita equivalence. We capture this part by a pairing between cyclic homology classes associated with isotropy groups and cyclic cohomology classes of the groupoid convolution algebra. We show that the pushforward is compatible with the maps induced by essential equivalences. This gives a numerical invariant depending only on the Morita equivalence class of the groupoid. In the case of a finite group action, we relate the resulting pairing to the equivariant index and to the Atiyah-Bott fixed-point formula.

comments
35 pages. Comments are welcome
fields
Operator Algebras, Differential Geometry, K-Theory and Homology
pdf ↗ page arXiv:2611.11982 ↗

For self-adjoint contractions in a finite tracial von Neumann algebra, binary shuffle traces with $m=1,2,4$ occurrences of the second variable admit simultaneous finite-dimensional approximation by commuting diagonal contractions. For every odd $m$, a commuting diagonal self-adjoint pair reproduces any prescribed finite set of shuffle traces exactly. When the first operator has finite spectrum and $m\geq3$ is odd, a weighted symmetric cycle reproduces all degrees simultaneously. We prove fourth-order trace-derivative positivity in finite tracial von Neumann algebras and obtain a positive measure representing the four-occurrence coefficients. For each even $m$, we characterize the contraction model property by positivity of an associated trace-derivative functional.

fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2611.12498 ↗

In this paper, we prove that the space of normalized dimension functions on a unital $C^*$-algebra is either empty or a Choquet simplex. As a byproduct, we show that $W(A)$ is hereditary in $\operatorname{Cu}(A)$ for every $C^*$-algebra $A$. The argument combines an exact factorization for Cuntz comparison with Birkhoff's decomposition of lattice valuations. Moreover, we show that the space of normalized rank functions on a unital ring is either empty or a Choquet simplex.

fields
Operator Algebras
pdf ↗ page arXiv:2611.12518 ↗

Algebraic Topology7

We provide a common explanation for two 4-periodic phenomena arising in the study of connective real K-theory: first, the family of twists of ko over $B\mathbb Z/2$, and second, the torsion in the Picard group of $Q_1$-local $\mathcal A(1)$-modules. These phenomena have been previously studied, as they lead to 4-periodic patterns in Smith homomorphisms, resp. in the ko-homology of $(B\mathbb Z/2)^n$. In this paper, we exhibit both of these 4-periodicities as consequences of an isomorphism of two extraspecial groups of order 32.

comments
23 pages. Comments welcome!
fields
Algebraic Topology
pdf ↗ page arXiv:2611.10243 ↗

We introduce the landscape velocity $ξ$, a scalar measure of variation of a parameter-dependent persistence landscape. For families of finite barcodes whose bars are all born at the fixed filtration value $0$, we show that $ξ$ is the $L^2$ speed of the landscape curve where the sorted death times are differentiable and derive an exact closed formula that requires no persistence landscape at all: the death times of the barcodes, as functions of the parameter, suffice. For the velocity of the empirical mean of several landscapes we also prove a closed formula which, again, strikingly requires neither the empirical mean landscape nor any of the individual landscapes, only the individual barcodes. As an application, we revisit Olsthoorn's persistent homology analysis of the transverse-field Ising chain. Whereas his approach uses different homology degrees and summaries depending on the boundary conditions, ours uses $H_0$ only and a single rule: the position of the maximum of $ξ$. This rule locates the quantum critical point for both periodic and open boundary conditions, and for both mutual-information and correlator-based dissimilarities. The position of the maximum converges to the critical point faster than all the estimators we can extract from Olsthoorn's work. In the 4 scenarios considered (different boundary conditions and different dissimilarity matrices), the peak of the normalized velocity becomes increasingly pronounced with system size, with observed logarithmic growth. This logarithmic growth is proved for periodic boundaries with correlator dissimilarity under stated hypotheses, identifying landscape velocity as a singular topological response to quantum criticality.

comments
68 pages, 21 figures. Accompanying code (version 1.0.0): https://doi.org/10.5281/zenodo.24020159
fields
Algebraic Topology
pdf ↗ page arXiv:2611.11358 ↗

We present an elementary argument showing that fundamental groups of permutation complexes are free. Hence, $\mathbb{R} P^2$ cannot be realized by a permutation complex, answering a question of Chachólski, Levi and Meshulam.

comments
3 pages
fields
Algebraic Topology, Group Theory
pdf ↗ page arXiv:2611.11362 ↗

This expository note gives a short derivation of the classical Spivak normal fibration formula for the total space of a spherical fibration over a Poincaré duality space. We review the associated smooth, PL, and topological manifold realization criteria and illustrate them with examples from the stable stems. The principal application combines these criteria with the completed solution of the Kervaire invariant problem to identify the exceptional stems in a specified family of three cell Poincaré spaces.

comments
This paper is primarily expository. The author claims little originality for this note and does not intend to publish it in a peer-reviewed journal
fields
Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2611.11463 ↗

Working in homotopy type theory, we define relative homotopy groups and give three equivalent definitions of the product on these groups. Using this product, we establish the multiplicativity of the cohomological Serre spectral sequence. We show a connection between the homotopy product and the cup-product in cohomology, which leads to the classically familiar description of the starting page of the spectral sequence as a tensor product of graded rings. As applications, we compute cohomology rings of several classifying spaces and loop spaces of spheres.

fields
Algebraic Topology, Category Theory, Logic
pdf ↗ page arXiv:2611.11828 ↗

Local anomaly polynomials describe local variations, but a normalized Green-Schwarz phase also depends on global background data. We explain this dependence for ten-dimensional three-sphere bundles of quaternionic lines over closed spin seven-manifolds. The backgrounds retain two specified $\mathrm{Spin}(16)$ gauge bundles and an integral differential trivialization on the base, including its boundary identifications. The trivialized class is the sum of half the first Pontryagin class of the tangent bundle and the second Chern class of the quaternionic line's underlying complex bundle. For these backgrounds, the calculation combines a generally nonzero local Green-Schwarz integral with a real eta invariant evaluated by a twelve-dimensional Atiyah-Patodi-Singer filling. Together, these terms determine an integral relative characteristic number; the additive response is one third of that number, modulo integers. When the base's third and fourth rational cohomology groups vanish, the response equals eight times the Crowley-Goette invariant, without assuming that the base is simply connected. A calibration using the actual quaternionic line bundle gives additive value one third on $\mathrm{Sp}(2)$, recovering the known third-root phase. Distinct integral String data on one fixed ten-manifold give all three phase values, showing which global background information the response can detect. The physical identifications retain their prescribed fermion data, while the separate application to integral topological modular forms and vertex operator superalgebras requires compatible integral lifts. The response calculation constructs neither a microscopic realization nor an equivalence of complete theories.

comments
86 pages
fields
Algebraic Topology, Differential Geometry
pdf ↗ page arXiv:2611.12810 ↗

For a simple graph $Γ$ without loops and an integer $n\geq2$, Abrams showed in his Ph.D. thesis that the discrete configuration space $DConf(Γ,n)$ is homeomorphic to a closed $n$-manifold if and only if $n=2$ and $Γ$ is $K_5$ or $K_{3,3}$, the two minimal obstructions to graph planarity. We show that this manifold property persists for the infinite family of discrete configuration spaces obtained by replacing the Kuratowski graphs with the $d$-skeleton of the simplex of dimension $2d+2$, thus recovering Abrams' $K_5$ case when $d=1$. Our manifold recognition argument relies on a recursive application of Whitehead's theorem that collapsible PL manifolds are PL balls, combined with Forman's discrete Morse theory. The resulting construction produces an infinite family of combinatorial spheres that contains the Legendre polytope boundaries and is closed under taking vertex links.

comments
19 pages, 3 figures
fields
Algebraic Topology
pdf ↗ page arXiv:2611.12847 ↗

Commutative Algebra6

We introduce generalized edge ideals by assigning pairwise coprime monomials, instead of variables, to the vertices of a graph. We use the lcm-lattice to show that the multigraded Betti numbers and Castelnuovo-Mumford regularity of the quotient by a generalized edge ideal agree with the Betti numbers and resolution regularity of the quotient by an ordinary edge ideal in a non-standard Z-grading. We define the regularity offset as a measurement of the difference between the regularities of the quotients by a generalized edge ideal and its ordinary counterpart, and prove bounds for the regularity offset. We compute the regularity offset for co-chordal graphs and paths, and derive a formula for the regularity offset of forests. We also derive a graph-theoretic criterion for when a forest's regularity offset is always zero, or equivalently, its top-level Betti number is nonzero.

fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.08889 ↗

In this paper, we consider arbitrary regular local ring $S$ and an ideal $J\subset S$ whose minimal primes are cohomologically complete intersection. Using the Mayer-Vietoris spectral sequence, in Section 2, we construct examples of local cohomology modules $H^i_J (S)$, whose set of associated primes is finite. As a special case we show that the set of associated primes $H^i_J (S)$ is finite when minimal primes of $J$ are part of a specific regular system of parameters and satisfy a `Dropping Condition'. In Section 3, we prove Theorem 2.3 along with its asssociated corollary in a more general setting, without the use of `Dropping Condition'. These examples of local cohomology modules include the cases whose associative primes also can contain prime number $p$.

comments
7 pages, comments are welcome
fields
Commutative Algebra
pdf ↗ page arXiv:2611.10064 ↗

We answer a 1968 question of Heinzer by constructing a two-dimensional local divisorial domain whose normalization is not Prüfer.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.11357 ↗

We give answers to four questions on linear bounds for Frobenius powers. Let $\mathfrak m$ denote the homogeneous maximal ideal. We construct a height-two prime $I$ in a geometrically normal four-dimensional graded hypersurface $R$ of characteristic two such that, for every power $q\geq16$ of four, the Loewy length of $H^0_{\mathfrak m}(R/I^{[q]})$ is at least $q^{3/2}/8-1$. Thus no fixed integer $C$ gives annihilation by $\mathfrak m^{Cq}$ for all $q$, as required by the Hochster–Huneke condition $(\mathrm{LC})$. The same construction gives superlinear lower bounds for the Castelnuovo–Mumford regularity in Katzman's question, for the exponents of the embedded primary components in the question of Smith and Swanson, and for the degree in the least variable in Katzman's Gröbner basis conjecture. The bounds follow from the degree of the kernel line bundle of a multiplication pencil associated to a family of plane quartics.

comments
30 pages. Comments welcome!
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.12008 ↗

We introduce split kernel multiplication (SKM) modules, for which every submodule has the form $N=IM\oplus\ker f$, where $I$ is an ideal of $R$ and $f$ is an endomorphism of $M$. We study direct sums, localization, and connections with multiplication and retractability properties. For the idempotent version (ISKM), we prove that $R\oplus k^b$ is ISKM over a local ring $(R,\mathfrak m)$, with residue field $k$ and $b\geq1$, if and only if $\mathfrak m^2=0$. We also classify ISKM modules of the form $R^a\oplus k^b$ over local rings. For commutative Noetherian rings, we show that $R^2$ is SKM if and only if $R$ is an Artinian principal ideal ring. Finally, we prove that every finitely generated $R$-module is ISKM if and only if $R$ is a finite product of fields.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.12320 ↗

We obtain a negative answer to a question of Freudenburg concerning rigidity conditions for a polynomial. We construct a polynomial that does not lie in the kernel of any nonzero locally nilpotent derivation on the polynomial ring, but there exist an affine domain, algebraically independent elements and a locally nilpotent derivation such that the result of substituting elements into the polynomial lies in the kernel of that locally nilpotent derivation, but at least one of the substituted elements does not lie in that kernel.

comments
5 pages
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.12590 ↗

History and Overview4

Students often have serious difficulties with many key concepts of the undergraduate mathematics curriculum. We argue that many of these difficulties can be eased by explicitly separating the key ideas from the technical details. To do so, we present finite graphs as a setting where the basic concepts appear more transparently, because on a graph most proofs only require basic techniques from linear algebra. We illustrate this approach in three areas that cover a large part of the curriculum. First, we explain basic operators from vector calculus, such as the gradient and the divergence, through the incidence matrix of a graph. Second, we show that the diffusion equation has a simple solution on a graph. We also solve the graph Dirichlet problem, in which the values at some vertices are fixed. Third, we introduce a second incidence matrix that illustrates homology, cohomology and the Helmholtz decomposition in a simple way. Finally, we outline how to apply this approach to other branches of mathematics.

comments
16 pages, 4 figures
fields
History and Overview, Combinatorics
pdf ↗ page arXiv:2611.10143 ↗

Results on the redundancy and on the independence of the order axioms of the Hilbert plane are scattered in the literature, from Veblen's 1904 remark that the independence of the axioms of order can be shown by finite models to the redundancies removed from Hilbert's axioms of order in later editions of the Grundlagen. The aim of this note is to collect them in an organic and self-contained form for the incidence and order axioms as presented by Greenberg. In doing so we single out three redundancies inside the order axioms: the symmetry of betweenness, the existence part of trichotomy, and the second clause of plane separation. Each of them dictates which part of the corresponding axiom an independence model must violate, and we give explicit finite models of three, three, nine and twenty-five points. A model of all the incidence and order axioms, on the contrary, is necessarily infinite, so the independence of any axiom added to them requires infinite models; for two of the order axioms the finite models also give independence from all the remaining axioms of the Hilbert plane.

comments
9 pages, 3 figures
fields
History and Overview
pdf ↗ page arXiv:2611.11443 ↗

In 2026, AI agents began to produce mathematical results. They formalize complete theorems and settle open problems faster than a research group can review the results. The difficulty is shifting to organizing that output, deciding which results to trust and understanding them as a group. Current tools address particular problems or assist individual researchers, and none of them is designed as the shared working environment of a research group. We propose the design of a self-hosted environment in which a group of people and agents does its daily mathematical work. It consists of a small open core, which each group deploys with the resources it has and adapts through extensions. The core records who did what and gives every message and result a stable address. We also outline how the formal libraries of different groups, maintained mostly by agents, can form a network. We describe Stemma, an early prototype that implements part of the proposal, and illustrate it with a synthetic example.

code
github.com/stemma-math/stemma-exedra ∎ Lean project (lean/fixture/lakefile.toml, lean/fixture/lean-toolchain) builds with 3 sorry warnings at 937cbba, checked 2026-11-10 build details
comments
16 pages, 8 figures, 2 tables. Prototype: https://github.com/stemma-math/stemma-exedra
fields
History and Overview
pdf ↗ page arXiv:2611.11645 ↗

How does a mathematical community discuss AI on a federated social platform? We study 24,920 public posts from January–September 2026 by 272 accounts in a fixed roster of 1,002 Mastodon accounts whose profiles indicate mathematical research or study. LLM-assisted extraction identifies 1,191 AI-for-mathematics posts by 101 accounts. Their share of all posts rises from 1.1\% in January to 11.5\% in September, with contributing accounts increasing from 10 to 59. We represent discussion through linked target–aspect–stance triples, separating what is discussed from the property assessed and the author's evaluation. From July to September, capability and usefulness decline as a share of related discussion, while social and institutional concerns increase; changing contributors account for much of the latter shift. Among 38 accounts evaluating both technical quality or utility and communication, credit, or verification procedures, the procedural negative-component fraction is 19.4 percentage points higher on average (95\% account-bootstrap interval: 3.8–35.1). Matching targets within posts gives a similar direction. Repeated extraction varies substantially at the level of individual triples, although replacing the repeated sample preserves the aggregate contrast. Around OpenAI's October 6 mathematics release, related-post share rises from 9.6\% to 13.6\%, and contributing accounts increase from 13 to 28. Post-release discussion includes appreciation of the results' potential mathematical value and applications alongside criticism of promotion centered on result counts, limited methodological disclosure, and verification arrangements.

comments
Comments are welcome
fields
History and Overview
pdf ↗ page arXiv:2611.11841 ↗

Symplectic Geometry4

In the three-dimensional quadric, we study the Oakley–Usher torus and its Chekanov counterpart as defined by the authors in the companion paper \cite{OU1}. Computing the versal deformation of the $Ψ$-invariant of Shelukhin–Tonkonog–Vianna, we find that the Chekanov Oakley–Usher torus is knotted in a strong sense: it is not Hamiltonian isotopic to the Biran-lift of any Vianna torus in the two-dimensional quadric. Furthermore, we investigate enumerative properties of the Oakley–Usher torus in $Q^3$ and prove its non-displaceability, settling an open question asked by Oakley–Usher. We relate this to mirror symmetry by proving a split-generation result for the monotone Fukaya category of $Q^3$. This should be viewed as the analogue of a result by Abouzaid–Diogo after compactifying. Interestingly, in the compactification, the monotone copy of the $(S^1 \times S^2)$-generators of Abouzaid–Diogo becomes displaceable. On the other hand, the Oakley–Usher torus still appears as a generator. In the appendix joint with Soham Chanda, we give an alternative construction of the Chekanov Oakley–Usher torus using a double solid torus mutation. This allows us to compute its disk-potential using wall-crossing results.

comments
34 pages, 3 figures, appendix joint with Soham Chanda. This article was part of an earlier version of arXiv:2607.15136 before being split off
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.10108 ↗

Let $M$ be a closed symplectic four-manifold admitting an almost toric fibration over a disk. The ellipsoid embedding function of $M$ has an infinite staircase if it has infinitely many nonsmooth points. Cristofaro-Gardiner, Holm, Mandini, and Pires showed that these points must then accumulate at a solution of an explicit quadratic equation, and that at this accumulation point the ellipsoid embedding function agrees with the volume obstruction. We call this a full filling at the accumulation point, and study it in terms of almost toric fibrations. We show that if $M$ admits a sequence of almost toric base diagrams, each with a Delzant corner, converging nontrivially to a triangle, then $M$ has a full filling at its accumulation point. For the one-point blowups $H_b$ of $\mathbb{CP}^2$, we also prove the converse. As a consequence, $H_b$ has an infinite staircase if and only if it admits such a sequence converging to a triangle whose hypotenuse has irrational slope.

comments
29 pages
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.10270 ↗

We construct an explicit exact Kähler form on \((\mathbb C^*)^2\) admitting no almost-toric fibration and hence no smooth Lagrangian torus fibration. For the logarithmic holomorphic volume form, we also rule out any special Lagrangian fibrations with compact fibers and dense regular locus, even when arbitrary compact connected singular fibers are allowed. For higher dimensions, taking products also yields explicit exact Kähler forms on \((\mathbb C^*)^n\), for every \(n\ge2\), admitting no smooth proper Lagrangian torus fibration.

comments
17 pages, 2 figures
fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.10532 ↗

Given a full rank sink recurrent cluster $\mathcal{A}$ variety, we prove that its wrapped Fukaya category is equivalent to the category of coherent sheaves on a stacky elaboration of the dual Fock-Goncharov cluster $\mathcal{X}$ variety. In particular, braid varieties for a semisimple group are mirror to the braid varieties for the Langlands dual group. Another example: for compact surfaces with no interior marked points, a least one marked point on each boundary component, and at least two marked points in total, the Fock-Goncharov moduli for SL(2) and PGL(2) are homologically mirror. The results were obtained in communion with ChatGPT Astra.

comments
64 pages, 1 figure
fields
Symplectic Geometry, Algebraic Geometry, Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.11660 ↗

Category Theory3

Let $\mathcal{D}$ be a finite tensor category with exactly one isomorphism class of simple objects which are non-invertible. Semisimple tensor categories $\mathcal{D}$ with this property are called near-group categories, and have been studied by Evans, Gannon, Siehler and others. In this paper, we study such categories in the non-semisimple setting, with the additional assumption that the non-invertible simple object is projective. Specifically, we consider the case when $\mathcal{D}$ admits a fiber functor and has a unique semisimple abelian block (in the general case that $\D$ is not semisimple). We describe the structure of such categories and their corresponding Hopf algebras, and construct examples of such categories with a cyclic Picard group. We obtain additional results when the Frobenius-Perron dimension of the unique non-invertible simple object is a prime number.

fields
Category Theory
pdf ↗ page arXiv:2611.10384 ↗

We show that an additive category is abelian if and only if its functorial nerve is a double décalage of a pseudo-simplicial object in Cat. In this characterization, the canonical isomorphism between the image and coimage is encoded by a coherent pseudo-simplicial identity.

comments
15 pages
fields
Category Theory
pdf ↗ page arXiv:2611.10805 ↗

By a $\textit{proximity subgroup}$ of a group $G$ we mean a norm $ν$ on $G$ valued in a complete lattice $L$ equipped with a binary sum (an additive counterpart of a multiplicative structure). The idea is that the smaller the value $ν(y)$ is, the closer $y\in G$ is to the subgroup of $G$ defined by the equation $ν(x)=\bot$, where $\bot$ is the bottom element of $L$. We test whether this notion is a suitable substitute for the usual notion of a subgroup (recovered by taking $L=\{\bot,\top\}$ with join as the sum), by showing that the form of proximity subgroups is noetherian. Intuitively, this means that proximity subgroups are as well suited for formulating and proving isomorphism theorems and homological diagram lemmas for groups as the usual subgroups are. We study several questions in relation to this, including what makes the noetherian form of usual subgroups special among all of these noetherian forms, and in fact, all noetherian forms of the category of groups.

fields
Category Theory, Group Theory
pdf ↗ page arXiv:2611.11185 ↗

Spectral Theory2

We analyze the spectrum of quantum square lattice graph exposed to a homogeneous magnetic field with a rational flux through plaquette, assuming all nontrivial cases of the vertex coupling which is circulant and scale-invariant, with a particular attention to those of them that give rise to a dynamics violating the time reversal invariance. Except for two cases with partially decoupled edges, the remaining twelve split into two spectral classes; the second one offers a hitherto unknown butterfly pattern.

comments
17 pages, 2 figures
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2611.10767 ↗

We prove Rayleigh's conjecture for the clamped plate in dimensions four and five. In fact, we obtain a sharp comparison with the first Dirichlet eigenvalue: on every open set of finite positive measure, the first plate eigenvalue is at least the square of the Dirichlet eigenvalue multiplied by the ratio attained on a ball. The proof uses a homogeneous transformation of a trial function and its gradient. Two divergence identities reduce the comparison to positivity of a quadratic form in the Hessian. We establish the required Bessel inequalities by rational estimates for entire profiles and their remainders. An exact defect identity accounts for regular nodal sets, so the argument allows trial functions of either sign and imposes no boundary regularity. The domains may be disconnected or unbounded. We characterize equality up to sets of zero Sobolev capacity. We also obtain quantitative stability with the optimal quadratic power of the Fraenkel asymmetry.

comments
18 pages
fields
Spectral Theory, Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.11250 ↗

General Topology1

We introduce and study the notions of reciprocating domains in classes of topological spaces. A reciprocating domain is a member of a class that maps onto every member which maps onto it. We provide general characterizations, showing in particular that in upward directed classes reciprocating domains coincide with universal domains. We investigate these domains in several classes of compact metrizable spaces and continua. We also construct a chainable universal domain admitting a continuous monotone surjection onto a pseudoarc although every nondegenerate subcontinuum of the domain contains an arc. In particular, a chainable reciprocating domain need not contain a pseudoarc.

fields
General Topology
pdf ↗ page arXiv:2611.11671 ↗

K-Theory and Homology1

We make two case studies of $\mathrm{RO}(G)$-graded homotopy in connection with $p$-adic cohomology. First, we identify the $\mathrm{RO}(\mathbf T)$-graded $\mathrm{TC}^-$ and $\mathrm{TP}$ of quasiregular semiperfectoid rings as multi-Rees algebras for the Nygaard and $φ^\bullet(I)$-adic filtrations. We additionally compute $E^{h\mathbf T}_\bigstar$ and $E^{t\mathbf T}_\bigstar$ when $E$ is a general even $\mathbf E_\infty$-ring with $\mathbf T$-action, and compute $(\mathrm{TR}^n)^{h\mathbf T/C_{p^n}}_\bigstar$ in terms of iterated Nygaard filtrations. Next, we compute the $\mathrm{RO}(\mathbf Z_p)^\land$-graded $\mathrm{TR}$ of smooth algebras over a perfectoid base, providing a pushout of the works of Hesselholt and Angeltveit-Gerhardt along the base case $\mathbf F_p$. Using this, we extend Angeltveit's Norm map of Witt vectors to the de Rham-Witt complex, which participates in a "Witt coordinates" decomposition of the $p$-primary Adams operations.

comments
45 pages. Preliminary version, does not include Breuil-Kisin or prismatic norms
fields
K-Theory and Homology, Algebraic Geometry, Algebraic Topology, Number Theory
pdf ↗ page arXiv:2611.12043 ↗

Revised papers594

Let $F_I=\{f:I\to I \mid f(x)=(Ax+B)/(Cx+D),\ AD-BC\neq 0\}$, where $I$ is a proper closed subinterval of $\mathbb{R}$. We describe all pairs $f,g\in F_I$ for which the action of the semigroup $\langle f,g \rangle$ generated by $f$ and $g$ is topologically transitive on $I$. It turns out that for such pairs topological transitivity, hypercyclicity, and density of every interior orbit are equivalent. Using the Hilbert metric of $I$ we show that no subsemigroup of $F_I$, with any number of generators, acts in a weakly topologically mixing way on $I$. We classify the pairs of affine maps of $\mathbb{R}$ whose semigroup action is topologically transitive, weakly topologically mixing, or hypercyclic, and we show that such an action is never $3$-transitive. In contrast, there are pairs of real linear fractional transformations whose semigroup action on $\mathbb{R}$ is topologically $3$-transitive, while no semigroup of linear fractional transformations is $4$-transitive.

comments
This is a revised version of a published article
journal
M. Javaheri, Topologically transitive semigroup actions of real linear fractional transformations, J. Math. Anal. Appl. 368 (2010), 587--603
fields
Dynamical Systems
pdf ↗ page arXiv:0908.3316 ↗

An unconditional inequality of the totient function is contributed to the literature. This result is associated with various problems about the distribution of prime numbers.

comments
Thirteen Pages. Keywords: Euler totient function, Prime numbers, Highly composite numbers, Primorial integers
fields
Number Theory
pdf ↗ page arXiv:1002.1998 ↗

For a collection of reproducing kernels k which includes those for the Hardy space of the polydisk and ball and for the Bergman space, k is a complete Pick kernel if and only if the multiplier algebra of the Hilbert space H^2(k) associated to k has the Douglas property. Consequences for solving the operator equation AX=Y are examined.

comments
V2 (Nov 2011) to V3 (Nov 2026): A false finite-to-infinite assertion between Definition 1.8 and Theorem 1.9, which did not materially impact the stated results, has been removed and a counterexample added. See the discussion in the penultimate paragraph in the introduction and the appendix for other changes. We thank Daniel Alpay for questioning the validity of this finite-to-infinte claim
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:1107.0980 ↗

An $N$-tiling of triangle $ABC$ by triangle $T$ (the ``tile'') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(α,β,γ)$, and sides $(a,b,c)$. This paper takes up the case when $3α+ 2β= π$. Then there are (as was already known) exactly five possible shapes of $ABC$ not similar to $T$: either $ABC$ is isosceles with base angles $α$, $β$, or $α+β$, or the angles of $ABC$ are $(2α,β,α+β)$, or the angles of $ABC$ are $(2α, α, 2β)$. We prove that the tile is rational (the ratios of its sides are rational). We then exhibit several families of previously unknown tilings. We also exhibit, for each shape, a Diophantine equation in $N$ and the parameters of the tile that must have a solution whenever there is a tiling of some triangle of that shape. By means of these Diophantine equations, some conclusions about the possible values of $N$ are drawn. We prove, for example, that there is no $N$-tiling with $N$ prime when $3α+ 2β= π$, for three of the five shapes; that question remains open for the shape $(2α,β,α+β)$ and for isosceles triangles with base angles $β$. These equations also imply that for each $N$, there is a finite set of possibilities for the tile $(a,b,c)$ and the triangle $ABC$. (Usually, but not always, there is just one possible tile.) For each of the five shapes, we give a construction method that works under certain sufficient conditions, but there remain values of $N$ that satisfy our necessary conditions and for which we do not know whether a tiling exists. All results have been formalized in Lean.

comments
101 pages, 25 figures. This version supplies proofs verified in Lean for every result
fields
Metric Geometry
pdf ↗ page arXiv:1206.2229 ↗

Although $W^{2,2}(\mathbb{R}^{4})$ does not embed into $L^\infty$, we prove that radial symmetry allows the $L^\infty$ norm to be controlled by the homogeneous Sobolev seminorm $\dot H^2$, at the cost of a logarithmic correction involving a stronger Hölder-type norm. Our main result is a sharp double-logarithmic inequality with optimal leading constant $1/(8π^2α)$. We also establish a single-logarithmic estimate and prove the sharpness of its threshold. The optimal lower bound is derived by analysing a biharmonic obstacle problem with Hölder-type obstacle. A tailored penalization argument yields existence, uniqueness, and regularity of the minimizer, while an explicit transcendental equation for the free-boundary radius determines the sharp constant through its asymptotic behavior. These results provide fourth-order, four-dimensional analogues of the two-dimensional first-order inequalities of Ibrahim–Majdoub–Masmoudi (\textit{Proc.\ Amer.\ Math.\ Soc.}, 2007), with potential applications to fourth-order semilinear evolution equations with exponential nonlinearities.

comments
The title has been revised, and the presentation has been further enhanced and improved
fields
Analysis of PDEs, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:1301.2353 ↗

A generalized theory of gauge transformations is presented on the basis of the covariant Hamiltonian formalism of field theory, for which the covariant canonical field equations are equivalent to the Euler-Lagrange field equations. Similar to the canonical transformation theory of point dynamics, the canonical transformation rules for fields are derived from generating functions. Thus—in contrast to the usual Lagrangian description—the covariant canonical transformation formalism automatically ensures the mappings to preserve the action principle, and hence to be {\em physical}. On that basis, we work out the theory of inhomogeneous local gauge transformations that generalizes the conventional local SU(N) gauge transformation theory. It is shown that massive gauge bosons naturally emerge in this description, which thus could supersede the Higgs mechanism.

comments
25 pages. arXiv admin note: text overlap with arXiv:0811.0508
fields
Mathematical Physics
pdf ↗ page arXiv:1303.6551 ↗

We give some formality criteria for a differential graded Lie algebra to be formal. For instance, we show that a DG-Lie algebra L is formal if and only if the natural spectral sequence computing the Chevalley-Eilenberg cohomology H(L,L) degenerates at second page.

comments
V3: added an appendix with errata and corrigenda of Lemma 5.3, Thm. 6.8 and Thm. 3.4
journal
J. Algebra 438 (2015), 90 - 118
fields
Quantum Algebra, Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:1310.3048 ↗

Let $\mathbb{G}^{D}$ be the set of graphs $G(V,\, E)$ with $\left|V\right|=n$, and the degree sequence equal to $D=(d_{1},\, d_{2},\,\dots,\, d_{n})$. In addition, for $\frac{1}{2}<a<1$, we define the set of graphs with an almost given degree sequence $D$ as follows, \[ \mathbb{G}_{a}^{D}:=\cup\,\mathbb{G}^{\bar{D}}, \] where the union is over all degree sequences $\bar{D}$ such that, for $1\leq i\leq n$, we have $\left|d_{i}-\bar{d}_{i}\right|<d_{i}^{a}$. Now, if we chose random graphs $\mathcal{G}_{\mathbf{g}}\left(D\right)$ and $\mathcal{G}_{\mathbf{a}}\left(D\right)$ uniformly out of the sets $\mathbb{G}^{D}$ and $\mathbb{G}_{a}^{D}$, respectively, what do they look like? This has been studied when $\mathcal{G}_{\mathbf{g}}\left(D\right)$ is a dense graph, i.e. $\left|E\right|=Θ(n^{2})$, in the sense of graphons, or when $\mathcal{G}_{\mathbf{g}}\left(D\right)$ is very sparse, i.e. $d_{n}^{2}=o(\left|E\right|)$. In the case of sparse graphs with an almost given degree sequence, we investigate this question, and give the finite tree subgraph structure of $\mathcal{G}_{\mathbf{a}}\left(D\right)$ under some mild conditions. For the random graph $\mathcal{G}_{\mathbf{g}}\left(D\right)$ with a given degree sequence, we re-derive the finite tree structure in dense and very sparse cases to give a continuous picture. Moreover, for a pair of vectors $\left(D_{1},D_{2}\right)\in\mathbb{Z}^{n_{1}}\times\mathbb{Z}^{n_{2}}$, we let $\mathcal{G}_{\mathbf{b}}\left(D_{1},D_{2}\right)$ be the random bipartite graph that is chosen uniformly out of the set $\mathbb{G}^{D_{1},D_{2}}$, where $\mathbb{G}^{D_{1},D_{2}}$ is the set of all bipartite graphs with the degree sequence $\left(D_{1},D_{2}\right)$. We are able to show the result for $\mathcal{G}_{\mathbf{b}}\left(D_{1},D_{2}\right)$ without any further conditions.

comments
49 pages, 2 figure
fields
Probability, Combinatorics
pdf ↗ page arXiv:1401.0220 ↗

This work continues the research of the author on estimates for the number of solutions of algebraic diophantine equations by means of the circle method and develops this line in the geometric direction, towards counting integral points on log Fano varieties. It consists of two parts. Part 1 is the corrected version of the previous work. For diagonal equations $c_1x^{k_1} +...+c_sx^{k_s} = n$ with natural coefficients, upper asymptotic estimates for the number of natural solutions in the range $s \leq 2^k$, where the classical asymptotics is not applicable, are obtained by the circle method and the Hua lemma. The estimates are refined for $s = 2,3,4$ and various $k_i$; in the range $s > 2^k$ they agree with the classical ones. Part 2 develops the same line: from counting solutions of equations to counting integral points on log Fano varieties, where the circle method fails because of insuf ficient dimension. In the log case, the product in the Peyre constant diverges as a harmonic series. A method of analytic compensation is introduced that cancels the divergent term and returns the problem to the range of applicability of the standard scheme. The main result is a method for computing the Peyre log constant with guar anteed accuracy and certified intervals for the number of integral points whenever an estimate of the remainder of the asymptotics is known. The log constant is computable unconditionally, without the Manin conjecture; the conjecture is needed only to interpret it as the leading term of the asymptotics. An experimental verification for the algebraic torus and the Fermat cubic surface is presented.

comments
36 pages. v2: Part 1 is corrected version of the original paper; Part 2 is new material on analytic compensation for Manin log conjecture and certified intervals for integral points on log Fano varieties
fields
Number Theory
pdf ↗ page arXiv:1512.07079 ↗

Let $ω(G)$ be the maximum size of a set of pairwise non-commuting elements of a group $G$. We determine $ω(UU_4(\mathbb{F}_q))$, where $UU_4(\mathbb{F}_q)$ is the group of $4\times 4$ unipotent upper-triangular matrices over the finite field $\mathbb{F}_q$, in terms of a classical invariant of finite geometry: we prove that \[ ω(UU_4(\mathbb{F}_q))=q^3-q+1+ν(q), \] where $ν(q)$ is the largest size of a partial ovoid of the symplectic generalized quadrangle $\mathrm{W}(3,q)$ disjoint from a fixed line. We show that $ν(q)=q^2$ for even $q$ and $ν(q)=μ(q)$ for odd $q$, where $μ(q)$ is the largest size of a partial ovoid of $\mathrm{W}(3,q)$. Consequently $ω(UU_4(\mathbb{F}_q))=q^3+q^2-q+1$ for even $q$, while for odd $q$ we obtain $q^3+2q-1\le ω(UU_4(\mathbb{F}_q))\le q^3+q^2-2q+2$; the upper bound rests on a self-contained proof of the inequality $μ(q)\le q^2-q+1$. In particular $ω(UU_4(\mathbb{F}_q))$ is not a polynomial in $q$, not even for large $q$. This corrects Theorem~$A$ of the published version of this paper, where the value $q^3+q+1+ω(\mathcal{M})$ was claimed. We also study the non-commuting structures $\mathcal{M}$ and $\mathcal{Q}$ introduced there: we prove that $ω(\mathcal{M})=q(q-1)$ for even $q$, that $ω(\mathcal{Q})=μ(q)-1$ for all $q$, and that for odd $q$ a non-commuting set in $\mathcal{Q}$ consisting of almost $m$ lines exists only for $m\le 5$. Exact values for small $q$ and a list of open problems and conjectures are included. Consequently for odd $q$ \[ ω(UU_4(\mathbb{F}_q))=q^3-q+2+ω(\mathcal{Q}). \]

comments
30 pages, There is an error in Theorem A in the published version in Acta Mathematica Hungarica, Feb. 2017, Vol. 151, Issue 1, pp. 82-116. This error is corrected in this revised arXiv version
journal
Acta Mathematica Hungarica, Feb. 2017, Vol. 151, Issue 1, pp. 82-116, 35 pages
fields
Number Theory
pdf ↗ page arXiv:1601.04133 ↗

In the sequel, we extend the Strichartz average approach for the Laplacian, which uses average values of a function over basic sets, rather than pointwise ones as classically done in the literature, and goes back to the seminal work of~S.~Kusuoka and~X.~Y.~Zhou, to Sierpiński Simplices. To our knowledge, the finite volume method had not been applied before to fractals themselves, with their intrinsic Laplacian. We build the finite volume scheme for the heat equation with Dirichlet boundary conditions, give its consistency error, a stability condition of Courant-Friedrichs-Lewy type, obtained by means of an inclusion between the spectrum of the finite volume matrix and the one of the graph Laplacian, and prove the convergence of the scheme. Numerical results are given in the case of the Sierpiński Gasket and Tetrahedron, and compared with the finite difference method.

comments
arXiv admin note: substantial text overlap with arXiv:1802.09925
fields
Combinatorics
pdf ↗ page arXiv:1806.04531 ↗

For a real polynomial $P(x)$ we study the integer sequence $λ(P)=(\lfloor P(k) \rfloor)_{k\ge1}$ modulo integers. We show that for nonlinear $P$ the sequence $λ(P)$ is uniformly distributed (u.d.) in $\mathbb{Z}$ if and only if $P$ has an irrational coefficient other than the constant term. In fact, if all non-constant coefficients of a nonlinear $P$ are rational, then $λ(P)$ fails to be u.d.\ modulo every prime in a set of primes of positive density. We also study completeness: $P$ is complete modulo $m$ if $\lfloor P(x) \rfloor$ meets every residue class modulo $m$. For $P$ of even degree we prove that $λ(P)$ meets every residue class modulo every integer if and only if $P$ has an irrational non-constant coefficient. The same holds for every polynomial $P(x)=ax^n+c$ with $n\ge2$, and for every nonlinear $P$ with $P(x)-P(0)\in\mathbb{Z}[x]$. For linear $P$, both properties are characterized completely, and the two notions differ.

comments
This is a revised version of a published article
journal
M. Javaheri, A note on polynomial sequences modulo integers, J. Integer Sequences 22 (2019), Article 19.1.1
fields
Number Theory
pdf ↗ page arXiv:1806.11359 ↗

Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the ``tile'') and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known about the possible values of $N$. Here we prove that for $N>3$, $N$ cannot be prime, and study more closely the possible tilings when the tile has a $π/3$ angle. All theorems have been formalized in Lean.

comments
26 pages, 9 figures. This version corrected and shortened some proofs and improved a theorem. All theorems are now formalized in Lean
fields
Combinatorics, History and Overview, Metric Geometry
pdf ↗ page arXiv:1812.07014 ↗

We continue the study of multiple cluster structures in the rings of regular functions on $GL_n$, $SL_n$ and $\operatorname{Mat}_n$ that are compatible with Poisson-Lie and Poisson-homogeneous structures. According to our initial conjecture, each class in the Belavin-Drinfeld classification of Poisson–Lie structures on a semisimple complex group $\mathcal G$ corresponds to a cluster structure in $\mathcal O(\mathcal G)$. Here we prove this conjecture for a large subset of Belavin-Drinfeld (BD) data of $A_n$ type, which includes all the previously known examples. Namely, we subdivide all possible $A_n$ type BD data into oriented and non-oriented kinds. In the oriented case, we single out BD data satisfying a certain combinatorial condition that we call aperiodicity and prove that for any BD data of this kind there exists a regular cluster structure compatible with the corresponding Poisson-Lie bracket. In fact, we extend the aperiodicity condition to pairs of oriented BD data and prove a more general result that establishes an existence of a regular cluster structure on $SL_n$ compatible with a Poisson bracket homogeneous with respect to the right and left action of two copies of $SL_n$ equipped with two different Poisson-Lie brackets. If the aperiodicity condition is not satisfied, a compatible cluster structure has to be replaced with a generalized cluster structure. We will address this situation in future publications.

comments
92 pages, 21 figures
journal
Memoirs of the AMS, 297 (2024), no.1486
fields
Quantum Algebra
pdf ↗ page arXiv:1902.02902 ↗

Let $X_1$ and $X_2$ be derived equivalent smooth projective varieties over the field of complex numbers. We prove that the numbers $h^{0,p}(X_1)$ and $h^{0,p}(X_2)$ are equal for any $p$.

comments
A wrong fact on Hochschild homology was used in the proof of the main Theorem.
fields
Algebraic Geometry, Category Theory
pdf ↗ page arXiv:1907.08721 ↗

We consider the tiling generating functions of semi-hexagons and quartered hexagons with dents on their sides. In general, there are no simple product formulas for these generating functions. However, we show that the modification in the regions' width changes the tiling generating functions by only a simple multiplicative factor.

comments
Version 5: fixed some more typos
fields
Combinatorics
pdf ↗ page arXiv:2006.10900 ↗

Let $k_0$ be a finite field of characteristic $p$, let $G$ be a smooth affine group scheme over $\mathbb{Z}_p$, and let $μ$ be a cocharacter of $G_{W(k_0)}$ such that the set of $μ$-weights of $\Lie G$ is a subset of $\{-1,0,1,2,\dots\}$. We prove that the groupoid of adjoint nilpotent $(G,μ)$-displays as in \cite[Definition 1.0.1]{pappas}, \cite{lau2} and \cite[Definition 3.16]{E7} is equivalent to the groupoid of $(G,μ)$-windows, which are the generalizations of windows as in \cite[Definition 5.1]{langer2} and \cite[Definition 3.3.1]{E7}.

fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2011.09163 ↗

In this paper, we introduce and study the numerical semigroups generated by $\{a_1, a_2, \ldots \} \subset \mathbb{N}$ such that $a_1$ is the repunit number in base $b > 1$ of length $n > 1$ and $a_i - a_{i-1} = a\, b^{i-2},$ for every $i \geq 2$, where $a$ is a positive integer relatively prime with $a_1$. These numerical semigroups generalize the repunit numerical semigroups among many others. We show that they have interesting properties such as being homogeneous and Wilf. Moreover, we solve the Frobenius problem for this family, by giving a closed formula for the Frobenius number in terms of $a, b$ and $n$, and compute other usual invariants such as the Apéry sets, the genus or the type.

comments
18 pages. Published version
journal
Mediterranean Journal of Mathematics 20, 16 (2023)
fields
Commutative Algebra
pdf ↗ page arXiv:2112.01106 ↗

This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds on deterministic integer factorization. We will generalize the sieve in order to obtain a polynomial-time reduction from integer factorization to a specific instance of the multiple-choice subset-sum problem. As an application, we will improve upon special purpose factorization algorithms for integers composed of divisors with small difference. In particular, we will refine the runtime complexity of Fermat's factorization algorithm by a large subexponential factor. Our first procedure is deterministic, rigorous, easy to implement and has negligible space complexity. Our second procedure is heuristically faster than the first, but has non-negligible space complexity.

comments
22 pages (including appendix), v2: Corrected technical typo in Theorem 3.5, Corollary 7.4, and Remark 7.5
fields
Number Theory
pdf ↗ page arXiv:2205.10074 ↗

Let $\mathcal{F}$ be a foliation with a "singular" submanifold $Σ$ on a smooth manifold $A$ and $p:E \to Σ$ be a tubular neighborhood of $Σ$ in $A$. Under certain "scalability" assumptions on $\mathcal{F}$ near $Σ$, we prove that every leaf preserving diffeomorphism $h$ of $A$ is isotopic via a leaf preserving isotopy to a diffeomorphism which coincides with some vector bundle morphism of $E$ near $Σ$. This result is simultaneously a foliated, compactly supported and parametrized variant of a well known statement that every diffeomorphism $h$ of $\mathbb{R}^n$ fixing the origin is isotopic to the linear isomorphism induced by its Jacobi matrix at $0$. Particular cases of such a "linearization theorem" allowed recently to compute homotopy types of leaf preserving diffeomorphism groups of polar Morse-Bott foliations on lens spaces and the twisted bundle $S^2\tilde{\times}S^1$. In general, that "linearization theorem" can be used to reduce the study of the homotopy type of the group of leaf preserving diffeomorphisms of $\mathcal{F}$ to an investigation of the following three groups (being independent in a certain sense): (a) diffeomorphism group of $Σ$, (b) the group of leaf preserving vector bundle isomorphisms of $E$, and (c) the group of leaf preserving diffeomorphisms of $A$ supported in $A\setminus Σ$, i.e. out of the "singularity" $Σ$.

comments
37 pages, 2 figures. Essentially reworked
fields
Algebraic Topology, Differential Geometry, Dynamical Systems, Geometric Topology
pdf ↗ page arXiv:2208.05876 ↗

Given a sequence ${\bf g}: g_0,\dots,g_m$ in a finite group $G$ with $g_0=1_G$, let $\bar{\bf g}:\bar g_0,\dots,\bar g_m$ be the sequence of consecutive quotients of $\bf g$, defined by $\bar g_0=1_G$ and $\bar g_i=g_{i-1}^{-1}g_i$ for $1\le i\le m$. We say that $G$ is \emph{doubly sequenceable} if there exists a sequence $\bf g$ in $G$ such that every element of $G$ appears exactly twice in each of $\bf g$ and $\bar{\bf g}$; such a sequence is \emph{cyclic} if its last term is $1_G$. We show that every group that is abelian, of odd order, sequenceable, R-sequenceable, or terraced has a cyclic double sequencing, and that a group is terraced if and only if it has a palindromic cyclic double sequencing. We show that if $H$ is a group of odd order or a sequenceable group and $K$ is an abelian group, then $H\times K$ has a cyclic double sequencing. We also show that if $H$ has a cyclic double sequencing and $K$ is an abelian group with no direct summand of order $2$, then $H\times K$ has a cyclic double sequencing, and we extend this to terraced groups $H$ and abelian groups $K$ with at most six direct summands of order $2$. Consequently, complete double Latin squares exist for every order, and the double sequencing conjecture holds for all groups of order at most $87$ except possibly $64$, and for all sufficiently large groups.

comments
This is a revised version of a published article
journal
M. Javaheri, Doubly sequenceable groups, J. Combin. Designs 32 (2024), no. 7, 371-387
fields
Group Theory, Number Theory
pdf ↗ page arXiv:2208.14334 ↗

Suppose that $X_1$ and $X_2$ are two $*$-free, possibly unbounded, random variables with Brown measures $μ_{X_1}$ and $μ_{X_2}$ respectively. Using properties of classic free additive convolution, we develop a method for calculating $μ_{X_1+X_2}$ when $X_2$ is $R$-diagonal. This method determines a density relative to Lebesgue measure on an open set whose closure equals the support of $μ_{X_{1}+X_{2}}$. We prove that $μ_{X_1+X_2}$ has no singular continuous part, that its density is strictly positive on this open set, and we determine the masses of its atoms. Explicit calculations are possible in several important cases. As an application, we combine our Fuglede–Kadison determinant formula with known subordination convergence results to calculate the limiting logarithmic potentials of free multiplicative random walks. We identify the limit with the Fuglede–Kadison determinant formula for free multiplicative Brownian motion previously proved by some PDE methods.

comments
50 pages
fields
Probability, Mathematical Physics, Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2209.12379 ↗

We show that finite tensor products $\otimes_{i=1}^{r}\mathcal{T}_λ$ of modules of tensor fields are Noetherian modules over any Lie subalgebra of finite codimension in the Lie algebra of polynomial vector fields on $\mathbb{R}^n$. Moreover, the Hilbert series of their graded submodules are rational functions whose denominators are products of factors of the form $(1-t^m)$. As a corollary, we prove the conjecture of I.\,M. Gelfand, announced at the ICM in Nice in 1970, on the finite-dimensionality of the continuous cohomology of graded Lie subalgebras of finite codimension in the Lie algebra of formal vector fields $\mathcal{W}_n$. We also prove that tensor products of modules of densities are Noetherian over the Witt Lie algebra of polynomial vector fields on the punctured line. Moreover, for a weight $λ\neq0,1$ every nonzero submodule of the symmetric power $S^r(\mathcal{T}_λ)$ contains $Δ^{2d}S^r(\mathcal{T}_λ)$, where $Δ$ is the Vandermonde determinant. As a consequence, we show that a conjecture of Etingof implies the conjecture of Petukhov and Sierra on the simplicity of the quotients $U(\vir)/(C-c)$ of the enveloping algebra of the Virasoro algebra.

comments
v4: The proof of Noetherianity is updated because the one suggested in v3 contains a gap. The proof of the rationality of Hilbert series was added
fields
Quantum Algebra, Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2211.08510 ↗

We study the convergence of an upwind finite-difference scheme for Hamilton-Jacobi-Bellman equations on a one-dimensional periodic domain, considering both the value function and the feedback control selected by the discrete pointwise minimization. For classical value functions whose time and spatial derivatives are Hölder continuous in their respective variables, we bound the error at the grid points by a constant times the sum of the time step and spatial mesh width each raised to their common Hölder exponent. This yields first-order convergence when these derivatives are Lipschitz continuous and the meshes are refined proportionally. Under additional spatial regularity of the problem data, we also prove convergence of both one-sided difference quotients of the discrete value function to the spatial derivative of the value function: the integral over space and time of the absolute error tends to zero for each difference quotient. We further establish convergence of the discrete controls to the continuous feedback control when the continuous pointwise minimizer is unique, regardless of how the discrete minimizers are selected. These theoretical results are supported by numerical experiments that illustrate the accuracy of the value-function approximation and the behavior of the computed feedback controls.

comments
41 pages, 8 figures
fields
Numerical Analysis, Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2301.06415 ↗

In this paper, we evaluate in closed forms two families of infinite integrals containing hyperbolic and trigonometric functions in their integrands. We call them Berndt-type integrals since he initiated the study of similar integrals. We first establish explicit evaluations of four classes of hyperbolic sums by special values of the Gamma function, by two completely different approaches, which extend those sums considered by Ramanujan and Zucker previously. We discover the first by refining two results of Ramanujan concerning some $q$-series. For the second we compare both the Fourier series expansions and the Maclaurin series expansions of a few Jacobi elliptic functions. Next, by contour integrations we convert two families of Berndt-type integrals to the above hyperbolic sums, all of which can be evaluated in closed forms. We then discover explicit formulas for one of the two families. Throughout the paper we present many examples which enable us to formulate a conjectural explicit formula for the other family of the Berndt-type integrals at the end.

comments
26 pages
fields
Number Theory
pdf ↗ page arXiv:2301.08211 ↗

Poincare-type series, such as Selberg's, are known to produce automorphic functions, in the hyperbolic half-plane, the decompositions of which into eigenfunctions (genuine or generalized) of the automorphic Laplacian contain all modular forms of nonholomorphic type. We introduce a one-parameter family of explicit automorphic measures supported by discrete unions of congruent lines with the same property, except for one value of the real parameter, for which they miss exactly the Eisenstein series associated to non-trivial zeros of zeta, and the Hecke eigenforms the $L$-functions associated to which vanish as $\frac{1}{2}$. The Grand Riemann Hypothesis, a special case of which needs being analyzed, is disproved

comments
In the case of the Riemann zeta function, the last section of arXiv:2208.12937 underwent repeated corrections, which led finally to the conclusion that RH does hold. This propagates to the present preprint, which deals with more general L-functions. We shall come back to this preprint at some later time.
fields
Number Theory
pdf ↗ page arXiv:2302.07834 ↗

A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be generated by their set of circuits. Additionally, we provide a characterization of universally free numerical semigroups in terms of Gröbner bases. Specifically, a numerical semigroup is universally free if and only if all initial ideals of its corresponding toric ideal are complete intersections. Furthermore, we establish several equalities among the toric bases of a universally free numerical semigroup. We provide a complete characterization of $3$-generated universally free numerical semigroups in terms of their minimal generating sets, and by proving the equality of certain toric bases. We compute exactly all the toric bases of a toric ideal defined by a 3-generated universally free numerical semigroup. Notably, we answer some questions posed by Tatakis and Thoma by demonstrating that toric ideals defined by $3$-generated universally free numerical semigroups have a set of circuits and a universal Gröbner basis of size 3, while the universal Markov basis and the Graver basis can be arbitrarily large. We present partial results and propose several conjectures regarding universally free numerical semigroups with more than three generators.

comments
24 pages. Published version
journal
Journal of Pure and Applied Algebra 228 (2024), 107551
fields
Commutative Algebra
pdf ↗ page arXiv:2303.06474 ↗

We study rail-yard dimer models with free boundaries at both ends. The double free-boundary geometry introduces infinitely many reflected Cauchy factors into partition functions and contour formulas for height Laplace observables. For admissible piecewise periodic weights satisfying the stated separation conditions, we prove a Laplace-transform law of large numbers and obtain a limit shape through weak convergence of slope measures. For $β=1$, under the stated regularity and nonexceptional endpoint conditions, we derive a necessary real double-root condition for the frozen boundary. We also prove Gaussian fluctuations of centered height Laplace observables, with covariance determined by an annular reflected-image kernel expressed through theta functions. Finally, we construct an exact growth-diagram sampler for finite reflected truncations and prove that their laws converge in total variation to the full Gibbs measure on every fixed rail-yard graph with finitely many columns as the truncation level tends to infinity.

comments
103 pages
fields
Probability, Combinatorics
pdf ↗ page arXiv:2304.00650 ↗

In this paper, we establish the rigidity of the generalized cylinder $N^n \times \mathbb R^{m-n}$, or a quotient thereof, in the space of Ricci shrinkers equipped with the pointed-Gromov-Hausdorff topology. Here, $N$ is a stable Einstein manifold that has an obstruction of order $3$. The proof is based on a quantitative characterization of the rigidity of compact Ricci shrinkers, a rigidity inequality of mixed orders on generalized cylinders, and the method of contraction and extension. As an application, we prove the uniqueness of the tangent flow for general compact Ricci flows under the assumption that one tangent flow is a generalized cylinder.

comments
Updated version. Some proofs have been revised and supplemented; the main results remain unchanged
fields
Differential Geometry
pdf ↗ page arXiv:2305.06143 ↗

Hilbert modules over a $C^*$-category were first defined by Mitchener, who also proved that they form a $C^*$-category. An Eilenberg-Watts theorem for Hilbert modules over $C^*$-algebras was proved by Blecher. We follow a similar path to prove an Eilenberg-Watts theorem for Hilbert modules over $C^*$-categories and characterize equivalences of categories of Hilbert modules as being given by tensoring with imprimitivity bimodules. We employ our results to prove several equivalences of bicategories of $C^*$-algebras and $C^*$-categories, and to exhibit a Morita localization of the category of locally small $C^*$-categories.

comments
Incorporated comments from reviewer. Final version, to appear in Adv. Math
fields
Operator Algebras, Category Theory, K-Theory and Homology
pdf ↗ page arXiv:2305.10859 ↗

While $L_\infty$ algebras are fundamental structures in differential geometry and mathematical physics, the geometric information encoded in such structures is often implicit. We address the following question: What constitutes a geometrically meaningful deformation of an $L_\infty$ algebra arising from vector bundles, and how can such deformations classify new geometric invariants? Inspired by nonabelian extension theory of Lie algebras, we define geometric deformations of curved $L_\infty$ algebras constructed from a vector bundle $V\to M$, and demonstrate that such deformations uniquely correspond to Lie algebroid structures on $V$. Explicit computations reveal that a representative of the first Atiyah-Chern class is exact in the total Weil complex, with its primitive representing the modular class in Lie algebroid cohomology. In the case of action Lie algebroids, the leading-order Atiyah-Chern classes correspond to the equivariant Chern characters. Applications to BV theories show that the geometric deformations naturally generate Poisson sigma models. These results provide a coherent framework for deriving field theories from geometric deformations of $L_\infty$ algebras.

journal
SIGMA 22 (2026), 110, 34 pages
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2307.07497 ↗

We study the fundamental group of the equivariant Gromov–Hausdorff limit space \[ (M_i, p_i, G_i) \xrightarrow{eGH} (Y, p, G), \] where $\{(M_i,p_i)\}_{i\in\mathbb N}$ is a sequence of complete, connected, and simply connected $n$-dimensional Riemannian manifolds with $\mathrm{Ric}\ge -(n-1)$. Here $G_i\subset \mathrm{Iso}(M_i)$ is a discrete subgroup satisfying $\mathrm{diam}(M_i/G_i)\le D$ for some fixed constant $D>0$. Let $G_0$ denote the identity component of $G$. Then $G_0$ is a nilpotent Lie group. Let $T^k \subseteq G_0$ be the maximal torus. Our main result asserts that the quotient space $Y/T^k$ is simply connected. Moreover, the fundamental group $π_1(Y,p)$ is generated, up to conjugation, by loops contained in $T^k$-orbits. More precisely, each generator can be represented by a loop of the form \begin{equation*} γ= α\cdot β\cdot α^{-1}, \end{equation*} where $α$ is a curve from $p$ to some point $y \in Y$, and $β$ is a loop based at $y$ that lies entirely in the $T^k$-orbit of $y$.

fields
Differential Geometry
pdf ↗ page arXiv:2307.07658 ↗

For family $x'=(a_0+a_1\cos t+a_2\sin t)|x|+b_0+b_1\cos t+b_2\sin t$, we solve three basic problems related with its dynamics. First, we characterize when it has a center (Poincaré center focus problem). Second, we show that each equation has a finite number of limit cycles (finiteness problem), and finally we give a uniform upper bound for the number of limit cycles (Hilbert problem 16).

comments
17 pages, no figures. Published version
journal
Qualitative Theory of Dynamical Systems 23, 119 (2024)
fields
Dynamical Systems
pdf ↗ page arXiv:2307.15578 ↗

We recall and delve into the different characterizations of the depth of an affine semigroup ring, providing an original characterization of depth two in three and four dimensional cases which are closely related to the existence of a maximal element in certain Apery sets.

comments
16 pages, 1 figure. Published version
journal
Collectanea Mathematica 76 (2025), 133-150
fields
Commutative Algebra
pdf ↗ page arXiv:2307.16501 ↗

We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such realizations as of elements of a moduli space of stable rational curves with marked points. The second is the idea of splitting a minimally rigid graph into two subgraphs, called calligraphs, that admit one degree of freedom and that share only a single edge and a further vertex. This idea has been recently employed for realizations of graphs in the plane up to isometries. The key result is that we can associate to a calligraph a triple of natural numbers with a special property: whenever a minimally rigid graph is split into two calligraphs, the number of realizations of the former equals the product of the two triples of the latter, where this product is specified by a fixed quadratic form. These triples and quadratic form codify the fact that we express realizations as intersections of two curves on the blowup of a sphere along two pairs of complex conjugate points.

fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2308.15305 ↗

Inverse problems with incomplete data are severely ill-posed and require regularization. Learned reconstructions incorporate prior information effectively, but their regularization properties are less well understood than those of classical variational methods. We propose data-proximal null-space networks, which post-process an initial reconstruction obtained by a classical regularization method and extend null-space networks by allowing learned corrections that are not restricted to the null space, while bounding their effect on the measured data by a prescribed tolerance. Combined with a convergent, possibly nonlinear regularization method, these networks yield convergent regularization methods with convergence rates and data-proximity bounds. A calmness-based analysis covers fixed networks with radial clipping even when the operator range is not closed; their correction outside the null space vanishes in the limit, so that they differ from null-space networks only at positive noise levels. For the limited-angle Radon transform, exact data consistency preserves the visible singularities of the initial reconstruction, whereas data proximity controls the visible error in a weak Sobolev norm proportional to the data norm, but not its singularities. For compactly supported objects, null-space networks act trivially, whereas data-proximal networks can still correct nearly invisible components. In limited-angle computed tomography, data-proximal networks substantially improve on null-space networks and, unlike residual networks, guarantee a prescribed bound on the data change.

fields
Numerical Analysis
pdf ↗ page arXiv:2309.06573 ↗

In this article, we address endpoint issues for the bilinear spherical maximal function. We obtain borderline restricted weak type estimates for the well studied bilinear spherical maximal function $$\mathfrak{M}(f,g)(x):=\sup_{t>0}\left|\int_{\mathbb S^{2d-1}}f(x-ty_1)g(x-ty_2)\;dσ(y_1,y_2)\right|,$$ in dimensions $d=1,2$ and as an application, we deduce sharp endpoint estimates for the multilinear spherical maximal function. We also prove $L^p-$estimates for the local spherical maximal function in all dimensions $d\geq 2$, thus improving the boundedness left open in the work of Jeong and Lee (https://doi.org/10.1016/j.jfa.2020.108629). We further study necessary conditions for the bilinear maximal function, \[\mathcal M (f,g)(x)=\sup_{t>0}\left|\int_{\mathbb S^{1}}f(x-ty)g(x+ty)\;dσ(y)\right|\] to be bounded from $L^{p_1}(\mathbb R^2)\times L^{p_2}(\mathbb R^2)$ to $L^p(\mathbb R^2)$ and prove sharp results for a bilinearized version of $\mathcal M$.

comments
Revised version. 28 pages
journal
Journal of Geometric Analysis (2026)
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2310.00425 ↗

We derive the heat equation for the thermal energy under diffusive space-time scaling for a purely deterministic microscopic dynamics satisfying Newton equations perturbed by an external chaotic force acting like a magnetic field.

comments
The present version contains corrections to the published version. We fixed the normalization of the constant gamma in (2.5), stated Theorem 4.9 for t in epsilon N, and added Remark 4.11. The results and proofs are otherwise unchanged
journal
G. Canestrari, C. Liverani, S. Olla, Heat equation from a deterministic dynamics. Invent. math. 245, 1437--1504 (2026)
fields
Dynamical Systems
pdf ↗ page arXiv:2310.13338 ↗

In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root three associated with an arithmetic variety. This tree is not locally finite; however, if the Frobenius number is fixed, the tree has finitely many nodes and algorithms can be developed. All algorithms provided in this article include their (non-debugged) implementation in GAP.

comments
17 pages. Published version
journal
Results in Mathematics 79, 171 (2024)
fields
Commutative Algebra
pdf ↗ page arXiv:2311.13500 ↗

We study the compatibility between utility-optimized statistical parity and individual fairness. While individual fairness seeks to treat similar individuals similarly, optimal statistical parity aims to provide similar treatment to individuals who share relative similarity within their respective sensitive groups. Although both fairness perspectives are desirable, they often conflict in practical applications. Our goal in this work is to analyze the existence of this conflict and its potential solution. In particular, we establish sufficient (sharp) conditions for the compatibility between the optimal (post-processing) statistical parity $L^2$ learning and the ($K$-Lipschitz or $(ε,δ)$) individual fairness requirements. When a conflict arises, we first relax the optimal statistical parity solution to the Pareto frontier, representing the optimal trade-off between $L^2$ error and statistical disparity, and then examine its compatibility with individual fairness. Our analysis identifies regions along the Pareto frontier that satisfy individual fairness constraints. Additionally, we provide individual fairness guarantees for the composition of a trained model with the optimal post-processing step, enabling practitioners to assess the compatibility of post-processed models. This provides practitioners with a principled approach to achieving Pareto-optimal statistical parity while maintaining individual fairness constraints.

comments
30 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2401.07174 ↗

We systematically compile an exhaustive catalogue of multiview varieties and anchored multiview varieties arising from projections of points, lines, and planes in 1, 2, and 3-dimensional projective spaces. We say that two such varieties are ED-equivalent if there is a linear isomorphism between them that preserves ED-critical points. This gives rise to fourteen representatives, at most two of which are equivalent, and we determine various properties—dimension, set-theoretic equations, and multidegrees—for all varieties featured in our catalogue. In the case of points, we also present a complementary study of resectioning varieties and their singular loci. Finally, we propose conjectures for the Euclidean distance degrees of all varieties appearing in our comprehensive compilation.

fields
Algebraic Geometry
pdf ↗ page arXiv:2402.00648 ↗

Given two numerical semigroups $S$ and $T$ we say that $T$ is a multiple of $S$ if there exists an integer $d \in \mathbb{N} \setminus \{0\}$ such that $S = \{x \in \mathbb{N} \mid d x \in T\}$. In this paper we study the family of multiples of a (fixed) numerical semigroup. We also address the open problem of finding numerical semigroups of embedding dimension $e$ without any quotient of embedding dimension less than $e$, and provide new families with this property.

comments
12 pages. Published version
journal
Turkish Journal of Mathematics 48 (2024), 1055-1066
fields
Group Theory
pdf ↗ page arXiv:2402.04413 ↗

We identify Drinfeld's formal group on the prismatization of $\mathrm{Spf}\,\mathbb{Z}_p$ with a formal group arising from homotopy theory, given locally by the Quillen formal group of a decompleted variant of topological periodic cyclic homology. We also prove that this formal group extends to the syntomization of $\mathrm{Spf}\,\mathbb{Z}_p$, and that it admits a certain algebraization conjectured by Drinfeld.

comments
34 pages; accepted version, to appear in JEMS
fields
Algebraic Topology, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2403.02555 ↗

In this short note, we establish a more concrete characterization of subgroup separable (LERF) Artin groups, building on a previously known criterion. Specifically, we prove an Artin group is LERF if and only if its underlying graph does not contain certain induced subgraphs, thus providing a more direct generalization of the Metaftsis-Raptis criterion for RAAGs. Consequently, we prove every LERF Artin group is coherent and obtain a graph condition for coherent Artin groups to be LERF.

fields
Group Theory
pdf ↗ page arXiv:2403.05483 ↗

We study the monotonicity of information measures, functions that assign a value to each statistical experiment, with respect to the Blackwell and Lehmann orders. We show that such monotonicity can be characterized by local, first-order conditions. Under natural invariance properties, a measure is Blackwell monotone if and only if it decreases in the direction of signal replacements, and Lehmann monotone if and only if it decreases in the direction of reverse signal replacements, which replace signals with higher ones only in low states or with lower ones only in high states. We translate both conditions into the space of posterior beliefs and apply them to likelihood-separable and posterior-separable measures, showing in particular that the entropy cost is Lehmann monotone. Among posterior-separable measures, we further identify a Lehmann monotone subclass, posterior-mean-ratio measures, that characterizes the Lehmann order.

fields
Information Theory
pdf ↗ page arXiv:2404.15158 ↗

Given $H$ self-adjoint, $V$ symmetric and relatively $H$-bounded, and $f:\mathbb{R}\to\mathbb{C}$ satisfying mild conditions, we show that the Gateaux derivative $$\frac{d^n}{dt^n}f(H+tV)|_{t=0}$$ exists in the operator norm topology, for every natural $n$, give a new explicit formula for this derivative in terms of multiple operator integrals, and establish useful perturbation formulas for multiple operator integrals under relatively bounded perturbations. Moreover, if the $H$-bound of $V$ is less than 1, we obtain sufficient conditions on $f$ which ensure that the Taylor expansion $$f(H+V)=\sum_{n=0}^\infty\frac{1}{n!}\frac{d^n}{dt^n} f(H+tV)\big|_{t=0}$$ exists and converges absolutely in operator norm. Finally, assuming that $V(H-i)^{-p}\in\mathcal{S}^{s/p}$ for $p=1,\ldots,s$ for some $s\in\mathbb{N}$ (for instance, when $H$ is an order 1 differential operator on an $s-1$ dimensional space), we show that the Krein–Koplienko spectral shift functions $η_{k,H,V}$, satisfying $${Tr}\left(f(H+V)-\sum_{m=0}^{k-1}\frac{1}{m!}\frac{d^m}{dt^m} f(H+tV)\big|_{t=0}\right)=\int_{\mathbb{R}} f^{(k)}(x)η_{k,H,V}(x)dx,$$ exist for every $k=1,2,3,\ldots$, independently of $s$. The latter result (which is significantly stronger than \cite{vNS22}) is completely new also in the case that $V$ is bounded. The proof is based on \cite{PSS}, combined with a generalisation of the multiple operator integral compatible with \cite{HMvN}. We discuss applications of our results to quantum physics and noncommutative geometry.

comments
Minor revision
fields
Functional Analysis
pdf ↗ page arXiv:2404.18422 ↗

The goal of this paper is twofold. Firstly, we provide a type-uniform formula for the torus complexity of the usual torus action on a Richardson variety, by developing the notion of algebraic dimensions of Bruhat intervals, strengthening a type $A$ result by Donten-Bury, Escobar and Portakal. In the process, we give an explicit description of the torus action on any Deodhar component as well as describe the root subgroups that comprise the component. Secondly, when a Levi subgroup in a reductive algebraic group acts on a Schubert variety, we exhibit a codimension preserving bijection between the Levi-Borel subgroup (a Borel subgroup in the Levi subgroup) orbits in the big open cell of that Schubert variety and torus orbits in the big open cell of a distinguished Schubert subvariety. This bijection has many applications including a type-uniform formula for the Levi-Borel complexity of the usual Levi-Borel subgroup action on a Schubert variety. We conclude by extending the Levi-Borel complexity results to a large class of Schubert varieties in the partial flag variety.

comments
22 pages, minor corrections
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2405.13774 ↗

Inventory control traditionally focuses on pricing and production rates, while physical storage capacity is typically fixed at the initial design stage. This paper addresses this relatively unexplored aspect by formulating a non-standard optimal control problem. The objective combines the classical integral term, capturing inventory-related costs, with an L^\infty-term, representing the maximum inventory level over the planning horizon. We first establish a relationship between the optimal pricing and production-rate policies, reducing the problem's dimensionality. Building on our earlier framework, we establish the existence of an optimal relaxed control and obtain an ε-optimal pure control for the reduced problem through smooth approximation. Numerical solutions of the resulting approximate problem demonstrate a substantial reduction in required storage capacity, with a negligible loss in net revenue (less than 6%), after accounting for shortage, holding, and production costs. We also observe that increasing the weight of the L^\infty-component reduces fluctuations in the inventory trajectory. These findings are particularly relevant when future demand information is incomplete or unavailable. In such settings, dynamically adjusting pricing and production policies to keep inventory levels close to zero can substantially reduce storage requirements with only a negligible loss in net revenue. Our results highlight the potential of incorporating inventory-level considerations directly into operational decision-making, particularly when physical storage capacity can be designed flexibly.

fields
Optimization and Control
pdf ↗ page arXiv:2406.05526 ↗

We study the principle of relativity in classical time-dependent nonholonomic Lagrangian mechanics from the perspective of moving global reference frames. We also introduce time-dependent $G$-Chaplygin systems with affine constraints, which are natural objects for the invariant formulation of nonholonomic systems with symmetries. As far as the author is aware, the Hamiltonization problem for time-dependent constraints has not yet been studied. As a first step in this direction, we consider a rolling without sliding of a balanced disc of radius $r$ over a vertical circle of a given variable radius $R(t)$. We modify the Chaplygin multiplier method and prove that the reduced system becomes Hamiltonian with respect to the new time.

comments
29 pages, 4 figures, to appear in Journal of Geometry and Physics
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2407.06231 ↗

We construct two distinct Leray solutions of the three-dimensional forced viscous, resistive magnetohydrodynamic equations in the whole space, with zero initial data and identical forcing. Our construction begins with a periodic axisymmetric unstable MHD mode associated with a rotating column and a nonconstant axial magnetic field. The rotating profile is also centrifugally unstable at zero magnetic field; the construction uses an unstable MHD eigenvalue and does not require magnetic destabilization of a hydrodynamically stable flow. Our spectral construction tracks a prescribed unstable MHD eigenvalue under radial truncation, the addition of small positive viscosity, and toroidal closure. The first two steps use a decomposition into a skew-adjoint principal part and compact feedback at a fixed Fourier frequency. Keeping the viscosity fixed, we bend the column into a compactly supported toroidal profile and obtain a genuine whole-space unstable eigenvalue through convergence of localized Stokes resolvents. A small-dilation limit and an exact rescaling then yield an unstable background in similarity variables. A nonlinear trajectory along its unstable direction produces the second solution. Both solutions are smooth for positive times and satisfy the energy equality. The forcing acts in both the velocity and magnetic equations.

comments
36pp
fields
Analysis of PDEs
pdf ↗ page arXiv:2407.06565 ↗

We introduce a non-Markovian rumor model on a complete graph of $n$ vertices, integrating the classical interactional framework of Daley and Kendall (1964) with modern cognitive insights into misinformation. Unlike traditional Markovian models, our approach incorporates a deliberation delay -- a decision-making window where individuals evaluate information before committing to dissemination or refutation. We establish a Functional Law of Large Numbers (FLLN) and a Functional Central Limit Theorem (FCLT) to characterize the asymptotic behavior and diffusion-scaled fluctuations of the process.

comments
Title changed. Model, proofs, and introduction significantly revised and rectified
fields
Probability
pdf ↗ page arXiv:2407.07170 ↗

Given a split simply connected semi-simple algebraic group scheme $\mathbb G$ over $\mathbb Z$, a split maximaltorus $\mathbb T$ in $\mathbb G$and a parabolic subgroup scheme $\mathbb P\supset \mathbb T$, this paper constructs semi-orthogonal decompositions of the bounded derived category $D^b(rep(\mathbb P))$ of noetherian representations of $\mathbb P$ with each semi-orthogonal component being equivalent to the bounded derived category $D^b(rep(\mathbb G))$ of noetherian representations of $\mathbb G$. The semi-orthogonal components of those decompositions are stable under the monoidal action of $D^b(rep(\mathbb G))$ on $D^b(rep(\mathbb P))$. The decompositions depend on an arbitrarily chosen total order on the Weyl group that refines the Bruhat order. The semi-orthogonal decompositions are also compatible with the Bruhat order on cosets of the Weyl group of $\mathbb P$ in the Weyl group of $\mathbb G$. Their construction builds upon the foundational results on $\mathbb B$-modules from the works of Mathieu, Polo, and van der Kallen, and upon properties of the Steinberg basis of the $\mathbb T$-equivariant $K$-theory of $\mathbb G/\mathbb B$. As a corollary, we obtain full exceptional collections in the bounded derived category of coherent sheaves on generalized flag schemes $\mathbb G/\mathbb P$ over $\mathbb Z$.

comments
minor changes
fields
Algebraic Geometry, K-Theory and Homology, Representation Theory
pdf ↗ page arXiv:2407.13653 ↗

In this paper, we point out the natural relation between $\mathbb Q$-twisted objects of the derived category of abelian varieties, cohomological rank functions, and semihomogeneous vector bundles. We apply this to two basic classes of objects, corresponding to each other via the Fourier-Mukai-Poincaré transform: positive twists of the ideal sheaf of one point and of the evaluation complexes of ample simple semihomogeneous vector bundles. This naturally leads to the introduction of $\mathbb Q^{\ge 0}$- graded section modules associated to line bundles on abelian varieties built by means of semihomogeneous vector bundles (containing the usual section rings). We prove a duality relation between such modules associated to dual polarizations, which is not visible at the level of the usual section rings. Other applications include formulas relating the thresholds of relevant cohomological rank functions appearing in this context. As a consequence we show a lower bound for the base point free threshold of a polarization in function of its type, and some obstructions to surjectivity of multiplication maps of global sections of certain line bundles.

comments
Minor changes. Published version
journal
International Journal of Mathematics Vol. 37, No. 13 (2026) 2650070
fields
Algebraic Geometry
pdf ↗ page arXiv:2407.20646 ↗

We consider two-dimensional capillary water waves with nonzero constant vorticity in infinite depth. We first derive the Babenko equation that describes the profile of the solitary wave. When the velocity $c$ is close to a critical velocity, the Babenko equation can be reduced to the stationary focusing cubic nonlinear Schrödinger equation plus perturbative error. This gives the existence of small-amplitude solitary wave solutions for the water wave system with constant vorticity whose profiles are close to solutions of the stationary focusing cubic nonlinear Schrödinger equation.

comments
30 pages, title changed
fields
Analysis of PDEs
pdf ↗ page arXiv:2408.03428 ↗

In this paper, we are concerned with the local and global existence for the stochastic Prandtl equation in two and three dimensions, which governs the velocity field inside the boundary layer that appears in the inviscid limit of the stochastic Navier-Stokes equation with non-slip boundary condition. New problem arises when establishing the well-posedness in the stochastic regime: one can never derive a pathwise control of the energy functional which is used to describe the analytic radius of the solution in the deterministic setting. To this end, we establish higher-order estimates in the conormal Sobolev spaces in order to get rid of the dependence of the analytic radius on the unknown. Three approximate schemes are constructed for solving the stochastic Prandtl equation, and a local well-posedness is obtained in a tangentially analytic and normally Sobolev-type space. Furthermore, we study the stochastic Prandtl equation driven by a tangential random diffusion, and find that the noise regularizes the equation in the sense that in both two and three dimensions, there exists a global Gevrey-2 solution with high probability and the radius growing linearly in time.

fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2408.04546 ↗

Let $\mathbf{B}_n$ be an $n\times n$ Haar-uniform band matrix over $\mathbb{Z}_p$ with band width $w_n$. We prove that $\text{cok}(\mathbf{B}_n)$ has Cohen-Lenstra limiting distribution if and only if \[\lim_{n\to\infty} \left(w_n-\log_p(n)\right)=+\infty.\]

fields
Probability, Combinatorics
pdf ↗ page arXiv:2408.13037 ↗

The paper investigates two invariants for totally disconnected locally compact (t.d.l.c.) groups: the number of ends and the rational discrete cohomological dimension. Firstly, for a compactly generated t.d.l.c. group $G$, it is shown that its number of ends can be expressed in terms of the low-dimensional rational discrete cohomology of $G$, generalising a notable theorem by E. Specker to the t.d.l.c. setting. Secondly, we focus on a t.d.l.c. group $G$ acting under suitable conditions on a building $Δ$, showing that both the number of ends and the rational cohomological dimension of $G$ are related to those of the Weyl group associated to $Δ$. In special cases, we compare the rational discrete cohomological dimension of $G$ to its flat-rank, and in the appendix we provide examples for which these two invariants coincide. Finally, for t.d.l.c. groups with rational discrete cohomological dimension one that act properly and chamber-transitively on locally finite buildings, we explicitly construct a proper cocompact action on a tree out of the action on the building. All the results of independent interest in Coxeter theory have been included in the appendix.

comments
40 pages, 1 figure. Changed auxiliary results and their proofs in the new Sect. 3.3 to fix a mistake in the old Example 2.2; the main result of the section (Thm 3.3) is unchanged. We integrated the referees' suggestions. Notably, we expanded the preliminaries, moved some results to an appendix, and adapted the abstract and the introduction accordingly. Version accepted by Rev. Math. Iberoam
fields
Group Theory
pdf ↗ page arXiv:2408.15716 ↗

We introduce the notion of the \textit{Bruce–Roberts number} for holomorphic 1-forms relative to complex analytic varieties. Our main result shows that the Bruce–Roberts number of a 1-form $ω$ relative to a complex analytic hypersurface $X$ with an isolated singularity can be expressed in terms of the \textit{Goméz-Mont–Seade–Verjovsky index} of $ω$ along $X$, the \textit{Milnor number} of $ω$ and the \textit{Tjurina number} of $X$. This result allows us to recover known formulas for the Bruce–Roberts number of a holomorphic function along $X$ and to establish connections between this number, the radial index, and the local Euler obstruction of $ω$ along $X$. Moreover, we present applications to both global and local holomorphic foliations in complex dimension two.

comments
30 pages. Updating of references and improved writing of the results
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2409.01237 ↗

In this paper we prove the uniqueness of the critical point for stable solutions of the Robin problem \[ \begin{cases} -Δu=f(u)&\text{in }Ω\\ u>0&\text{in }Ω\\ \partial_νu+βu=0&\text{on }\partialΩ, \end{cases} \] where $Ω\subseteq\mathbb{R}^2$ is a smooth and bounded domain with strictly positive curvature of the boundary, $f\ge0$ is a smooth function and $β>0$. Moreover, for $β$ large the result fails as soon as the domain is no more convex, even if it is very close to be: indeed, in this case it is possible to find solutions with an arbitrary large number of critical points.

fields
Analysis of PDEs
pdf ↗ page arXiv:2409.06576 ↗

We demonstrate equidistribution of the lattice shape of cubic fields when ordered by discriminant, giving an estimate in the Eisenstein series spectrum with a lower order main term. The analysis gives a separate discussion of the contributions of reducible and irreducible binary cubic forms, following a method of Shintani. Our work answers a question posed at the American Institute of Math by giving a precise geometric and spectral description of an evident barrier to equidistribution in the lattice shape.

comments
44 pages
fields
Number Theory
pdf ↗ page arXiv:2409.08417 ↗

We present several formulas for both the discrete and fractional iterates of an invertible power series $f,$ using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are also obtained.

fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2409.09809 ↗

We study the comparison principle for viscosity sub- and super-solutions of degenerate quasi-linear equations in non-divergence form driven by the horizontal vector fields of a Carnot group, under an ellipticity condition and a homogeneity condition.

comments
Major revisions have been made, and we could not prove the result in full generality, as stated earlier. We present proofs for several important cases
fields
Analysis of PDEs
pdf ↗ page arXiv:2409.15144 ↗

In this paper, we answer this fundamental question affirmatively by using a class of informationally complete positive operator-valued measures (IC-POVMs), including symmetric IC-POVMs (SIC-POVMs) and spherical $t$-designs, focusing on sample complexity while not accounting for the implementation complexity of the measurement settings. For SIC-POVMs and spherical 2-designs, we show that the number of state copies to guarantee bounded recovery error of an MPO state with a constrained least-squares estimator depends on the probability distribution of the MPO under the POVM but scales only linearly with $n$ when the distribution is approximately uniform. For general spherical $t$-designs with a sufficiently large $t$, we prove that only a number of state copies proportional to the number of independent parameters in the MPO is sufficient for a guaranteed recovery of any state represented by an MPO. In addition, we establish a sample complexity lower bound based on the Cramer-Rao bound, showing that, for strictly positive definite MPO states and unbiased estimators, a number of state copies proportional to the number of independent parameters in the MPO is also necessary, although the upper and lower bounds do not yet match in their dependence on the target accuracy. Furthermore, we propose a spectral method and a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem, both equipped with rigorous recovery error guarantees.

fields
Information Theory, Optimization and Control
pdf ↗ page arXiv:2410.02583 ↗

In 1880, G. G. Stokes [Mathematical and Physical Papers, Vol.I] examined an extreme two-dimensional irrotational periodic traveling water wave under the influence of gravity and conjectured a symmetric corner of \(120^\circ\) at the crest. The conjecture was first proved rigorously by Amick, Fraenkel, and Toland [Acta Math. 148 (1982)] and, independently, by Plotnikov [Dinamika Sploshn. Sredy 57 (1982)] via the Nekrasov integral equation. In the early 2010s, Varvarua and Weiss [Acta Math. 206 (2011)] revisited the conjecture by introducing a novel geometric method, which provided an affirmative answer to the conjecture without requiring the structural assumptions used in earlier works, such as the isolation of the stagnation points and the symmetry and monotonicity of the free surface. The main purpose of this paper is to establish the validity of the Stokes conjecture in the context of compressible gravity water waves. More precisely, we prove that, at each stagnation point of a compressible gravity water wave, a sharp crest with an included angle of \(120^\circ\) forms, which gives the first rigorous confirmation of the compressible counterpart of the classical Stokes conjecture of 1880. The central aspect of our approach is the discovery of a new monotonicity formula and a modified version of it for quasilinear free boundary problems of Bernoulli type. Another key ingredient is a new nonlinear frequency formula, which we combine with the concentration-cancellation theory of Evans and Muller [J. Amer. Math. Soc. 7 (1994)]. These newly developed monotonicity formulas are valid for nonlinear problems and enable us to carry out a blow-up analysis at each stagnation point and to provide a complete classification of the blow-up limits near each stagnation point.

comments
95 Pages. This revision corrects typos and an erroneous estimate from the previous version. The results are strengthened
fields
Analysis of PDEs
pdf ↗ page arXiv:2410.04178 ↗

High-fidelity simulations of time-dependent nonlinear partial differential equations (PDEs) are expensive to repeat across families of domains and parameter fields, a cost that recurs in design optimization, uncertainty quantification, and computational medicine. Most neural-operator surrogates require each domain to be mapped onto a common grid or reference shape, and few predict the full time course. We introduce Graph Fourier Neural Kernels (G-FuNK), a neural operator for second-order semilinear PDEs with a diffusive principal part that transfers across geometries and anisotropic diffusion tensors without coordinate maps or diffeomorphisms. A weighted graph and its Laplacian supply a spectral basis that encodes geometry and anisotropy. Shared layers act in this basis, at a cost linear in mesh size after one partial eigendecomposition per geometry, and a neural ODE integrator propagates the learned generator to full spatiotemporal trajectories on unseen domains. Across anisotropic heat flow, stiff reaction-diffusion, FitzHugh-Nagumo, and patient-specific left-atrial electrophysiology on CT-derived surfaces, G-FuNK reproduces held-out trajectories with relative $L^2$ error between 0.046 and 0.160. Its accuracy is comparable to that of a geometry-aware Fourier neural operator on regular domains, and its predictions are unchanged when a rectangular domain is rotated. On left atria, whose venous and valvular openings prevent mapping onto a reference shape, it predicts an 85-ms trajectory in under half a second, against about 5 minutes for finite elements, with a mean activation-time error of 1.73 ms. Accuracy depends on graph construction and is highest when the learned generator is integrated at its training time step.

comments
38 pages, including supplementary information
fields
Spectral Theory
pdf ↗ page arXiv:2410.04655 ↗

Gukov, Pei, Putrov, and Vafa developed a $q$-series invariant of negative definite plumbed $3$-manifolds with spin$^{c}$ structures, building on earlier work of Lawrence and Zagier. This was recently generalized to an an infinite family of two-variable $(t,q)$-series invariants by Akhmechet, Johnson, and Krushkal (AJK). We calculate one such series for all Seifert manifolds with $b_{1}=0.$ These results extend a previous theorem of Liles and McSpirit to any number of exceptional fibers and the Reduction Theorem of Gukov, Svoboda, and Katzarkov to the two-variable case. As a consequence, a previous result of Liles and McSpirit on modularity properties and radial limits is enhanced to a larger family of manifolds. We also calculate the infinite collection of $(t,q)$-series invariants for three infinite families of manifolds, finding mixed modularity properties for one such family.

comments
updated with suggestions from referees
fields
Geometric Topology
pdf ↗ page arXiv:2410.10561 ↗

In this paper we develop a new geometric approach to subtractive continued fraction algorithms in high dimensions. We adapt a version of Farey summation to the geometric techniques proposed by F. Klein in 1895. More specifically we introduce Farey polyhedra and their sails that generalise respectively Klein polyhedra and their sails, and show similar duality properties of the Farey sail integer invariants. The construction of Farey sails is based on the multidimensional generalisation of the Farey tessellation provided by a modification of the continued fraction algorithm introduced by R. W. J. Meester. We classify Farey polyhedra in the combinatorial terms of prismatic diagrams. Prismatic diagrams extend boat polygons introduced by S. Morier-Genoud and V. Ovsienko in the two-dimensional case. As one of the applications of the new theory we get a multidimensional version of Conway-Coxeter frieze patterns. We show that multidimensional frieze patterns satisfy generalised Ptolemy relations.

fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2410.13091 ↗

We study the mixing properties of the white-forced Navier-Stokes system in the whole space $\mathbb{R}^2$. Assuming that the noise is sufficiently non-degenerate, we prove the uniqueness of stationary measure and polynomial mixing in the dual-Lipschitz metric. The proof combines the coupling method with a Foiaş-Prodi type estimate, weighted growth estimates for trajectories, and an estimate for the Leray projector involving Muckenhoupt $A_2$-class weights.

fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2410.15727 ↗

We determine the limit of the spectrum of the Neumann-Poincaré operator on circular tori as the torus degenerates. As the central hole closes, the spectrum converges to $[-1/2,0]$ together with a set of positive points, which we characterize as eigenvalues of explicit limiting operators. As the cross-section shrinks, the spectrum converges to $[0,1/2]$.

comments
20 pages, 2 figures
fields
Functional Analysis
pdf ↗ page arXiv:2410.20033 ↗

We investigate five-dimensional shrinking gradient Ricci solion $(M^5, g,f)$ satisfying $Ric+\nabla^2f= \frac{1}{2} g$ with constant scalar curvature. Fernández-López and Garc\'ıa-R\'ıo \cite{FR16} proved that the possible values of scalar curvature are $\{0,1,\frac{3}{2}, 2, \frac{5}{2}\}$. If $R=0$, the soliton is isometric to $\mathbb{R}^5$; if $R=2$, the soliton is a finite quotient of ${N}^{4}\times\mathbb{R}$ \cite{FR16}, where ${N}^4$ is a four-dimensional Einstein manifold; if $R=\frac{5}{2}$, the soliton is Einstein \cite{Petersen-Wylie2}. The most difficult cases are $R=\frac{3}{2}$ or $R=1$. In \cite{Li-Ou-Qu-Wu} we proved that it is a finite quotient of $\mathbb{R}^3\times \mathbb{S}^2$ if $R=1$. In this paper, we prove that five-dimensional shrinking gradient Ricci soliton with $R=\frac{3}{2}$ is isometric to a finite quotient of $\mathbb{R}^2\times \mathbb{S}^3$.

fields
Differential Geometry
pdf ↗ page arXiv:2411.10712 ↗

We propose a neural window decoder (NWD) for spatially coupled low-density parity-check (SC-LDPC) codes. The proposed methods adapt neural min-sum decoding to the structure and sequential operation of window decoding. First, target-oriented training restricts the loss to the variable nodes whose decisions are required at each window stage. Second, learned damping factors identify check-node updates that can reuse messages from the preceding iteration. Finally, adaptive weight switching selects weights trained for unreliable inherited information when a previous-window failure is detected. For a length-$20{,}000$ $(3,6)$-regular SC-LDPC code, the target-oriented NWD achieves performance comparable to sum-product window decoding while using min-sum updates. On the reduced target graph, scheduling based on regularized damping factors yields an estimated computational cost 48\% lower than that of full-graph weighted min-sum decoding, while maintaining comparable decoding performance. Adaptive weight switching improves decoding performance by 35\% at 3.0 dB relative to plain weights. These learning methods exploit the properties of window decoding to improve the reliability and computational efficiency of SC-LDPC convolutional codes.

comments
12 pages, 10 figures
fields
Information Theory
pdf ↗ page arXiv:2411.19092 ↗

We study non-collapsed $\mathrm{RCD}(-(N-1),N)$ spaces with locally bounded covering geometry. Our first main result generalizes Gromov's almost flat manifold theorem: if the universal cover is non-collapsing and the diameter is sufficiently small, then the space is bi-Holder homeomorphic to an infranilmanifold. In the smooth setting with $\mathrm{Ric} \ge -(N-1)$, this homeomorphism is actually a diffeomorphism. As an application of our arguments, we show that Gromov's almost flat manifold theorem extends to the $\mathrm{RCD}+\mathrm{CBA}$ setting. Our second main result generalizes Fukaya's fibration theorem. Suppose a sequence of non-collapsed $\mathrm{RCD}(-(N-1),N)$ spaces with locally bounded covering geometry converges in the pointed measured Gromov–Hausdorff sense to a smooth manifold of dimension $k < N$. We then construct a topological fiber bundle map from the RCD spaces to the limit manifold. The fibers are infranilmanifolds, and the structure group is affine. Finally, although there exist collapsing Ricci limit spaces with no topological manifold points, we prove that if the sequence additionally satisfies locally bounded covering geometry and the limit space has dimension $k$, then every $k$-regular point is a topological manifold point.

fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2412.06131 ↗

Complex systems often evolve in continuous time but are observed only at discrete time points with measurement noise. When the interactions can change across unobserved states, recovering both the state transitions and the differential equations is important for mechanistic insight and for identifying time-varying directed graphs. However, this recovery is challenging in high dimensions. In this paper, we study estimation and graph recovery for high-dimensional Markov-switching ordinary differential equation models from noisy discrete observations. We model the switching between states by a latent continuous-time Markov chain, and within each state the drift is a sparse additive function with unknown nonlinear components. We approximate each component by a finite basis expansion and estimate the parameters under group sparsity. Our procedure estimates the latent trajectories by wavelet smoothing and then runs a penalized surrogate expectation-maximization algorithm. Under stationarity and geometric $β$-mixing, given a sufficiently accurate estimated trajectory and other local regularity conditions, we show that the algorithm converges geometrically to a neighborhood of the true parameters. Finally, in an application to resting-state fMRI data, the procedure identifies multiple connectivity states, whose occupation times we compare descriptively between the children with combined-type ADHD and the typically developing children used in the fit.

fields
Statistics Theory
pdf ↗ page arXiv:2501.00087 ↗

Let $E$ be an elliptic curve defined over a quartic extension $K$ of $\mathbb{Q}$ with $j(E)\in\mathbb{Q}$. We classify the possible group structures of $E(K)_{\mathrm{tors}}$, concluding that the only additional possibilities, besides those occuring over quartic fields by base change from elliptic curves over $\mathbb{Q}$, are $\mathbb{Z}/17\mathbb{Z}$ and $\mathbb{Z}/21\mathbb{Z}$.

comments
10 pages, 1 table. Added a new section containing a simpler proof of Lemma 6.3
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2501.00400 ↗

We analyze a mathematical property of the popular card game SET. We present a revised geometric and computer-assisted proof that the maximum number of sets for 12 cards is 14 using finite field geometry, combinatorics, and graph theory. We present several computer algorithms for finding or approximating the maximum number of sets. We show a complete computer proof that iterates over all possible board configurations. We use this method to compute the maximum number of sets with 4 properties for a small number of cards, but it is generally too inefficient. With this method, we compute the maximum number of sets for 3 properties for all possible numbers of cards. Finally, we compare this to an existing approximation algorithm for finding maximal sets.

comments
9 pages, 7 figures, 7 tables. Accepted and expanded version of the IEEE CoG 2025 paper; corrects a gap in the published proof (Appendix B)
journal
2025 IEEE Conference on Games (CoG), Lisbon, Portugal, 2025
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2501.12565 ↗

In previous work, Takagi used the methods of solving the Sarkisov links by calculating the corresponding Diophantine equations and the construction of key varieties to give all possible classifications and some implementations of a class $\mathbb{Q}$-Fano 3-fold with Fano index 1/2 and at worst $(1, 1, 1)/2$ or QODP singularities. Firstly, we use a method different from Kawamata's work to give the derived category formulas for general weighted blow-up and Kawamata weighted blow-up. On this basis, we study the changing behavior of the derived category of Takagi's varieties under Sarkisov links. Finally, by studying non-commutative projections, we give exceptional collections on the derived category of Takagi's varieties and their corresponding geometric meanings.

fields
Algebraic Geometry
pdf ↗ page arXiv:2501.17454 ↗

We introduce string diagrams for graded symmetric monoidal categories. Our approach includes a definition of graded monoidal theory and the corresponding freely generated syntactic category. The para construction on monoidal actegories is a motivating example for our framework, and we show how an axiomatic presentation of the resulting category $\mathbf{Para}(\mathbb{G},\mathbf{C})$ may be modularly obtained from presentations for $\mathbb{G}$ and $\mathbf{C}$. We demonstrate three different applications of our diagrammatic language under the same theme: probabilistic reasoning. First, we show how to axiomatise a variant of the graded category $\mathbf{ImP}$, recently introduced by Liell-Cock and Staton to model imprecise probability. This culminates in a representation, as string diagrams with grading wires, of programs with primitives for nondeterministic and probabilistic choices and conditioning. Second, we exploit our modular presentation result to provide a new proof for a presentation of $\mathbf{Gauss}$, the category of Gaussian stochastic maps. Third, we use grading wires to represent causal interventions on Bayesian networks.

comments
New Section 3.3 on quotient up to regrading. New Section 7 on presentation of Gaussian maps. Old Section 7 is now Section 8 with added Section 8.5 on identifiability. Implemented many suggestions from reviewers
fields
Category Theory
pdf ↗ page arXiv:2501.18404 ↗

We compute the Gromov–Hausdorff distance from a metric space to the class of ultrametric spaces in terms of its ultrametric defect and study when a compact ultrametric space attains this distance. For the product of a compact ultrametric space and a compact connected metric space, we give a criterion for the existence of such an approximation. For every integer $k\geqslant1$, we obtain an exact formula for the distance from a bounded metric space to the class of ultrametric spaces with at most $k$ points and prove that the minimum is attained. We characterize the clouds that contain a path-connected space. For compact $X$, we construct a geodesic of length $\operatorname{diam}\textbf{U}(X)/2$ to a nearest connected compact space.

comments
12 pages; v2 is substantially edited, new results are added
fields
Metric Geometry
pdf ↗ page arXiv:2501.19346 ↗

We identify a new sufficient condition for the finite convergence of moment relaxations of polynomial optimization problems with correlative sparsity. This condition, which follows from a solution to a correlatively sparse version of the classical truncated moment problem, requires that certain moment matrices admit a flat extension and that the variable cliques underpinning the relaxation satisfy a "running intersection" property. We also describe an algorithm that, when these conditions are met, extracts at least as many minimizers for the original polynomial optimization problem as the largest rank of the moment matrices in its relaxation. Our results, along with the necessity of the running intersection property, are illustrated with examples.

comments
17 pages; clarified theorem statements and assumptions; improved literature discussion; replaced conjecture 9 with a counterexample; fixed typos and references
fields
Optimization and Control
pdf ↗ page arXiv:2502.01410 ↗

We introduce a Markov model for the factorisation of iterates of post-critically finite (PCF) cubic polynomials, extending the approach of Boston-Jones and Goksel for quadratic polynomials. Using the information encoded in the critical orbits, we study PCF cubic polynomials with combined critical orbits of lengths one, two and three. We construct groups $M_n$ and prove that their cycle data follow our Markov model. In certain cases, relations involving critical and co-critical points allow us to refine the model and the corresponding groups. We describe these groups using conditions arising from discriminants and prove that they contain, up to conjugation, the Galois groups of the iterates over number fields containing $\sqrt{-3}$. Our construction recovers the known Galois group associated with the cubic Belyi map and gives new groups for the other cases. Finally, we conjecture that the constructed groups coincide with the Galois groups outside a thin set of parameters at each fixed level, and provide computational evidence supporting this conjecture.

fields
Number Theory
pdf ↗ page arXiv:2502.16202 ↗

This paper establishes a primal-dual formulation for continuous-time mean field games (MFGs) and provides a complete analytical characterization of the set of all mean field equilibria (MFEs). We reformulate the representative player's control problem as a linear program over occupation measures and derive its dual formulation over smooth subsolutions of the associated Hamilton–Jacobi–Bellman (HJB) equation. This primal-dual formulation yields a verification theorem for MFEs under measurable coefficients and provides necessary and sufficient conditions characterizing all MFEs under a strong duality condition. We establish this strong duality for nondegenerate diffusions with Hölder continuous coefficients through a new global $C^{2,α}$ regularity result for fully nonlinear parabolic HJB equations. A key insight is that the dual variable need only coincide with the HJB solution on the support of the mean field flow. Compared with existing approaches, our characterization requires neither convexity of the Hamiltonian nor uniqueness of its optimizer, accommodates relaxed equilibria, and remains applicable when the HJB equation lacks classical solutions.

fields
Optimization and Control, Probability
pdf ↗ page arXiv:2503.01042 ↗

We provide a finite element discretization of $\ell$-form-valued $k$-forms on triangulation in $\mathbb{R}^{n}$ for general $k$, $\ell$ and $n$ and any polynomial degree. The construction generalizes finite element Whitney forms for the de~Rham complex and their higher-order and distributional versions, the Regge finite elements and the Christiansen–Regge elasticity complex, the TDNNS element for symmetric stress tensors, the MCS element for traceless matrix fields, the Hellan–Herrmann–Johnson (HHJ) elements for biharmonic equations, and discrete divdiv and Hessian complexes in [Hu, Lin, and Zhang, 2025]. The construction discretizes the Bernstein–Gelfand–Gelfand (BGG) diagrams. Applications of the construction include discretization of strain and stress tensors in continuum mechanics and metric and curvature tensors in differential geometry in any dimension.

comments
97 pages, 26 figures, 21 tables
fields
Numerical Analysis, Differential Geometry
pdf ↗ page arXiv:2503.03243 ↗

Drawing parallels with the way biological networks are studied, the authors adapt the treatment–control paradigm to explainable artificial intelligence research and enrich it through multi-parametric input alterations. A framework for investigating internal inference impacted by input data augmentations is proposed to address the real-world scenario with multiple simultaneously applied treatments instead of observing a single effect. The internal changes in network operation are reflected in activation changes measured by variance, which can be decomposed into components related to each augmentation by employing Sobol indices and Shapley values. To facilitate distinguishing model-related specifics from the self-interactions of augmentations, an auxiliary variable responsible for their permutations has been incorporated into the analysis. The resulting quantities enable one to visualize sensitivity to different variables and use them as features for further analysis and processing, including guided masking of activations. In addition, a method for single-class sensitivity analysis is introduced through a pipeline that involves class selection according to their match with the prediction bias generated by targeted damaging of the activations. Three convolutional networks, namely AlexNet, VGG11, and ResNet18, have been evaluated via the designed framework, with two vision transformers, ViT-b-16 and Swin-t, partially complementing the findings. Two sets of augmentations, consisting of five and seven distinct input transformations applied simultaneously, have been utilized as sources of variance in the image domain. Relying on the observed parallels, the authors assume that the developed framework can potentially be transferred to the study of biological neural networks in complex environments, as well as enhance the design of autonomous decision-making systems.

comments
38 pages; main text: 10 figures, 1 table; appendix: 5 sections, 3 tables; supplementary: 3 files (S1: arXiv ancillary file, attached; S2-S3: available at Zenodo repositories, see Data availability section)
journal
Neural Networks 206 (2027) 109502
fields
Numerical Analysis
pdf ↗ page arXiv:2503.03283 ↗

Distribution shifts have long been regarded as troublesome external forces that a decision-maker should either counteract or conform to. An intriguing feedback phenomenon termed decision dependence arises when the deployed decision affects the environment and alters the data-generating distribution. In the realm of performative prediction, this is encoded by distribution maps parameterized by decisions due to strategic behaviors. In contrast, we formalize an endogenous distribution shift as a feedback process featuring nonlinear dynamics that couple the evolving distribution with the decision. Stochastic optimization in this dynamic regime provides fertile ground to examine the various roles played by dynamics in the composite problem structure. To this end, we develop an online decision-making algorithm that both adapts to and shapes the dynamic distribution. Throughout the paper, we adopt a distributional perspective and demonstrate how this view facilitates characterizations of distribution dynamics and the optimality and generalization performance of the proposed algorithm. We showcase the theoretical results in an opinion dynamics context, where an opportunistic party maximizes the affinity of a population with evolving, polarized opinions, and in a recommender system scenario, featuring performance optimization with discrete distributions in the probability simplex.

comments
Published in the Journal of Machine Learning Research
fields
Optimization and Control
pdf ↗ page arXiv:2503.07324 ↗

An adaptive refinement strategy, based on an equilibrated flux a posteriori error estimator, is proposed in the context of defeaturing problems. Defeaturing consists of removing features from complex domains to simplify mesh generation and reduce the computational cost of simulations. It is a common procedure, for example, in computer aided design for simulation-based manufacturing. However, depending on the problem at hand, geometrical simplification may significantly deteriorate the accuracy of the solution. The proposed adaptive strategy is hence twofold: starting from a defeatured geometry, it iteratively performs both standard mesh refinement and geometrical refinement by selecting, at each step, which features must be reintroduced to significantly improve accuracy. Similar adaptive strategies have been previously developed using residual-based error estimators within an IGA framework. Here, instead, we extend a previously developed equilibrated flux a posteriori error analysis, designed for standard finite element discretizations, to make it fully applicable within the adaptive procedure. In particular, we address the assembly of the equilibrated flux estimator in presence of elements trimmed by the boundary of included features, adopting an unfitted finite element strategy to handle feature inclusion. The resulting estimator allows us to bound both the defeaturing and the numerical sources of error, with additional contributions accounting for the weak imposition of boundary conditions.

fields
Numerical Analysis
pdf ↗ page arXiv:2503.19784 ↗

We give conserved quantities of two generalizations of conformal circles on the conformal sphere. One generalization concerns curves carrying a distinguished parallel tractor along them, which can be used to construct the conserved quantities. The other is the class of curves satisfying the conformal Mercator equation, the conserved quantities of which are computed using Lagrangian formalism. The two generalizations are not disjoint, and our main result is the relation between their conserved quantities. Explicit examples are also presented.

comments
Accepted for publication in Journal of Mathematical Analysis and Applications (J. Math. Anal. Appl. 568 (2027) 131161)
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2503.23442 ↗

We consider the weakly coupled elliptic system of logistic type, \begin{equation} \begin{cases} -Δu &=μ_1u- |u|^{p-2}u+ β|u|^{\frac{p}{2}-2}u |v|{^{\frac{p}{2}}}\mbox{ in }Ω, -Δv & =μ_2 v- |v|^{p-2}v+β|u|^{\frac{p}{2}}|v|^{\frac{p}{2}-2}v \mbox{ in }Ω, \ \ u,v &\in H_0^1(Ω), \end{cases} \end{equation} where $Ω\subset\mathbb{R}^N$ is a bounded connected domain with $N\geq 2$, $2< p < 2^*$, $λ_1(Ω)< μ_1\leqμ_2$, and $λ_1(Ω)$ denotes the first eigenvalue of the Laplacian operator in $Ω$ with Dirichlet boundary conditions. We say the system is competitive if $β<0$ and cooperative if $β>0$, for $β\in \mathbb{R}$. We prove the existence and multiplicity of solutions to the problem \eqref{LS} in alternative variational frameworks, depending on the range of the parameter $β.$ We do not rely on bifurcation or degree theory, which have been used in the literature for logistic-type problems. Instead, the novelty is to obtain min-max type solutions by exploiting the different geometry of the functional associated with the logistic problem. In case $N\geq 2$, we establish existence and multiplicity results for different ranges of the coupling parameter, considering both the case \(2<p<4\) and the classical case \(p=4\). We also investigate the asymptotic behavior of selected solutions as \(β\to1^-\) and \(β\to-\infty\).} \textsc{Key words: Logistic System, Ground State Solution, Linking structure, Seminodal Solution.}{\small} \textsc{MSC 2020: } {\small 35J15 35J20, 35J60, 62J12.}

comments
22 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2504.18750 ↗

We prove that a bounded complex of coherent sheaves on an abelian variety A, whose Fourier-Mukai transform has support of dimension at most 1, extends to a perfect complex on the standard NC-smooth thickening of A and on the deformation quantization of any constant Poisson bracket on A. We discuss a related conjectural characterization of Jacobians in terms of NC-smooth thickenings.

comments
15 pages; v2: 16 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2505.04023 ↗

We study two models of $\mathsf{ReLU}$ neural networks: monotone networks ($\mathsf{ReLU}^+$) and input convex neural networks ($\mathsf{ICNN}$). Our focus is on expressivity, mostly in terms of depth, and our motivation is to gain a better understanding of the depth required to exactly represent functions using neural networks with ReLU activations, a subject that has received a lot of attention lately. We prove several lower bounds on the depth required to represent functions by monotone ReLU networks and $\mathsf{ICNN}$. For the maximum function $\mathsf{MAX}_n$ computing the maximum of $n$ real numbers, we show that $\mathsf{ReLU}^+$ networks cannot compute $\mathsf{MAX}_n$, or even approximate it. We prove a sharp lower bound of $n-1$ on the $\mathsf{ICNN}$ depth complexity of $\mathsf{MAX}_n$. We also prove depth separations between $\mathsf{ReLU}$ networks and $\mathsf{ICNN}$s; for every $k$, there is a depth-$2$ $\mathsf{ReLU}$ network of size $O(k^2)$ that cannot be simulated by a depth-$k$ $\mathsf{ICNN}$. The proofs are based on deep connections between neural networks and polyhedral geometry, and also use isoperimetric properties of triangulations.

comments
NeurIPS 2026 Spotlight
fields
Combinatorics
pdf ↗ page arXiv:2505.06169 ↗

This paper investigates the interplay between local and global equivalences on noncommutative polynomials, the elements of the free algebra. When the latter are viewed as functions in several matrix variables, a local equivalence of noncommutative polynomials refers to their values sharing a common feature point-wise on matrix tuples of all dimensions, such as rank-equivalence (values have the same ranks), isospectrality (values have the same spectrum), and pointwise similarity (values are similar). On the other hand, a global equivalence refers to a ring-theoretic relation within the free algebra, such as stable association or (elementary) intertwinedness. This paper identifies the most ubiquitous pairs of local and global equivalences. Namely, rank-equivalence coincides with stable association, isospectrality coincides with both intertwinedness and transitive closure of elementary intertwinedness, and pointwise similarity coincides with equality. Using these characterizations, further results on spectral radii and norms of values of noncommutative polynomials are derived.

fields
Rings and Algebras, Operator Algebras
pdf ↗ page arXiv:2505.07469 ↗

In this paper, we construct a restriction morphism on the critical cohomology of an equivariant Landau-Ginzburg model associated to a representation of a reductive group equipped with an invariant function. We show a compatibility formula between this restriction map and the induction map considered in earlier work in the form of a Mackey-type formula, thereby giving the critical cohomology the structure of a localized induction-restriction system. In the case of quivers, our formulas give the localized coproduct of Davison for cohomological Hall algebras of quivers with potential.

comments
v2: 48 pages, arguments carefully expanded. v1: 41 pages. Comments welcome
fields
Representation Theory, Algebraic Geometry
pdf ↗ page arXiv:2505.09483 ↗

The distance signless Laplacian matrix of a graph $G$ is define as $Q(G)=$Tr$(G)+D(G)$, where Tr$(G)$ and $D(G)$ are the diagonal matrix of vertex transmissions and the distance matrix of $G$, respectively. Denote by $E_G(v)$ the set of all edges incident to a vertex $v$ in $G$. A fractional matching of a graph $G$ is a function $f:E(G) \rightarrow [0,1]$ such that $\sum_{e\in E_G(v)} f(e)\leq 1$ for every vertex $v\in V(G)$. The fractional matching number $μ_f(G)$ of a graph $G$ is the maximum value of $ \sum_{e\in E(G)} f(e)$ over all fractional matchings. Given subgraphs $H_1, H_2,...,H_k$ of $G$, a $\{H_1, H_2,...,H_k\}$-factor of $G$ is a spanning subgraph $F$ in which each connected component is isomorphic to one of $H_1, H_2,...,H_k$. In this paper, we establish a upper bound for the distance signless Laplacian spectral radius of a graph $G$ of order $n$ to guarantee that $μ_f(G)> \frac{n-k}{2}$, where $1\leq k<n$ is an integer. Besides, we also provide a sufficient condition based on distance signless Laplacian spectral radius to guarantee the existence of a $\{K_2,\{C_k\}\}$-factor in a graph, where $k \geq 3$ is an integer.

comments
10 pages
fields
Combinatorics
pdf ↗ page arXiv:2505.13863 ↗

We establish a symmetry principle for asymptotically cylindrical steady gradient Ricci solitons and asymptotically conical expanding gradient Ricci solitons. Our symmetry principle bounds the loss of symmetry from the asymptotic link to the interior by the dimension of the weighted $L^2$ kernel of the stability operator. For homogeneous links, suitable kernel bounds imply that the soliton has an isometric action of cohomogeneity one. The results apply in particular to strictly linear stable solitons, require no curvature sign assumptions, and allow orbifold singular sets of codimension at least four. Applications include characterizations of Bryant solitons and global $U(m)$-symmetry results for solitons with quotient-Berger asymptotic links. In dimension four, we classify asymptotically $SU(2)/Γ$-cylindrical steady gradient Ricci solitons with trivial weighted kernel as finite quotients of Bryant or Appleton solitons. Under the same kernel condition, we also establish toric symmetry for asymptotically lens-cylindrical steady solitons.

comments
43 pages. v4 contains updated results for SU(2)/Gamma-cylindrical steady solitons, reinstates some of the orbifold discussion from v2, and simplifies some proofs from previous versions. Main ideas remain unchanged
fields
Differential Geometry
pdf ↗ page arXiv:2505.20576 ↗

The mathematical program with equilibrium constraints (MPEC) is a powerful yet challenging class of constrained optimization problems, where the constraints are characterized by a parametrized variational inequality (VI) problem. While efficient algorithms for addressing MPECs and their stochastic variants (SMPECs) have been recently presented, distributed SMPECs over networks pose significant challenges. This work aims to develop fully iterative methods with complexity guarantees for resolving distributed SMPECs in two problem settings: (1) distributed single-stage SMPECs and (2) distributed two-stage SMPECs. In both cases, the global objective function is distributed among a network of agents that communicate cooperatively. Under the assumption that the parametrized VI is uniquely solvable, the resulting implicit problem in upper-level decisions is generally neither convex nor smooth. Under some standard assumptions, including the uniqueness of the solution to the VI problems and the Lipschitz continuity of the implicit global objective function, we propose single-stage and two-stage zeroth-order distributed gradient tracking optimization methods where the gradient of a smoothed implicit objective function is approximated using two (possibly inexact) evaluations of the lower-level VI solutions. In the exact setting of both the single-stage and two-stage problems, we achieve the best-known complexity bound for centralized nonsmooth nonconvex stochastic optimization. This complexity bound is also achieved (for the first time) for our method in addressing the inexact setting of the distributed two-stage SMPEC. In addressing the inexact setting of the single-stage problem, we derive an overall complexity bound, improving the dependence on the dimension compared to the existing results for the centralized SMPECs.

fields
Optimization and Control
pdf ↗ page arXiv:2505.22916 ↗

We investigate 5-dimensional shrinking gradient Ricci soliton $(M^5, g,f)$ satisfying $Ric+\nabla^2f= \frac{1}{2} g$ with constant scalar curvature. Fernández-López and Garc\'ıa-R\'ıo \cite{FR16} proved that the possible values of scalar curvature are $\{0,1,\frac{3}{2}, 2, \frac{5}{2}\}$. If $R=0$, the soliton is isometric to $\mathbb{R}^5$; if $R=2$, the soliton is a finite quotient of ${N}^{4}\times\mathbb{R}$ \cite{FR16}, where ${N}^4$ is a four-dimensional Einstein manifold; if $R=\frac{5}{2}$, the soliton is Einstein \cite{Petersen-Wylie2}. The most difficult cases are $R=\frac{3}{2}$ or $R=1$. In \cite{Li-Ou-Qu-Wu} we proved that it is a finite quotient of $\mathbb{R}^2\times \mathbb{S}^3$ if $R=\frac{3}{2}$. In this paper, we prove that every five-dimensional shrinking gradient Ricci soliton with $R=1$ is isometric to a finite quotient of $\mathbb{R}^3\times\mathbb{S}^2(\sqrt2)$. Thus every complete connected five-dimensional shrinking gradient Ricci soliton with constant scalar curvature is rigid, so Cao's conjecture holds in dimension five.

fields
Differential Geometry
pdf ↗ page arXiv:2506.00887 ↗

We extend Rabin's cryptosystem to general number fields. We show that recovery of a random plaintext from its ciphertext is as hard as the integer factorisation problem, provided the modulus in our scheme has been chosen carefully. We investigate the performance of our new cryptosystem in comparison with the classical Rabin scheme and a more recent version over the Gaussian integers.

comments
16 pages; several changes according to referee's report
fields
Number Theory
pdf ↗ page arXiv:2506.09569 ↗

We consider one of the most common reparameterization techniques, the square transformation. Assuming the original objective function is the sum of a smooth function and a polyhedral function, we study the variational properties of the objective function after reparameterization. In particular, we first study the minimal norm of the subdifferential of the reparameterized objective function. Second, we compute the second subderivative of the reparameterized objective function on a linear subspace, which allows us to fully characterize the subclass of stationary points of the reparameterized objective function that correspond to stationary points of the original objective function. Finally, utilizing the representation of the minimal norm of the subdifferential, we show that the Kurdyka-Łojasiewicz (KL) exponent of the reparameterized function can be deduced from that of the original function. Applications to concrete optimization models are discussed.

comments
33 pages
fields
Optimization and Control
pdf ↗ page arXiv:2506.10110 ↗

We study the unconstrained and the minimax saddle point variants of the convex multi-stage stochastic programming problem, where consecutive decisions are coupled through the objective functions, rather than through the constraints. We approach the problems from the infinite-dimensional policy perspective, but consider an online setting where only the policies corresponding to the actual realization of the underlying stochastic process are needed. This leads to a tractable formulation, where the dimension of the output is linear in the number of stages $T$. We propose hypothetical Mirror Descent Stochastic Approximation (MDSA) for the infinite-dimensional policies using stochastic conditional gradients. By taking advantage of the decomposability of the updates across stages and realizations of the underlying stochastic process, we show that the proposed MDSA algorithms admit efficient online implementation. In the moderate-accuracy regime, where the allowed total error scales linearly with $T$, the oracle complexity is linear in $T$ and the extra space needed is independent of $T$.

fields
Optimization and Control
pdf ↗ page arXiv:2506.15392 ↗

We study a system of coupled Gross–Pitaevskii equations modelling a four-component Bose–Einstein condensate on the unit ball in R^3. The system possesses a branch of spatially homogeneous solutions—the trivial branch—that bifurcates from the identically zero state. Our main result establishes that this trivial branch undergoes multiple global bifurcations at critical values of the chemical potential. The tool we use to prove our results is the G-equivariant gradient degree with G=O(3)x S_{4}, which combines the rotational symmetry of the domain with the permutation symmetry of the components. We emphasise that the bifurcating solutions are spatially inhomogeneous amplitude (density) patterns of real-valued components.

comments
The eigenvalue S^2_km has been revised throughout the paper: (k,m) is now either (0,0) or belongs to NxN^+. The appendices have been condensed, and additional references have been added
fields
Analysis of PDEs
pdf ↗ page arXiv:2507.07235 ↗

In this paper, we study blow up behavior of the semilinear parabolic inequality with $p$-Laplacian operator and nonlinear source $u_t - Δ_p u \geq σ(x, t)Φ(u)$ on a locally finite connected weighted graph $G = (V, E)$. We extend the comparison principle and thereby establish the relationship between the initial value and the existence of blow-up solutions to the problem under different growth rates of $Φ$. We prove that when the growth rate of $Φ$ exceeds linear growth, blow-up solutions exist under appropriate initial conditions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2507.12303 ↗

We prove convergence of the spectral element method for piecewise polynomial collocation applied to periodic boundary value problems for functional differential equations. In particular, we prove that the numerical collocation solution approximates the true solution with accuracy of order $\mathrm{e}^{-ηm}$ for some $η>0$ and increasing degree $m$ of the polynomials, provided that the true solution is analytical. This includes a case that is common in applications: differential equations where the right-hand side depends on a finite number of delayed arguments with parametric delays and real analytic coefficients. For state-dependent delays the spectral element method also converges under mild regularity assumptions, although analyticity of the solution cannot be trivially inferred from analyticity of the coefficients. In order to extend our convergence results to this case, we introduce the concept of extended local Lipschitz continuity of the right-hand side.

comments
27 pages, 5 figures
journal
Andò, A., Sieber, J. Spectral element methods for boundary-value problems of functional differential equations. Bit Numer Math 66, 68 (2026)
fields
Numerical Analysis
pdf ↗ page arXiv:2507.20266 ↗

We consider the two-dimensional Coulomb gas with a general potential at the determinantal temperature, or equivalently, the eigenvalues of random normal matrices. We prove that the smallest gaps between particles are typically of order $n^{-3/4}$, and that the associated joint point process of gap locations and gap sizes, after rescaling the gaps by $n^{3/4}$, converges to a Poisson point process. As a consequence, we show that the $k$-th smallest rescaled gap has a limiting density proportional to $x^{4k-1}e^{-\frac{\mathcal{J}}{4}x^{4}}$, where $\mathcal{J}=π^{2}\int ρ(z)^{3}d^{2}z$ and $ρ$ is the density of the equilibrium measure. This generalizes a result of Shi and Jiang beyond the quadratic potential.

comments
36 pages, 3 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2507.23502 ↗

We study drift and covariance estimation for a stationary Gaussian process with an integrated deterministic drift, observed at high frequency over an expanding time horizon. We establish consistency and asymptotic normality of an increment least-squares estimator under conditions on drift accumulation and the full covariance of the weighted increments. For directly Riemann integrable drifts, this estimator need not be consistent, as an explicit example shows. Covariance parameters can nevertheless be estimated consistently when the drift decays sufficiently fast. For smooth short-range kernels, we prove a joint central limit theorem for the centered sample variance and the normalized increment second moment, with rate $\sqrt{T_n}$. These statistics require no drift estimate and identify both parameters of the Gaussian kernel. The results clarify how drift accumulation and increment dependence affect the two estimation problems.

fields
Statistics Theory, Probability
pdf ↗ page arXiv:2508.01164 ↗

In arXiv:1812.00170 and arXiv:1908.04365, Morier-Genoud and Ovsienko introduced $q$-rational numbers $[x]_q$, rational functions specializing to $x$ at $q=1$, and their extension to $q$-real numbers, Laurent series agreeing with $[x]_q$ for rational $x$. It was conjectured in arXiv:2102.00891 that for every real $x>1$, $[x]_q$ has positive radius of convergence, with optimal common radius $R_*=(3-\sqrt{5})/2$, attained at the golden ratio. We prove that $[x]_q$ converges to a nonvanishing holomorphic function for every real $x>1$ and $|q|<3-2\sqrt{2}$. The proof gives an expansion of $1/[x]_q$ as a $q$-adically convergent series of rational functions, converging absolutely and locally uniformly on an explicit region. It also defines a positive analytic function for $q\in(-R_*,1)$. Using arXiv:2405.15970, we further obtain convergence for $|q|<2-\sqrt{3}$. We compute $[x]_q$ explicitly for some transcendental $x$, including ${\rm cotan}(1)$ and $e$. We also establish sharp inequalities for numerators and denominators of $q$-rationals when $|q|=1$ and determine the closure of the set of $[x]_q$ when such $q$ is not a root of unity. Next, we show that coefficientwise reduction modulo every $m\ge2$ is injective on the Cantor line (the extended real line with doubled up rationals and the Cantor set topology); for $m=2$, it identifies the Cantor line with $\mathbb P^1(\mathbb F_2((q)))$. We describe the inverse map, extend rationality results modulo every prime, characterize quadratic series over $\mathbb F_2(q)$ corresponding to quadratic irrationals, derive criteria for eventual parity of coefficients, and compute the real numbers corresponding to $1+q^n$. Finally, we propose a definition of $q$-complex number $[τ]_q$, a meromorphic function in $τ\in\mathbb C_+$ expressed via hypergeometric functions evaluated at modular functions of $τ$.

comments
60 pages, 2 figures; v2 is a major revision with new results in sections 3.2, 7, 8; v3 contains corrections of errors found by ChatGPT 6 Astra (the results are the same as in v2)
fields
Complex Variables, Classical Analysis and ODEs, Combinatorics, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2508.08440 ↗

Nijenhuis family algebras generalize Nijenhuis associative algebras, the operator being replaced by a family of operators labelled by a semigroup $Ω$. In this paper, we introduce Nijenhuis family bimodules and show that a Nijenhuis family algebra gives rise to an associative algebra on ${A\ot\bkΩ}$. We realize Nijenhuis families and Nijenhuis family algebras as Maurer–Cartan elements of a graded Lie algebra and of an $L_\infty$-algebra. We define the cohomology of a Nijenhuis family algebra with coefficients in a bimodule via a mapping cone, obtain a long exact sequence, and show that infinitesimal deformations are classified by the second cohomology group. Finally, we show that strict homotopy Nijenhuis family algebras induce $A_\infty$-algebras on ${A\ot\bkΩ}$.

fields
Rings and Algebras
pdf ↗ page arXiv:2508.17529 ↗

The goal of this paper is to provide a new approach to address the $L^p-$boundedness of bilinear rough singular integral operators. This approach relies on local Fourier series expansion of input functions leading to trilinear estimates with desired decay in the frequency parameter. This approach departs from the existing methods of the wavelet decomposition of the multiplier employed in the work of Grafakos, He and Honzík and in a series of subsequent papers in the context of bilinear rough singular integrals. With this new approach, we prove sharp $L^p-$estimates for maximally truncated bilinear rough singular integrals when the kernel is supported away from the diagonal in the plane. Furthermore, this method allows us to deduce a new and self-contained proof of $L^p-$boundedness of the bilinear rough singular integral operators in all dimensions for the optimal range of exponents.

comments
Revised version. 26 pages, To appear in Annali della Scuola Normale Superiore di Pisa
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2508.19181 ↗

We consider an irreversible investment problem under incomplete information, where the investor decides whether and when to make investments in a project. Upon investment, the investor acquires previously hidden information from the project's past (''learning from the past''), and so the learning rate of the problem is controlled by investing. We set up this original problem as a recursively defined stopping problem with a learning-from-the-past effect. We show that, under general conditions, at each recursion step there exists a one-sided stopping boundary. We proceed to present the optimal investment strategy as a sequence of semi-explicit stopping boundaries derived from the smooth fit conditions of the corresponding free-boundary problems. Feasibility of our approach is then demonstrated by solving example boundaries numerically and by performing sensitivity analysis with respect to different model parameters.

comments
To appear in: Journal of Applied Probability
fields
Optimization and Control
pdf ↗ page arXiv:2508.21731 ↗

In this article we show that the quasi-free flows on the Cuntz algebra $\mathcal{O}_2$ are generically classifiable by the inverse temperature of their unique KMS state. Along the way, we show that a large class of quasi-free flows on the Cuntz algebra $\mathcal{O}_n$ are generically equivariantly $\mathcal{Z}$-stable and their corresponding dual action has the Rokhlin property generically.

comments
Accepted version, Doc. Math
fields
Operator Algebras, Dynamical Systems
pdf ↗ page arXiv:2509.00829 ↗

In this work, we develop a unified framework for quasidiagonal and Følner-type approximations of linear operators on Hilbert spaces. These approximations (originally formulated for bounded operators and operator algebras) involve sequences of non-zero finite rank orthogonal projections that asymptotically commute with the operator -- either in norm (quasidiagonal) or in mean (Følner). Such structures guarantee spectral approximation results in terms of their finite sections. We extend this theory to unbounded, densely defined closable operators, establishing a generalization of Halmos' classical result: every closable quasidiagonal operator is a compact perturbation of a closable block-diagonal operator on the same domain. Likewise, we introduce sparse Følner sequences and establish an interplay between quasidiagonal approximations and the existence of sparse Følner sequences. The theoretical developments are illustrated with explicit examples using different types of weighted shifts and applied to quantum mechanical models, including a detailed treatment of the Weyl algebra and its Schrödinger representation.

comments
New definition of sparse Foelner sequence and proof of Theorem 2.8; new Proposition 3.3; variation in the definition of Foelner sequences for unbounded operators; general improvement of the presentation and new references; 21 pages
fields
Functional Analysis, Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2509.03384 ↗

This paper presents a Markov-chain-based method for the early-phase analysis and design of spare-management architectures for large-scale satellite constellations. To assess the long-run viability of such concepts of operations, satellite failure and replenishment processes are modeled as Markov chains and analyzed through their stationary solution. We reinvestigate an indirect spare strategy, modeled as a multi-echelon periodic-review reorder-point/order-quantity policy, in which spares are first delivered to parking orbits and then transferred to constellation planes. The stock levels in constellation and parking orbits are each modeled as independent Markov chains, and a fixed-point iteration yields a consistent joint stationary solution that describes the strategy's average behavior. This approach accurately captures the stochastic interplay within a multi-echelon model driven by orbital mechanics, avoiding the aggregation assumptions of prior works and remaining valid across a wider operating domain. Building on this fast, accurate analysis, we formulate an optimization problem and solve it via a genetic algorithm. Finally, we demonstrate the practical value of both the analysis method and the optimization framework in a real-world mega-constellation case study.

fields
Optimization and Control
pdf ↗ page arXiv:2509.09957 ↗

We revisit the problem of spectral clustering in multimodal settings, where each data modality is encoded as a graph Laplacian. While classical approaches–including joint diagonalization, spectral co-regularization, and multiview clustering–attempt to align embeddings across modalities, they often rely on costly iterative refinement and may fail to directly target the spectral subspace relevant for clustering. In this work, we introduce two key innovations. First, we bring the power of randomization to this setting by sampling random convex combinations of Laplacians as a simple and scalable alternative to explicit eigenspace alignment. Second, we propose a principled selection rule based on Bottom-$k$ Aggregated Spectral Energy (BASE)--a $k$-dimensional extension of the directional smoothness objective from recent minimax formulations–which we uniquely apply as a selection mechanism rather than an optimization target. The result is Randomized Joint Diagonalization with BASE Selection (RJD-BASE), a method that is easily implementable, computationally efficient, aligned with the clustering objective, and grounded in decades of progress in standard eigensolvers. Through experiments on synthetic and real-world datasets, we show that RJD-BASE reliably selects high-quality embeddings, outperforming classical multimodal clustering methods at low computational cost.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.11981 ↗

We study Chow groups and étale motivic cohomology groups of smooth complete intersections with Hodge structures of level one, classified by Deligne and Rapoport, with particular attention to fivefolds. We extend these results to an étale motivic context and recover an analogous finite-dimensionality in the sense of Kimura. We then turn to quartic double fivefolds, which are Fano fivefolds whose middle cohomology is numerically similar to that of a Calabi-Yau threefold. By means of cubic surfaces which are totally ramified along the branch locus, we prove the integral Hodge conjecture for all of them. We also show that the comparison maps between their Chow groups and étale Chow groups are isomorphisms except possibly in codimension three, where we describe the kernel and the cokernel in terms of Bloch-Ogus cohomology and, via a Sarkisov link, of the unramified cohomology of a cubic surface over the function field of $\mathbb{P}^3$.

comments
53 pages. v3: Major updates following referee reports and talks given on the preprint. Comments are very welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2509.12186 ↗

We prove that non-pretentious multiplicative functions are orthogonal to polynomials over function fields (up to characteristic conditions).

comments
22 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2509.12755 ↗

We study notions of conjugate points along timelike geodesics in the synthetic setting of Lorentzian (pre-)length spaces, inspired by earlier work for metric spaces by Shankar–Sormani. After preliminary considerations on convergence of timelike and causal geodesics, we introduce and compare one-sided, symmetric, unreachable and ultimate conjugate points along timelike geodesics. We show that all such notions are compatible with the usual one in the smooth (strongly causal) spacetime setting. As applications, we prove a timelike Rauch comparison theorem, as well as a result closely related to the recently established Lorentzian Cartan–Hadamard theorem by Erös–Gieger. In the appendix, we give a detailed treatment of the Fréchet distance on the space of non-stopping curves up to reparametrization, a technical tool used throughout the paper.

comments
27 pages, 1 figure, final version
fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2509.12855 ↗

We show that algebra objects in model categories can be transferred to algebra objects in $\infty$-categories, without any cofibrancy or fibrancy assumptions on the algebra. We furthermore show under some mild extra assumptions that this correspondence extends to commutative bialgebras and to commutative Hopf algebras.

comments
v1: Comments welcome! v2: Accepted version, to appear in AGT
fields
Category Theory, Algebraic Topology
pdf ↗ page arXiv:2509.13602 ↗

We provide a short proof of a conic version of the colorful Carathéodory theorem for oriented matroids. Holmsen's extension of the colorful Carathéodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses several generalizations of the original result, but not its conic version. Our approach relies on a common generalization of Sperner's lemma and Meshulam's lemma - two closely related results from combinatorial topology that have found a number of applications in discrete geometry and combinatorics. This generalization may be of independent interest. Using a similar approach, we also establish the following colorful theorem for topes, whose special geometric case had not been considered before: Given $n$ topes from a uniform oriented matroid with $n$ elements, if they agree on some element, then there is a way to select a distinct element from each tope, together with its sign, so as to form another tope of the oriented matroid. Motivated by this theorem, we further explore other conditions leading to the same conclusion.

fields
Combinatorics
pdf ↗ page arXiv:2509.13718 ↗

Let $G\subset \mathrm{SL}_3(\mathbb C)$ be a nontrivial finite abelian subgroup and let $Ψ\colon D^b_G(\mathbb{C}^3) \xrightarrow{\sim} D^b(G\operatorname{-}\mathrm{Hilb}(\mathbb{C}^3))$ denote the Bridgeland–King–Reid equivalence. For every nontrivial character $χ$ of $G$, the transform of the corresponding skyscraper sheaf at the origin has exactly one nonzero cohomology sheaf, in degree $0$ or $-1$. We study the proportion $\mathcal B_0$ of characters for which this degree is zero. Using derived Reid's recipe, we establish the sharp bounds $1/3\leq\mathcal B_0\leq1$. For isolated quotient singularities, the lower bound sharpens to $1/2$, and we exhibit an explicit family of cyclic quotients indexed by positive integers $m$ for which $\mathcal{B}_0 \to 1$ as $m \to \infty$. We show that $\mathcal B_0=1$ precisely when the fiber over the origin has dimension at most one, and relate $\mathcal B_0$ to the Picard rank of $G\operatorname{-}\mathrm{Hilb}(\mathbb{C}^3)$ and the number of compact exceptional divisors of the resolution $G\operatorname{-}\mathrm{Hilb}(\mathbb{C}^3)\rightarrow \mathbb{C}^3/G$. A theorem of Craw–Lin–Yamagishi translates these estimates into bounds for the coordinate facets of the $G$-Hilbert GIT chamber. We discuss how the proportion $\mathcal{B}_0$ adapts to non-abelian finite subgroups of $\mathrm{SL}_3(\mathbb{C})$.

comments
arXiv admin note: substantial text overlap with arXiv:2201.07847
fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2509.15825 ↗

Exponential functionals of subordinators play a key role in probability theory and arise in numerous applications, yet explicit density formulas have until now been available only in a limited number of special settings. This paper provides a general remedy. First, we obtain a closed-form representation of the density for the entire class of integer-valued subordinators (compound Poisson processes with positive integer jump sizes) in the form of a rapidly converging series whose coefficients obey a simple recurrence; we further extend the construction to include drift by means of an explicit iterative scheme. Second, we propose a general approximation method for arbitrary driftless subordinators, including cases where the Lévy measure has continuous support. By discretizing the Lévy measure, we generate a sequence of explicit, computable densities that is proved to converge to the true density. Together, these results greatly broaden the theory of exponential functionals, transforming a problem previously tractable only in rare instances into one that is either explicitly solvable or can be systematically approximated for the full class of subordinators. The resulting formulas enable fast and accurate computations for financial modelling, insurance risk assessment, and stochastic simulation, while the approximation procedure provides a robust and stable alternative to existing numerical methods. The unified framework --- linking pantograph equations, $q$-calculus, and Poisson approximation --- also opens avenues for analyzing more general decreasing functionals and drifted subordinators with general Lévy measures.

comments
34 pages, 2 tables, 6 figures. Retitled (formerly "On certain integral functionals of integer-valued subordinators"), reorganized for clarity, main results unchanged
fields
Probability
pdf ↗ page arXiv:2509.17199 ↗

We derive two forms of conditional a posteriori error estimates for a finite volume scheme approximating the parabolic-elliptic Keller-Segel system. The estimates control the error in the $L^\infty(0,T, L^2(Ω))$-norm and exhibit linear convergence in the mesh size, as observed in numerical experiments. Crucially, we show that, as long as the condition of the error estimate is satisfied, a weak solution exists. This means, as long as the numerical solution has good properties, we can rigorously infer existence of an exact solution.

comments
54 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2509.17710 ↗

On a Walker 3-manifold $(M,g)$, we construct and study almost paracontact metric structures $(\varphi ,ξ,η,g)$, only by means of coordinate functions of a unit space-like vector field $ξ$ and the metric $g$. Necessary and sufficient conditions are established for $M$, endowed with these structures, to belong to one of the classes of almost paracontact metric 3-manifolds, according to the classification of S. Zamkovoy and G. Nakova. We find some classes to which the studied manifolds do not belong. The almost paracontact metric structure on a Walker 3-manifold examined in \cite{GC2} is obtained here as a particular case. Special attention we pay to an $η$-Einstein manifold, whose $ξ$-sectional, $\varphi $-sectional and scalar curvatures are investigated. Some local and global examples are constructed throughout.

comments
27 pages
fields
Differential Geometry
pdf ↗ page arXiv:2509.21809 ↗

It is known that any meromorphic connection on the Riemann sphere determines a finite diagram (a generalised graph, possibly with negative edge multiplicities), which is invariant under the Fourier-Laplace transform. If the connection has regular singularities at finite distance and an untwisted irregular singularity at infinity, the diagram is a supernova graph, and the quiver modularity theorem of Boalch/Hiroe-Yamakawa shows that the corresponding nonabelian Hodge moduli space contains the Nakajima quiver variety of the graph as an open subset. In this note, motivated by the question of classifying these nonabelian Hodge diagrams, we obtain a necessary condition satisfied by all (core) nonabelian Hodge diagrams, involving ultrametric inequalities. We use this to investigate the class of such diagrams that are graphs (without edge-loops nor negative multiplicities), as well as certain special classes of nonabelian Hodge graphs: we show that there exist nonabelian Hodge graphs beyond the setting of the quiver modularity theorem, and obtain characterisations of fission graphs and of simply-laced nonabelian Hodge graphs.

comments
18 pages, comments welcome! v2. minor changes, introduction expanded with more background and motivation
fields
Algebraic Geometry, Classical Analysis and ODEs
pdf ↗ page arXiv:2509.24861 ↗

In this paper, we propose a pathwise data-driven framework for model discovery of stochastic differential equations (SDEs) from a single trajectory, without requiring the ergodicity or stationary assumption on the underlying continuous process. By combining (stochastic) Taylor expansions with Girsanov transformations, and using the drift function's initial value as input, we construct drift estimators while simultaneously recovering the model noise. This drift is unique up to the fixed underlying Brownian sample path, in line with pathwise unique Rough-Smooth decomposition. This allows us to recover the underlying $\mathbb P$ Brownian motion increments for the observer path $ω$. Building on these estimators, we introduce the first stochastic Sparse Identification of Stochastic Differential Equation (SSISDE) algorithm, capable of identifying the governing SDE dynamics from a single observed trajectory without requiring ergodicity or stationarity. To validate the proposed approach, we conduct numerical experiments with both linear and quadratic drift-diffusion functions. Among these, the Black-Scholes SDE is included as a representative case of a system that does not satisfy ergodicity or stationarity.

comments
37 pages
fields
Probability
pdf ↗ page arXiv:2509.25484 ↗

Recovering a low-CP-rank tensor from noisy linear measurements is a central challenge in high-dimensional data analysis, with applications spanning tensor PCA, scalar-on-tensor regression, tensor-on-tensor regression, and beyond. We exploit the intrinsic geometry of rank-one tensors by casting the recovery task as an optimization problem over the Segre manifold, the smooth Riemannian manifold of rank-one tensors. This geometric viewpoint yields two powerful algorithms: Riemannian Gradient Descent (RGD) and Riemannian Gauss-Newton (RGN), each of which preserves feasibility at every iteration. Under mild noise assumptions, we prove that RGD converges at a local linear rate, while RGN exhibits an initial local quadratic phase followed by linear refinement to the statistical error. Extensive synthetic experiments validate these convergence guarantees and demonstrate the practical effectiveness of our methods.

comments
Accepted at NeurIPS 2026 (camera-ready version). 49 pages, 5 figures, 10 tables. Code: https://github.com/kxu-stat/SegreCP
fields
Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2510.00569 ↗

The theory of representations of a crossed module is a direct generalization of the theory of representations of groups. For a finite group G, the Drinfeld quantum double of the group G is a Hopf algebra that represents a special case of crossed module of finite groups. Here we study how to extend the construction of the Drinfeld quantum double for any other kind of crossed module of finite groups. This leads to a Hopf algebra D(G,H) that presents similarities with a Drinfeld double. We then study simple subalgebras of D(G,H) and give two isomorphisms for the decomposition into a product of simple subalgebras. We then study the category D(G,H)-mod^Fd of finite dimensional modules over D(G,H), which turns out to be isomorphic to the category of finite dimensional representations of finite crossed modules of groups. These categories being monoidal, we also study links between direct sums of simple objects and tensor products of simple objects and give some results for a Clebsch-Gordan formula. We, in this context, present and develop the character theory for representations of crossed modules of finite groups, and detail the proofs. We then study the category itself, which leads to some ribbon invariants.

comments
Suggestions are welcome
fields
Quantum Algebra, Category Theory, Representation Theory
pdf ↗ page arXiv:2510.01809 ↗

Recently the authors have shown that every Hecke algebra associated to a type constructed by Kim and Yu is isomorphic to a Hecke algebra for a depth-zero type. An example in the literature has been suggested as a counterexample to this result. We show that the example is not a counterexample, and exhibit some of its interesting properties, e.g., we show that a principal series, depth-zero type can have a Hecke algebra with non-trivial two-cocyle, a phenomenon that many did not expect could occur.

comments
14 pages
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2510.07391 ↗

Ample empirical evidence in deep neural network training suggests that a variety of optimizers tend to find nearly global optima. In this article, we adopt the reversed perspective that convergence to an arbitrary point is assumed rather than proven, focusing on the consequences of this assumption. From this viewpoint, in line with recent advances on the edge-of-stability phenomenon, we argue that different optimizers effectively act as eigenvalue filters determined by their hyperparameters. Specifically, the standard gradient descent method inherently avoids the sharpest minima, whereas Sharpness-Aware Minimization (SAM) algorithms go even further by actively favoring wider basins. Inspired by these insights, we propose two novel algorithms that exhibit enhanced eigenvalue filtering, effectively promoting wider minima. Our theoretical analysis leverages a generalized Hadamard–Perron stable manifold theorem and applies to general semialgebraic $C^2$ functions, without requiring additional non-degeneracy conditions or global Lipschitz bound assumptions. We support our conclusions with numerical experiments on feed-forward neural networks.

comments
In press, 19 pp
journal
Transactions on Machine Learning Research
fields
Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2510.09034 ↗

We show that $h_\infty(X+Y)\leq h_\infty(Z+W)$, where $X, Y$ are independent log-concave random variables, and $Z, W$ are exponential random variables having the same respective $\infty$-Rényi entropies. Analogs for integer-valued monotone log-concave random variables are also obtained. Our main tools are decreasing rearrangement, majorization, and the change of measure.

fields
Probability, Information Theory, Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2510.09206 ↗

Volatility estimation is a central problem in financial econometrics, but becomes particularly challenging when jump activity is high, a phenomenon observed empirically in highly traded financial securities. In this paper, we revisit the problem of spot volatility estimation for an Itô semimartingale with jumps of unbounded variation. We construct truncated kernel-based estimators and debiased variants that extend rate-optimal spot volatility estimation to a wider range of jump activity indices, from the previously available bound $Y<4/3$ to $Y<20/11$. Rate-suboptimal CLTs are also established for $Y>20/11$. Compared with earlier work, our approach achieves smaller asymptotic variances through the use of more general kernels and an optimal choice for the bandwidth convergence rate, and also has broader applicability under more flexible model assumptions. A comprehensive simulation study confirms that our procedures outperform competing methods in finite samples.

comments
84 pages
fields
Statistics Theory
pdf ↗ page arXiv:2510.14285 ↗

Given a graph $G$, let $Δ_2(G)$ denote the maximum number of neighbors any two distinct vertices of $G$ have in common. Vu (2002) proposed that, provided $Δ_2(G)$ is not too small as a proportion of the maximum degree $Δ(G)$ of $G$, the chromatic number of $G$ should never be too much larger than $Δ_2(G)$. We make a first approach towards Vu's conjecture from a structural graph theoretic point of view. We prove that, in the case where $G$ is claw-free, indeed the chromatic number of $G$ is at most $Δ_2(G)+3$. This is tight, as our bound is met with equality for the line graph of the Petersen graph. Moreover, we can prove this in terms of the more specific parameter that bounds the maximum number of neighbors any two endpoints of some edge of $G$ have in common. Our result may be viewed as a generalization of the classic bound of Vizing (1964) for edge-coloring.

comments
34 pages, 7 figures; v3 is AAM to appear in Canadian Journal of Mathematics
fields
Combinatorics
pdf ↗ page arXiv:2510.15553 ↗

We study effective generalized divisors on reduced tame Deligne-Mumford curves over $\mathbb{C}$ satisfying $G_1$ and $S_2$. Canonical coarsening maps divisor ideals to coarse canonical lattices. We describe its fibres by exact intervals of equivariant lattices. For flat projective finite-quotient families of geometrically reduced Gorenstein curves over locally Noetherian bases, with finite constant groups and the stated relative-duality and base-change hypotheses, we construct projective invariant-Quot schemes for fixed canonical lattices with finite flat quotients and prescribed quotient representations. A nontrivial marked deformation preserves the coarse ring, normalization, conductor and entire fixed canonical fibre, while a length-four isotypic jet detects its parameter. We compute the full normalization and conductor correction after support restriction on an explicit rank-three chart. As a module, the correction splits into one surface and two line canonical modules, with a common grading shift. The corresponding square-zero algebra extension is nonsplit. The full source-support pair is compared through second order. Exact computational certificates accompany the proofs.

comments
47 pages. Substantially revised and retitled. Section 1.5 explains corrections to v1. New results concern canonical coarsening, deformations, and conductor corrections
fields
Algebraic Geometry
pdf ↗ page arXiv:2510.16796 ↗

In connection with recent work on smallest gaps, C. Charlier proves that the 1-point function of a suitable planar Coulomb system $\{z_j\}_1^n$, in the determinantal case with respect to an external potential $Q(z)$, admits the expansion, as $n\to\infty$, $$R_n\bigg(z_0+\frac t {\sqrt{2n\partial\bar{\partial} Q(z_0)}}ν(z_0)\bigg)=n\partial\bar{\partial} Q(z_0)\frac {\operatorname{erfc} t}2+\sqrt{n\partial\bar{\partial} Q(z_0)}\,C(z_0;t)+\mathcal{O}(\log^6 n).$$ Here $t$ is a real parameter, $z_0$ is a regular boundary point of the (connected) Coulomb droplet and $ν(z_0)$ is the outwards unit normal; the coefficient $C(z_0;t)$ has an apriori structure depending on a number of parameters. In this note we identify the parameters and obtain a formula for $C(z_0;t)$ in potential theoretic and geometric terms. Our formula holds for a large class of potentials such that the droplet is connected with smooth boundary. Our derivation uses the well known expectation of fluctuations formula.

comments
This update contains a few relatively minor clarifications of proofs
fields
Mathematical Physics, Complex Variables, Probability
pdf ↗ page arXiv:2510.16945 ↗

We introduce variable projected augmented Lagrangian (VPAL) methods for solving generalized nonlinear Lasso problems with improved speed and accuracy. By eliminating the nonsmooth variable via soft-thresholding, VPAL transforms the problem into a smooth reduced formulation. We develop a preconditioned variant based on curvature-informed updates and investigate its performance for both linear and nonlinear inverse problems. We prove convergence guarantees for both standard and preconditioned VPAL under mild assumptions and show that variable projection leads to faster convergence and higher solution quality. The method seamlessly extends to nonlinear inverse problems, where it outperforms traditional approaches in applications such as phase retrieval and contrast-enhanced magnetic resonance imaging. Across linear and nonlinear imaging applications, numerical experiments demonstrate the accuracy and computational efficiency of the proposed methods, highlighting the potential of variable projection for large-scale inverse problems.

fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2510.24140 ↗

In this work, we take a step towards understanding overdamped Langevin dynamics for the minimization of a general class of objective functions $\mathcal{L}$. We establish well-posedness and regularity of the law $ρ_t$ of the process through novel a priori estimates, and, very importantly, we characterize the large-time behavior of $ρ_t$ under truly minimal assumptions on $\mathcal{L}$. In the case of integrable Gibbs density, the law converges to the normalized Gibbs measure. In the non-integrable case, we prove that the law diffuses. The rate of convergence, in terms of relative Dirichlet energy with respect to the Gibbs measure, is $\mathcal O(1/(σt))$, where $σ$ is the diffusion parameter. Under a Polyak-Lojasiewicz (PL) condition on $\mathcal{L}$, we also derive sharp exponential contractivity results toward the set of global minimizers. Combining these results we provide the first systematic convergence analysis of Langevin dynamics under PL conditions in non-integrable Gibbs settings: a first phase of exponential in time contraction toward the set of minimizers and then a large-time exploration over it with rate $\mathcal O(1/(σt))$ in terms of the relative Dirichlet energy.

comments
section 3 changed
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2510.24925 ↗

We study multiplicative inequalities among entries of Lorentzian matrices, referred to as bounded ratios. These inequalities can be viewed as generalizations of the classical Alexandrov–Fenchel inequalities for mixed volumes. Our main structural result identifies the cone of all bounded ratios on Lorentzian matrices with the dual of the cut cone, a finitely generated integral polyhedral cone extensively studied in metric geometry and graph theory. We examine in detail the pentagonal ratio, which first appears for Lorentzian matrices of size at least five. For Lorentzian matrices of size three, we determine the optimal bounding constants across the entire cone of bounded ratios, obtaining an explicit entropy-like formula.

comments
23 pages, 1 figure
fields
Combinatorics, Algebraic Geometry, Metric Geometry
pdf ↗ page arXiv:2510.25030 ↗

We introduce a low-rank algorithm inspired by the Basis-Update and Galerkin (BUG) integrator to efficiently approximate solutions to Sylvester-type equations. The algorithm can exploit both the low-rank structure of the solution as well as any sparsity present to reduce computational complexity. In the worst case scenario, i.e. even when a standard dense solver, such as the Bartels-Stewart algorithm, is used for the reduced Sylvester equations generated by our approach, the overall computational complexity for constructing and solving the associated linear systems reduces to $\mathcal{O}\left(kr(n^2+m^2 +mn + r^2)\right)$, for $X\in \mathbb{R}^{m \times n}$, where $k$ is the number of iterations and $r$ the rank of the approximation, but any method can be used to exploit existing structure to optimize the solution even further.

comments
14 pages, 5 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2511.01735 ↗

In this note we study the asymptotic popularity, that is, the limit probability to find a given consecutive pattern at a random position in a random permutation in the eighteen classes of permutations avoiding at least two length 3 consecutive patterns. We show that for ten classes, this popularity can be readily deduced from the structure of the permutations. By combining analytical and bijective approaches, we study in detail two more involved cases. The problem remains open for five classes.

comments
12 pages, 2 figures, 2 tables
fields
Combinatorics
pdf ↗ page arXiv:2511.02442 ↗

We study Goodwillie-Weiss embedding calculus through its relationship with Goodwillie's functor calculus. Specifically, building on a result of Tillmann and Weiss, we construct a functorial complement for \(T_{n}\)-embeddings that takes values in Heuts's categorical \(n\)-excisive approximation of pointed spaces. We also establish an analogue of Stallings' theorem for lower central series in the context of \(T_{n}\)-embeddings of \(P \times I\) into \(D^{d}\) for any compact manifold \(P\). As an application, we show that the embedding tower of string links detects Milnor invariants.

comments
Withdrawn due to errors in the proof of Theorem B. Weaker versions of the results are available in the author's thesis.
fields
Geometric Topology, Algebraic Topology
pdf ↗ page arXiv:2511.04582 ↗

The goal of experiment design is to select the inputs of a dynamical system in such a way that the resulting data contain sufficient information for system identification and data-driven control. This paper investigates the problem of experiment design for continuous-time systems under piecewise constant input signals. To obviate the need for measuring time derivatives of (data) trajectories, we introduce a generalized filtering framework. Our main result is to establish conditions on the input and the filter functions under which the filtered data are informative for system identification, i.e., they satisfy a certain rank condition. We assume that the filter functions are piecewise continuously differentiable, encompassing several filter functions that have appeared in the literature. Building on the proposed filtering framework, we adapt an existing experiment design procedure from discrete-time to continuous-time systems, where the piecewise constant input signal is designed online during system operation. This method is shown to be sample efficient, in the sense that it deals with the least possible number of filtered data samples for system identification. Notably, the designed input signal is such that the data capture the system's dynamics at all times between sampling instants, thus establishing a connection with a continuous-time version of Willems et al.'s fundamental lemma.

fields
Optimization and Control
pdf ↗ page arXiv:2511.09386 ↗

We propose a sub-diffusive Black–Scholes model in which stock prices are governed by stochastic differential equations driven by sub-diffusions. The model captures the periods of low trading activity observed in bear markets, and it contains the classical Black–Scholes model as a special case. The sub-diffusive spot market is arbitrage-free but, in general, incomplete. We study the pricing of European contingent claims in this model. To this end, we establish a structure-preserving Girsanov transform for sub-diffusions. We use it to identify the minimal martingale measure of the model. This measure is the unique equivalent martingale measure under which the discounted stock prices are martingales driven by sub-diffusions with the same law as the original ones. Using this measure, we price every contingent claim in $L^p$ with $p>2$. For each such claim, we construct a replicating strategy that is mean self-financing and minimizes the local risk, and whose value process gives the price process of the claim. Finally, we derive an explicit formula for the price of a European call option. We show that this price solves a partial differential equation with a fractional derivative in time, which we call the time-fractional Black–Scholes equation.

comments
40 pages
fields
Probability
pdf ↗ page arXiv:2511.10371 ↗

Originally introduced in circuit theory, the notion of effective resistance has been fruitfully exploited in graph theory, where each edge in a graph is understood as a resistor in an electric network. In this context, the effective resistance between two vertices quantifies the total opposition to current flow when a unit current is injected at one vertex and extracted at the other. As such, it encodes rich structural and geometric information about the underlying graph: it satisfies a minimum-energy principle termed Thomson's principle, defines a metric on the vertex set, relates to the topology of the graph through Foster's theorem, and determines the probability of appearance of an edge in a random spanning tree. Generalizations of effective resistance to simplicial complexes have been proposed in several forms, often formulated as matrix products of standard operators associated with the complex. We introduce a novel, basis-independent bilinear form, derived from an algebraic reinterpretation of circuit theory, that extends the classical effective resistance from graphs to simplicial complexes. This bilinear form acts on chains and cochains, and in particular, simplices and cosimplices in a simplicial complex. Our framework subsumes and unifies all existing matrix-based formulations of effective resistance. Moreover, we establish higher-order analogues of several fundamental properties known in the graph case: (i) we extend Thomson's principle to our basis-free framework; (ii) we establish metric properties for the effective resistance and its square root on chains and cycles, recovering the classical graph case; (iii) we provide a generalization of Foster's theorem to simplicial complexes; and (iv) we prove a matrix-tree theorem for higher-dimensional spanning trees, linking effective resistance to the probability of appearance of a simplex in random simplicial spanning trees.

comments
The revised version adds a new section proving a weighted matrix-tree theorem, expands the section on metric properties, and improves the exposition throughout
fields
Combinatorics, Algebraic Topology
pdf ↗ page arXiv:2511.10749 ↗

This paper considers an insurer with two collaborating business lines that must make three critical decisions: (1) dividend payout, (2) a combination of proportional and excess-of-loss reinsurance coverage, and (3) capital injection between the lines. The reserve level of each line is modeled using a diffusion approximation, and the insurer aims to maximize the weighted total discounted dividends paid until the first ruin time. We obtain the value function and the optimal strategies in explicit or semi-explicit form. We then prove that the optimal dividend payout strategy for bounded dividend rates is of threshold type, while for unbounded dividend rates it is of barrier type. Under the diffusion approximation, the optimal combination of proportional and excess-of-loss reinsurance is shown to be pure excess-of-loss reinsurance. We also show that the optimal level of risk ceded to the reinsurer decreases as the aggregate reserve level increases, and that reinsurance is phased out line by line. The optimal capital-injection strategy involves transferring reserves to prevent the ruin of one line. Finally, numerical examples are presented to illustrate these optimal strategies.

comments
42 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2511.11383 ↗

We prove that every group of odd order is symmetric harmonious, i.e., there exists a permutation $g_0,g_1,\dots,g_{\ell-1}$ of the elements of $G$ such that the consecutive products $g_0g_1,g_1g_2,\dots,g_{\ell-1}g_0$ also form a permutation of the elements of $G$ and $g_{\ell-i}=g_i^{-1}$ for all $1\le i\le \ell-1$, where $\ell=|G|$. Consequently, a group is symmetric harmonious if and only if it has odd order. We also characterize symmetric harmonious sequences in terms of complete mappings. As applications we obtain new examples of R*-sequenceable groups, and we show that every split extension of an odd-order group by a harmoniously matched group is both harmonious and \#-harmonious. Together with several new harmoniously matched groups ($D_{12},D_{16},D_{20},D_{24},Q_{16},Q_{24},A_4,S_4$), this yields many non-abelian groups that are both harmonious and \#-harmonious, including infinite families of dihedral and dicyclic groups and all $2$-nilpotent groups with an abelian Sylow $2$-subgroup that is neither cyclic nor elementary abelian and is central in its normalizer.

comments
This is a revised version of a published article
journal
M. Javaheri, Symmetric harmoniousness of odd-order groups, Austral. J Combin. 96 (2026), no. 1, 134-141
fields
Group Theory
pdf ↗ page arXiv:2511.13430 ↗

I analyze $\mathcal{O}$-weakly immediate and $\mathcal{O}$-residual types in an o-minimal expansion of an ordered field $\mathbb{E}$, where $\mathcal{O}$ is a convex valuation ring. The main result is a characterization of those exponential theories $T$ such that for all $(\mathbb{E}, \mathcal{O})\models T_{\mathrm{convex}}$ the image of any $\mathcal{O}$-weakly immediate type is given by some composition of translations, sign changes and exponential, of some \emph{possibly different} $\mathcal{O}$-weakly immediate type. I call these theories \emph{transserial}, and they encompass simply exponential theories such as $T_{\exp}$ and $T_{an, \exp}$. A consequence of the analysis is that there are no counterexamples to \emph{Tressl's signature-alternative} (cf [15]) in models of transserial theories admitting an Archimedean prime model. The characterization has at its core some arguments that use very few but fundamental properties of the valued differential field of germs at a cut in an o-minimal structure. These are abstracted in some conditions of compatibility between the derivation and the order or the derivation and the valuation, both ultimately stemming from the mean-value-theorem in o-minimal structures. I develop some basic theory around these notions and observe that in the case of few constants (i.e.\ when the valuation ring contains the constants) these notions specialize to notions thoroughly studied in arXiv:1509.02588

comments
44 pages, comments welcome. Changelog: completely reorganized section 4, simplifying and generalizing several results; fixed some minor issues in the other sections
fields
Logic
pdf ↗ page arXiv:2511.13447 ↗

We show that there is a set which is not a set of multiple recurrence despite being a set of recurrence for nil-Bohr sets. This answers Huang, Shao, and Ye's "higher-order" version of Katznelson's Question on Bohr recurrence and topological recurrence in the negative. Equivalently, we construct a set $S$ so that there is a finite coloring of $\mathbb{N}$ without monochromatic three-term arithmetic progressions with common differences in $S$, but so that $S$ lacks the usual polynomial obstacles to arithmetic progressions. This represents a significant contribution to our understanding of when a restricted van der Waerden theorem or a restricted Szemerédi Theorem holds, an important problem in additive combinatorics and Ramsey theory.

comments
21 pages, 1 figure, thanks Ben Green and GPT-6 Astra for helpful suggestions. Comments welcome!
fields
Dynamical Systems, Combinatorics, Number Theory
pdf ↗ page arXiv:2511.21680 ↗

We consider the stochastic heat equation with multiplicative white noise: $\partial_t u =\partial_x^2u + b(u) +σ(u) \dot W$, both on $[0,1]$ and $\mathbb R$. In the case of $[0,1]$ we show that the finite Osgood criterion on $b$ is a necessary and sufficient condition for finite-time blowup, under fairly general conditions on $σ$. In the case of $\mathbb R$ we show instantaneous explosion when we start with initial profile $u_0\equiv 1$. Our work introduces a novel approach that not only extends the work of [12] which dealt with bounded $σ$, but also provides an alternate route to proving such results. A key ingredient is a comparison result which shows that the solution on $\mathbb R$ stays above the corresponding solution on $[0,1]$ with Dirichlet boundary conditions.

comments
Major revision. Added Theorem 1.3(1); some of the calculations wherein are AI-inspired. Improved the exposition in accordance with many comments
fields
Probability
pdf ↗ page arXiv:2511.23403 ↗

We construct a fully implicit, sequential two-stage time discretization for stiff systems using physical quantities and their rates of change. Coefficients are determined by direct Taylor matching, and convergence analysis proves fourth-order accuracy at both midpoint and endpoint for fixed smooth systems. Pole and imaginary-axis boundary analysis, together with the maximum modulus principle, characterizes the \(L\)-stable family. Within this family, \(C_q=5/183\) uniquely cancels the leading inverse-power term and gives the full-step amplification factor quadratic stiff decay, while \(C_a=\frac{25-\sqrt{105}}{780}\) yields the highest accuracy. The method combines \(L\)-stability with second-order stiff damping, two-stage fourth-order accuracy, and sequential implicitness. In contrast, fourth-order Gauss–Legendre and symmetric Hermite–Obreshkov schemes are \(A\)-stable rather than \(L\)-stable; their variants must sacrifice per-stage accuracy to improve stiff stability. Among \(L\)-stable methods, two-stage Radau IIA and TR–BDF2 have third- and second-order accuracy, respectively, while SDIRK requires five stages for fourth order. Gauss and Radau stages must be solved in a coupled manner. Stiff ODE and scalar tests verify fourth-order convergence and quadratic stiff decay. Finite-volume tests show fourth-order joint convergence on smooth one-dimensional problems and fast-mode damping in two-dimensional cases. At the same acoustic error threshold, the method uses eight implicit stages, whereas three-stage Radau IIA uses twelve. Finally, the sequential formulation keeps each Newton system at the state dimension, reducing its size, improving efficiency, and facilitating parallel computation.

fields
Numerical Analysis
pdf ↗ page arXiv:2512.01628 ↗

The celebrated 1975 Kuramoto model of $N$ identical oscillators with phase angle vector $\boldsymbol{\vartheta}=(\vartheta_1,\ldots,\vartheta_N)$ and all-to-all coupling reads \begin{equation} \label{*} \dot\vartheta_j\,=\tfrac{1}{N}\sum_{k=1}^N \sin(\vartheta_k-\vartheta_j). \tag{*} \end{equation} Here we have passed to co-rotating coordinates in normalized time scale. The model is highly accessible to rigorous mathematical analysis, and has been studied as a paradigm for effects like total and partial synchronization. Most initial conditions $\boldsymbol{\vartheta}$ lead to total synchronization. The large number of asymptotically $\sim 2^{N-1}$ (circles of) partially synchronized states, however, is unstable. The precise behavior of transitions to synchrony seems to have eluded description. In the present paper, we address this gap. By the gradient structure of (*), the global dynamics decompose into equilibria and heteroclinic orbits between them. Except for the extremes of total instability and total synchrony, all equilibria are 2-cluster solutions: their phase angles $\vartheta_j$ attain only two values, with a phase difference of $π$ between them. Any heteroclinic orbit between 2-cluster equilibria, or towards synchrony, can be realized as a 3-cluster rebellion. Cluster rebellions split the smaller, "slim", minority cluster of the source equilibrium and send the rebellious part to join the bigger, "fat", majority cluster. Heteroclinic transversality identifies the Kuramoto model as a structurally stable Morse-Smale system. In particular, heteroclinic orbits can be concatenated in finite time. The options involved in successive cluster rebellions amount to finite symbol sequences of 2-shift type. We include numerical illustrations, and a comparison with coupled Stuart-Landau oscillators. The paper is dedicated to Professor Yoshiki Kuramoto, with admiration.

comments
42+ii pages, 8 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2512.02937 ↗

For every relation $R$ between Stiefel-Whitney numbers of closed $(n+1)$-manifolds we consider an associated invariant $\varkappa_R$ of null-cobordant $n$-manifolds with a certain additional structure. For $n=2k-1$ and $R = w_{n+1}+v_k^2$ the invariant $\varkappa_R$ equals the Kervaire semi-characteristic. In addition, we construct the cobordism group $Ω_n^R$, which extends the unoriented cobordism group $Ω_n^O$. We show that $\varkappa_R$ is a complete invariant of $R$-cobordism classes of null-cobordant $n$-manifolds. We prove that our invariant $\varkappa_R$ and $R$-cobordism class of manifold are quadratic in the sense of Gusarov-Vassiliev-Podkorytov.

fields
Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2512.06371 ↗

The dynamic formulation of optimal transport, also known as the Benamou-Brenier formulation, has been extended to the unbalanced case by introducing a source term in the continuity equation. When this source term is penalized based on the Fisher-Rao metric, the resulting model is referred to as the Wasserstein-Fisher-Rao (WFR) setting, and allows for the comparison between any two positive measures without the need for equalized total mass. In recent work, we introduced a constrained variant of this model, in which affine integral equality constraints are imposed along the measure path. In the present paper, we propose a further generalization of this framework, which allows for constraints that apply not just to the density path but also to the momentum and source terms, and incorporates affine inequalities in addition to equality constraints. We prove, under suitable assumptions on the constraints, the well-posedness of the resulting class of convex variational problems. The paper is then primarily devoted to developing an effective numerical pipeline that tackles the corresponding constrained optimization problem based on finite difference discretizations and parallel proximal schemes. Our proposed framework encompasses standard balanced and unbalanced optimal transport, as well as a multitude of natural and practically relevant constraints, and we highlight its versatility via several synthetic and real data examples.

comments
44 pages (32 pages main text and references, 12 pages supplementary material), 18 figures; revised and expanded version with additional feasibility results and numerical experiments
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2512.09250 ↗

We study simple extensions of pointed finite tensor categories, that is, tensor categories $\mathcal{C}$ admitting an abelian decomposition $\mathcal{C} \cong \mathcal{D} \oplus \mathcal{M}$ where $\mathcal{D}$ is a pointed tensor subcategory and $\mathcal{M}$ is semisimple with a unique simple projective object. Such categories provide a natural generalization of near-group categories. Our results concern the braided case. We prove that every non-degenerate braided non-semisimple near-group category is a braided simple extension of $\operatorname{sRep}(W\oplus W^*)$ with non-trivial braiding for which $\operatorname{sRep}(W)$ is Lagrangian, and any braided non-semisimple near-group category $\mathcal{C}$ arises canonically as an extension of a non-degenerate braided tensor category with a Lagrangian subcategory $\operatorname{sRep}(W)$ and $\operatorname{Rep}(K)$, where $K$ is the Picard group of a symmetric subcategory determined by the unique simple projective object of $\mathcal{C}$.

comments
V3: Added subsection 3.3, corrected Theorem 2 and the results in section 4.3 from the published version (in Comm. In Algebra), a new proof to Theorem 1
fields
Category Theory
pdf ↗ page arXiv:2512.12556 ↗

We highlight two basic types of variational problems and prove the existence of fractal minimizers through the direct method in the calculus of variations. By design these minimizers are Hölder curves or Hölder parametrizations of surfaces whose images generally have a non-integer Hausdorff dimension. Their origin is deterministic, but their regularity properties are roughly similar to those of typical realizations of stochastic processes. As a key tool and our main technical result, we prove novel continuity and boundedness results for potentials of occupation measures of Gaussian random fields. These results complement well-known results for local times, but hold under much less restrictive assumptions. In an auxiliary section, we generalize earlier results on nonlinear compositions of fractional Sobolev functions with $BV$-functions to higher dimensions.

comments
25 pages, 64 references
fields
Probability, Functional Analysis, Optimization and Control
pdf ↗ page arXiv:2512.14248 ↗

In many real-world scheduling problems, the processing times of tasks are subject to uncertainty. This makes it essential to design schedules that are robust against disruptions. We distinguish between two types of robustness: quality-robust schedules keep a stable objective value under disruptions, while solution-robust schedules keep a stable schedule structure. We study how to generate schedules for the Stochastic Parallel Machine Scheduling Problem (SPMSP) with precedence constraints and release dates that are both quality- and solution-robust. To this end, we compare several robustness measures and local search algorithms that use these measures. We start with an extensive simulation study where we determine the correlation of 13 existing and 6 new robustness measures with both quality and solution robustness. Next, we use the measures with high robustness correlation as the objective in our local search algorithm to find the best way to generate schedules containing both job-machine assignments as well as buffer assignments. We use a new dynamic objective weight within our local search algorithms, which actively changes the objective weights in each iteration. We found that the best way to generate robust schedules is to use robustness measures that model the processing times with normal distribution approximations and to combine job placement and buffer assignment simultaneously.

fields
Optimization and Control
pdf ↗ page arXiv:2512.15471 ↗

We present an algorithm based on the alternating direction method of multipliers (ADMM) for solving nonlinear matrix decompositions (NMD). Given an input matrix $X \in \mathbb{R}^{m \times n}$ and a factorization rank $r \ll \min(m, n)$, NMD seeks matrices $W \in \mathbb{R}^{m \times r}$ and $H \in \mathbb{R}^{r \times n}$ such that $X \approx f(WH)$, where $f$ is an element-wise nonlinear function. We evaluate our method on several representative nonlinear models: the rectified linear unit activation $f(x) = \max(0, x)$, suitable for nonnegative sparse data approximation, the component-wise square $f(x) = x^2$, applicable to probabilistic circuit representation, and the MinMax transform $f(x) = \min(b, \max(a, x))$, relevant for recommender systems. The proposed framework flexibly supports diverse loss functions, including least squares, $\ell_1$ norm, and the Kullback-Leibler divergence, and can be readily extended to other nonlinearities and metrics. We illustrate the applicability, efficiency, and adaptability of the approach on real-world datasets, highlighting its potential for a broad range of applications.

comments
54 pages, 7 figures, 6 tables, including supplementary material. Revised version: adds a convergence analysis of the proposed ADMM algorithm (Section S4), a comparison with a dedicated CSF algorithm, and additional experiments. Code available from https://gitlab.com/Atharva05/admm-for-nmd
fields
Optimization and Control
pdf ↗ page arXiv:2512.17473 ↗

For any toric ideal $I$ in a polynomial ring $S$, we provide a combinatorial description of a free resolution of the integral closure of the $S$-module $S/I$. These new complexes arise from an extension of Bayer–Sturmfels' theory of cellular free resolutions. As applications, we unify several constructions for a resolution of the diagonal embedding of a toric variety, and compare the locally free resolutions for toric subvarieties introduced by Hanlon–Hicks–Lazarev and Brown–Erman.

fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2512.17871 ↗

In this article, we study two-dimensional Eisenstein deformation spaces, focusing on the Zariski density of modular points and the dimensions of their irreducible components. Over $\mathbb{Q}$, under explicit generic hypotheses, we prove that every irreducible component has characteristic zero and dimension $4$, and that modular points are Zariski dense. Over certain abelian totally real fields, we prove a big $R=\mathbb{T}$ theorem for the union of the high-dimensional components. As an arithmetic application, we prove the weight-one Fontaine-Mazur conjecture over $\mathbb{Q}$ for $p\geq 5$, with no hypothesis on the residual representation. In a complementary direction, we prove a local-to-global finiteness theorem for pseudo-deformation rings. Combining this with ordinary finiteness and modularity-theoretic inputs, we prove Mazur's dimension conjecture over $\mathbb{Q}$ in both the residually reducible and residually irreducible cases, and deduce Emerton's equidimensionality conjecture for the $p$-adic big Hecke algebra for every odd prime.

comments
70 pages
fields
Number Theory
pdf ↗ page arXiv:2512.21249 ↗

We consider the following mixed local and non-local critical elliptic equation: \begin{equation*}\label{0.1} \left\{ \begin{array}{lll} -Δu+(-Δ)^su=λh u^{p}+u^{2^*-1}, &\text{in}\,\, \mathbb{R}^n, u>0, &\text {in} \,\, \mathbb{R}^n, \lim\limits_{|x|\to\infty} u(x) = 0, \end{array} \right. \end{equation*} where $n\geqslant4, \,\, p\in (0,2^*-1),\,\, 2^*:=\frac{2n}{n-2}$ and $h$ is a positive function. We first show the existence and regularity results of viscosity solutions to the above critical elliptic equation. More precisely, from \cite{Su-Xu} weak solutions are obtained and we prove they are indeed viscosity solutions and their regularity is: \( u \in C^α(\mathbb{R}^n) \) for $p\in(0,1);$ \( u \in C^{2,β}(\mathbb{R}^n) \) for $p\in [1, 2^*-1).$ Moreover, for $p\in [1, 2^*-1)$, these viscosity solutions are indeed classical ones and we then prove the existence of positive solutions with the qualitative properties such as the decay estimates and the radial symmetry.

comments
39 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2512.21873 ↗

In this paper, we establish a Struwe type global compactness result for a class of nonlinear critical Hardy-Sobolev exponent problems driven by the fractional $p$-Laplace Hardy-Sobolev operator.

comments
18 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2601.00589 ↗

We present a general regularization procedure for piecewise smooth vector fields whose discontinuity locus is a variety of normal crossings type. We show that such regularization can be smoothed through a finite sequence of blowings-up, thereby reducing the problem to the study of the dynamics of a smooth vector field in a manifold with corners. The procedure will be illustrated in the cases of piecewise smooth vector fields on $\mathbb{R}^2$ with discontinuity locus $x=0$ or $xy=0$, and on $\mathbb{R}^3$ with discontinuity locus $xyz=0$. We will see that some unexpected dynamical phenomena such as Bogdanov-Takens bifurcations and Bykov cycles may arise even in the case of piecewise constant vector fields.

fields
Dynamical Systems
pdf ↗ page arXiv:2601.00697 ↗

Statistical inference for spatial processes from partially realized or scattered data has seen voluminous developments in diverse areas ranging from environmental sciences to business and economics. Inference on the associated rates of change has seen some recent developments. The literature has been restricted to Euclidean domains, where inference is sought on directional derivatives, rates along a chosen direction of interest, at arbitrary locations. Inference for higher order rates, particularly directional curvature has also proved useful in these settings. Modern spatial data often arise from non-Euclidean domains. This manuscript particularly considers spatial processes defined over compact Riemannian manifolds. We develop a comprehensive inferential framework for spatial rates of change for such processes over vector fields. In doing so, we formalize smoothness of process realizations and construct differential processes -- the derivative and curvature processes. We derive conditions for kernels that ensure the existence of these processes and establish validity of the joint multivariate process consisting of the ``parent'' Gaussian process (GP) over the manifold and the associated differential processes. Predictive inference on these rates is devised conditioned on the realized process over the manifold. Manifolds arise as polyhedral meshes in practice. The success of our simulation experiments for assessing derivatives for processes observed over such meshes validate our theoretical findings. By enhancing our understanding of GPs on manifolds, this manuscript unlocks a variety of potential applications in machine learning and statistics where GPs have seen wide usage. We propose a fully model-based approach to inference on the differential processes arising from a spatial process from partially observed or realized data across scattered location on a manifold.

fields
Statistics Theory, Differential Geometry
pdf ↗ page arXiv:2601.02305 ↗

To develop a gravitational diagram technique that is ultraviolet finite, we start from Regge's simplicial gravity and use a bell-shaped form of the measure obtained via functional integration over connection. A "hypercubic" structure is considered (some variables are frozen), it is described by the metric $g_{λμ}$ at the sites. The measure is known in closed form if the timelike length scale is fixed at a low level. This is possible in the synchronous gauge (properly softened to remove nonphysical infrared singularities). This gauge also allows, with a refined finite-difference form of the action, to match the analytical properties of the propagator to the continuum case. The metric is parameterized to make the measure Lebesgue. The linear part of this parametrization leads to a discrete form of standard Feynman diagrams that approximates finite continuum diagrams and is finite for infinite ones; the nonlinear part gives new vertices and diagrams. The maximum of the measure is at the edge length scale $b = b_{\rm s} \sim η^{1/2}$, where $η$ defines the free factor like $(- \det \|g_{λμ}\|)^{η/2}$ in the measure and should be a large parameter to ensure true action upon integration over connection. For general perturbative expansion (including both that for the measure and the S matrix) to be free of increasing powers of $η$, its initial point must be at $b$ sufficiently close to $b_{\rm s}$; this appears to be a dynamic mechanism for establishing $b$ as an optimal initial point of the perturbative expansion. This technique is applied to Newton's potential. Some of new diagrams, including potentially large ones, are mutually cancelled. The S matrix expansion is analyzed to consist of standard diagrams. These diagrams form series with a small parameter $η^{-1}$; one-loop diagrams calculated in the literature represent the leading order.

comments
65 pages, 8 figures. Compared to our paper arXiv:2306.11531, a soft synchronous gauge is used which allows us to do without model assumptions in specifying the measure and makes it relatively easy to provide a consistent discrete perturbative expansion; now a subsection on normal ordering is added
fields
Mathematical Physics
pdf ↗ page arXiv:2601.03228 ↗

Geometric and Topological Deep Learning enhance machine learning by exploiting geometric and topological structures in data. In this context, Group Equivariant Non-Expansive Operators (GENEOs) provide a principled framework for encoding symmetries and designing efficient, interpretable neural architectures. Originally introduced in Topological Data Analysis and later adopted in Deep Learning, GENEOs unify geometric and topological approaches and include, as a special case, the operator computing persistence diagrams. Their theoretical foundations rely on group actions, equivariance, and compactness properties of operator spaces. GENEOs are defined between data spaces endowed with transformation groups, referred to as perception pairs. While previous representation results characterized linear GENEOs acting on identical perception pairs, many applications require operators between heterogeneous ones. In this work, we introduce and prove a new algebraic representation theorem for linear GENEOs acting between different perception pairs. Under mild assumptions on data domains and group actions, this result provides a complete characterization of such operators and implicitly yields a computational method to generate all linear GENEOs between two perception pairs. The proof combines tools from the theory of stochastic matrices, group actions, and invariant measures. In our paper, we also show that the space of linear GENEOs is compact and convex, making easier their use for learning and optimization. Our new theorem enlarges the applicability of GENEOs, and allows for their composition with a broader class of current architectures. We show this with an application in image reconstruction.

fields
Representation Theory
pdf ↗ page arXiv:2601.03910 ↗

For a connected uniform hypergraph $H$, we prove two conjectures concerning the algebraic multiplicities of the spectral radius of its adjacency tensor and the zero eigenvalue of its Laplacian tensor. In particular, we establish that the algebraic multiplicity of each of these eigenvalues is equal to the cardinality of the corresponding projective eigenvariety.

fields
Combinatorics
pdf ↗ page arXiv:2601.04514 ↗

A new approach to the semantics of identity types in intensional Martin-Löf type theory is proposed, assuming only a category with finite limits and an interval. The specification of \emph{extensional} identity types in the original presentation of natural models paralleled that of the other type formers $Σ$ and $Π$, but the treatment of the \emph{intensional} case there was less uniform. It was later reformulated to an account based on polynomials; here a further improvement in the style of the other type formers is achieved by employing an interval, in order to give a single pullback specification of a model with \emph{path types}. The interval is also used to specify a (Hurewicz) fibration structure on the universe of the model. It is shown that the combination of these two conditions suffices to model the intensional identity rules, assuming only finite limits. The addition of an interval also relates the current treatment to that of cubical type theory.

comments
in version 2, Evan Cavallo noticed a critical error in an earlier version of this paper and proposed the repair now used in Section 4; we are grateful for his generous advice
fields
Category Theory, Algebraic Topology, Logic
pdf ↗ page arXiv:2601.06567 ↗

In arXiv:2211.09069, significant progress was made in decomposing simple products of fermion correlation functions, and in summing over spin structures of superstring amplitudes in genus two under cyclic constraints. In this manuscript we consider part of the same subject using a framework in which one of the branch points of the genus two curve is fixed at infinity. This framework is a direct generalization of the popular one in the case of genus one. We address some of the issues that remained unresolved in our previous paper arXiv:2209.14633. We show that the spin structures of the simple products of fermion correlation functions with cyclic conditions depend only on the Pe-function values at the half-periods of the genus two surface, for any number of factors in the products. Similar to the genus one case, we can provide basis functions to decompose the product. Consequently, the trilinear relations found in arXiv:2211.09069 can be derived from the known set of differential equations of genus two Pe-functions by setting the variables equal to the half-periods of the non-singular and even spin structures, as is the case for genus one. Based on these considerations, we present a procedure for expressing the results of decomposed formulae in terms of the unique genus two theta function for two, three, and four point cases, and discuss a realistic approach for calculating six point function. A general formula for the expression of the results in terms of the theta function for the product of an arbitrary number of the fermion correlation functions is not yet derivable.

fields
Mathematical Physics
pdf ↗ page arXiv:2601.08664 ↗

The minimum Type II error probability (or volume) of simple hypothesis tests with randomized detectors is expressed as a Riemann integral of the (cumulative) distribution function of the likelihood ratio for all non-negative Type I error probability (or volume) values: $β(\varepsilon)=\int_{0}^{\infty}|F(1/τ)-\varepsilon|^{+}dτ$ for all $\varepsilon\geq0$. The derivation relies on convex conjugation (the Legendre transform) and level set integration, and is sufficiently general to extend to tests between $σ$-finite measures. Measure change identities relating the $β(\cdot)$ functions of different hypothesis testing problems are established. Approximations for Type II and Type I volumes are derived under two different hypotheses concerning the Kolmogorov distance to normality for the log-likelihood ratio distributions. In both the Central Limit Theorem and the large deviations regimes, the resulting non-asymptotic expressions recover and extend state-of-the-art characterizations of optimal performance in the memoryless case, and improve and generalize them in the Markovian case. Finally, The distinction between the implications of the Central Limit Theorem and the Berry–Esseen Theorem for the asymptotic simple hypothesis testing problem is clarified.

comments
30 pages. Submitted to IEEE Transactions on Information Theory
fields
Information Theory
pdf ↗ page arXiv:2601.09564 ↗

We analyze high-order augmented Lagrangian methods for convex optimization problems with linear constraints and construct robust multilevel inner solvers. For the high-order proximal point method, we derive energy error estimates under uniform convexity that distinguish the sublinear, linear, and superlinear regimes by comparing the regularization power with the uniform convexity exponent. Through duality, these estimates yield convergence results for the high-order augmented Lagrangian method. The primal subproblems become nearly semicoercive as the penalty parameter decreases. We address this difficulty using multilevel subspace correction methods whose subspaces decompose the constraint kernel. Applications to nonlinear diffusion, Darcy–Forchheimer flow, and the finite neuron method show how the multilevel design accommodates mean, divergence, and boundary constraints. Numerical experiments illustrate the outer convergence regimes and demonstrate parameter-robust behavior of the inner solvers across different meshes.

comments
26 pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2601.11826 ↗

We present a novel matrix product representation of the Laughlin and related fractional quantum Hall wavefunctions based on a rigorous version of the correlators of a chiral quantum field theory. This representation enables the quantitative control of the coefficients of the Laughlin wavefunction times an arbitrary monomial symmetric polynomial when expanded in a Slater determinant or permanent basis. It renders the properties, such as factorization and the renewal structure, inherent in such fractional quantum Hall wavefunctions transparent. We prove bounds on the correlators of the chiral quantum field theory and utilize this representation to demonstrate the exponential decay of connected correlations and a gap in the entanglement spectrum on a thin cylinder.

comments
52 pages. Comments are welcome! Typos corrected
fields
Mathematical Physics
pdf ↗ page arXiv:2601.12165 ↗

Given an $F$-finite regular scheme $X$ of positive characteristic and a simple normal crossing divisor $E$ on $X$, we introduce a filtration on the de Rham–Witt complex $W_mΩ^\bullet_{X\setminus E}$. When $X$ is the spectrum of a henselian discrete valuation ring $A$ with quotient field $K$, this extends the classical filtration on $W_m(K)$ due to Brylinski. We show that Kato's ramification filtration on $H^q_\et(X \setminus E, {\Q}/{\Z}(q-1))$ for $q \ge 1$ admits an explicit description in terms of the above filtration on the de Rham–Witt complex of $X \setminus E$. When $q =1$, this specializes to the results of Kato and Kerz–Saito. As applications, we construct a generalized version of Kato's refined Swan conductor for regular schemes, prove Lefschetz theorems for Kato's ramification filtrations for smooth projective varieties over $F$-finite fields, and prove Lefschetz and vanishing theorems for the Brauer group.

comments
Major revision, 71 pages. arXiv admin note: text overlap with arXiv:2501.00931
fields
Algebraic Geometry
pdf ↗ page arXiv:2601.12177 ↗

Let $1<k\in\mathbb{Z}$. A total coloring of a connected simple regular graph $G$ via color set $]k]_0=\{0,1,\ldots, k\}$ is efficient if each color yields an efficient dominating set, where efficient domination applies to each color class in $V(G)$. An efficient total coloring of $G$ via $[k]_0$ extends to an efficient total facial coloring $c$ of a map $M(G)$ of $G$ if it assigns a vertex-and-edge $k$-color set to the boundary cycle of each face, with the consequently missing color assigned to the face itself, so that the two adjacent faces along each edge are assigned different colors. Focus is set upon planar and toroidal maps. Modifications of $c$ are also treated by removing a perfect dominating set or a 1-factor from $G$.

comments
17 pages, 9 figures,
fields
Combinatorics
pdf ↗ page arXiv:2601.12514 ↗

We study a two-stage queueing system attended by two flexible servers. Once a server begins to interact with a job, it remains attached to its job throughout both stages of service. After completing the first-stage service, the server chooses between two second-stage options. Option 1 sends the server-job pair to a parallel-service station where both servers may operate simultaneously; therefore, the server immediately begins the second-stage service on its job. Option 2 routes the pair to a single-service station that admits at most one server-job pair into service at a time. While we consider the complete range of parameters, the usual reason for choosing Option 2 is that jobs may receive higher-quality (faster and/or lower expected cost) service. If the single-service station is occupied, the pair must wait together until the station becomes available. The decision-making scenario is modeled via a Markov decision process formulation of a clearing system with holding costs at each station. Focusing on cases with a large initial queue, we fully characterize the structural properties of an optimal control policy based on the relationship between the service rates at the downstream stations. A numerical study highlights the significance of understanding the structure of the optimal policy by comparing its performance against several natural heuristic policies.

fields
Optimization and Control, Probability
pdf ↗ page arXiv:2601.13576 ↗

In this paper we develop a Bregman regularized proximal point algorithm for solving monotone equilibrium problems on Hadamard manifolds. It has been shown that the regularization term induced by a Bregman function is, in general, nonconvex on Hadamard manifolds unless the curvature is zero. Nevertheless, we prove that the proposed Bregman regularization scheme does converge to a solution of the equilibrium problem on Hadamard manifolds in the presence of a strong assumption on the convexity of the set formed by the regularization term. Moreover, we employ a coercivity condition on the Bregman function which is weaker than those typically assumed in the existing literature on Bregman regularization. Numerical experiments on illustrative examples demonstrate the practical effectiveness of our proposed method.

fields
Optimization and Control
pdf ↗ page arXiv:2601.13959 ↗

This paper presents a rational approximation of the AC optimal power flow (AC OPF) problem based on an all-pass approximation of the exponential power flow kernel. The classical AC OPF relies on trigonometric coupling between bus voltage phasors, which yields a nonconvex program with oscillatory derivatives that can slow, or in some cases destabilize, interior-point methods. We replace the trigonometric terms with an all-pass function (APF) approximation whose real and imaginary components act as smooth surrogates for the cosine and sine functions, and we introduce a pre-rotation to shift the argument of the approximation toward its most accurate region, ensuring that the reformulated power flow model preserves physical loss behavior, maintains the symmetry of the classical kernels, and improves the conditioning of the Jacobian and Hessian matrices. The proposed APF OPF formulation remains nonconvex, as in the classical model, but it eliminates trigonometric evaluations and empirically produces larger and more stable Newton steps under standard interior-point solvers. Numerical results on more than 25 IEEE and PGLib test systems ranging from 9 to 10{,}000 buses demonstrate that the APF OPF model achieves solutions with accuracy comparable to that of the classical formulation while reducing solver times, indicating a more solver-friendly nonconvex representation of AC OPF. All code, functions, verification scripts, and generated results are publicly available on \href{https://github.com/LSU-RAISE-LAB/APF-OPF}{GitHub}, along with a README describing how to run and reproduce the experiments.

fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2601.14468 ↗

Generalised algebraic theories (GATs) allow multiple sorts indexed over each other. For example, the theories of categories or Martin-L{ö}f type theories form GATs. Categories have two sorts, objects and morphisms, and the latter are double-indexed over the former. Martin-L{ö}f type theory has four sorts: contexts, substitutions, types and terms. For example, types are indexed over contexts, and terms are indexed over both contexts and types. In this paper we show that any GAT can be reduced to a GAT with only two sorts, and there is a section-retraction correspondence (formally, a strict coreflection) between models of the original and the reduced GAT. In particular, any model of the original GAT can be turned into a model of the reduced (two-sorted) GAT and back, and this roundtrip is the identity. The reduced GAT is simpler than the original GAT in the following aspects: it does not have sort equalities; it does not have interleaved sorts and operations; if the original GAT did not have interleaved sorts and operations, then the reduced GAT won't have operations interleaved between different sorts. In a type-theoretic metatheory, the initial algebra of a GAT is called a quotient inductive-inductive type (QIIT). Our reduction provides a way to implement QIITs with sort equalities or interleaved constructors which are not allowed by Cubical Agda. An instance of our reduction is the well-known method of reducing mutual inductive types to a single indexed family. Our approach is semantic in that it does not rely on a syntactic description of GATs, but instead, on Uemura's bi-initial characterisation of the category of (finite) GATs in the 2-category of finitely complete categories with a chosen exponentiable morphism.

fields
Category Theory
pdf ↗ page arXiv:2601.19426 ↗

We give a convenient reformulation, a slight generalization and some applications of the formality transfer theorem for DG-Lie algebras.

comments
V3. The corrigendum section of version V2 has been moved in the appendix of https://arxiv.org/abs/1310.3048
fields
Rings and Algebras, Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:2601.19698 ↗

In this paper, we explore the high-frequency properties of eigenfunctions of point perturbations of the Laplacian on a compact Riemannian manifold. These systems cannot be obtained as the quantization of a classical Hamiltonian, as the effect of the perturbation amounts to prescribing certain boundary conditions on a discrete set of points. We are interested in understanding to what extent the high-frequency behavior of eigenfunctions is governed by the global dynamics of the geodesic flow in the manifold (the classical flow corresponding to the unperturbed Laplacian). We prove that as soon as the Laplacian is perturbed by a finite set of point scatterers satisfying a \emph{non-focality} condition, namely, that the family of geodesics starting from this set and coming back to it has zero measure, semiclassical measures corresponding to high-frequency sequences of eigenfunctions are invariant under the geodesic flow. Invariance may fail when the non-focality condition does not hold, as is shown in a companion article [arXiv:2601.19701]. Our results are based on a quasimode construction that requires improved estimates on the spectral function of the Laplacian on the set of scatterers.

comments
Corrected typo in statement of main theorem. Added Remark 1.4 and a proof of it. Other minor edits. (28 pages)
fields
Spectral Theory
pdf ↗ page arXiv:2601.19705 ↗

Motivated by the Serrin problem, we study weak solutions of the generalised Alt-Caffarelli problem $-Δu = f$ in $Ω$, $u = 0$ on $\partialΩ$, $\partial_νu = Q$ on $\partialΩ$. Our main result establishes that if $Ω$ is Lipschitz, then it is actually $C^{\infty}$ (provided that $f$ and $Q$ are smooth). This was known before only for viscosity solutions. As a corollary, we obtain an alternative solution of Serrin's problem in the case of Lipschitz domains. We also discuss the characterisation of the regularity of Lipschitz domains in terms of their Poisson kernel.

comments
Version changes: we added the missing hypothesis Q > 0 in Theorem 1.4
fields
Analysis of PDEs
pdf ↗ page arXiv:2601.20493 ↗

Optimisation algorithms typically assume oracle access to objectives and constraints, yet in many applications these functions are available only through data. To recover them, a common approach learns a surrogate for each function and optimises over it, but this can be unnecessarily expensive and may fail to preserve the structure required by the optimisation algorithm. We study this problem for monotone optimisation, a class of non-convex problems which can be solved globally using the Polyblock Outer Approximation (POA) algorithm. Our key observation is that POA does not require the constraint functions themselves, but only a scalar quantity we call the radial inverse. Learning this quantity directly replaces POA's inner bisection loop over a learned constraint with a single radial inverse evaluation. We characterise exactly which maps arise as radial inverses of monotone constraints, and relate their approximation error to perturbations of the feasible set and optimal objective value. Building on these results, we introduce Homogeneous-Monotone Radial Inverse (HM-RI) networks, structured min-max models that enforce the monotonicity and positive-homogeneity of radial inverses by construction. Across synthetic monotone optimisation problems and a cellular transmit-power application, HM-RI improves solution quality over direct constraint surrogates and local optimisation baselines by up to 58.6 percentage points relative to the Oracle reference objective, while achieving a 3.0-4.7x speed-up over bisection-based POA with learned constraint surrogates, with the largest solution-quality gains occurring in data-limited and piecewise-constant settings.

fields
Optimization and Control
pdf ↗ page arXiv:2601.20983 ↗

Motivated by continuous-time optimal inventory management, we study a class of stationary mean-field control problems with singular controls. The dynamics are modeled by a mean-reverting Ornstein-Uhlenbeck process, and the performance criterion is given by a quadratic long-time average expected cost functional. The mean-field dependence is through the stationary mean of the controlled process itself, which enters the ergodic cost functional. We relate optimal controls for the stationary mean-field control problem to equilibria of an associated stationary mean-field game. In particular, optimal controls induce equilibria of the associated game, while the converse holds true within the class of admissible controls satisfying an additional integrability requirement. Finally, we solve the stationary mean-field game explicitly, thereby obtaining an explicitly characterized optimal reflection policy for the stationary mean-field control problem within this restricted class.

comments
26 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2601.23036 ↗

We study fixed-policy evaluation for finite Markov chains that may be reducible and periodic. Classical evaluation methods with gain and bias decomposition are not always diagnostic: the gain records only invariant Cesàro averages, while persistent phase-dependent behavior is absorbed into the bias together with genuinely transient effects. We identify the real peripheral invariant subspace $\mathcal{K}(P)$ of the transition matrix $P$ as the source of this ambiguity. Quotienting by $\mathcal{K}(P)$ is the minimal exact quotient that removes all non-decaying modes and makes the remaining dynamics strictly stable. After choosing a gauge projection $Π$ with kernel $\mathcal{K}(P)$, the reward admits a unique decomposition $r = g_Π^\star + (I-P)v_Π^\star$, where $g_Π^\star$ is a persistent regime profile and $v_Π^\star$ is a gauge-fixed transient component. An exact comparison with classical normalized gain and bias shows that the new pair reallocates the same information into a persistent profile and a gauge-fixed representative of the transient quotient. This decomposition reconstructs finite-horizon returns, recovers statewise average reward, admits a transient-cost interpretation, and yields a stable estimator under a generative model.

comments
The 40th Conference on Neural Information Processing Systems (NeurIPS 2026)
fields
Numerical Analysis
pdf ↗ page arXiv:2602.00474 ↗

Let $\mbox{odd}(G)$ and $i(G)$ denote the number of nontrivial odd components and the number of isolated vertices of a graph $G$, respectively. The $k$-Berge-Tutte-formula of a graph $G$ is defined as: $\mbox{def}_k(G)=\mathop{\text{max}}\limits_{S\subseteq V(G)}\{k\cdot i(G-S)-k|S|\} $ for even $k$; $\mbox{def}_k(G)=\mathop{\mbox{max}}\limits_{S\subseteq V(G)}\{\mbox{odd}(G-S)+k\cdot i(G-S)-k|S|\} $ for odd $k$. A $k$-barrier of a graph $G$ is the subset $S\subseteq V(G)$ that reaches the maximum value in the $k$-Berge-Tutte-formula of $G$. A graph $G$ of odd order (resp. even order) is generalized factor-critical (resp. generalized bicritical) if $\emptyset$ is its only $k$-barrier. Denote by $E_G(v)$ the set of all edges incident to a vertex $v$ in $G$. A $k$-matching of a graph $G$ is a function $f:E(G) \rightarrow \{0,1,...,k\}$ such that $\sum_{e\in E_G(v)} f(e)$ $\leq k$ for every vertex $v\in V(G)$. For $1\leq d\leq k$ and $d \equiv |V(G)|$(mod 2), if for any $ v \in V(G)$, there exists a $k$-matching $f$ such that $\sum_{e\in E_G(v)}f(e)=k-d$ and $\sum_{e\in E_G(u)}f(e)=k \text{ for any } u\in V(G)-\{v\}$. Then $G$ is $k$-$d$-critical. In this paper, we establish tight sufficient conditions in terms of size or spectral radius respectively for a graph $G$ to be generalized factor-critical, generalized bicritical, and $k$-$d$-critical. Furthermore, we prove the equivalence of the existence of four factors (namely, $\{K_2,\{C_t: t\geq 3\}\}$-factor, $\{K_2,\{C_{2t+1}:t\geq 1 \}\}$-factor, fractional perfect matching, perfect $k$-matching with even $k$) in a graph. Thus we also give size conditions and spectral radius conditions for a graph $G-v$ to have one of the four factors for any $v\in V(G)$.

fields
Combinatorics
pdf ↗ page arXiv:2602.01512 ↗

Constrained end-to-end learning trains neural networks whose outputs must satisfy feasibility constraints, such as resource, budget, or operational limits. While projection and optimization layers guarantee constraint satisfaction, boundary-based projections can introduce unfavorable optimization geometry: regions of the unconstrained output space are mapped to the same active face of the feasible set. This makes the resulting map locally rank-deficient, suppressing gradients in constrained directions and potentially impairing optimization - a bottleneck known as gradient saturation. We propose Soft-Radial Projection (SRP), a differentiable reparameterization layer that maps unconstrained network outputs into the relative interior of a convex feasible set by smoothly rescaling rays from a strictly feasible anchor point. Unlike hard radial or orthogonal projections, the resulting map is one-to-one and has a full-rank Jacobian almost everywhere, while guaranteeing strict feasibility. We prove that constrained networks equipped with SRP retain universal approximation guarantees. For polytopes and balls, the layer admits a closed-form forward pass, while for general convex sets, the ray-boundary intersection reduces to a one-dimensional search. Experiments on decision-focused learning benchmarks demonstrate strong solution quality at low computational cost, with particularly favorable results in portfolio optimization and substantially lower inference latency than differentiable optimization layers in the evaluated settings.

comments
Accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2602.03461 ↗

We formulate an algorithm-independent theory of learning dynamics for individual models and ensembles. We establish a conservation law, the vanishing of predictive entropy under successful learning, quantitative entropy and core-expansion bounds, and calibration and finite-sample validation results for identifying reliable predictions. These results motivate a two-generation ensemble that uses Jensen-Shannon (JS) disagreement to route uncertain inputs to specialized learners. CIFAR-10 experiments examine controlled perturbations, distribution shifts, and adversarial attacks. On a heterogeneous test environment, routing improves accuracy over probability averaging while keeping core accuracy near 95%. For adversarial defense, we consider a query-only black-box setting: the attacker can query the overall prediction function but does not know a particular internal decomposition into learners and routing rules. Our current attacks use a fixed-initial-route gradient, which is accurate for a single-step attack when the route remains unchanged, but may deviate from actual multi-step attacks, especially for large perturbations. We evaluate our two-layer defense against this approximation; whether additional adversarially trained layers improve resistance to stronger multi-step attacks remains for future study.

comments
39 pages
fields
Information Theory
pdf ↗ page arXiv:2602.05026 ↗

Given $β\in(1,2]$, let $T_β: [0,1)\to[0,1);~x\mapstoβx\pmod 1$. For $m\in\mathbb N$ let \[ τ_m(β):=\sup\left\{t\in[0,1): K_β(t)\textrm{ contains a periodic orbit of smallest period }m \right\}, \] where $K_β(t)=\{x\in[0,1): T_β^n(x)\notin(0,t)~\forall n\ge 0\}$ is the survivor set of the open dynamical system $(T_β, [0,1), H)$ with a hole $H=(0,t)$. In this paper we give a complete characterization of $τ_m$, and show that $τ_m$ is piecewise continuous with precisely $ψ(m)$ discontinuity points, where $ψ(m)$ is the number of bulbs of period $m$ in the Mandelbrot set. To describe the critical value function $τ_m$ we construct a finite butterfly tree $\mathcal T_m$, from which we are able to determine the discontinuity points and the analytic formula of $τ_m$ based on Farey words and substitution operators. As a by product, we characterize the extremal Lyndon words and extremal Perron words. Since we are working in the symbolic space, our result can be applied to study phase transitions for periodic orbits in topologically expansive Lorenz maps, doubling map with an asymmetric hole, intermediate $β$-transformations, unique expansions in double bases, and so on.

comments
48 pages, 6 figures, 1 table
fields
Dynamical Systems
pdf ↗ page arXiv:2602.05438 ↗

Let $G$ be a graph and let $\mathrm{cl}(G)$ be the number of distinct induced cycle lengths in $G$. We show that for $c,t\in \mathbb N$, every graph $G$ that does not contain an induced subgraph isomorphic to $K_{t+1}$ or $K_{t,t}$ and satisfies $\mathrm{cl}(G) \le c$ has bounded treewidth. As a consequence, we obtain a polynomial-time algorithm for deciding whether a graph $G$ contains induced cycles of at least three distinct lengths.

fields
Combinatorics
pdf ↗ page arXiv:2602.06874 ↗

Training implicit neural representations (INRs) to capture fine-scale details typically relies on iterative backpropagation and is often hindered by spectral bias when the target exhibits highly non-uniform frequency content. We propose ELM-INR, a backpropagation-free INR that decomposes the domain into overlapping subdomains and fits each local problem using an Extreme Learning Machine (ELM) in closed form, replacing iterative optimization with stable linear least-squares solutions. This design yields fast and numerically robust reconstruction by combining local predictors through a partition of unity. To understand where approximation becomes difficult under fixed local capacity, we analyze the method from a spectral Barron norm perspective, which reveals that global reconstruction error is dominated by regions with high spectral complexity. Building on this insight, we introduce BEAM, an adaptive mesh refinement strategy that balances spectral complexity across subdomains to improve reconstruction quality in capacity-constrained regimes.

comments
NeurIPS 2026
fields
Numerical Analysis
pdf ↗ page arXiv:2602.07603 ↗

Second-order methods are provably faster than first-order methods, and their efficient implementations for large-scale optimization problems have attracted significant attention. Yet, optimization problems in ML often have nonsmooth derivatives, which makes the existing convergence rate theory of second-order methods inapplicable. In this paper, we propose a new semismooth Newton method (SSN) that enjoys both global convergence rates and asymptotic superlinear convergence without requiring second-order differentiability. Crucially, our method does not require (generalized) Hessians to be evaluated at each iteration but only periodically, and it reuses stale Hessians otherwise (i.e., it performs lazy Hessian updates), saving compute cost and often leading to significant speedups in time, whilst still maintaining strong global and local convergence rate guarantees. We develop our theory in an infinite-dimensional setting and illustrate it with numerical experiments on matrix factorization and neural networks with Lipschitz constraints.

fields
Optimization and Control
pdf ↗ page arXiv:2602.08069 ↗

By extracting coefficients from Wilf-Zeilberger pairs with respect to auxiliary parameters, we discover many nontrivial hypergeometric series involving harmonic numbers. In particular, we obtain a rapidly convergent series for the depth-two multiple zeta value $ζ(5,3)$, which appears to be the first result of its kind in the literature. We also investigate the Hilbert series attached to a WZ-seed and conjecture that it admits a remarkably simple form, suggesting the presence of an underlying graded-algebra structure associated with WZ-seeds.

fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2602.08721 ↗

Let $k$ be an algebraically closed field with characteristic $2$, and let $X$ be a smooth projective algebraic curve of genus $g \geqslant 2$ over $k$. Let $\mathcal{M}^s_X(2,\mathcal{L})$ be the moduli space of rank $2$ stable vector bundles with determinant $\mathcal{L}$ on $X$. The Frobenius stratification measures the instability of bundles in $\mathcal{M}^s_X(r,\mathcal{L})$ under pullback by the Frobenius map. We show that there exists a Frobenius stratum in $\mathcal{M}^s_X(2,\mathcal{L})$ which is covered by Hecke curves.

comments
9 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2602.09879 ↗

We express the $q$-Pochhammer symbol $(z;q)_\infty$ as an infinite product of gamma functions, analogously to how Narukawa expressed the elliptic gamma function as an infinite product of hyperbolic gamma functions. This identity is used to obtain asymptotic expansions when $q$ tends to $1$.

comments
19 pages, 3 figures; v2: new appendix on connection with Narukawa's identity; v3: published version
journal
Arabi Ardehali, A., Rosengren, H. A New Product Formula for $(z;q)_\infty$, with Applications to Asymptotics. Constr Approx (2026)
fields
Quantum Algebra, Mathematical Physics, Classical Analysis and ODEs
pdf ↗ page arXiv:2602.11329 ↗

The rise of Mean Field Games (MFGs) has fostered a growing family of algorithms designed to solve large-scale multi-agent systems. However, the field currently lacks a standardized evaluation protocol, forcing researchers to rely on bespoke, isolated, and often simplistic environments. This fragmentation makes it difficult to assess the robustness, generalization, and failure modes of emerging methods. To address this gap, we propose a comprehensive benchmark suite for MFGs, focusing on the discrete-time, discrete-space, stationary setting. We introduce a taxonomy of problem classes, ranging from no-interaction and monotone games to potential and dynamics-coupled games, and provide prototypical environments for each. Furthermore, we present MF-Garnets, a method for generating random MFG instances to facilitate rigorous statistical testing. We benchmark a variety of learning algorithms across these environments, including a novel population-based approach (MF-PSO). To our knowledge, this is the first benchmark for MFGs.

fields
Optimization and Control
pdf ↗ page arXiv:2602.12517 ↗

We study the viscous Burgers equation on the real line perturbed by a multiplicative noise $σ(u)\dot{Z}_t$, where $Z$ is a Hermite process of order $q\ge1$ and Hurst index $H\in(1/2,1)$; the case $q=1$ is fractional Brownian motion and $q=2$ is the Rosenblatt process. The stochastic term is a Young integral and the equation is solved path by path. A transformation of Doss-Sussmann type reduces it to a parabolic equation with random coefficients and quadratic growth in the gradient, for which we prove a maximum principle and a gradient estimate of Bernstein type on short time windows. We obtain global existence and uniqueness, the pathwise bound $|u(t,x)|\le\|u_0\|_\infty+\|σ\|_\infty|Z_t|$, and a Wong-Zakai type result without correction term. All moments are finite and $\mathbb{E}\exp(λ\sup_x|u(t,x)|^{2/q})<\infty$ for small $λ$. For the Rosenblatt process with $σ\geσ_0>0$, $\mathbb{E}\,e^{λu(t,x)}$ is finite for small $λ$ and infinite for $λσ_0t^H\geθ_H$, an explicit spectral constant, while the left tail is sub-Gaussian. We show that the temporal Hölder exponent $H$ is optimal, identify the limits of the power variations of $t\mapsto u(t,x)$, and deduce consistent estimators of $H$ and of the noise intensity from one path observed at one spatial point. For $q=2$ we relate the pathwise solution to a Skorokhod formulation through the forward/Skorokhod correction formula of Čoupek, Duncan and Pasik-Duncan.

comments
38 pages. v2: complete rewrite, which corrects errors in v1. The noise is now a Hermite process of arbitrary order, the stochastic integral is a pathwise Young integral, and the solution is global. The results on moments, optimal time regularity, power variations and parameter estimation are new
fields
Probability
pdf ↗ page arXiv:2602.14617 ↗

We establish a criterion for determining when a family of geometric functors is jointly conservative through the lens of purity in compactly generated triangulated categories. We introduce the notion of pure descendability and we apply it to two particular situations involving sequential limits of ring spectra.

comments
19 pages, minor corrections, accepted for publication in Algebraic & Geometric Topology
fields
Algebraic Topology, Category Theory, Representation Theory
pdf ↗ page arXiv:2602.14886 ↗

We study conditional average treatment effect (CATE) estimation from observational data in regimes with potentially weak overlap, when the nuisance response functions lie in a reproducing kernel Hilbert space (RKHS), but the contrast function is structurally simpler. We consider three forms of such simplicity: (i) membership in a lower-complexity RKHS with faster eigenvalue decay, (ii) a source condition relative to the nuisance kernel, or (iii) dependence on a known low-dimensional covariate representation. We develop a unified two-stage kernel ridge regression procedure that remains valid under weak overlap and attains minimax rates determined by the complexity of the contrast function. The procedure avoids propensity-score estimation and separate nuisance convergence-rate assumptions. We also show that a simple model-selection step over candidate contrast spaces and regularization levels satisfies an oracle inequality, enabling adaptation to unknown CATE regularity.

comments
NeurIPS 2026
fields
Statistics Theory
pdf ↗ page arXiv:2602.18958 ↗

Let $\ell$ be an odd prime number. We study the visibility theorem for certain elliptic curves over $\mathbb{Q}$ with additive reduction at $\ell$, and deduce the existence of nontrivial $\ell$-torsion in $\mathrm{Sha}(E^D/\mathbb{Q})$ for suitable quadratic twists $E^D$. Assuming the Bunyakovsky conjecture for $D_k:=3796416000k^3+6840849600k^2-19745252280k-36525288487$, we prove that there exist infinitely many pairs of BSD twins with identical minimal discriminants and Kodaira symbols, both of which have nontrivial $3$-primary components of their Tate–Shafarevich groups. Via the theory of visibility, this provides an instance of the infinitude predicted by the Bhargava–Klagsbrun–Lemke Oliver–Shnidman conjecture, within the family of quadratic twists of an elliptic curve without a rational 3-isogeny.

comments
19 pages. Added Theorem 1.3
fields
Number Theory
pdf ↗ page arXiv:2602.19861 ↗

We study two-dimensional translation-invariant CSS stabilizer codes over prime-dimensional qudits on the square lattice under twisted boundary conditions, generalizing the Kitaev $\mathbb{Z}_p$ toric code by augmenting each stabilizer with two additional qudits. Using the Laurent-polynomial formalism, we adapt the Gröbner basis to compute the logical dimension $k$ efficiently, without explicitly constructing large parity-check matrices. We then perform a systematic search over various stabilizer realizations and lattice geometries for $p\in\{3,5,7,11\}$, identifying qudit low-density parity-check codes with the optimal finite-size performance. Representative examples include $[[242,10, \leq 22]]_3$ and $[[120,6, \leq 20]]_{11}$, both achieving $k d^{2}/n \leq 20$. Across the searched regime, the best observed $k d^{2}$ at fixed $n$ increases with $p$, with an empirical relation $k d^{2} = 0.0541 \, n^{2}\ln p + 3.84 \, n$, compatible with a Bravyi–Poulin–Terhal-type tradeoff when the interaction range grows with system size.

comments
9+2 pages, 5 figures; v2: typos fixed, figures updated
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2602.20158 ↗

Competition complexity formalizes a compelling intuition: rather than refining the mechanism, how much additional competition is sufficient for a simple mechanism to compete with an optimal one? We begin the study of this question in multi-unit pricing for welfare maximization using prophet inequalities. An online decision-maker observes $m \geq k$ nonnegative values drawn independently from a known distribution, may select up to $k$ of them, and aims to maximize the expected sum of selected values. The benchmark is a prophet who observes a sequence of length $n \geq k$ and selects the $k$ largest values. We focus on the widely adopted class of single-threshold algorithms and fully characterize their $(1-\varepsilon)$-competition complexity. Notably, our results reveal a sharp competition-induced phase transition: in the absence of competition, single-threshold algorithms are fundamentally limited to a $1-1/\sqrt{2kπ}$ fraction of the prophet value, whereas even a $1\%$ multiplicative increase beyond $n$ observations suffices to achieve a $1-\exp(-Θ(k))$ fraction. Another notable result happens when $k=1$: we show that the $(1-\varepsilon)$-competition complexity is exactly $\ln(1/\varepsilon)$, fully resolving an open question by Brustle et al. [Math. Oper. Res. 2024]. Our analysis is based on infinite-dimensional linear programming and duality arguments.

fields
Optimization and Control
pdf ↗ page arXiv:2602.20398 ↗

In this article, we establish weak type $(1,1)$ bounds for the variation and jump operators associated with the family of truncated singular integrals with rough kernels. This resolves an open question raised by Jones, Seeger and Wright (Trans. Amer. Math. Soc. (2008)). Moreover, as an immediate consequence of the variational estimate, we recover the weak type $(1,1)$ boundedness of the maximally truncated rough singular integral operator.

comments
17 pages, Typos corrected
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2602.21888 ↗

In this paper, we introduce higher level versions of the theta group $Γ_θ.$ In particular, we treat level 3 and 4 versions of the theta group, $Γ_{θ,3}$ and $Γ_{θ,4}$ and prove that $\displaystyle F(τ)=η\left(\frac{τ-1}{3} \right) η\left(\frac{τ+1}{3} \right)$ and $\displaystyle G(τ)=η\left(\frac{τ-1}{4} \right) η\left(\frac{τ+1}{4} \right)$ are modular forms on $Γ_{θ,3}$ and $Γ_{θ,4}$ respectively. Moreover we compute their multiplier systems, $ν_{F}$ and $ν_{G}$.

fields
Number Theory
pdf ↗ page arXiv:2602.22471 ↗

The Raisonnier filter is a combinatorial object isolated by Jean Raisonnier in order to simplify Shelah's proof that if all $\mathbfΣ^1_3$ sets are Lebesgue-measurable then there is an inner model with an inaccessible cardinal. In this paper, we study the combinatorics of a general version of the Raisonnier filter, with an eye to potential applications in descriptive set theory. We prove various results about the Raisonnier Filter generated by simple sets, and we study the ideals associated to the Raisonnier Filter being rapid and/or unbounded, connecting it to the null-additive and meagre-additive ideals studied by Pawlikowski and Shelah. Among the more interesting results is a converse to Raisonnier's theorem which indicates that Raisonnier's technique is unlikely to lead to similar results for other regularity properties. We also draw some conclusions regarding the Borel and dual Borel Conjectures.

comments
20 pages, 1 figure. New version contains new results in Sections 3 and 4 and adds necessary proper context to results regarding rapid Raisonnier filters from the previous version
fields
Logic
pdf ↗ page arXiv:2602.23340 ↗

Finding the distance to singularity for a matrix is a ubiquitous problem in numerical linear algebra, and is elegantly solved by the Eckart-Young-Mirsky theorem. Its structured variant arises when one considers structured matrices and wants to preserve their structure. This problem is important for several matrix nearness problems that either entirely or partly reduce to a structured distance to singularity problem. In this work, we propose a new method for the structured distance to singularity problem based on singular spaces, that is, linear subspaces consisting of singular matrices. We study the properties of these spaces to guide the construction of the algorithm. In the Tikhonov regularized formulation, the method globally minimizes a certain objective function alternately in its arguments. We show that a restricted family of singular spaces suffices to attain the best possible improvement in a single iteration. In many of the numerical comparisons, the proposed method yields substantial reductions in running time when compared with existing methods, while the computed distances to singularity remain comparable. These gains allow larger problems to be solved within practical running times.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.01233 ↗

The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$, and it is non-degenerate if it is not periodic. Such a non-degenerate code is standard if its permutation automorphism group is equal to the group generated by the cyclic shift and the Frobenius automorphism, and non-standard otherwise. In this paper, we give a complete classification of all non-standard non-degenerate irreducible cyclic codes, using the classification of finite simple groups. Our result shows that, apart from a small number of explicit exceptional families and their descendants under certain secondary constructions, every non-degenerate irreducible cyclic code is standard, and up to four explicit exceptions, every nonzero degenerate cyclic code is non-standard. This classification has several consequences. First, it yields a general description of non-standard linear recurring sequence subgroups, extending the earlier work of Brison and Nogueira; secondly, it establishes the Schmidt-White conjecture for all non-standard non-degenerate irreducible cyclic codes. Moreover, our results provide strong evidence in support of the conjecture of Berger and Charpin that almost all cyclic codes are standard.

comments
Comments are welcome; 42 pages
fields
Combinatorics
pdf ↗ page arXiv:2603.01904 ↗

We describe a generating set for the initial ideal of simplicial toric ideals with respect to the graded reverse lexicographic order, using representations of elements of affine monoids as sums of irreducible elements. Although the resulting generating set is not necessarily minimal, we demonstrate, through an example, how one can obtain the reduced Gröbner basis from it. Moreover, we compare the maximal degree of the Gröbner basis and the Castelnuvo-Mumford regularity.

comments
20 pages. Section 5 has been added in this revised version
fields
Commutative Algebra
pdf ↗ page arXiv:2603.07488 ↗

We consider $(\infty,d)$-categories in the limit $d\to \infty$ via the core or localization functors that forget or invert higher non-invertible arrows, respectively. We compare the two resulting $(\infty,1)$-categories of $(\infty,\infty)$-categories and exhibit the localization-limit as a reflective localization of the core-limit. Furthermore, we study notions of invertibility that only emerge at $d=\infty$ and give rise to intermediate reflective localizations between the two limits. For example, we characterize coinductive completion and the maps it inverts, and reveal a new separation beyond the one of Henry–Loubaton by showing that even the stronger $ω$-completeness does not suffice to carve out the localization-limit.

comments
53 pages; v2: added a new counterexample separating $ω$-completeness from the localization-limit
fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2603.11005 ↗

In this paper we study a general class of nonlinear elliptic problems in divergence form. First, we prove that the solutions to these problems satisfy a convexity property when the given domain is strictly convex. Then, making use of this convexity property, we develop some minimum principles for an appropriate $P$-function, in the sense of L.~E.~Payne. Finally, this new minimum principle is applied to find a priori estimates for the solutions, in terms of the mean curvature of the boundary of the underlying domain.

fields
Analysis of PDEs
pdf ↗ page arXiv:2603.12931 ↗

A field in which the (logarithmic) Weil height is bounded from below by a strictly positive constant is said to have the Bogomolov property (property (B)). Given a normalized eigenform $f\in S_k(Γ_0(N))$ Amoroso and Terracini proved (B) for the field "cut out" by the adelic representation associated to $f$ under some assumptions on $f$, generalizing the earlier work of Habegger on elliptic curves. In this paper we extend this result to the case of normalized eigenforms with nontrivial nebentypus character. We also introduce the notion of ADZ field, inspired by earlier work of Amoroso, David and Zannier, exhibiting a class of fields in which property (B) is preserved under (arbitrary) composition.

comments
45 pages, major edits on the presentations and example section
fields
Number Theory
pdf ↗ page arXiv:2603.13523 ↗

We address the brittleness of Bayesian experimental design under model misspecification by formulating the problem as a max–min game between the experimenter and an adversarial nature subject to information-theoretic constraints. We demonstrate that this approach yields a robust objective governed by Sibson's $α$-mutual information~(MI), which identifies the $α$-tilted posterior as the robust belief update and establishes the Rényi divergence as the appropriate measure of conditional information gain. To mitigate the bias and variance of nested Monte Carlo estimators needed to estimate Sibson's $α$-MI, we adopt a PAC-Bayes framework to search over stochastic design policies, yielding rigorous high-probability lower bounds on the robust expected information gain that explicitly control finite-sample error.

comments
Accepted at NeurIPS 2026
fields
Statistics Theory
pdf ↗ page arXiv:2603.14094 ↗

The biochemical processes underlying DNA data storage, including synthesis, amplification, and sequencing, are inherently noisy, leading to insertion, deletion, and substitution errors as well as sequence dropouts that challenge reliable data retrieval. Here we introduce DNA-MGC+, a DNA storage codec designed for reliable and resource-efficient retrieval under diverse operating conditions. We evaluate DNA-MGC+ across various in silico and in vitro settings. In comparison with selected representative codecs, the results show that DNA-MGC+ consistently improves key performance metrics under explicit reliability constraints, including required sequencing depth, read cost, decoding time, storage density, and error-correction capability. In silico experiments show that DNA-MGC+ supports reliable decoding at error rates up to 24% for a 15-KB file, while separate scalability experiments demonstrate reliable decoding of files up to 200 MB at a 5% error rate. In vitro experiments involving a 24-KB file and electrochemical synthesis show that different DNA-MGC+ configurations achieve minimum sequencing depths below 3x and read costs below 3.5 nts/bit under both Illumina and Nanopore sequencing.

comments
Accepted in Communications Engineering (Nature Portfolio)
fields
Information Theory
pdf ↗ page arXiv:2603.14527 ↗

We study a universal model for the bifurcation of asymptotic values, based on the notion of tangent-like maps and families thereof. In analogy with polynomials and polynomial-like maps, we prove that every tangent-like map can be associated to a member of the model family. In particular, the filled Julia sets of tangent-like maps are quasiconformally homeomorphic to the ones for the model family. Likewise, the bifurcation locus of a family of tangent-like maps is homeomorphic to the boundary of the {\em Tandelbrot set} $\mathcal T$, the bifurcation locus of the model. Moreover $\mathcal T$ is universal, in the sense that homeomorphic copies of it can be found densely in the activity loci of asymptotic values of any appropriate natural family of finite type meromorphic maps. When applied to the iterates of a transcendental meromorphic map, these results make it possible to build a transcendental renormalization theory, a question that has been open for the last 25 years.

fields
Dynamical Systems, Complex Variables
pdf ↗ page arXiv:2603.15466 ↗

This technical note documents the implementation and use of the Primal-Dual Conic Programming Solver (PDCS), a first-order solver for large-scale conic optimization problems introduced by Lin et al. (arXiv:2505.00311). It describes the algorithmic and implementation details underlying PDCS, including the restarted primal-dual hybrid gradient method framework, adaptive step-size selection, adaptive reflected Halpern iterations, adaptive restarts, and diagonal preconditioning. It also provides practical instructions for using PDCS, including its interfaces with JuMP and CVXPY, solver options, and illustrative code examples. PDCS is available at https://github.com/ZikaiXiong/PDCS under the Apache License 2.0.

comments
17 pages, 1 figure, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2603.15504 ↗

The continuous quadratic knapsack (CQK) problem involves minimizing a diagonal convex quadratic function subject to box constraints and a single linear equality constraint. It has numerous applications in resource allocation, multicommodity flow, machine learning, and classical optimization tasks such as Lagrangian relaxation and quasi-Newton updates. In this work, we revisit the semismooth Newton method introduced by Cominetti, Mascarenhas, and Silva. We demonstrate that the method can be significantly improved in two directions. First, for projections onto the simplex or the $\ell_1$-ball, it can incorporate Condat's highly effective initial multiplier guess. Second, it can serve as a flexible foundation for CQK algorithms, allowing for different parallel variants tailored to exploit CPU and GPU computational models. These improvements are implemented in the open-source Julia package \texttt{NewtonCQK.jl}. We present extensive numerical tests comparing this implementation with other state-of-the-art solvers, demonstrating its superior efficiency and scalability.

fields
Optimization and Control
pdf ↗ page arXiv:2603.15910 ↗

In this series of papers, we introduce higher level versions of the theta group $Γ_θ.$ In this paper, we treat the theta group of level $5$, $Γ_{θ,5},$ and construct modular forms on $Γ_{θ,5}$. Moreover we compute their multiplier systems. For this purpose, we derive transformation formula of theta function with characteristics.

fields
Number Theory
pdf ↗ page arXiv:2603.16109 ↗

We compute the Poisson cohomology of the linear Poisson structure dual to the n-dimensional "book" Lie algebra, defined by [e_0,e_i]=e_i, [e_i,e_j]=0, for i,j=1,...,n-1.

comments
23 pages, 1 figure. Typos fixed, minor corrections. Accepted at J. Symplectic Geom
fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2603.17277 ↗

Let $\mathfrak{o}$ be a compact discrete valuation ring with residue field $\mathbb{F}_q$. We study the cotype zeta function of finite-index subalgebras of $\mathfrak{o}^n$ by adapting an approach developed by Voll for more general algebras. For each $\emptyset\neq I\subseteq\{1,\ldots,n-1\}$, we express the generating series counting subalgebras whose elementary divisor valuations, listed in decreasing order, have jumps precisely at the positions in $I$ as a finite weighted sum of $\mathfrak{o}$-adic integrals. We compute these integrals in several cases, obtaining explicit formulas for the generating series associated with every singleton set $I$ in arbitrary rank. We also obtain the cotype zeta function of unital subalgebras of $\mathfrak{o}^4$. As a by-product, we obtain a universal lower bound for the abscissa of convergence of the subalgebra zeta function of any $\mathfrak{o}$-algebra that is free of rank $n$ as an $\mathfrak{o}$-module. We also establish several results concerning the uniformity problem for the subalgebra zeta function of \(\mathfrak{o}^n\). To do so, we study two systems of polynomial equations over the residue field and apply the results to derive the number of irreducible unital subalgebras of $\mathfrak{o}^n$ of index $q^e$, for $e\leq n+3$. Finally, we use the decomposition of subalgebras into local factors to obtain the number of unital subalgebras of $\mathfrak{o}^n$ of index $q^e$ for $e\leq 9$. For each fixed $n$, these subalgebra counts are universal polynomials in $q$.

comments
56 pages; added two sections on finite-field systems and the enumeration of irreducible unital subalgebras of $\mathfrak{o}^n$ of indices $q^{n+2}$ and $q^{n+3}$, and of unital subalgebras of index $q^9$
fields
Number Theory
pdf ↗ page arXiv:2603.17286 ↗

We study the fully-mixed formulation of the Biot equations which is characterized by a symmetric coupling between flow and deformation while each subphysics has internally a saddle point structure. This enables the use of stable mixed finite elements for each subproblem without a strong compatibility condition across the two subphysics. To exploit this flexibility while preserving the conservation structure of both subproblems, we consider fully mixed finite element methods in which the symmetry of the elastic stress tensor is enforced weakly, often referred to as a five-field formulation. The resulting mixed formulation exhibits an overarching saddle-point structure whose stability is determined by suitable inf-sup conditions. Inf-sup stability is established for several families of discrete spaces of arbitrary order, leading to optimal a priori error estimates. Iterative splitting strategies following the classical fixed-stress split with additional tuning are specifically investigated for the fully mixed formulation with proof of convergence and rates depending on the coupling strength. Contrary to previous analyses on coupled problems with a symmetric structure, we theoretically prove the efficacy of negative stabilization, consistent with Schur-complement ideas. Numerical results based on analytical solutions and the classical 2D Mandel problem and a 3D footing problem are presented supporting the theory.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.18241 ↗

We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-output decoding entire component codes rather than individual parity checks, we mitigate the effects of trapping sets and cycles, resulting in improved convergence. Because our decoder preserves the message passing structure of standard belief propagation (BP), it is compatible with many BP enhancements. We demonstrate this with OSD postprocessing, quaternary BP, and RelayBP, each yielding further gains. Standalone SOGRAND outperforms the standard BP+OSD baseline by over two orders of magnitude in logical error rate. In combination with the Relay principle, SOGRAND outperforms RelayBP by over one order of magnitude, providing a way forward for scalable decoding of the emerging class of Tanner-code-based quantum codes.

fields
Information Theory
pdf ↗ page arXiv:2603.18318 ↗

In this paper, we present a unified approach to constructing continuous and discrete $\mathrm{PGL}(3)$-invariant integrable systems, formulated in terms of the common dependent variables $z_1,z_2$, from linear spectral problems and their factorisation. Starting from third-order spectral problems, we first provide explicit forms of the differential and difference invariants, generalising the Schwarzian derivative and cross-ratio to the rank-$3$ setting. The factorisation induces dualities among linear spectral problems, underlying the exact discretisation and multi-dimensional consistency of the associated Boussinesq systems. Then, we derive both continuous and discrete $\mathrm{PGL}(3)$-invariant Boussinesq systems, representing natural rank-$3$ generalisations of the Schwarzian KdV and cross-ratio equations. A geometric lifting-decoupling mechanism is developed to explain the reduction of these systems to the $\mathrm{PGL}(2)$-invariant Boussinesq equations. Finally, we derive a ${\mathrm{PGL}}(3)$-invariant system of generating PDEs together with its Lagrangian structure, in which the lattice parameters serve as independent variables, providing the generating PDE system for the Boussinesq hierarchy.

comments
48 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2603.18386 ↗

We give an account of mutation of theta functions in cluster scattering diagrams, starting with a notion of mutation that is related to, but different from, the notion of mutation defined by Gross, Hacking, Keel, and Kontsevich.This different approach to mutation leads to several applications. Three of the applications simplify the process of computing structure constants for multiplication of theta functions, and these are used in another paper on cluster scattering diagrams of affine type. Notable in these three applications is the appearance of mutation symmetries and dominance regions. The other two applications have to do with pointed reduced bases, a variation on the pointed bases of Fan Qin. We give a characterization of pointed reduced bases analogous to Qin's characterization of pointed bases. All of these applications take place in a version of Gross, Hacking, Keel, and Kontsevich's canonical algebra that can be constructed for an arbitrary exchange matrix.

journal
SIGMA 22 (2026), 109, 38 pages
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2603.19391 ↗

Negative avoiding sequences of span $n$ are periodic sequences of elements from $\mathbb{Z}_k$ for some $k$ with the property that no $n$-tuple occurs more than once in a period and if an $n$-tuple does occur then its negative does not. They are a special type of cut-down de Bruijn sequence with potential position-location applications. We establish a simple upper bound on the period of such a sequence, and refer to sequences meeting this bound as maximal negative avoiding sequences. We then go on to demonstrate the existence of maximal negative avoiding sequences for every $k\geq3$ and every $n\geq2$.

comments
Minor errors fixed
fields
Combinatorics
pdf ↗ page arXiv:2603.25286 ↗

Achieving reliable communication has long been a fundamental challenge in networked systems. Semantic Error Correction (SEC) leverages the semantic understanding capabilities of language models (LMs) to perform application-layer error correction, complementing conventional channel decoding. While promising, existing SEC approaches rely solely on context captured by LMs at the application layer, ignoring the rich information available at the physical layer. To address this limitation, this paper introduces Cross-Layer SEC (CL-SEC), an LM-empowered error correction framework that integrates cross-layer information from both the physical and application layers to jointly correct corrupted words in text communication. Using a Bayesian combination in product form tailored to this framework, CL-SEC achieves significantly improved performance over methods that process information in isolated layers. CL-SEC shows substantial gains across multiple error-correction metrics, including bit-error rate, word-error rate, and semantic fidelity scores. Importantly, unlike most semantic communication systems that focus solely on recovering the semantic meaning of transmitted messages, CL-SEC aims to reconstruct the original transmitted message verbatim, leveraging the semantic understanding capabilities of LMs for precise reconstruction.

fields
Information Theory
pdf ↗ page arXiv:2603.26125 ↗

Let $\mathfrak{g}$ be a complex simple Lie algebra and $L(λ)$ be a simple highest weight module of $\mathfrak{g}$ with highest weight $λ-ρ$, where $ρ$ is half the sum of positive roots. A simple $\mathfrak{g}$-module $L_w:=L(-wρ)$ is called integral minimal if the associated variety of its annihilator ideal equals the closure of the unique minimal special nilpotent orbit. In this paper, we find that the associated variety of any integral minimal module $L_w$ is irreducible and equal to the orbital variety corresponding to a minimal-length element in the Kazhdan–Lusztig right cell containing $w$.

comments
32 pages
fields
Representation Theory
pdf ↗ page arXiv:2603.26371 ↗

Similarity measures such as centred kernel alignment (CKA) or representational similarity analysis (RSA) are widely used to compare the representational geometries employed by different neural networks to solve the same task. Yet, because existing methods compare the extrinsic geometry of representations in state space, rather than their intrinsic geometry, they may fail to capture subtle yet crucial distinctions between fundamentally different computations. Here, we introduce metric similarity analysis (MSA), a novel method which leverages tools from Riemannian geometry to compare the intrinsic geometry of neural representations under the manifold hypothesis. We show that MSA can be used to (i) disentangle neural computations of deep networks in rich vs. lazy learning regimes, (ii) compare the dynamics of recurrent neural networks and state-space models, and (iii) investigate the statistical manifolds of diffusion models. Overall, we introduce a mathematically grounded and broadly applicable framework to understand the mechanisms behind neural computations by contrasting their intrinsic geometries.

comments
Accepted at NeurIPS 2026 (Oral)
fields
Differential Geometry
pdf ↗ page arXiv:2603.28764 ↗

We study a paradigm of coding for compression of the natural numbers via the zeta distribution and develop a statistical-mechanical interpretation, both in terms of Hagedorn systems and a Bose gas with energy levels given by logarithms of prime numbers. We also propose a simple coding scheme for the zeta distribution that nearly achieves the ideal code length. For block coding of vectors of natural numbers, we derive the micro-canonical entropy function and demonstrate its asymptotic linearity implying that its behavior is analogous to that of a Hagedorn system. We also derive the large deviations rate function, and provide a formula for the best coding parameter in the large deviations sense. We show that due the Hagedorn-type phase transition there is only partial equivalence of ensembles, due to the degeneration of the domain of the partition function.

comments
41 pages, 2 figures, accepted to Journal of Statistical Physics Theory and Experiment (JSTAT)
fields
Information Theory
pdf ↗ page arXiv:2604.00858 ↗

We investigate a fluid-structure interaction system in which the dynamics of the fluid is described by the compressible Navier-Stokes equations, while the elastic structure is modeled by a damped plate equation. The fluid evolves in a three-dimensional bounded domain, with the structure occupies a part of its boundary. Instead of standard no-slip boundary conditions, we consider the Navier-slip boundary conditions at the fluid-structure interface as well as at the fixed boundary. We establish the local-in-time existence and uniqueness of strong solutions within $L^{p}-L^{q}$ framework. The existence result is obtained for small time by decoupling the linearized system and employing a cascade strategy combined with the Second Schauder fixed point theorem, whereas the uniqueness is shown by deriving weak regularity properties for the associated linear coupled operator in a Hilbert space setting. It is the first result addressing strong solutions for a compressible fluid interacting with a damped plate under Navier-slip boundary conditions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2604.00973 ↗

We study conditional independence under infinite measures on punctured product spaces, a notion recently introduced for graphical modeling in multivariate extremes and Lévy processes. In contrast to classical probabilistic conditional independence, this concept is formulated through normalized restrictions of an infinite measure, a formulation that reflects the non-product structure of the punctured space. We show that this non-standard notion admits a natural probabilistic characterization: it is equivalent to classical conditional independence between coordinate projections of a Poisson point process defined on the punctured space with the given infinite measure as its mean measure. In addition, we provide a functional characterization of the conditional independence concept at the level of the enumerated points of the Poisson point process. We further extend the characterization to punctured products of Borel spaces with distinguished points and a product localization.

comments
17 pages
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2604.01399 ↗

We study a radially parametrized subclass of domains satisfying the Geometric Normal Property with respect to a fixed convex core $C$ ($C$-GNP). These domains are described by a thickness function $d:\pC\to(0,\infty)$. The main contribution is the equivalence \[ χ_{\Om_n}\toχ_{\Om}\ \text{in }L^1 \iff d_n\to d\ \text{uniformly} \iff \Om_n\to\Om\ \text{in Hausdorff distance}. \] This equivalence is established via an explicit reconstruction formula $d(c)=\int_0^\infty χ_{\Om}(c+t\nuC(c))\dd t$, which allows the transfer of convergence of characteristic functions into uniform convergence of geometric parameters. Thus the infinite-dimensional geometric optimization problem is reduced to the optimization of a scalar function on a fixed manifold. We prove compactness of uniformly controlled subclasses. The analysis is extended to non-connected domains with uniform separation. Under the curvature condition $\sup d<δ_0$ (where $δ_0$ is the normal tubular radius of $C$), we prove a conditional regularity result for the thickness function when the normal projection admits a $C^{m,β}$ inverse parametrization. We also give a sufficient perturbative bilipschitz condition for the radial parametrization. Using the Mosco convergence framework, we prove $Γ$-convergence of Dirichlet energies under domain variation for the uniformly controlled radial subclass. We also discuss the relation with the general $C$-GNP class and possible applications in shape optimization.

fields
Optimization and Control
pdf ↗ page arXiv:2604.01813 ↗

We define and study the magnitude and magnitude homology of real hyperplane arrangements by regarding their tope graphs as metric spaces. Since magnitude is a refinement of the cardinality, this may be viewed as a natural generalization of the classical problem of counting the chambers of an arrangement. Our central result is a structure theorem asserting that the magnitude and magnitude homology of an arrangement decompose into contributions indexed by its faces. In particular, the magnitude is determined by the intersection lattice of the arrangement. We also observe several interesting phenomena, including a characterization of Boolean arrangements in terms of diagonality and a reciprocity theorem reminiscent of Ehrhart–Macdonald reciprocity. Finally, based on explicit computations, we conjecture that the magnitude homology of an arrangement is torsion-free and determined by its intersection lattice.

comments
Abstract and introduction re-written. Updated status of open problems
fields
Combinatorics, Algebraic Topology, Metric Geometry
pdf ↗ page arXiv:2604.03718 ↗

Principal manifold estimation (PME) has been successfully applied to robotics and neuroimaging. However, the existing PME framework does not directly accommodate manifolds with non-Euclidean topology, and its theoretical foundations remain incomplete. In this article, we develop a complete theoretical framework for PME that summarizes high-dimensional point clouds using low-dimensional manifolds with general, potentially non-Euclidean topology. The choice of topology can be informed by topological data analysis. Drawing on the theory of Sobolev spaces on Riemannian manifolds, we establish that the proposed principal manifolds are well-defined, prove convergence of the iterative algorithm used to compute them, and establish the consistency of the finite-sample estimator. We further provide a Bayesian interpretation of PME that connects the framework to recent developments in Gaussian processes on Riemannian manifolds. Examples illustrate how the proposed PME framework can be applied to existing statistical methods, including manifold-valued regression. Numerical experiments illustrate the proposed methodology, its computational implementation, and its theoretical properties.

comments
139 pages
fields
Statistics Theory
pdf ↗ page arXiv:2604.04272 ↗

The objective of this article is to study nearly invariant subspaces of the backward shift operator on the real Hardy space. We also investigate nearly invariant subspaces with finite defect, and as a consequence, provide a characterization for almost invariant subspaces of the backward shift operator.

comments
17 pages
fields
Functional Analysis
pdf ↗ page arXiv:2604.10240 ↗

We give explicit axioms for the algebraic theory of the quasivarieties of right-preordered groups and preordered groups. We then look at lattices of effective equivalence relations, which turn out to be similar to the lattices of equivalence relations in the category of groups. Once this is established, we study internal structures in the category of right-preordered groups. We start with some general results and then prove the S-protomodularity of the category of right-preordered groups, when considering the class S of Schreier split epimorphisms. Following this, we investigate further and prove that the category of right-preordered groups turns out to be action representable when we restrict our attention to split epimorphisms in S. Relatively to this class of split epimorphisms, we define the notion of S-precrossed modules, and then of S-crossed modules; that correspond exactly to Schreier internal reflexive graphs and Schreier internal categories, respectively. Lastly, we characterize groupoids among Schreier internal categories and give some examples.

comments
Suggestions are welcome
fields
Category Theory
pdf ↗ page arXiv:2604.14105 ↗

We study state-feedback design for continuous-time LTI systems with a control input and an external input-output pair. Our objective is to determine feedback gains that render the closed-loop system (strictly) passive with respect to the external port while minimizing the standard LQR cost in the disturbance-free case. The resulting constrained optimization problem is intractable due to bilinear matrix inequalities. We analyze the set of passivating gains, showing it is unbounded, possibly nonconvex, path-connected, and contractible. We propose an indirect approach, in which the set of passivating feedback gains is inner-approximated by a compact, convex polytope. A projected gradient flow is employed to compute a gain within this polytope that minimizes the LQR cost. Numerical examples illustrate the effectiveness of the method.

fields
Optimization and Control
pdf ↗ page arXiv:2604.14854 ↗

We introduce induced fiber topological pressure for random dynamical systems and identify it with two critical exponents and the threshold of classical fiber pressure, allowing infinite fiber topological entropy. We establish an almost-sure fiberwise formula and a variational principle, and identify induced equilibrium states with classical equilibrium states. If the fiber topological entropy is finite and the entropy map is upper semicontinuous, an ergodic induced equilibrium state exists.

comments
19 pages, 1 figure. Separated two topics of version 1, the first topic is induced fiber topological pressure; the latter will be uploaded when completed
fields
Dynamical Systems
pdf ↗ page arXiv:2604.14964 ↗

In the standard formulation of relativistic quantum field theory, a $\mathbb{Z}_2$-graded structure is assumed to realize locality and the boson-fermion dichotomy. While $\mathbb{Z}_2^n$-graded extensions are known to be allowed at the level of symmetry, their realization in interacting quantum field theories remains unclear. In this paper, we construct a classical minimal $\mathbb{Z}_2^2$-graded supersymmetric Yang-Mills theory. We derive the invariant action and show that all kinetic terms have the correct sign, indicating the absence of classical ghost-like instabilities. Moreover, the positivity of the Hamiltonian follows from the $\mathbb{Z}_2^2$-graded supersymmetry algebra. As a result, we show that $\mathbb{Z}_2^2$-graded generalized statistics can be realized at the classical level in a stable interacting supersymmetric gauge theory.

comments
Corrected sign and index errors, helicity assignments, and a missing term in an auxiliary-field supersymmetry transformation. The main arguments and conclusions are unchanged
journal
Nucl. Phys. B 1031 (2026) 117654
fields
Mathematical Physics
pdf ↗ page arXiv:2604.19415 ↗

Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.

comments
The proof contains an error
fields
Differential Geometry, Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2604.19630 ↗

Modeling high-dimensional dependencies while keeping likelihoods tractable re- mains challenging. Classical vine copulas provide an explicit dependence structure but require repeated, costly bivariate fitting. We propose Vine Denoising Copula (VDC)1, an amortized estimator for simplified vines on continuous data. VDC trains a single bivariate denoising network on simulated copulas and reuses it across all vine edges. For each edge, the network maps an empirical histogram to a density grid, and iterative proportional fitting approximately enforces uniform grid marginals. The predicted densities and cached conditional transforms support stan- dard vine recursion, likelihood evaluation, sampling, and information estimation. This retains the classical vine factorization while replacing repeated per-edge fitting with reusable neural inference. Across synthetic and real-data benchmarks, VDC combines accurate bivariate density estimation, competitive information estimates, and faster high-dimensional vine fitting after pretraining. Performance varies across datasets; finite grid resolution and conditional prediction remain limitations. The explicit fitted structure supports edge- and tree-level information decomposition, making repeated dependence analysis more practical.

fields
Information Theory
pdf ↗ page arXiv:2604.20568 ↗

The relativistic hydrodynamics (RHD) equations can give rise to solutions which have shocks, contact discontinuities, and other sharp structures, which interact and evolve over time. Capturing these sharp waves effectively requires a mesh with high resolution, making the scheme computationally expensive. In this work, adaptive mesh refinement is used with the high-order Lax-Wendroff flux reconstruction (LWFR) method to solve the system of RHD equations, which is closed with general Synge-type equations of state. To make the scheme Jacobian-free, the idea of automatic differentiation is incorporated for computing the temporal derivatives in the time average flux approximations. The high-order method is blended with an admissible low-order method at the subcell level to control the Gibbs oscillations and maintain the physical admissibility of the solution. Finally, several test cases involving high Lorentz factors, low densities, low pressures, strong shock waves, and other discontinuities are used to demonstrate the robustness, accuracy, and effectiveness of the proposed method. These simulations are performed with AMR using various linear and curved meshes to show the scheme's efficiency and ability to handle complex geometries.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.20608 ↗

In this paper, we consider a derivative nonlinear Schrödinger equation $$ \mathrm{i}\partial_{t}u+\partial_{xx}u-V\ast u+\mathrm{i}\vert u\vert^{2}\partial_{x}u=0 $$ on the torus $\mathbb{T}$, depending on some potential $V$. We prove that for `almost all' potentials $V$, this equation admits an almost-periodic solution.

fields
Dynamical Systems
pdf ↗ page arXiv:2604.23202 ↗

Gaussian basis functions provide an efficient and flexible alternative to spline activations in Kolmogorov-Arnold networks (KANs), but their performance is sensitive to the Gaussian scale parameter ε. We introduce the partition-of-unity Gaussian KAN (PU-GKAN), a kernel-based normalization framework that transfers the Shepard partition-of-unity principle to trainable KAN edge functions. Each Gaussian edge basis is normalized by its local sum over fixed centers, preserving the standard edge-based architecture and essentially the same trainable coefficient structure as GKAN. The resulting feature map reproduces constants exactly at the edge level and admits an explicit normalized finite-feature kernel interpretation. Numerical experiments show that PU-GKAN reduces sensitivity to ε, improves validation accuracy for most smooth and moderately non-smooth targets, and provides more stable training behavior. These benefits persist across variations in sample size and number of centers, higher-dimensional architectures, and Matern RBF bases. PU-GKAN also improves physics-informed neural networks for Helmholtz and wave equations, with validation-error reductions of up to 90%. These results establish partition-of-unity normalization as a mathematically grounded and broadly applicable framework for improving the reliability and accuracy of radial basis function KANs.

journal
Neurocomputing, 710, 135408, 2027
fields
Analysis of PDEs
pdf ↗ page arXiv:2604.23599 ↗

Based on discrete observations $X_0,X_Δ,\dots, X_{nΔ}$ for $Δ=n^{-γ}$ with $γ\in [0,1)$ of the null-recurrent dynamic $dX_t = σ(X_t)dW_t$ with a Brownian motion $W$ and $σ(x)=α\mathbb{1}\{x<ρ\} + β\mathbb{1}\{x\geq ρ\}$, we derive rate of convergence and limiting distribution of the profile MLE for $ρ$. This includes low-frequency asymptotics ($γ=0$) for which the observations form a null-recurrent Markov chain. The derived non-standard limit is the argsup over a doubly stochastic drifted Poisson process explicitly involving the local time of oscillating Brownian motion. Its dependence on $ρ$ as well as the unknown volatility levels $α$ and $β$ is shown to be continuous w.r.t. the topology of weak convergence, enabling statistical inference. Whereas this limit is independent of the sampling frequency, the profile MLE's rate of convergence equals $n^{-(1+γ)/2}$ and is proven to be minimax optimal. The surprising idea of the proof of the limit theorem is to relate the long-term behavior of the null-recurrent Markov chain to the infill asymptotics on a fixed time interval. Indeed, in the very special case that $(X_t)_{t\geq 0}$ is started in the true parameter $X_0=ρ_0$, the process $(X_t-ρ_0)_{t\geq 0}$ is shown to possess a desirable distributional self-similarity. On basis of the strong Markov property, the artificial constellation of starting in $ρ_0$ is finally overcome by a coupling argument.

fields
Statistics Theory, Probability
pdf ↗ page arXiv:2604.25368 ↗

In this paper, we define and study $S$-Noetherian lattices as a natural generalization of Noetherian rings. We prove that a ring $R$ is $S$-Noetherian if and only if its ideal lattice, $Id(R)$, is $S_L$-Noetherian. Furthermore, we establish a Cohen-Kaplansky type theorem for $S$-Noetherian lattices, showing that $L$ is $S$-Noetherian if and only if every $S$-prime element of $L$ is $S$-compact. Finally, we introduce the concept of $S$-primary elements - a generalization of primary elements in multiplicative lattices and demonstrate the existence (when every element of $S$ is meet principal, as is the case for the ideal lattice of a ring) and uniqueness of $S$-primary decomposition in $S$-Noetherian lattices.

comments
The authors thank Professor Akiyoshi Sannai of Kyoto University for identifying a gap in the earlier version of Theorem 2.15, implication $(3) \implies (4)$, using AI Math Referee, a mathematical auditing tool under development by him. The Second S-Uniqueness Theorem has also been established, along with several additional results
fields
Commutative Algebra
pdf ↗ page arXiv:2604.26058 ↗

For the boundary value problem $$\left\{ \begin{array}{rcll} -Δ_p u+u^{p-1}&=&|x|^αu^{q-1}&\mbox{in }Ω,\\ \frac{\displaystyle\partial u}{\displaystyle\partial{\bf n}}&=&0&\mbox{on }\partial Ω, \end{array}\right. $$ in the unit ball $Ω$, we investigate the properties of the positive radial solution. It is known, that for $1<p<n$, $\frac{(n-1)p}{n-p}<q<\frac{np}{n-p}$ and sufficiently large $α$ this solution does not provide global minimum to the corresponding energy functional, see [M. Gazzini, E. Serra, 2008] for $p=2$ and [A.P. Shcheglova, 2018] in general case. Nevertheless, it is shown in [M. Gazzini, E. Serra, 2008] that for $n\ge 4$, $p=2$, $2<q<\frac{2n}{n-2}$ and sufficiently large $α$ the radial solution is at least a local minimizer of the energy functional. We partially generalize this result. Namely, let $n\ge4$ and let $p>2$ be sufficiently close to $2$. Then for all $p<q<\frac{np}{n-p}$, for sufficiently large $α$ the second variation of the energy functional is positive. The same holds true for all $2<p<n$ if $q>p$ is sufficiently close to $p$. In this version, some gaps and misprints are fixed.

comments
22 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2604.26286 ↗

We develop a Wilsonian description of perturbative D-terms in 4d $\mathcal N=1$ gauge theories on $\mathbb R^3\times S^1$ with chiral Kaluza–Klein spectra. A closed-form, one-loop-exact coefficient of the auxiliary D fields, including 4d Fayet–Iliopoulos parameters and globally valid throughout the holonomy space, determines the leading holonomy potential away from massless thresholds. We establish uniform weak-coupling control there and match across thresholds by retaining the light fields. Gauge-anomaly cancellation renders the Coulomb-slice vacuum equations affine within each chamber bounded by the thresholds, enabling exact linear analysis of their zero sets and numerical reconstruction through DBSCAN clustering of approximate zeros, LPCA denoising, and RANSAC hyperplane detection. Complementing the rank-one applications of the accompanying Letter, we study flavor-twist dependence in the $\mathrm{SU}(2)$ $\mathcal N=4$ theory, and illustrate the numerical reconstruction in higher-rank R-twisted Argyres–Douglas reductions of interest in the SCFT/VOA correspondence. We also relate the same D-term data to leading stationary-phase equations of supersymmetric partition functions and a decompactification limit of the torus twisted superpotential.

comments
v2: the abelian example moved to the companion letter, criteria for perturbative control strengthened, A1A4 and A1A7 examples added including strong-coupling IR data for completeness in the A1A4 case. v3: minor improvements and an ancillary Mathematica notebook
fields
Mathematical Physics
pdf ↗ page arXiv:2604.27066 ↗

Orthogonal frequency-division multiplexing (OFDM) and its sinusoidal subcarriers have underpinned the 4G and 5G eras, delivering high spectral efficiency and resilience to multipath fading through an efficient multicarrier architecture. However, as future systems move toward doubly dispersive environments driven by high-mobility applications and migration to mmWave/sub-THz bands, the time-invariance assumption underlying OFDM becomes increasingly difficult to maintain, and Doppler-induced degradation becomes prominent. While enhancements such as MIMO, advanced coding, and scheduling provide incremental remedies, they introduce additional overhead, because the sinusoidal subcarrier itself offers no inherent waveform-level robustness to Doppler impairments. Accordingly, two time-frequency spreading philosophies have emerged to improve Doppler resilience by distributing each symbol's energy across both dimensions of the time-frequency plane: (i) 2D isotropic spreading via the delay-Doppler (DD) domain, exemplified by the orthogonal time frequency space (OTFS) family, and (ii) sheared spreading via parameterizable chirps, exemplified by the affine frequency-division multiplexing (AFDM) family. In this article, we examine key considerations for future waveform design across these paradigms and argue that transitioning from the sinusoidal subcarriers of OFDM to the chirp-based subcarriers offers a viable design direction for improving Doppler robustness while retaining much of the mature OFDM infrastructure. This perspective also highlights the suitability of chirp-based waveforms for integrated sensing and communications (ISAC) and their extensibility to emerging physical-layer techniques. Overall, we argue that the transition from sinusoids to chirps is a technically motivated, compelling evolutionary direction for future wireless physical layer design.

fields
Information Theory
pdf ↗ page arXiv:2605.00249 ↗

Spectral graph sparsification is a classical tool for reducing graph complexity while preserving Laplacian quadratic forms. In graph neural networks (GNNs), sparsification is often used to accelerate computation while maintaining predictive performance. In this work, we study a complementary representation-level question: does sparsification preserve the geometry of learned embeddings? For polynomial-filter GNNs, we prove that any $ε$-spectral sparsifier induces $O(ε)$ perturbations in polynomial graph filters, multilayer hidden representations, and their Gram matrices. These guarantees imply stability of squared pairwise distances, class means, and covariance structure in embedding space. We further establish finite-time training stability: under smoothness and boundedness assumptions, gradient descent on dense and sparsified graphs produces weight trajectories whose separation grows at most proportionally to the sparsification distortion. Empirically, effective-resistance sparsification validates the predicted perturbation chain on synthetic graphs and preserves hidden representation geometry on real datasets. In our experiments, the gram matrix and training dynamics show low divergence even under substantial sparsification, consistent with the predicted stability under spectral sparsification. Hidden Gram preservation strongly predicts neighborhood preservation and class-centroid stability across FashionMNIST, Cora, and Paul15. Together, these results show that spectral sparsification preserves not only graph operators, but also the representation geometry that supports downstream use of GNN embeddings for interpretability.

comments
9 pages, 4 figures, Accepted Neurips 2026
fields
Spectral Theory
pdf ↗ page arXiv:2605.01136 ↗

Quantum error correcting codes are essential to achieve fault-tolerant quantum computation. This work introduces two constructions of high-rate, dual-containing (DC) Calderbank–Shor–Steane low-density parity-check (LDPC) codes based on quasi-dyadic matrices. We characterize the automorphism group of such codes, investigate their minimum distance behavior, and provide several theoretical results on their cycle properties. Monte Carlo simulations under depolarizing and phenomenological noise show better finite-length logical error rates than the considered DC benchmark codes and competitive performance against several state-of-the-art quantum LDPC code families. Finally, we employ an automorphism-ensemble belief propagation decoder to improve their decoding performance.

comments
16 pages, Journal paper
fields
Information Theory
pdf ↗ page arXiv:2605.03631 ↗

Locally repairable codes (LRCs) have attracted considerable attention owing to their pivotal role in distributed storage systems. Since binary linear LRCs can significantly reduce the complexity of both encoding and decoding, the construction of binary LRCs has drawn extensive research interest. In this paper, we construct binary LRCs with locality $r=2$ and disjoint local repair groups via classical concatenation, where the outer codes are linear codes over $\mathbb{F}_4$ and the inner code is the binary $[3,2,2]$ linear code. We present a systematic approach for selecting outer codes to obtain LRCs attaining specified bounds, and show that the weight distributions of the resulting binary LRCs are determined by those of the selected outer codes. Under certain sufficient conditions, we construct several classes of optimal binary LRCs, including those attaining Griesmer-type bounds and binary perfect LRCs. Furthermore, we sharpen the Johnson-like bounds of Ma and Ge for binary LRCs with locality $r=2$ and disjoint local repair groups, and define nearly perfect binary LRCs and $k$-optimal binary LRCs with respect to the improved bounds. We show that nearly perfect binary LRCs can be constructed via concatenation when the outer codes are nearly perfect linear codes over $\mathbb{F}_4$. Finally, we present several examples of such nearly perfect and $k$-optimal binary LRCs.

comments
Revised several proofs and added two examples attaining the refined dimension bound at parameters where it is strictly tighter than the Ma-Ge bound
fields
Information Theory
pdf ↗ page arXiv:2605.04618 ↗

Generative compressed sensing uses the range of a pretrained generator as a nonlinear model for recovering structured signals from limited measurements. We study a conditional version of this problem for image recovery from subsampled Fourier measurements using prompt-conditioned generative models. Our framework separates two roles of conditioning: the prompt used to design the sampling distribution and the prompt used to define the recovery model. For ReLU and Lipschitz conditional generators, we prove stable recovery bounds showing that prompt-matched Christoffel sampling retains the same Christoffel complexity constant as existing near-optimal generative compressed sensing theory, while prompt mismatch incurs an explicit compatibility penalty. Experiments with Stable Diffusion show that prompts meaningfully reshape Christoffel sampling distributions and influence image recovery. Overall, our results suggest treating prompts as design variables for sensing, approximation, and recovery, opening new directions for the practical use of conditional generative models in compressed sensing, where conditioning, sampling, and optimization must be considered jointly.

comments
45 pages, including appendices. Accepted at NeurIPS 2026; camera-ready version
fields
Numerical Analysis
pdf ↗ page arXiv:2605.05435 ↗

Simulated annealing follows a path of distributions from an easy initial law to a target. Standard analyses require rapid mixing at every fixed temperature, which can fail for multimodal targets even when annealing succeeds. Motivated by the continuous optimal-transport analysis of annealed Langevin dynamics by Guo, Tao, and Chen (ICLR 2025), we develop a discrete optimal-transport framework for finite-state annealing. The discrete action of the path integrates the minimum electrical energy needed to route the demand $-\partial_sπ_s$ through the chain's transition capacities. Like a path-dependent inverse conductance, it penalizes a bottleneck only when the path must move mass across it. We also introduce weak action, which leaves an $\varepsilon$ amount of this motion unrouted. Up to initialization error, action $\mathcal A$ gives reverse-KL error at most $\mathcal A/(4T)$ after $T$ expected updates, while weak action gives TV error at most $\varepsilon+\sqrt{\mathcal A^{w}_\varepsilon/(8T)}$. Paralleling canonical paths and Poincaré inequalities, we develop flow and spectral bounds, showing that pathwise (weak) Poincaré inequalities imply (weak) action bounds. We also show that a weak Poincaré inequality yields a genuine one after removing a small amount of mass. As a pathwise analogue of chain decomposition, we obtain a componentwise algorithm for mixtures with phase weights supplied at initialization. Applications include mean-field Ising and Potts models and bipartite spin systems. For every fixed $δ>0$, we give a polynomial-time single-site annealing sampler for uniform independent sets in $(d,D)$-biregular bipartite graphs with $D/d\geq1+δ$ and large $D$. To our knowledge, this is the first polynomial-time sampler requiring only a fixed multiplicative degree imbalance, strictly extending the $D\geq7d\log d$ regime of Cannon and Perkins (SODA 2020).

fields
Probability
pdf ↗ page arXiv:2605.05877 ↗

In this paper, we introduce INEUS, a meshfree iterative neural solver for partial integro-differential equations (PIDEs). The method replaces the explicit evaluation of nonlocal jump integrals with single-jump sampling and reformulates PIDE solving as a sequence of recursive regression problems. Like Physics-Informed Neural Networks (PINNs), INEUS learns global solutions over the entire space-time domain, yet it offers a more efficient treatment of nonlocal terms and avoids the computationally expensive differentiation of full PIDE residuals. These features make INEUS particularly well suited for high-dimensional PDEs and PIDEs. Supported by a contraction-based convergence proof for linear PIDEs, our numerical experiments show that INEUS delivers accurate and scalable solutions for various high-dimensional linear and nonlinear examples.

comments
NeurIPS 2026
fields
Numerical Analysis
pdf ↗ page arXiv:2605.06281 ↗

Despite an ever-increasing interest in topological deep learning models that target higher-order datasets, there is no consensus on how to evaluate such models. This is exacerbated by the fact that topological objects permit operations, such as structural refinements, that are not appropriate for graph data. In this work, we extend MANTRA, a benchmark dataset containing manifold triangulations, to a larger class of manifolds with more diverse homeomorphism types. We show that, contrary to prior claims, graph neural networks can saturate the benchmark, while higher-order message passing methods lag behind. However, we find that this is contingent on the right representation and feature assignment, emphasizing their importance in baseline models. Hence, we present a novel evaluation protocol based on representational diversity and triangulation refinement. Even when including refinement-like changes in the training data, existing models fail to generalize beyond the combinatorial structure of the data. This points towards a research gap in developing models that understand topological structure independent of scale. Our work thus provides the necessary scaffolding to evaluate future models and enable the development of topology-aware inductive biases.

comments
Accepted at the 40th Conference on Neural Information Processing Systems (NeurIPS) 2026. Our code is available at https://github.com/aidos-lab/mantra-pp-benchmarks
fields
Algebraic Topology
pdf ↗ page arXiv:2605.06467 ↗

The Kuramoto model is a paradigmatic model of collective synchronization in coupled oscillator systems. Although its mathematical properties have been extensively investigated, explicit phase trajectories from arbitrary initial conditions have been available only for the simplest case, N = 2. In this study, we provide a global analytical solution for the phase trajectories of the all-to-all coupled Kuramoto model with three identical oscillators (N = 3). We construct Koopman eigenfunctions from products of observables whose growth rates, weighted by the exponents, sum to a constant, and obtain a nontrivial constant of motion from the ratio of two such eigenfunctions. Using their explicit exponential time dependence, we reduce trajectory reconstruction to time-dependent quartic equations and recover the phase trajectories. The same construction also yields Koopman eigenfunctions for the Kuramoto-Sakaguchi model with arbitrary phase lag and for the N = 4 all-to-all and ring-coupled systems. These results provide a concrete example in which Koopman eigenfunctions are used not only to characterize but also to explicitly solve a widely studied nonlinear model.

comments
36 pages, 5 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2605.07360 ↗

Agents built on large language models (LLMs) rely on reliability techniques such as retry, majority voting, and self-consistency developed in parallel rather than within a common analytical framework. We observe that an LLM sampled at temperature $T$ is a discrete stochastic channel $p(y \mid x)$ in the sense of Shannon's coding theory, and use this identity as the entry point for such a framework. Each of these techniques is a special case of one of six classical reliability operators: diversity combining, hybrid retransmission, iterative generator-critic decoding, rateless sampling, structured redundant verification, and difficulty-adaptive routing. Within the framework we give two closed-form results, a noise-variance threshold above which uniform averaging beats quality-weighted averaging and a contractivity criterion for generator-critic refinement, and turn each into a design rule checkable before committing compute. We further introduce a cost-aware semantic-nearest-neighbor router whose single Lagrangian knob traverses the quality-cost frontier without retraining. Across six local and cloud channel configurations, no fixed model-technique-budget choice dominates. On a 300-item hard split of MMLU, GSM8K, and HumanEval, the router occupies the empirical Pareto frontier: at matched quality its normalized cost is $\approx$56% lower than the best fixed technique, and at matched cost it improves quality by $\approx$7% (26% over single-shot decoding). Judge-free grading of 6,900 outputs confirms that the judge tracks correctness at the item level and that the router's advantage over a fixed policy persists at most cost settings; with internal reasoning enabled, the gain of external refinement shrinks but remains significant for our incremental-redundancy operator. These results argue for consolidating reliability techniques into a single tunable layer informed by channel coding.

comments
Accepted at NeurIPS 2026 (camera-ready version). 76 pages, 39 figures, 23 tables
fields
Information Theory
pdf ↗ page arXiv:2605.09121 ↗

\emph{Kullback-Leibler} (KL) regularization is ubiquitous in reinforcement learning algorithms in the form of \emph{reverse} or \emph{forward} KL. Recent studies have demonstrated $ε^{-1}$-type fast rates for decision making under reverse KL regularization, in contrast to the standard $ε^{-2}$-type sample complexity. However, for forward-KL-regularized objectives, existing statistical analyses are either not applicable or result in $\tilde{O}(ε^{-2})$ slow rates. We take the first step towards addressing this problem via a streamlined analysis of forward-KL-regularized offline CBs. We give the first $\tilde{O}(ε^{-1})$ upper bounds in tabular and general function approximation settings, both under notions of \emph{single-policy concentrability}. In particular, our convex-analytical pipeline unifies these settings by exploiting the pessimism principle in a novel way and completely bypasses the proof routines in previous works based on the mean value theorem, which might be of independent interest. Moreover, we provide rate-optimal lower bounds, manifesting the tightness of our upper bounds in terms of statistical rates. Our lower bounds also demonstrate that the forward-KL-regularized sample complexity recovers the unregularized slow rate in the low-regularization regime, similarly to the reverse-KL regularization.

comments
36 pages, camera-ready version, fixed a compilation issue
fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2605.09214 ↗

Distributional causal inference requires estimating not only average treatment effects but also interventional outcome distributions, including quantiles, tail risks, and policy-dependent uncertainty. As a method for distributional causal inference, generative adversarial network (GAN)-based counterfactual methods are flexible tools for this task. However, these methods have several limitations. First, the objectives of certain techniques do not coincide with the statistical risk of the identifiable causal target, and therefore provide limited theoretical guarantees regarding estimable counterfactual distributions or optimality. Second, implementing target-design risks under observational sampling can require density-ratio estimation. In this paper, we propose GANICE (GAN for Interventional Conditional Estimation) with several advantages: it (i) specifies the conditional interventional distribution for each treatment–covariate state as the causal estimation target; (ii) estimates the conditional distribution such that its averaged Wasserstein risk is minimized; (iii) attains minimax optimality. GANICE achieves these advantages through the extended Wasserstein distance and cell-normalized estimation, with minimax bounds based on Wasserstein GAN oracle inequalities and an anisotropic Assouad construction; Besov theory characterizes the cellwise critics. Our experiments show that GANICE outperforms existing methods on most benchmarks.

fields
Statistics Theory
pdf ↗ page arXiv:2605.10206 ↗

We study the parameterized complexity of testing approximate first-order stationarity at a prescribed point for continuous piecewise-affine (PA) functions, a basic task in nonsmooth optimization. PA functions form a canonical model for nonsmooth stationarity testing and capture the local polyhedral geometry that appears in ReLU-type training losses. Recent work of Tian and So (2025) shows that testing approximate stationarity notions for PA functions is computationally intractable in the worst case, and identifies fixed-dimensional tractability as an open direction. We address this direction from the viewpoint of parameterized complexity, with the ambient dimension $d$ as the parameter. In this paper, we give XP algorithms in fixed dimension for the tractable sides, and prove W[1]-hardness for the complementary sides. Moreover, lower bounds under the parameterized $k$-Clique hypothesis rule out deterministic algorithms running in time $ρ(d)s^{o(d)}$ for any computable function $ρ$, where $s$ denotes the total binary encoding length of the instance. As a further consequence, our results yield the corresponding parameterized complexity picture for testing local minimality of continuous PA functions. We also extend our hardness results to a family of shallow ReLU CNN training losses, tested in the trainable weight space. Thus, the same parameterized-complexity picture also appears for simple CNN training losses. Notably, our lower bounds assume that $k$-Clique on $N$-vertex graphs admits no deterministic $ρ(k)N^{o(k)}$-time algorithm for any computable function $ρ$. The recent refutations of the Exponential Time Hypothesis (ETH) (OpenAI, 2026) and the stronger fine-grained $k$-Clique hypothesis (Vassilevska Williams and Zamir, 2026) do not contradict this assumption.

comments
2:46 Accepted at NeurIPS 2026. 29 pages. This revision states the conditional lower bounds directly under the parameterized k-Clique hypothesis, which is not contradicted by the recent refutations of ETH and the stronger fine-grained k-Clique hypothesis
fields
Optimization and Control
pdf ↗ page arXiv:2605.10219 ↗

Neural Sheaf Diffusion (NSD) learns a task-adapted sheaf geometry for node classification. We connect the study of these learned geometries with Geometric Invariant Theory (GIT) to analyse their representation-theoretic structure and develop mechanisms for geometric control during training. Identifying cellular sheaves with representations of the incidence quiver connects direct-sum decompositions to the harmonic space and motivates the study of trivial or low-complexity summands as potential degeneration modes. We make this perspective concrete by focusing on the trivial representation: on an embedded copy, the sheaf Dirichlet energy reduces to weighted scalar graph energy. The GIT stability framework provides a criterion for excluding such copies within the semistable class. Using its moment-map characterisation of polystability, we construct differentiable surrogates that encourage the corresponding balance conditions. We identify an equal-stalk obstruction to assigning a destabilising weight to the trivial representation and show how nonuniform stalk dimensions remove it. Controlled energy-minimisation experiments reproduce trivial-component formation, while native feature-conditioned NSD experiments on heterophilic graphs show how moment-map regularisation changes the balance and Dirichlet-energy trajectories of learned geometries during training, alongside their classification behaviour.

comments
Accepted to NeurIPS 2026. Camera-ready version
fields
Representation Theory
pdf ↗ page arXiv:2605.11178 ↗

Average-reward reinforcement learning requires estimating the gain and a state-dependent bias, which solves the Poisson equation only up to an additive constant. Distributional analogues of the bias inherit this same ambiguity. We introduce a quotient-space formulation in which state-indexed laws are identified up to a common translation, together with a categorical parameterization that respects this symmetry. On this space, we define a projected average-reward distributional operator and show that it is well-defined, non-expansive in a coordinate Cramér metric, and admits fixed points. We interpret the projected fixed points through geometrically-stopped differential returns, whose categorical operators are contractive and whose fixed points converge in the Abel sense to a canonical fixed point of the projected undiscounted operator. We show that the means of the projected fixed points match the scalar bias up to an error caused by endpoint clipping of the categorical projections, and we bound this error. Finally, we establish almost-sure convergence and finite-iteration residual bounds for temporal-difference recursions with gain-centered rewards under i.i.d. and Markovian sampling. When the gain is unknown, we couple the recursion with an online gain estimator and prove the same guarantees under Markovian sampling, with a bound on the gain error.

comments
39 pages, 4 figures. To be presented at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2605.11289 ↗

A family of subsets of a $t$-set is a \emph{$d$-cover-free family} or $d$-CFF if no subset in the family is contained in the union of any $d$ other subsets. Let $t(d, n)$ denote the minimum $t$ for which there exists a $d$-CFF on a $t$-set with $n$ subsets. Since a $1$-CFF is the same as a Sperner family, using Sperner's theorem, we get $t(1, n) \sim \log_{2}(n)$ as $n$ grows. Erdös, Frankl, and Füredi (JCTA, 1982) proved that $3.106\log_{2}(n) < t(2,n) < 5.512\log_{2}(n)$. This paper focuses on generalizing $1$-CFF and $2$-CFF using a graph $G$ where vertices correspond to subsets in the set system. A $G$-Sperner$(t, n)$ is a family of subsets of a $t$-set such that each edge of $G$ specifies a pair of subsets not contained in each other, where as a $G$-CFF$(t, n)$ is a family of subsets of a $t$-set such that it is $G$-Sperner and the union of a pair of subsets corresponding to each edge of $G$ does not contain any other subset in the family. Let $t_s(G)$ and $t(G)$ denote the minimum $t$ for which there exist a $G$-Sperner$(t, n)$ and a $G$-CFF$(t, n)$, respectively. In this way, $t_s(K_n) = t(1, n)$ and $t(K_n) = t(2, n)$. Firstly, we prove $t_s(G) = t(1, χ(G))$ for any simple graph $G$ and provide various upper and lower bounds for $t(G)$. The \emph{trivial bound}, $t(1, n) \leq t(G) \leq t(2, n)$ holds for any simple graph $G$ with no isolated vertex, with the lower bound tight for an infinite family of star graphs and the upper bound tight for complete graphs. We study when these bounds can be improved and give better constructive upper bounds for families of graphs such as stars, paths, cycles, wheels, and windmill graphs. In particular, a construction based on mixed-radix Gray codes yields $\log_{2}(n) \leq t(P_n) \leq t(C_n) \leq 1.893\log_{2}(n) + \mathcal{O}(1)$ where $P_n$ and $C_n$ are paths and cycles with $n$ vertices.

fields
Combinatorics
pdf ↗ page arXiv:2605.12634 ↗

This paper studies indefinite stochastic linear-quadratic (LQ) optimal control for jump-diffusion systems with random coefficients. We construct an algebraic inverse flow from the zero-control base system, extract the semimartingale kernel of the value function, and prove that it satisfies a generalized stochastic Riccati equation with jumps (SREJ). Under a uniform convexity condition, we establish the existence and uniqueness of open-loop optimal controls for any initial pair and show that the associated matrix $\mathscr{N}(t)$ is uniformly positive definite, yielding an exact closed-loop feedback representation of the optimal control via the SREJ. A distinguishing feature of our approach is that it requires neither relaxation techniques (as in the compensator method) nor additional invertibility assumptions on the optimal state process, and it accommodates the general case where the control enters the jump part ($F \neq 0$). As an application, we analyze a financial portfolio problem with a jump-diffusion risky asset whose excess return is zero, where the investor minimizes a cost functional with a negative terminal wealth weight. The uniform convexity condition reduces to an explicit inequality among the risk aversion coefficient, volatility, jump magnitude, and risk-free rate, thereby delineating the parametric region in which an optimal strategy exists. These results extend classical indefinite LQ theory to jump-diffusion systems with random coefficients.

fields
Optimization and Control
pdf ↗ page arXiv:2605.12775 ↗

Objectives involving quadratic forms $u^*f(A(θ))u$ for Hermitian $A$ arise widely in scientific computing and machine learning. Lanczos efficiently approximates these quantities, but differentiating through its recurrence can introduce numerical instability and costly reorthogonalization. Building on existing low-rank Krylov approximations of Fréchet derivatives, we develop a matrix-free gradient implementation that reuses the forward Lanczos quantities without differentiating through the recurrence. We analyze its discrepancy from the exact gradient of the finite Lanczos approximation, deriving an exact residual-coupled error identity and a bound involving the best degree-$(m-1)$ uniform polynomial approximation error of $f'$, multiplied by a basis-sensitivity factor. The discrepancy vanishes when the Krylov subspace is invariant. Experiments demonstrate accurate gradients and runtime improvements over differentiated-Lanczos and modified-Arnoldi baselines. It remains numerically stable without reorthogonalization in all tested settings, including cases where adjoint-based Lanczos differentiation becomes unstable.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.12801 ↗

In this paper, we study some properties of Connes spectral distances between quantum states under unitary transformations. We mainly focus on spectral triples with matrix algebras acting on finite-dimensional Hilbert spaces via unital representations. We find that there is a direct correspondence between the Lipschitz unit sphere and the set of optimal elements of finite Connes spectral distances. Quantum trace distance is one of the most important unitarily invariant distance measures. We prove that for any finite-dimensional matrix algebra, there exist finite-dimensional spectral triples for which the Connes spectral distances coincide with the quantum trace distances between quantum states. We also construct finite-dimensional spectral triples in which the Lipschitz seminorm coincides with the operator norm for traceless Hermitian elements, and the Connes spectral distances between one-qubit states are exactly the quantum trace distances. These results provide a better understanding of the unitary invariance of Connes spectral distance and the relationships between Connes spectral distance and other quantum distance measures. These concrete examples are valuable for studying the geometric structures of finite spectral triples and mathematical relations of qubits and other quantum states in the framework of noncommutative geometry.

comments
Added Theorem 2 and Corollary 1, revised Theorems 6, 7, 8 and their proofs, and corrected some errors
fields
Mathematical Physics
pdf ↗ page arXiv:2605.13014 ↗

A $k$-matching in a graph $G$ is defined as a function $f:E(G) \rightarrow \{0,1,\ldots,k\}$ satisfying $\sum_{e\in E_G(v)} f(e)$ $\leq k$ for each vertex $v\in V(G)$, where $E_G(v)$ denotes the set of edges incident to $v$ in $G$. For $1\leq d\leq k$ and $d \equiv |V(G)|~(\mathrm{mod}~2)$, if for any $ v \in V(G)$, there exists a $k$-matching $f$ such that $\sum_{e\in E_G(v)}f(e)=k-d$ and $\sum_{e\in E_G(u)}f(e)=k \text{ for any } u\in V(G)-\{v\}$, then $G$ is $k$-$d$-critical. A graph $G$ of odd order (resp. even order) is generalized factor-critical (resp. generalized bicritical) if the empty set is the unique set attaining the maximum value in $k$-Berge-Tutte-formula of $G$. In this paper, we provide sharp sufficient conditions in terms of size or spectral radius respectively for a graph $G$ to be $k$-$d$-critical, generalized factor-critical and generalized bicritical with minimum degree.

fields
Combinatorics
pdf ↗ page arXiv:2605.13198 ↗

A set $\cG$ of $n$ integers is called a $g$-Golomb ruler if the difference between any two distinct elements of $\cG$ is repeated at most $g$ times. If $g=1$, these are also called $B_2$-sets, Sidon sets, and Babcock sets. We define $G(g,n)$ to be the minimum diameter of a $g$-Golomb ruler with $n$ marks. In this paper, we prove that for every $ε>0$ and all sufficiently large positive integers $b$, if $g\ge(π/3+ε)b^{3/2}$, then $G(g,g+b)=g+2b-2$. Explicit thresholds are given for $b\le251$. The main technique is through an arithmetic property of the integers that are \emph{not} in a $g$-Golomb ruler, leading us to introduce LM rulers, a class of rulers where every positive integer distance $d$ occurs as a difference at most $d-1$ times. Writing $L(n)$ for the minimum diameter of an $n$-element LM ruler, we prove $L(n)\ge\sqrt{8/9}\,(n-1)^{3/2}$ for every positive integer $n$ and, using a Farey construction, $L(n)\le(π/3+o(1))n^{3/2}$ as $n\to\infty$. We also provide computationally verified optimal LM rulers for every $1\le n\le250$.

comments
15 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2605.14229 ↗

Nearest-neighbor methods are fundamental to classical and modern machine learning, yet their geometric properties are typically analyzed under independent sampling. In this paper, we study the nearest-neighbor radii under dependent sampling. We consider strong mixing dependent observations and ask whether dependence changes the scale of nearest-neighbor neighborhoods. We establish distribution-free almost sure convergence under polynomial mixing and sharp non-asymptotic moment bounds under geometric mixing. The moment bounds depend on the local intrinsic dimension rather than the ambient dimension, making the results applicable to high-dimensional data supported on lower-dimensional manifolds. Synthetic experiments and real-world time-series benchmarks illustrate the theory, showing that nearest-neighbor geometry remains informative under dependent sampling.

comments
Accepted to 40th Conference on Neural Information Processing Systems (NeurIPS 2026)
fields
Statistics Theory
pdf ↗ page arXiv:2605.14343 ↗

Neural surrogate solvers of partial differential equations (PDEs) promise dramatic speedups over numerical methods, especially in scenarios requiring many solves. However, current accuracy-based evaluations do not fully consider two central issues: (1) neural solvers incur substantial up-front costs for data generation, training, and tuning; and (2) classical solvers can also generate low-fidelity solutions at a sufficiently low simulation cost. To explicitly account for these realities and fully incorporate end-to-end costs, we propose an evaluation framework centered on breakeven complexity, a metric that counts the forward solves before a learned solver is cost-effective relative to an error-equivalent traditional solver. To evaluate this measure, we apply scaling laws to determine how much training budget to allocate to data generation and discuss how to achieve smooth error-matching in diverse settings. We evaluate the breakeven complexity of multiple neural PDE solvers on three PDEs on 2D periodic domains from APEBench and a novel benchmark of flows past multiple obstacles generated by the GPU-native PyFR code. Among other findings, our results suggest that neural PDE solvers become more effective as problems get harder in terms of cost, dimension, rollout, physics regime (e.g. higher Reynolds number), etc.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.15399 ↗

We study projection-free optimization for convex objectives that satisfy abs-smoothness, a structural property that captures many non-smooth yet piecewise smooth functions arising, e.g., in modern machine learning models. We develop a unified framework for Abs-Smooth Frank-Wolfe methods, establishing a clean primal-dual analysis that guarantees convergence without requiring classical smoothness assumptions. Our framework extends the available results in two important directions. First, we introduce a heavy ball momentum variant and show that momentum can be incorporated naturally under abs-smoothness while preserving convergence guarantees. Second, we analyze inexact minimization oracles, demonstrating robustness to approximate inner solutions. Moreover, we relax the full convexity assumption and study the case where convexity holds only for the piecewise linear approximations of the objective, further broadening the applicability of conditional gradient methods to a wider class of non-smooth problems.

comments
v2: updated with reviewer feedback
fields
Optimization and Control
pdf ↗ page arXiv:2605.19828 ↗

In 1991 Bollobás and Frieze found the threshold for the emergence of a spanning triangulation of a triangle in the binomial random graph, up to a logarithmic factor. In this paper, we find the threshold probability for the emergence of a spanning triangulation of a $k$-gon for any $3\leq k\leq n$, up to a constant factor.

comments
20 pages, 6 figures
fields
Combinatorics, Probability
pdf ↗ page arXiv:2605.20361 ↗

We determine the $L^p$ spectrum, $1<p<\infty$, of the Stokes operator $A=-\PP\LD$ on divergence-free vector fields of hyperbolic 3-space of curvature $-a^2$, where $\LD=Δ_B+\Ric$ is the Ebin-Marsden deformation Laplacian and $\PP$ is the Leray projector. The spectrum is the parabolic region $a^2\{4+z^2:\ z\in\C,\ |\im z|\le|1-2/p|\}$. For $p>2$ every interior point is an eigenvalue, realized by an explicit family of divergence-free swirl fields which leave $L^p$ exactly at the boundary of the region. It follows that the Stokes semigroup on $\Lp$ has exponential type exactly $-μ_p$ with $μ_p=a^2\bigl(4-(1-2/p)^2\bigr)$. At $p=3$ this is $35a^2/9$, which lies strictly above the rates $26a^2/9$ and $10a^2/3$ that follow from pointwise domination by the scalar heat semigroup and from interpolation, and strictly below the $L^2$ gap $4a^2$. For the Navier-Stokes equations with small data in $L^3$, whose global solvability on $\HH^3$ is due to Pierfelice, the solutions decay in $L^3$ and in $L^6$ at every rate below $μ\cdot35a^2/9$, where $μ$ is the viscosity, and no faster rate holds for the linearized flow. The exponent $3$ is the usual scaling threshold. Curvature fixes the time scale of the decay and introduces no new threshold.

comments
15 pages
fields
Mathematical Physics, Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2605.22212 ↗

We identify topological symmetric homology as the free $\mathbb{E}_\infty$-algebra on an $\mathbb{E}_1$-algebra and topological braid homology as the free $\mathbb{E}_2$-algebra on an $\mathbb{E}_1$-algebra. In this way, topological symmetric homology and topological braid homology can be regarded as variants of $1$-dimensional representation homology. In order to identify topological braid homology as the free $\mathbb{E}_2$-algebra on an $\mathbb{E}_1$-algebra, we prove that the $\mathbb{E}_2$-monoidal envelope of the associative operad can be identified with the braided crossed simplicial group. Using this, we also compute the topological braid homology of grouplike $\mathbb{E}_1$-spaces. Further, we develop computational tools for topological symmetric and braid homologies. These tools allow us to perform low-degree computations of topological symmetric homology and prove that it is not Morita invariant. We also compute the topological $Δ\mathbf{G}$-homology of Thom spectra in general and produce explicit formulas in the case of topological symmetric and braid homologies.

comments
Final version to appear in the Proceedings of the Abel Symposium 2025
fields
Algebraic Topology, Category Theory, K-Theory and Homology
pdf ↗ page arXiv:2605.22946 ↗

We study finite set-theoretic intersections of tropical curves with tropical hypersurfaces. An elementary divisor argument bounds their cardinality by the weighted sum of the Newton support function over the unbounded directions of the curve, without a transversality hypothesis. For tropical lines the bound is $h_Δ(1,\dots,1)+\sum_i h_Δ(-e_i)=n!\,\MV(Δ,Σ,\dots,Σ)$. Explicit examples show that neither the $\ell^1$-diameter nor the support cardinality minus one gives a corresponding bound for tropical lines. We also record width refinements of the classical-line estimate of Lang, Shapiro and Shustin. A self-contained account of the standard transverse multiplicity formulas explains the role of saturated normal lattices and mixed-cell volumes. Finally, applying the tropical Bernstein theorem to locally independent subsystems gives a mixed-volume bound for the regular transverse locus of a redundant system. An example shows why a fixed subsystem need not compute the count on the whole redundant intersection.

comments
15 pages, all comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2605.24966 ↗

We extend Stein's method to include a prescribed dependence with respect to an auxiliary random variable, for conditional laws for which Stein characterizations do exist. This considerably extends the range of applications of Stein's method. The characterization we derive subsumes the case of independent random variables. Using the Malliavin calculus, we illustrate our extension on the example of a conditionally Gaussian/Beta-distributed random variable.

comments
13 pages
fields
Probability
pdf ↗ page arXiv:2605.25206 ↗

Firmly nonexpansive operators arise naturally as resolvents of monotone operators and as generalizations of projections and proximal mappings in convex optimization and fixed point theory. While their iterates are known to converge weakly to a fixed point, strong convergence is not guaranteed (Genel and Lindenstrauss, 1975). Strong convergence of Cesàro means of iterates is also known to fail for general nonlinear nonexpansive mappings (Krengel and Lin, 1987). In this paper, we show that this failure persists in the much smaller class of firmly nonexpansive mappings. Using suitable meshes, we construct a new explicit family of counterexamples in infinite-dimensional Hilbert spaces with the origin as the unique fixed point. In the harmonic case, the Cesàro means of the iterates remain bounded away from the origin. Another variant yields Cesàro means that converge strongly to the origin. A third variant presents Cesàro means whose norms oscillate in the sense that their liminf is zero while their limsup is positive. Thus the strong convergence conclusion in von Neumann's linear mean ergodic theorem does not extend to Baillon's nonlinear mean ergodic theorem, even for firmly nonexpansive mappings.

fields
Optimization and Control, Functional Analysis
pdf ↗ page arXiv:2605.25491 ↗

We study how much a linear program (LP) or an integer program (IP) can be compressed when solved repeatedly over a fixed feasible region with varying objective coefficients. We provide a framework that compresses LP and IP formulations with guarantees on the probability of preserving optimality, using either an uncertainty set for the cost vector or historical samples. Our framework exposes a tunable tradeoff between compression and the probability of recovering an optimal solution. We characterize the minimum dimension of affine reformulations preserving the full optimizer set over a given cost region and provide sample-based learning algorithms with fast-rate guarantees, without requiring a nondegeneracy assumption for LPs. With high confidence over the training data, the learned reformulation preserves the optimizer set for an independent test cost with probability at least $1-ρ-\widetilde{O}(d^\star_ρ/\hat n)$, where $ρ$ bounds the excluded probability mass, $d^\star_ρ$ is the retained region's decision-relevant dimension, and $\hat n$ is the number retained from $n$ training samples. Existing data-driven approaches to LP and IP reduction do not, to our knowledge, learn a single low-dimensional affine reformulation with a prescribed probability of preserving the full optimizer set. Experimental results show substantial improvements over the compared baselines in accuracy, sample efficiency, and computational speed.

comments
Accepted at NeurIPS 2026. 32 pages, 11 figures
fields
Optimization and Control
pdf ↗ page arXiv:2605.25635 ↗

The classical tail dependence coefficient (TDC) may fail to capture non-exchangeable features of bivariate tail dependence since it evaluates the underlying copula only along the diagonal. To address this limitation, several measures of strongest manifestation of tail dependence have been proposed in the bivariate case, including a measure based on the tail copula of the underlying bivariate copula. This paper introduces and investigates the multivariate maximal tail concordance measure (MTCM), which extends the bivariate measure to the multivariate case. The MTCM quantifies the largest tail mass over lower hyperrectangles of common unit volume, while the associated maximizer identifies the direction of maximal tail probability. We establish fundamental properties of the MTCM in the multivariate case, including existence of an optimal direction. We also derive analytical representations for several important model classes. Closed-form expressions are further obtained for survival Marshall-Olkin copulas, Archimax and nested Archimedean copulas with regularly varying Archimedean generators. An application to trivariate annual sea-level maxima in England reveals off-diagonal stress directions and differences in extremal dependence that are not summarized by likelihood values or the TDC alone. A basis-risk analysis of a parametric insurance further shows that the fitted model with relatively low values of TDC and MTCM can nevertheless yield the most conservative risk assessment due to its non-exchangeability in the tail.

fields
Statistics Theory
pdf ↗ page arXiv:2605.25766 ↗

We study adversarial online learning with hidden-convex losses, i.e., nonconvex losses that become convex after a nonlinear reparameterization. Ghai, Lu and Hazan (2022) proved that, under geometric and smoothness assumptions, online gradient descent (OGD) on such nonconvex losses approximately simulates online mirror descent (OMD) on the underlying convex losses with a suitable regularizer, yielding $\mathcal{O}(T^{2/3})$ regret. They left open whether the optimal $Θ(\sqrt{T})$ regret from online convex optimization can be recovered in this hidden-convex setting. We answer this question affirmatively. More specifically, via a sharper discrete-time algorithmic equivalence argument, we prove that OGD achieves $\mathcal{O}(\sqrt{T})$ regret under the same assumptions, matching the optimal worst-case rate for adversarial online convex optimization. We also address another open question of Ghai, Lu and Hazan (2022) by clarifying the geometry required for this algorithmic equivalence. We replace the diagonal-Jacobian sufficient condition with a necessary-and-sufficient Hessian compatibility condition, thereby expanding the class of admissible reparameterizations. We complement our tight regret bound with a lower bound showing that OGD suffers $Ω(T)$ regret even with a stepsize of order $1/\sqrt{T}$, for a smooth Hessian incompatible reparameterization between convex domains and an adversarial sequence of hidden-convex losses. Finally, we extend our analysis to one-point bandit feedback and prove a $\mathcal{O}(T^{3/4})$ expected regret bound for bandit OGD with spherical smoothing, matching its classical rate on convex losses.

comments
NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2605.26373 ↗

Careless or insufficient-effort responding threatens the validity of self-report measurement. Mixture models for careless responding specify its form, and screening rules and robust methods depend on a threshold or tuning constant with no direct meaning in terms of careless responses. We propose ExHuber, a Bayesian method for inference on the engaged population under Huber's contamination model, in which an unknown proportion of responses comes from a contaminating distribution of unspecified form instead of the structural model. With a finite support of responses, such as the values of a scale score, a Dirichlet prior and a Beta prior on the contaminating distribution and its proportion yield a closed-form exact marginal likelihood of the structural parameters. Under a prior favoring a contaminating distribution on a few values, we show that the posterior of the structural parameters is consistent when careless responses occupy few values of the support, without knowing which values. Dynamic programming evaluates the marginal likelihood and its gradient at a cost quadratic in the sample size, which enables gradient-based sampling. Simulations from graded response models show accurate inference under straightlining and repeated response patterns, and an application to Big Five scales estimates the engaged mean of each scale.

comments
41 pages, 7 figures
fields
Statistics Theory
pdf ↗ page arXiv:2605.26723 ↗

We study the query complexity of sampling from high-dimensional Gaussian distributions using gradient information. In the standard oracle model, exact gradients expose only matrix-vector products with the precision matrix, leading to polynomial approximation barriers and a characteristic $\sqrtκ$ dependence on the known spectral range. We show that this barrier disappears when the sampler is allowed to query smoothed scores, namely gradients of the logarithms of the Gaussian-convolved densities. For a centered Gaussian target with precision matrix $Λ$, a smoothed-score query at noise level $τ$ gives access to the resolvent $(Λ+τ^{-1}I)^{-1}$. Combining geometrically spaced noise levels with sinc-quadrature rational approximation, we obtain a sampler with $q=O((\logκ+\log(e\sqrt d/δ_{\rm TV}))\log(e\sqrt d/δ_{\rm TV}))$ smoothed-score queries for total variation error $δ_{\rm TV}$, improving the condition-number dependence from $\sqrtκ$ to logarithmic. We also study finite-bit gradient oracles. Using coordinatewise quantization of the transformed smoothed-score answers and a final dithering step, we obtain a sampling scheme whose total communicated gradient information is polylogarithmic in $κ$; in particular, for fixed dimension and accuracy, the bit complexity is $O(\log^2κ)$. To complement these upper bounds, we introduce a channel-synthesis, or reverse-Shannon, converse technique for sampling lower bounds. This converts total-variation simulation guarantees into communication requirements and yields an $Ω(d\logκ)$ bit lower bound for $d\ge2$ and fixed total variation error below one, as $κ\to\infty$. Together, these results identify smoothed scores as a provably more informative oracle for sampling and give nearly matching upper and lower bounds for its finite-bit complexity.

comments
to appear in Neurips 2026
fields
Information Theory
pdf ↗ page arXiv:2605.27769 ↗

We study minimal attention-only transformers under all-token corruption and show they admit a two-stage empirical Bayes interpretation. A single attention step computes a kernel-weighted posterior mean with respect to the empirical distribution defined by the context. Depth refines this distribution through particle dynamics (Stage 1), while a long-range skip-connection carries the noisy input as a query for posterior inference (Stage 2), revealing distinct statistical roles for depth and attention residuals. The framework isolates a minimal setting in which the context itself induces a depth-dependent energy landscape governing in-context inference. We show that effective denoising can emerge without an explicit noise schedule: a fixed kernel bandwidth and finite integration horizon suffice, yielding a principled depth-noise relationship. We further establish a posterior-mean recovery guarantee for Gaussian priors, showing the empirical estimator converges to the Bayes-optimal predictor under sequential asymptotic conditions. Connecting these dynamics to reverse-diffusion limits, our results provide a statistical interpretation of attention as in-context inference via sample-based posterior estimation, without explicit density modeling.

comments
53 pages, 5 figures. Accepted at NeurIPS 2026
fields
Dynamical Systems
pdf ↗ page arXiv:2605.29351 ↗

We show that random linear codes of fixed dimension $d$ over sufficiently large prime fields have nearly optimal output list size for list recovery. Fix an error fraction $0<α<1$ and $0<\varepsilon<1$. For all sufficiently large block lengths $n$, with probability at least $1-\varepsilon$, the following holds simultaneously for every input list size $\ell\le 2^{δn/\log n}$, where $δ>0$ depends only on $α,\varepsilon$, and $d$. Given any list of $\ell$ symbols at each coordinate, at most $(1+\varepsilon)\ell/(1-α)$ codewords agree with the lists in at least $(1-α)n$ coordinates. Our proof adapts the colored-graph and determinant arguments of Matousek, Privetivy, and Skovron for reconstructing planar point sets from their projections. We also prove that the range of input list sizes is nearly optimal. There is a constant $c=c(α,\varepsilon)>0$ such that, for every linear code of dimension at least two over a sufficiently large prime field $\mathbb{F}_p$ and every $2^{cn}\le\ell\le p$, there are lists of size $\ell$ and a set of more than $(1+\varepsilon)\ell/(1-α)$ codewords, each of which agrees with those lists in every coordinate. The main results of this paper were discovered by ChatGPT 5.5 Sol using harness components from the UCLA Moonshot Harness Project, in response to a less optimal result found by the authors. See the end of the introduction for a discussion.

fields
Information Theory
pdf ↗ page arXiv:2605.30101 ↗

In this paper, we are dealing with constrained vector optimisation problems where the objective function acts between real linear-topological spaces. Our aim is to study the relationships between the sets of properly efficient solutions to constrained and unconstrained vector optimisation problems under certain cone convexity assumptions on the objective function using a vectorial penalisation approach.

fields
Optimization and Control
pdf ↗ page arXiv:2605.30286 ↗

Orbital transfers in multi-body systems are often studied as isolated trajectory design problems, making it difficult to identify the larger transport structure connecting families of periodic orbits, including which families act as hubs, gateways, relays, or persistently difficult-to-access regions. This work introduces a reachable-set-based framework for constructing orbital networks in the circular restricted three-body problem. Finite-$ΔV$ and finite-time-of-flight reachable-set overlaps are used to infer accessibility relationships between representative periodic orbit families on a common Jacobi energy manifold and to assemble these relationships into a weighted orbital network. Applied to the Earth-Moon system, the resulting network reveals distinct accessibility regimes in which direct reachability, graph connectedness, and feasible multileg closure emerge separately. The analysis identifies multi-orbiter cycler orbits as the dominant hub, gateway, and relay families, with the (3,2)-cycler dominating across much of the sampled budget plane and the short-period (1,1)-cycler dominating in the low-time-of-flight regime, while the stable 2:1 resonant orbit remains persistently difficult to access. Although the maximum-budget network is nearly complete in a binary sense, its weighted accessibility remains strongly non-uniform. Selected proxy-supported connections are refined into concrete trajectories through differential correction, with corrected transfer costs remaining below the proxy estimates in all tested cases. Together, the results demonstrate how reachable-set overlap geometry can expose large-scale transport structure in nonlinear gravitational systems without requiring exhaustive pairwise trajectory optimization.

comments
Accepted manuscript; published in Advances in Space Research (2026), doi:10.1016/j.asr.2026.10.100. 40 pages, 18 figures, 9 tables. Code and data: https://doi.org/10.5281/zenodo.24022012
fields
Dynamical Systems
pdf ↗ page arXiv:2605.31543 ↗

Clustering is a central tool for discovering latent structure in unlabeled data; yet modern clustering pipelines often end with a hard assignment of each observation to a cluster without rigorous measures of assignment uncertainty. We propose a novel weighted conformal approach for constructing valid confidence sets for cluster labels. The key difficulty is that the labels available for calibration are not observed ground-truth labels, but synthetic labels produced by a data-dependent clustering algorithm. Our method develops a conformal inference algorithm that corrects the resulting mismatch with the latent target labels through weights by formulating conformal clustering as a conditional label-distribution shift problem. We first derive an oracle procedure that attains finite-sample marginal coverage and then develop a computationally tractable and implementable version using estimated conditional label probabilities and novel augmented calibration. We show that the coverage of the estimated-weight procedure depends on the estimator, giving an explicit bound on the loss relative to the nominal level. Empirical studies demonstrate that the proposed weighted approach offers improvements over the recently proposed split conformal clustering procedure in terms of informative confidence set size, especially in nonlinear and high-dimensional clustering applications.

fields
Statistics Theory
pdf ↗ page arXiv:2606.00436 ↗

In the paper, we prove a rather general characterization of higher-order Sobolev spaces. We show that the $k\mathrm{th}$-order regularity, where $k \in \mathbb{N}$, is captured via inequalities involving $2^k$-tuples of points. In fact, in full generality, the obtained results characterize higher-order Sobolev spaces based on Banach function spaces. Moreover, we show an analogous characterization of higher-order Hölder spaces. Finally, we propose a way to use the obtained results to define higher-order Sobolev and Hölder spaces on metric measure spaces.

fields
Functional Analysis
pdf ↗ page arXiv:2606.00897 ↗

In this article, we study rational representations of $G=\operatorname{GL}_2(q)$, where $q$ is a prime power. Let $ρ$ be an irreducible representation of $G$ over $\mathbb{Q}$. Then $ρ$ affords the character \[ Ω(χ)=m_{\mathbb{Q}}(χ)\sum_{σ\in\operatorname{Gal}(\mathbb{Q}(χ)/\mathbb{Q})}χ^σ, \] for some irreducible complex character $χ$ of $G$, where $m_{\mathbb{Q}}(χ)$ denotes the Schur index of $χ$ over $\mathbb{Q}$, and conversely, every character of this form is afforded by an irreducible representation of $G$ over $\mathbb{Q}$. We obtain a combinatorial description for the counting of inequivalent irreducible $\mathbb{Q}$-representations of $G$ of each distinct degree. Furthermore, we briefly determine the rational character table of $G$ and present a method for constructing an irreducible rational matrix representation $ρ$ of $G$ affording the character $Ω(χ)$, where $χ$ is an irreducible complex character of $G$ arising from parabolic induction. Finally, using the results on the rational representations of $G$, we derive an explicit combinatorial formula, depending only on $q$, for the Wedderburn decomposition of $\mathbb{Q}G$.

comments
Subsections 5.3 and 5.4 have been added to present an algorithm for constructing the irreducible rational representation R in Theorem 4
fields
Representation Theory, Combinatorics, Group Theory, Rings and Algebras
pdf ↗ page arXiv:2606.02415 ↗

We derive an exact integral representation of the response to an impulsive boundary excitation in a semi-infinite, homogeneous, linear viscoelastic medium governed by the Zener model. Starting from the Bromwich integral, we analytically invert the relevant Laplace transforms and express the response in terms of modified Bessel functions of the first kind and Macdonald functions of half-integer order. The representation reduces to the known Maxwell solution in the appropriate limit. As an independent computational approach, we characterize the saddle points of the phase function and construct the associated steepest-descent path (SDP). Its branches satisfy a sixth-degree polynomial equation in the imaginary part of the complex variable, which is cubic in its square. Numerical comparisons for several model parameters confirm the agreement of the two methods. The integral representation reveals the structure of the response, whereas the SDP approach requires no closed-form inverse Laplace transform and can therefore be applied to more general viscoelastic models.

comments
29 pages, 5 figures, The contents crosses partly with 2 e-prints of the same authors arXiv:2602.03897 ; arXiv:2511.00045
fields
Mathematical Physics, Complex Variables
pdf ↗ page arXiv:2606.04024 ↗

We study when a derived foliation along the fibres of a smooth morphism extends transversally to the total space. We classify strict unfoldings by basic Lie derivations, retaining the automorphisms arising from central isotropy. We define an intrinsic space of unfoldings and prove its agreement with the strict classification when the relative cotangent complex is a vector bundle in degree zero. A counterexample shows that the strict construction is not invariant under equivalent presentations. For two-term cotangent complexes, we describe cotangent extensions and their integrability conditions, and obtain cohomological existence criteria for strict unfoldings in explicit families. On smooth representable leaf spaces, descended unfoldings correspond to integrable Ehresmann connections.

comments
39 pages. Improved exposition
fields
Algebraic Geometry
pdf ↗ page arXiv:2606.04253 ↗

We establish new recursions for Hurwitz class numbers with polynomial weights. In contrast to previous recursions, our results decouple class numbers of even and odd discriminants. Our main tool is the vector-valued holomorphic projection operator applied to mock modular forms. We invoke representation theory to connect the relevant spaces of vector-valued modular forms to spaces of classical new and old forms. We thereby leverage the vanishing of spaces of vector-valued cusp forms not available in the scalar case.

fields
Number Theory
pdf ↗ page arXiv:2606.04508 ↗

We characterise e-processes for testing non-parametric hypotheses that require the conditional mean of a finite-dimensional statistic to lie in a prescribed convex set. Our main result is a complete-class theorem: every such e-process is pointwise dominated by a predictable product of affine one-step e-variables. Consequently, restricting to test supermartingales entails no loss: at any rejection threshold, the dominating process rejects no later on any observation path. We further show that a minimal complete class exists and consists of predictable products of maximal affine one-step e-variables. These results extend previous complete-class results from single-step constrained testing and bounded one-dimensional conditional mean testing to a broader conditional sequential setting.

fields
Statistics Theory
pdf ↗ page arXiv:2606.06769 ↗

We study local well-posedness for a class of stochastic reaction-diffusion equations driven by multiplicative, possibly colored, noise. The interaction between rough stochastic forcing and polynomial nonlinearities naturally leads to solutions with low spatial regularity, making the treatment of the nonlinear terms delicate. Our main contribution is a general local existence and uniqueness theory for SPDEs with rough noise and highly irregular initial data. The framework also yields new results in standard noise regimes, including trace-class noise and space-time white noise. We identify the critical initial-data spaces for a wide range of nonlinearities, and we establish instantaneous parabolic regularization, general blow-up criteria, and sufficient conditions for positivity preservation. We apply the abstract theory to several prototypical models, including the stochastic Allen-Cahn, Burgers, Fisher-KPP, and coupled Gray-Scott equations. Finally, in the one-dimensional space-time white-noise setting, we combine our local theory with existing global a priori results in a highly singular regime.

comments
50 pages; Corrected some mistakes and typographical errors identified with the assistance of LLM
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2606.07417 ↗

A classical theorem of Boshernitzan states that if $f$ is a function which belongs to a Hardy field and which satisfies $|f(x)|\prec x^{\ell}$ for some $\ell\in \mathbb{N}$, then the sequence $(f(n))_{n\in \mathbb{N}}$ is uniformly distributed modulo 1 if and only if $\lim_{x\to\infty}\frac{|f(x)-p(x)|}{\log(x)} = \infty$ for all $p(x)\in \mathbb{Q}[x]$. We provide a new proof of this result using methods from summability theory and we extend Boshernitzan's criterion by obtaining necessary and sufficient conditions for $f$ to be uniformly distributed modulo 1 with respect to a broad class of weighted averages. As an application of our results, we show that for the function $f(x) = x^{3/2}$ and for any $(a,b)\subset [0,1]$, and all sufficiently large $N\in\mathbb{N}$, there is an $n\in [N-N^{\frac{1}{4}},N]$ such that $f(n)\mod 1\in (a,b)$.

comments
The content of this paper has been included in Section 3 of arxiv:2609.16554
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2606.08040 ↗

We study smooth parameterized non-separable objectives of the form $\mathcal L(θ)=F(Y(θ))$, where a global operator couples the outputs of all training samples. We analyze two stochastic gradient constructions within this output-space framework: the ideal per-batch gradient $G$, obtained by row sampling of the full output gradient, and a cached surrogate $H$ for parameterized updates in which full-data quantities are expensive to evaluate. For uniformly sampled batches, the ideal estimator has a deterministic batch-size scaling and a second moment controlled by the full output gradient. Using this structure, we establish local high-probability confinement and convergence for fixed positive step sizes on a prescribed parameter neighborhood under a power-type gradient inequality, with linear and polynomial regimes determined by its exponent. For the cached surrogate, a Lyapunov function couples the objective gap with the cache error and yields analogous local results on the corresponding non-exit event. The theory includes explicit path-length, confinement, and rate bounds; numerical experiments illustrate finite-budget decay trends and the effects of global output-gradient sampling, batch restriction, and cache tracking.

fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2606.10383 ↗

We introduce a new tool, Express, for converting a non-causal attention approximation into a causal approximation with matching approximation guarantees. When combined with the state-of-the-art Thinformer approximation, Express improves upon the best known causal attention guarantees, delivering $\log^{3/2}(n)/s$ approximation error with only $O(s)$ memory and $O(s^2 \log^2(n))$ compression overhead for a sequence of length $n$. We pair these developments with an efficient I/O-aware Triton implementation, demonstrate substantial speedups over FlashAttention 2, and use Express to overcome four resource bottlenecks in the language modeling pipeline: long-context prefill, KV cache compression, long-form memory-constrained decoding, and long-form compute-constrained decoding.

fields
Statistics Theory
pdf ↗ page arXiv:2606.10944 ↗

In this paper, we propose a new approach, called maximum utility split (MUS) scheme, which is built on random utility split (RUS) scheme but with a notable difference: one lottery is designed with two fixed outcomes but with varying probability, and the other has a deterministic outcome specifically chosen at the point where the range between the largest and smallest possible utility values is maximized. Consequently, the probability of random lottery is set such that the range of the ambiguity set of utility functions is reduced by half at the point. Under moderate conditions, we show that MUS can successively generate a sequence of such questionnaires and effectively reduce the ambiguity set, eventually converging to the true utility function as the number of questionnaires increases. The main challenge is to effectively identify the point with the largest utility range for a given ambiguity set constructed from preference information. Based on the structure of the ambiguity set, we propose an interval-based algorithm which identifies each certain-outcome lottery by solving a sequence of linear programs. Moreover, to deal with the case where elicitation terminates before the ambiguity set reduces to a singleton, we demonstrate how to figure out a nominal utility function by solving optimization programs. These identify the smallest and largest utility functions under the Kantorovich metric within the ambiguity set, after which we identify a nominal utility function located in the middle of them. Finally, numerical results demonstrate the efficiency of the MUS method and the performance of a robo-advisor system based on MUS-type queries and the nominal utility elicitation. While the main discussions focus on concave utility functions, we also demonstrate how the MUS approach can be extended to accommodate general non-concave utility functions, particularly S-shaped ones.

fields
Optimization and Control
pdf ↗ page arXiv:2606.12868 ↗

Deep unfolding (DU) accelerates iterative optimizers by training learnable components through unrolled iterations, but extending DU to the large-scale semidefinite programs (SDPs) common in robotics has remained limited. Unrolling a full-update conic solver such as COSMO exposes two obstacles: backpropagating through the per-iteration linear-system solve incurs memory quadratic in the problem size when the coefficient matrix is formed explicitly, and backpropagating through the positive semidefinite (PSD) cone projection is numerically unstable under repeated eigenvalues. We address the first with a matrix-free implicit differentiation rule that reduces memory from $O(n^2)$ to $O(n + \mathrm{nnz}(A))$, and the second with a stable backward rule based on the Dalečkii–Krein representation of the Fréchet derivative. Together, these enable learning lightweight hyperparameter policies and warm starts for COSMO. On standalone SDPs and second-order cone programs, ranging from max-cut and Lovász $\vartheta$ to robust estimation and control, the learned policies outperform tuned COSMO on every problem class, reducing iterations to tolerance by up to 60$\times$, and transfer without retraining to instances up to 10$\times$ larger in the size parameter while retaining 2–5$\times$ speedups. Our matrix-free solver implementation also batches naturally on the GPU, solving 64 Lovász $\vartheta$ SDPs 14$\times$ faster than sequential COSMO.jl. When embedded in sequential convex programming for nonlinear covariance steering, our learned optimizers outperform the interior-point solver Clarabel in terms of both success rate and solve time.

comments
Presented at CoRL 2026
fields
Optimization and Control
pdf ↗ page arXiv:2606.13825 ↗

We say a word in a free group is ``partially positive'' if there is at least one generator which appears in the word, but does not appear with negative exponent. We show that one-relator groups with a partially positive relator are residually solvable. This extends a theorem of Baumslag showing one-relator groups with positive relators are residually solvable.

comments
12 pages, 1 figure
fields
Group Theory
pdf ↗ page arXiv:2606.13933 ↗

We study the sample complexity of learning in average-reward weakly-coupled Markov decision processes (WCMDPs) and Restless Bandits (RBs) under a generative model. Naive reduction to a tabular MDP leads to high complexity bounds as the state-action space is exponentially large in the number of arms $N$. By exploiting the weakly coupled structure, we show that near-optimal policies can be learned with sample and computational complexities that are polynomial in $N$. Specifically, we analyze the plug-in approach, which applies an efficient planning algorithm to an empirical model estimated from data. For fully heterogeneous WCMDPs, we establish the first finite-sample PAC guarantee with polynomial complexity and an $O(1/\sqrt{N})$ optimality gap. For homogeneous RBs, we further prove that a smaller optimality gap is achievable under mild structural assumptions. A primary technical contribution is a novel Lyapunov-based analysis framework. Unlike classical approaches that rely on the difficult-to-control bias function, our framework uses an explicitly constructed Lyapunov function along with a drift transfer technique between the true and empirical models. A key step of independent interest in our framework is a fine-grained perturbation analysis for the underlying linear programming (LP) relaxation, which provides a general tool for analyzing LP-based policies and weakly-coupled systems.

comments
Accepted for presentation at the Conference on Learning Theory (COLT) 2026
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2606.14095 ↗

We study the finite-dimensional isovertex radial stratum of the cube, P(c)=conv{(1+c_q)q : q in Q_n={+/-1}^n}, with c(-q)=c(q), and establish quantitative rigidity and volume-product estimates for n>=3. The first main result identifies the kernel of the linearized facet-coplanarity operator R_n with the homothety direction span{1} and proves that the coplanarity defect is locally equivalent to both the transverse amplitude dist_infty(c,span{1}) and the distance d_GL(P(c),C_n) to the GL(n)-orbit of the cube. After normalizing out the homothety mode onto 1^perp, a key step is a second-order comparison between the linearized vertex-displacement seminorm and its optimization over small linear transformations. The second main result converts transverse radial perturbations c in 1^perp into a linear volume increment. A facetwise concave-envelope construction and an associated pocket functional yield the explicit primal lower bound vol(P(c))-2^n >= 8/(3(n-1))||c||_infty - O(||c||_infty^2) on 1^perp. Combining this with a chamber-independent first-order expansion of the polar volume (whose linear part vanishes on 1^perp with a uniform quadratic remainder) gives a linear lower bound for the Mahler product V_M(P(c))-V_M(C_n) in terms of d_GL(P(c),C_n). In dimension three, an exact chamber analysis on 1^perp yields vol(P(c))=8+(8/3)||c||_infty+O(||c||_infty^2), and the Mahler product has one-sided directional derivative (32/9)||u||_infty along every nonzero ray in 1^perp. In dimension four, a symmetry-orbit classification of the seventy balanced Boolean directions yields six combinatorial types and explicit first-order pocket bounds. We also distinguish the frozen-combinatorics KKT balance from geometric stationarity.

comments
Substantial revision and deliberate narrowing of scope relative to arXiv:2606.14709v3. Broader discrete KKT and stability claims are withdrawn. This version focuses on the isovertex radial stratum of the cube, with quantitative coplanarity rigidity, linear Mahler lower bounds on 1^perp, explicit first-order coefficients for n>=3, and exact chamber and parity-orbit analysis in dimensions 3 and 4
fields
Optimization and Control, Metric Geometry
pdf ↗ page arXiv:2606.14709 ↗

In this paper, we investigate the boundedness properties of the Dunkl-type Hausdorff operator on generalized Dunkl-type Morrey spaces and generalized Dunkl-type Campanato spaces. Furthermore, we introduce the fractional Dunkl-type Hausdorff operator and study its boundedness from $L^p(\mathbb{R}, dμ_α)$ to $L^q(\mathbb{R}, dμ_α)$. We also establish the boundedness of the fractional Dunkl-type Hausdorff operator on generalized Dunkl-type Morrey spaces under suitable conditions. As a consequence of our main results, we derive several applications. Finally, we evaluate the exact norm of the Dunkl-type Hausdorff operator on Dunkl-type Morrey spaces and Dunkl-type Campanato spaces.

comments
NA. arXiv admin note: text overlap with arXiv:2504.17241
fields
Functional Analysis
pdf ↗ page arXiv:2606.16197 ↗

In this work we establish that the recently introduced fractional Sobolev spaces based on the Riesz fractional gradient of Musielak-Orlicz functions by one of the authors, coincide with the space of Bessel potentials of functions on such generalized Orlicz setting. Moreover, we identify them as complex interpolation spaces, and exploiting the well known properties for interpolation of operators we obtain several structural properties for those spaces.

fields
Functional Analysis, Analysis of PDEs
pdf ↗ page arXiv:2606.17770 ↗

We study coefficient identification problems for elliptic partial differential equations with total variation regularization and control constraints. Existing related literature relies on continuity and differentiability properties of the control-to-state operator with respect to the $L^\infty$-norm. While this is sufficient for deriving optimality conditions, it is not well-suited for numerical algorithms, as it neglects the spatial extent of perturbations and leads to a qualitative discrepancy compared to $L^q$-norms with $q < \infty$. In this work, we address this gap by exploiting $W^{1,s}$-regularity results to establish differentiability properties of the control-to-state operator with respect to $L^q$-norms for finite $q$. Based on this framework, we derive first- and second-order differentiability results for the reduced objective functional and establish first-order optimality conditions involving a restricted subdifferential characterization of the total variation seminorm and corresponding regularity of the associated multipliers. Building on this, we analyze a nonsmooth trust-region method based on an $L^r$-trust region for $r > 0.5 q$ and prove its convergence to first-order stationary points.

fields
Optimization and Control
pdf ↗ page arXiv:2606.17788 ↗

A foundational theorem of Ajtai, Komlós, Pintz, Spencer, and Szemerédi asserts that every $n$-vertex $k$-uniform uncrowded hypergraph (i.e., with girth at least $5$) of maximum degree at most $Δ$ contains an independent set of size $cn(\logΔ/Δ)^{\frac{1}{k-1}}$ for some absolute constant $c>0$. Improving an earlier bound of Frieze and Mubayi, Iliopoulos showed that every such hypergraph has list chromatic number at most $(1+o(1))(k-1)(Δ/\logΔ)^{\frac{1}{k-1}}$. Determining the optimal leading constant in this bound remains a major open problem. A natural target, suggested by the coupon-collector heuristic, is $(k-1)^{\frac{1}{k-1}}$, which also corresponds to the shattering threshold for coloring sparse random hypergraphs. Our main result shows that this target is attained: for every integer $k\ge2$, every $k$-uniform uncrowded hypergraph of maximum degree at most $Δ$ satisfies: $$χ_\ell(\mathcal{H})\le(1+o(1))\Big((k-1)\fracΔ{\logΔ}\Big)^{\frac{1}{k-1}}.$$ In particular, this confirms a 2019 conjecture of Molloy for uncrowded hypergraphs. Building on this result, we prove that every $k$-uniform linear hypergraph of maximum degree at most $Δ$ has chromatic number at most $(c_k+o(1))(Δ/\logΔ)^{\frac{1}{k-1}}$, where $c_k\to1$ as $k\to\infty$, thereby proving a conjecture of Verstraëte and Wilson on the independence number of linear hypergraphs in the stronger form of colorings. Our techniques also yield a palette sparsification theorem for uncrowded hypergraphs, partially answering a question of Casselgren and Eriksson.

fields
Combinatorics
pdf ↗ page arXiv:2606.18048 ↗

This paper investigates the vanishing and non-vanishing of Betti and Bass numbers for non-finitely generated modules. We prove that for $d$-dimensional Cohen–Macaulay local rings, every non-zero $\mathfrak{m}$-torsion module satisfies $β_d(M)\neq 0$, and we establish the Betti number behavior of the injective hull $E_R(k)$. We study tor-rigidity for $H^d_{\mathfrak{m}}(R)$. We also provide positive answer to Schoutens' question on whether the vanishing of some Betti number of a big Cohen–Macaulay algebra forces the Cohen–Macaulay property of $R$. For the absolute integral closure $R^+$, we establish both Tor and Ext results. On the Tor side, we prove that $β_i(R^+)=0$ for some $i>0$ implies regularity in a series cases. On the Ext side, we prove that $μ_i(R^+)=0$ for some $i> d$ forces regularity for Gorenstein domains of prime characteristic, and we obtain analogous results for graded normal domains of dimension $2$ and also for quotient and isolated singularities in any dimension. Also $μ_i(R^\infty)=0$ forces regularity for isolated singularity.

fields
Commutative Algebra
pdf ↗ page arXiv:2606.20391 ↗

Over a field $\mathbb K$ of characteristic zero, we determine the $St_n$-elements and $n$-centers, defined by standard polynomials, of principal subalgebras of path algebras. Our description expresses each $n$-center as the direct sum of a path ideal and explicit subspaces associated with isolated circles. We prove that these $n$-centers are subalgebras and stabilize for $n\geq2|Q_0|$. We also obtain explicit descriptions of the center and the $3$-center, and determine the least degree of a standard polynomial identity in the acyclic case. Further applications concern algebras of block formal languages and rational Hilbert series of the $n$-centers.

comments
17 pages. Substantially revised and expanded. The results on centers and $3$-centers in v2 are generalized to $n$-centers for all $n\geq 2$. The section on polynomial identities in v2 has been removed, and its results have been substantially extended in arXiv:2611.09415
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2606.23024 ↗

We establish a two-mode stability theory for Monge solutions of the multi-marginal optimal transport problem with barycentric quadratic cost. The associated tuple of maps splits into an external barycentric mode and internal relative modes. A quadratic lower bound for the Kantorovich defect controls the internal modes and yields a square-root estimate without invoking any two-marginal map-stability theorem. The external mode is the optimal transport map from the fixed source to the Wasserstein barycenter. Combining the resulting two-mode estimate with Mérigot's sharp theorem gives a $\frac{1}{4}$-Hölder estimate for general perturbations, while barycenter-preserving perturbations satisfy a $\frac{1}{2}$-Hölder estimate. We prove that both exponents and the dependence on the weights are optimal. We also examine the scope of such decomposition beyond the barycentric cost: collective-coordinate perturbations and uniformly concave costs of the sum retain the two-mode estimate, whereas the analyses of graph interactions, hedonic costs, and translation-invariant costs identify the two possible obstructions -- loss of relative coercivity and lack of stability for the remaining external modes.

comments
35 pages
fields
Metric Geometry, Functional Analysis
pdf ↗ page arXiv:2606.23037 ↗

In this paper we propose estimators of the parameter functions in an Aalen additive hasard regression model. The estimators are the individual and component wise $l^2$ projections of the naive estimators resulting from the ordinary least squares estimator in the Aalen additive hazard model on the space of monotone functions. The explicit restrictions imposed on the parameter function by our method have a clear clinical interpretation as they can be used to model early onset or late onset covariate effects on complex diseases. We provide point wise limit distribution results for the resulting estimators, that exhibit $n^{1/3}$ rate of convergence and the Chernoff distribution as the limit distribution. We also provide an asymptotic minimax lower bound showing that our suggested estimators are rate optimal, as well as provide an asymptotic minimax lower bound for the more general problem of estimating a monotone hasard function.

comments
25 pages
fields
Statistics Theory
pdf ↗ page arXiv:2606.23882 ↗

The binary Type I self-dual [26,13,6] code is classical. We give what appears to be the first direct non-computational proof of its uniqueness. We first determine the weight enumerators of the code and its shadow. Degree-one harmonic MacWilliams identities supply the required 1-designs. Elementary intersection counts then show that the two minimal half-shadows each contain 13 words; these words label the 26 coordinates as 13 points and 13 lines, and the two shadow classes become the point-stars and line-stars. From this structure we give two uniqueness proofs: one reconstructs the projective plane of order 3 and the plane code, including the full automorphism group PGL(3,3):2; the other deletes an intrinsic flag, obtains the odd Golay code together with a deep hole coset, and reconstructs the length 26 code and the size of the automorphism group from this coset datum. Thus the natural length-24 object behind the code is the odd Golay code together with its unique orbit of deep hole cosets.

comments
15 pages, Latex. Revised version accepted for publication in Journal of Combinatorial Theory, Series A. Proposition 3.4 strengthened to an if-and-only-if characterization of intrinsic flags; expanded proofs, especially the odd-Golay coset analysis
fields
Combinatorics
pdf ↗ page arXiv:2606.24573 ↗

We introduce $n$-almost symmetric Datalog and study $n$-almost symmetric linear arc monadic Datalog. We characterize the finite relational structures whose constraint satisfaction problem is solved by this Datalog fragment as those that can be primitive positively constructed from the transitive tournament on $n+2$ vertices. We also give characterizations in terms of a certain homomorphism duality (which we call $n$-fixed unfolded caterpillar duality) and in universal-algebraic terms (the existence of $k$-absorptive operations and of operations forming an elevator chain of length $n+1$). This article generalizes the results from Bodirsky and Starke about symmetric linear arc monadic Datalog.

fields
Rings and Algebras
pdf ↗ page arXiv:2606.24711 ↗

In this study we have explored gradient $h$-almost Yamabe solitons on both compact and complete non-compact Riemannian manifolds. We have established several sufficient conditions for the triviality of such solitons with respect to integral inequalities involving the scalar curvature and the soliton function. In this regard, we have acquired scalar curvature estimation under certain $L^1$ and $L^2$ integrability conditions, and defined signal of the function $h$. Our results extend and refine former works on almost and $h$-almost Yamabe solitons, and characterize the geometric structures of generalized Yamabe solitons.

comments
10 pages
fields
Differential Geometry
pdf ↗ page arXiv:2606.26113 ↗

Optimizing functionals over the space of probability measures is now ubiquitous in machine learning. A widely used approach is to perform the optimization directly over the Wasserstein space, but many objective functionals of practical interest are non-convex along Wasserstein geodesics, making the analysis of standard first-order methods challenging. In this work, we study a class of objectives over the Wasserstein space that admit a difference-of-convex (DC) decomposition and we lift the classical convex-concave procedure (CCCP) to this setting. Under smoothness and strong convexity assumptions on the convex components of the decomposition, we prove almost stationarity along the iterates of the resulting algorithm. Our main focus is on the Maximum Mean Discrepancy (MMD) and the Energy Distance (ED) functionals, for which we develop explicit Wasserstein DC decompositions, and establish local convergence of the scheme under mild assumptions. Empirically, we show that well-chosen DC decompositions yield faster and more stable convergence than Wasserstein gradient descent on these MMD objectives.

comments
Accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2606.27767 ↗

Ozaki scheme II emulates high-precision matrix multiplication using low-precision integer matrix operations based on the Chinese remainder theorem (CRT). It first scales the high-precision matrices to convert them into integer matrices. For this scaling step, Ozaki scheme II provides two modes: accurate mode, which uses INT8 matrix multiplication to estimate scaling factors, and fast mode, which applies the Cauchy–Schwarz inequality at lower computational cost. We show that the existing formula lacks scale invariance; multiplying the input matrices by a constant changes the effective bit width of the integer matrices in the scaling step, causing accuracy degradation or CRT recovery failure. To address this, we propose a revised scaling formula derived from the CRT uniqueness condition via the Cauchy–Schwarz inequality. The proposed formula is scale-invariant by construction, guarantees that the CRT uniqueness condition is always satisfied, and introduces no additional overhead over the original fast mode. Experiments on an NVIDIA GH200 GPU show that the proposed method achieves accuracy comparable to that of accurate mode while maintaining throughput comparable to that of fast mode. In the accuracy–throughput trade-off, the proposed method overcomes the accuracy limitation of fast mode and the throughput constraint of accurate mode, offering a superior accuracy and performance.

comments
Corrected the equations on p. 7 and fixed minor typos. The proposed method and the experimental results are unchanged
fields
Numerical Analysis
pdf ↗ page arXiv:2606.29129 ↗

The independence number $α$ of a finite simple graph lies between the polynomial-time computable Havel-Hakimi residue $R$ and annihilation number $a$. The Caro-Wei sum $W$ gives another lower bound and the known upper bound $α\le(Δ+1)W/2$ for maximum degree $Δ\ge1$. This upper bound does not by itself control the larger quantity $a$. This note proves $a\le(Δ+1)W/2$ for $Δ\ge1$, with equality attained, for example, by regular graphs of positive degree and even order. Together with $R\ge W$, this bound shows that the interval from $R$ to $a$ improves or matches both Caro-Wei endpoints. Its sharp worst-case endpoint ratio remains $(Δ+1)/2$, even among connected graphs. For maximum degree at least three, the bound also proves the inequality $α\ge(a+R)/Δ$ conjectured by TxGraffiti, an automated conjecturing program. A direct calculation handles connected graphs of maximum degree two. Together these cases resolve the conjecture for every connected graph with at least three vertices. The single edge is the only nontrivial connected exception. Equality holds for exactly eight connected graphs up to isomorphism. For maximum degree at least three, the conjectured lower bound never exceeds the residue, so it gives no stronger independence estimate.

comments
8 pages
fields
Combinatorics
pdf ↗ page arXiv:2606.29553 ↗

Resolving a prescribed multidimensional control window by a single continuous, serial scan is a task distinct from driving between fixed endpoints. We formulate this task as metric coverage at resolution $\eps$. Classical covering estimates, applied to a compact regular $d$-dimensional Riemannian window, give a required length of order at least $\eps^{1-d}$; local grid traversals attain the same exponent. When a physical friction tensor uniformly dominates the coverage metric, this geometric cost implies a necessary duration of order at least $\eps^{-2(d-1)}$ at fixed quadratic excess-work budget. Fixed-duration divergence refers to the slow-driving quadratic action and is not a claim about exact work outside that regime. A detailed-balance three-state process and an overdamped harmonic trap provide microscopic friction examples. For the trap, independently integrated Gaussian moment dynamics approach the quadratic prediction as the prescribed raster is slowed, while refinement at a controlled work budget increases scan duration. A quasi-uniform operational resolution floor cuts off the geometric divergence. Landau-response and van der Waals proxy metrics serve separately as prescribed diagnostic geometries: independent quadrature tests their coordinate- and protocol-dependent critical prefactors without asserting universal critical dissipation. Morton ordering supplies an ordering/connector benchmark with larger finite-resolution amplitudes. The resulting resource statements apply to exhaustive serial coverage, with metric, interpolation and driving assumptions specified explicitly.

fields
Mathematical Physics
pdf ↗ page arXiv:2606.29751 ↗

In this paper, we study how partial observability and inexact latent-state inference affect reward learning from preferences. To that end, we study preference-based reward learning under partial observability, where the learner forms latent-state estimates using an inexact learned POMDP model, so model error can accumulate over time. For finite log-linear POMDPs, we characterize this error term by establishing the stability of the belief filter to parametric model error under certain mixing conditions, yielding bounds on the belief mismatch in expectation and in high probability. We further extend this stability mechanism beyond the log-linear setting to neural-softmax POMDP models with overparameterized neural networks. We then propagate these errors into trajectory-level feature perturbations and derive finite-sample guarantees for constrained Bradley-Terry reward estimation from preferences. Our results decouple statistical error from an irreducible model-mismatch bias, and clarify when preference-based reward learning remains feasible under partial observability with imperfect dynamics.

fields
Optimization and Control
pdf ↗ page arXiv:2606.30271 ↗

We develop a unified framework for Fujita-type blow-up of solutions to the inhomogeneous semilinear heat equation $$\partial_tu-Δu=|u|^p+\mathbf{w}(x), \qquad (t,x)\in(0,\infty)\times\mathbb{R}^N, \qquad u(0, \cdot)=u_0.$$ The classical integrability assumptions on the forcing term are replaced by quantitative regular variation properties of its spatial mass $$F(R)=\int\limits_{|x|\le R}\mathbf{w}(x)\,dx.$$ Using techniques from regular variation theory together with the Mitidieri–Pohozaev test-function method, we establish sharp Fujita-type nonexistence results and identify the critical exponent in terms of the variation index of $F$. We prove that global solutions do not exist in the subcritical range and obtain critical-case blow-up under suitable slowly varying corrections. The regular variation framework further shows the optimality of the underlying mass condition, extends naturally to anisotropic settings through operator regular variation, and yields sufficient blow-up criteria for sign-changing forcings via the Gaussian-Laplace transform. The approach also applies to space-time dependent forcings, Riesz-potential type forcings, and equations involving the fractional Laplacian, providing a unified description of blow-up thresholds beyond the classical Fujita theory.

comments
The title has been revised, and the presentation has been further enhanced and improved
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.31643 ↗

In longitudinal studies, outcomes of interest are often truncated by death, meaning that they are only observed or well-defined conditional on intercurrent events such as survival. Existing strategies face a trade-off: causally interpretable estimands, such as survivor average causal effects, target a latent subgroup, whereas while-alive and composite summaries apply to the full population but are difficult to interpret as causal effects on the non-mortality outcome. We address these challenges by introducing methodology for a new set of estimands that (i) concern the entire population, (ii) remain causally interpretable, and (iii) leverage the longitudinal data commonly available in studies with outcomes truncated by death. The set of estimands includes single-world marginal separable effects that generalize conditional separable effects to full-population summaries. We develop identification and estimation results for these estimands and apply the methodology in a reanalysis of a prostate cancer trial, highlighting how different estimands can yield different treatment conclusions.

fields
Statistics Theory
pdf ↗ page arXiv:2607.00222 ↗

In this paper, we study local superderivations and local anti-superderivations of finite-dimensional nilpotent Lie superalgebras over a field $\mathbb F$ with $\operatorname{char}\mathbb F\neq2$. First, we prove that every finite-dimensional two-step nilpotent Lie superalgebra admits pure local superderivations and pure local anti-superderivations (namely, local (anti-)superderivations that are not (anti-)superderivations). For nilpotent Lie superalgebras of nilpotency index greater than two, we establish sufficient conditions for the existence of pure local superderivations and pure local anti-superderivations. In particular, we prove that every three-step nilpotent Lie superalgebra admits a pure local superderivation.

fields
Rings and Algebras
pdf ↗ page arXiv:2607.00393 ↗

Let $G$ be a graph and $I(G)$ its edge ideal. The $p$-th squarefree power $I(G)^{[p]}$ is the monomial ideal generated by the squarefree monomials corresponding to the matchings of size $p$ of $G$. A central highlight of our work is the complete solution of a problem posed by Bigdeli, Herzog and Zaare-Nahandi in 2017, which asked to characterize when squarefree powers of edge ideals have the first syzygy module generated by linear forms. Moreover, for a $1$-dimensional flag simplicial complex $Δ$ and its Stanley–Reisner ideal $I_Δ$, which is the edge ideal of the complement graph of $Δ$, we prove that $I_Δ^{[p]}$ has a linear resolution if and only if it is linearly related and the $(2p-1)$-st homology of the neighbourhood complex of $Δ$ vanishes. As a consequence, we describe the shape of the Betti table of $I_Δ^{[p]}$, and we give a combinatorial characterization of when $I_Δ^{[p]}$ has a linear resolution, provided that the $2p$-core of $Δ$ has maximum degree at most $2p$. Finally, we show that no such characterization exists in general: the linearity of $I_Δ^{[2]}$ may depend on the characteristic of the field, and it cannot be described by finitely many forbidden induced subgraphs.

comments
35 pages, 11 figures. Every comment is very welcome!
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2607.00838 ↗

In 2020, Panda, Verma, and Keerti asked whether the central graph of every graph satisfies the AVD-total coloring conjecture (AVD-TCC). In this paper, we use idempotent commutative Latin squares and a theorem of Borodin, Kostochka, and Woodall to prove the AVD-TCC for central graphs of all connected graphs with order at least five and minimum degree at least two. We further determine the AVD-total chromatic number of subdivision graphs of connected graphs and establish new results on the AVD-total coloring of joins of graphs, central graphs, and deleted lexicographic products.

comments
Two changes. Theorem 4.9 and Theorem 3.4 have been revised. The result in Theorem 4.9 has been substantially strengthened: we prove that the AVD-TCC holds for central graphs of all connected graphs of order at least five and minimum degree at least two. An incorrect assumption in Theorem 3.4 has been corrected
fields
Combinatorics
pdf ↗ page arXiv:2607.01979 ↗

Harborth conjecture states that every planar graph has a crossing-free straight-line drawing in which every edge has an integer length. Kleber's strengthening asks for the vertices themselves to have integer coordinates. In this series of papers, we make progress towards settling these conjectures. Kleber's conjecture reduces to local rational-distance statements for special polygons with at most five vertices. The triangle case is known from the results of Almering and Berry. In this paper, we prove the existence of a rational-distance point on an interior integer diagonal in all the cases for non-degenerate and degenerate quadrilaterals. In the upcoming papers, we focus on non-degenerate and degenerate pentagons.

fields
Combinatorics
pdf ↗ page arXiv:2607.02535 ↗

We prove a color-degree criterion for DP-coloring of finite uncrowded hypergraphs of bounded rank. For a $q$-fold cover with edge sizes between $2$ and $r+1$, let $D_\ell$ be the maximum number of forbidden colorings on $(\ell+1)$-edges prescribing a fixed color at a fixed vertex. If $q$ is sufficiently large in terms of $r$, then the cover admits a coloring whenever \[ \sum_{\ell=1}^r\frac{D_\ell}{q^\ell}\leq\log q-20\log\log q. \] For uncrowded $(r+1)$-uniform hypergraphs of maximum degree $Δ$, this gives a DP-chromatic number at most $(1+O_r(\log\logΔ/\logΔ))(rΔ/\logΔ)^{1/r}$.

comments
15 pages. Substantially revised from v1, with new DP-coloring results and a Note added clarifying the chronology and relationship to related work
fields
Combinatorics
pdf ↗ page arXiv:2607.05256 ↗

We study products of independent Haar matrices interspersed with a fixed corank-one projection. As the matrix dimension $N$ and product length $L$ grow with $L/N\toτ$, we prove that the empirical distribution of squared singular values converges to the free multiplicative Poisson law with $S$-transform $S(z)=\exp(τ/(1+z))$, for both the unitary and orthogonal ensembles. Lagrange inversion yields its moments explicitly, proving Beenakker's conjectured Erlang formula for every moment order.

comments
20 pages. Substantially revised, with a new title and reorganized exposition. Added proofs of convergence of all transmission moments and empirical spectral distributions in the double-scaling regime for both unitary and orthogonal ensembles, establishing the conjectured moment formula for every order
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2607.05693 ↗

We prove that for a very general abelian variety of dimension $\geq 4$, a divisor $D\in {\rm CH}^1(A)$ that satisfies $D^2=0$ in ${\rm CH}^2(A)$ is of torsion. The same result is also established for a very general Jacobian in genus $4$. We use then the second statement in order to prove a conjecture of Pirola, which states that any rational section of the Kummer fibration $K=J/\pm {\rm Id}\rightarrow \mathcal{M}_4$, where $J\rightarrow \mathcal{M}_4 $ is the Jacobian fibration, must be a multiple of the Griffiths-Pirola section given by the difference of the two trigonal divisors.

comments
An argument at the end of the proof of Proposition 4.5 has been corrected. Lemma 4.9 has been added
fields
Algebraic Geometry
pdf ↗ page arXiv:2607.07053 ↗

We consider a family of semilinear parabolic equations with homogeneous Neumann boundary conditions on a family of varying non-smooth domains $\{Ω_μ\}_{μ\in Λ} \subset \mathbb{R}^n $. Assuming only that the domains have uniformly bounded volumes, bounded away from zero, and satisfy a uniform Jones condition, together with the usual structural requirements on the linear and nonlinear terms, we establish the well-posedness of the problem in an appropriate scale of fractional Banach spaces and prove the existence of global attractors. The attractors themselves are shown to be uniformly bounded in $L^{\infty}(Ω_μ)$ by an elementary truncation argument, which uses no property of the domains beyond the weak formulation of the Neumann condition. A Moser–Alikakos bootstrap iteration, in conjunction with the uniform Gronwall lemma and the uniform properties of the Jones extension operator, then yields the stronger statement that bounded sets of $L^{q}(Ω_μ)$ are absorbed, in finite time and uniformly in $μ$, into a fixed ball of $L^{\infty}(Ω_μ)$; this iteration uses only first-order Sobolev embeddings, which is what makes it available on domains where the domain of the elliptic operator is not contained in $H^{2}$. Finally, assuming the volume convergence of the domains, $|Ω_μ\triangle Ω_0| \to 0$, we construct a framework of connecting maps, show that the uniform Jones condition upgrades this convergence in measure to Mosco convergence of the associated bilinear forms, and prove that the family of attractors is upper semicontinuous at $μ= 0$ in $L^2(Ω_μ)$ and hence, by interpolation, in $H^s(Ω_μ)$ for every $s<1$.

comments
36 pages
fields
Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2607.08061 ↗

The theory of quantum filtering (of quantum continuous measurements) was developed by V.P. Belavkin about 40 years ago. Since then it attracted attention of numerous investigators including mathematicians, theoretical and experimental physicists. However, the rigorous mathematical theory of the filtering equations for mixed states in basic infinite-dimensional quantum systems remained an open problem, which was resolved by the author recently. This survey paper presents in full the mathematical theory of quantum filtering equations, their rigorous derivation from basic principles, the corresponding law of large number limits (propagation of chaos) and related topics. Applications to feedback control, quantum dynamic and mean-field games are discussed.

fields
Mathematical Physics
pdf ↗ page arXiv:2607.08507 ↗

Many real-world processes can be represented as compositions of functions along a directed acyclic graph (DAG). In causal modelling, these correspond to the underlying mechanisms; in engineering, to multiple fidelity levels; and in gene-regulatory networks, to transcription factors. These functions are partially observed across the DAG, with noisy and heterogeneously sampled measurements, posing significant challenges for reconstruction, uncertainty propagation, and inference. To tackle these challenges, we place priors over functions and naturally arrive at Deep Gaussian Processes over DAGs. We theoretically study their prior-collapse behaviour and the effect of graph topology and intermediate observations on the preservation of information. We obtain almost-sure lower bounds on the asymptotic frequency of depths at which the distinction between inputs is preserved, identify broad kernel classes for which these hold, and prove an observation by \citep{dunlop2018} on the role of input connections. We offer a structured variational approximation that retains graph dependencies, preserves compositional uncertainty, and captures the explaining-away behaviour of colliders. Finally, we empirically validate our theory and methodology at scale and under DAG misspecification. We then model a latent-collider DAG, a protein signalling network, and a multi-fidelity \mbox{heavy-ion} collision emulation task, attaining state-of-the-art performance while recovering low-fidelity contributions and yielding interpretability over the simulator hierarchy.

comments
Accepted at NeurIPS 2026, camera-ready
fields
Statistics Theory
pdf ↗ page arXiv:2607.09645 ↗

Singular changes of variables in Hamiltonian systems, such as McGehee coordinates in celestial mechanics or renormalised variables in dispersive PDE blow-up, are designed to extend the equations of motion to a singular boundary. In contrast, it may be that near the boundary, the the induced symplectic two-form may rescale distinct geometric directions by distinct powers of the singular scale, and if the leading weighted part is degenerate, no single conformal factor makes the form extend as a smooth non-degenerate two-form. This anisotropic obstruction is complementary to the isotropic singularities studied in bm-symplectic geometry. We record it in an elementary finite-dimensional criterion and illustrate it with McGehee regularisation of homogeneous central-force collisions and, formally, with the modulation geometry of focusing nonlinear Schrödinger equation blow-up.

fields
Dynamical Systems
pdf ↗ page arXiv:2607.09952 ↗

We prove global well-posedness of the hard-sphere Boltzmann equation in $\mathbb{R}^d$ for small initial data in the critical Besov space $B_{1,1}^{d-1}L_v^1$ and in the critical Sobolev space $W^{d-1,1}L_v^1$. The proof is based on new bilinear estimates for the nonlinear collision operator, which rely on transversality considerations.

comments
18 pages, v1: Proofs rewritten in full detail; uniqueness, stability and scattering added; literature discussion revised
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.10143 ↗

We compare four methods for the construction of algebraic cubature rules on planar elements, whose boundary is tracked by splines. The methods, that we have developed over the last two decades, are based on Green theorem together with some cornerstones of polynomial approximation theory: Gaussian quadrature,Tchakaloff theorem, discretized Chebyshev expansion (hyperinterpolation), Fekete-like interpolation. We discuss their advantages and drawbacks in view of the application to curved polytopal element methods. We have also made freely available at a single site the corresponding open-source Matlab codes.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.10485 ↗

In multi-objective combinatorial optimization, unsupported non-dominated points typically outnumber supported points and are often significantly more challenging to compute. Recent studies show that extreme supported non-dominated points provide high-quality representations of the non-dominated set for certain binary problems. We demonstrate that this observation does not generalize to capacitated network optimization problems: representation quality decreases with increasing arc capacities, whereas supported non-dominated points consistently provide high-quality representations with respect to several quality indicators. However, supported point sets may still be too large in practical applications, where only a small, fixed number of alternatives is typically desired. Selecting fixed-size representations from the non-dominated set requires its computationally expensive generation and thus diminishes the computational advantages that representations are intended to provide. We therefore suggest the (extreme) supported points as alternative candidate sets in subset selection problems. Our numerical results show that restricting the candidate set to supported non-dominated points yields fixed-size representations of nearly the same quality as those selected from the complete non-dominated set. Overall, supported non-dominated points serve both as high-quality representations and as reasonable candidate sets for subset selection.

fields
Optimization and Control
pdf ↗ page arXiv:2607.11821 ↗

When $m = 1$, the Dyson rank generating function is a classical bridge between partition theory, Ramanujan's mock theta functions, and the theory of harmonic Maass forms and nonholomorphic Jacobi forms. The rank is a statistic on partitions, and the higher Dyson systems, for $m \geq 2$, are a natural multivariable refinement of it, combining $m$ graded rank contributions. Unlike the classical case, these higher systems are not expected to fit the mock-modular framework, which raises the question of what analytic structure governs them. We show that their root-of-unity specializations carry a hidden elliptic structure. For $m\ge2$, the primitive $(2m+1)$st-root specialization of their generating function leads to a product deformation whose associated seed satisfies a finite $q$-difference recurrence with an explicit polynomial defect. Using bilateral periodization we construct a meromorphic lift satisfying a twisted index-$m$ elliptic transformation law, with at most simple poles on a prescribed lattice orbit. The poles can be removed by subtracting an explicit multiple of an Appell–Lerch kernel and a specified translation removes the twist. The resulting holomorphic finite parts admit a finite theta decomposition. These results grew out of a human–AI collaboration, and the key new formulas were formalized and machine-verified in Lean/Mathlib by AxiomProver.

comments
This version is improved with a more general theorem about a modified expression. A vacuous result has been deleted. Please note the new expressions for the main functions. These results have been formally verified in Lean
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2607.13159 ↗

We prove that for any two birationally equivalent del Pezzo surfaces of Picard rank one over a perfect field there is a birational map between them such that it is decomposed in a composition of at most two Sarkisov links.

fields
Algebraic Geometry
pdf ↗ page arXiv:2607.13270 ↗

We study strong temporal approximation of periodic stochastic Korteweg–de Vries equation driven by small additive \(Q\)-Wiener noise of amplitude \(\mathcal O(\varepsilon)\), \(0<\varepsilon\ll1\) under $H^s$-regularity, $s=1,2$. This is a challenging problem, due to the additional derivative term in the nonlinearity and the lack of suitable exponential moment bounds for the exact solutions. Exploiting the small-noise regime, we first decompose the solution into a deterministic KdV flow and a stochastic component; then we linearize the obtained stochastic equation and approximate the resulting equation by means of Fourier analytic techniques. Combining the small-noise linearization error, the discretization error of the linearized equation, and the deterministic temporal approximation error, and assuming suitable conditions on the deterministic solver, we get strong errors of size $\mathcal{O}(τ+\varepsilon^2)$ under \(H^1\)-regularity and of size $\mathcal{O}(τ^2+\varepsilon^2)$ under $H^2$-regularity. To the best of our knowledge, these are the first strong error bounds achieved for numerical time approximations of the stochastic KdV at low regularity.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.14813 ↗

Let $(X,ω_0)$ be a compact Kähler manifold of complex dimension $n$, and let $U\Subset X$ have $C^{3,1}$ uniformly strongly pseudoconvex boundary. Consider the signed parallel family $U_t=\{ρ<t\}$, where $ρ$ is a defining function agreeing near $\partial U$ with the signed distance, negative in $U$. Let $u_t$ be the equilibrium envelope with zero obstacle on $X\setminus U_t$, and write $Σ_t=\partial U_t$, with outward unit normal $ν_t$. We prove that the normalized Monge–Ampère energy $e(t)=E_{ω_0}(u_t)$ belongs to $C^{1,1/2}([-τ,τ])$ for some $τ>0$ and satisfies the Hadamard formula $$ e'(t)=\frac{1}{n+1}\int_{Σ_t}\left(-\partial_{ν_t}u_t\right)^2 dσ_{ρ,t}^{\mathrm{tot}}, |t|<τ. $$ Here $dσ_{ρ,t}^{\mathrm{tot}}$ is the interior outward Anzellotti trace of $$ \frac{1}{V} d^cρ\wedge \sum_{p=0}^{n-1}(p+1) ω_{u_t}^{p}\wedgeω_0^{n-1-p}, V=\int_Xω_0^n, ω_{u_t}=ω_0+dd^c u_t. $$ This measure is positive and uniformly comparable to the induced surface measure. The proof combines uniform $C^{1,1}$ estimates up to the boundary from the interior with $1/2$-Hölder stability of the normal derivatives under the normal-flow identifications. We identify the boundary part of the normalized Monge–Ampère measure with the negative outward trace of a divergence-measure flux current. The one-sided weak-* limits of the mixed Bedford–Taylor boundary measures yield the weighted total flux appearing in the variation formula.

comments
34 pages, 1 figure. Revised exposition and proofs, including clarifications of the boundary densities and uniform regularity estimates; corrected references. Comments are welcome!
fields
Complex Variables, Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2607.17187 ↗

We consider the uniform exponential stability analysis of infinite-dimensional impulsive systems defined on a Banach or Hilbert space, whose flow is governed by a fixed $C_0$-semigroup generator and whose jumps occur at a prescribed time sequence. While the flow and jump maps are themselves time-invariant, the time-triggered impulses render the propagator a genuinely time-varying evolution family, which is the source of the analysis difficulty addressed here. We combine ideas from hybrid systems theory and infinite-dimensional systems to produce operator-based stability conditions, which can be analytically or numerically checked via convex programming. Necessary and sufficient conditions for the uniform exponential stability of impulsive systems on Banach spaces are obtained in the context of a fixed impulse-times sequence but also of arbitrary, constant, minimum, and range dwell-times using both non-coercive and coercive Lyapunov functionals. Some of those results are then adapted to systems on a Hilbert space and quadratic Lyapunov functionals. As an application, linear switched systems are shown to be an exact special case: reformulated as impulsive systems with unit-norm selector jumps, they inherit non-coercive and clock-dependent dwell-time stability conditions on both Banach and Hilbert spaces. Theoretical and numerical examples are given for illustration, notably on the sampled-data control of time-delay systems.

comments
90 pages
fields
Optimization and Control, Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2607.17260 ↗

The running-time distribution of a randomized algorithm is computed under independent randomness, but independence is rarely what a source guarantees. We study sources $ν$ with $ν[w]\le DP[w]^s$ for every finite prefix $w$ of the tape, where $P$ is an independent reference law, $0<s\le1$, and $D\ge1$; individual choices may be predictable, even determined by the past. The worst-case probability of any closed tape event $E$ is exactly $\min\{1,DC_s(E)\}$, where $C_s(E)$ is the infimum cost of covering $E$ by prefixes of varying depth. This tree max-flow/min-cut identity makes worst-case probabilities exact and optimizable. Three applications follow. In scheduling, $n$ tasks on one machine are each retried until the next random symbol lies in its success set; every schedule has the same makespan distribution under independent randomness, yet under our constraint two fixed orders miss a linear deadline with worst-case probabilities $1$ and $\exp[-Θ(n)]$, and a static priority rule is optimal at every deadline. For the standard local walk on a $k$-CNF with an assignment satisfying a majority of each clause, we find the sharp source threshold $s_*$: below it, on some instances one admissible source forces nontermination for every clause selection; at it, with fixed $D$, the expected number of flips is at most cubic in the initial distance, against linear under independence, with matching instances at distances up to a constant fraction of the number of variables; a fixed margin above it restores linear dependence. For noisy predecessor search with prefix-bounded comparison errors, verified backtracking attains any prescribed error probability at or above a source threshold whose sharpness we leave open, with the same cubic-to-linear query bounds. Restarting on the shared tape restores exponential tails exactly when the nontermination event has a prefix cover of cost below one.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2607.17469 ↗

Digital Twins support real-time decision-making through predictive models of physical systems, yet their reliability can deteriorate as operating conditions evolve. Maintaining predictive fidelity under such changes is challenging, particularly when model adaptation relies on limited streaming data, and updated models must be evaluated before deployment. Here, we present an online adaptation framework that integrates gradient-based drift detection, parameter-efficient fine-tuning, and statistical model validation within model predictive control. Changes in prediction-loss gradients trigger batch-wise model updates using Low-Rank Adaptation, while a paired moving-block bootstrap test evaluates predictive improvement before deploying the updated model. The framework is evaluated using a stochastic dynamical system with abrupt changes and a simulated directed energy deposition process with gradual changes in material properties. Results show improvements in predictive accuracy and uncertainty estimation during the evaluated post-adaptation intervals, alongside improved reference tracking and reduced constraint violations in the manufacturing case study compared with the investigated baselines. These findings demonstrate the potential of integrating continual validation with model adaptation while acknowledging the trade-off between responsiveness and predictive reliability in evolving Digital Twins.

fields
Statistics Theory
pdf ↗ page arXiv:2607.18164 ↗

In this paper we prove that whenever a projective plane of odd order n contains an oval, it may be used to construct a triple array with n + 1 rows, n.n columns and n(n + 1) symbols. In particular, for any odd prime power s, we use the projective plane over the field of order s to construct an explicitly given (s + 1) times s.s triple array on s(s + 1) symbols. This is only the third infinite series of triple arrays (up to transposition) to be found. Our construction proves a recent conjecture of Gordeev and Ohman (2025) in the case of odd prime powers.

fields
Combinatorics
pdf ↗ page arXiv:2607.20275 ↗

A numerical semigroup is a cofinite additive submonoid of ${\mathbb N}$. The largest element of the complement is its {\em Frobenius number} and the cardinality of its complement is the {\em genus}. We propose a new approach to counting semigroups by the Frobenius number and by the genus, by introducing two ad-hoc trees. Those are leaf-discriminating trees in the sense that their leaves correspond exactly to the objects we want to count and, so, exploring these trees instead of general trees is optimal. Our approach reduces the search space for genus to 23\% and for Frobenius to 0.03\% of that required by previous approaches and this allowed to obtain an important number of unkown terms from both sequences. We implemented a recursive descending algorithm based on the so-called seeds structure, trimming the general semigroup tree exactly at those nodes with no descendants with a given genus, in the first case, or with no descendants with a given Frobenius number, in the second case. We refined the parallelizing strategies and we overcame the previous limitation of the length of integers in the bitwise representation of the gap sequence and the seed sequence. We computed multiparameter decomposition of the numbers of semigroups of each Frobenius number up to $135$, the number of irreducible semigroups of Frobenius number up to $135$, and of the numbers of semigroups of each genus up to $80$.

comments
In the new version we removed the part on theoretical results and focused on the algorithms, the new construction of trees, and computational results. The theoretical part with combinatorial results and recurrences is now in a separated contribution
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2607.23111 ↗

A tournament is a \emph{$k$-majority tournament} if it is the pairwise majority relation of an election with $2k-1$ voters: there are $2k-1$ linear orders of the vertex set, repetitions allowed, such that $u\to v$ exactly when $u$ precedes $v$ in at least $k$ of them. Let $F(k)$ be the maximum domination number of a $k$-majority tournament. In 2006, Alon, Brightwell, Kierstead, Kostochka and Winkler proved that $F(k)$ is finite and that $c_1k/\log k\le F(k)\le c_2k\log k$ for absolute constants $c_1,c_2>0$; the order of growth of $F(k)$ has been open since. We prove that $F(k)=Θ(k\log k)$. As a consequence, the maximum domination number of a tournament realized by fair $m$-sided dice is $Θ(m\log m)$, closing the corresponding gap in the bounds of Alon et al.

comments
10 pages
fields
Combinatorics
pdf ↗ page arXiv:2607.23148 ↗

We prove the population-level identifiability of deep generative models (DGMs) with piecewise-affine (PWA) decoders and Gaussian mixture model (GMM) priors, in a purely unsupervised setting. We introduce three algebraic contrast principles for symmetry breaking: *domain contrast*, which trivializes the mixture symmetry group, a label-free counterpart of the sufficient-variability assumption of nonlinear ICA; *mechanism contrast*, which ensures every decoder branch gets an observational boundary across which it toggles alone; and *interaction contrast*, which forbids parameter conspiracies between latent components and decoder branches. Together they exploit the interplay between the discrete combinatorics of the PWA map and the continuous symmetry structure of the latent GMM. Continuity is replaced by algebraic symmetry conditions; injectivity is decoupled from structural identification and required only for pointwise inversion. Our results form a hierarchy: from *law identifiability* (LID; latent distribution up to a global affine map) through *map identifiability* (MID; decoder up to the same map) to *posterior* and *pointwise identifiability*. The ICA-form ambiguity emerges under conditions on diagonal component covariances. The interaction contrast is the only one of our contrasts required on the estimator side. To our knowledge this is the first to develop algebraic symmetry-breaking into an identifiability engine for a concrete nonlinear model class, the first to admit discontinuous decoders, and the first to handle fully non-injective decoders, where every observation admits multiple latent codes.

comments
NeurIPS 2026; camera ready
fields
Statistics Theory
pdf ↗ page arXiv:2607.23182 ↗

Let $T$ be a countable complete theory with a distinguished unary predicate $P$, and let $T^{P}$ be the theory of the $P$-parts of models of $T$ with the induced structure. $T$ is said to be relatively categorical or categorical over $P$ if any isomorphism between the $P$-parts of two models of $T$ lifts to an isomorphism of the models in question. We study the special case of relative categoricity where $T$ is internal to $T^{P}$ (that is, every model $M$ of $T$ is in the definable closure of $P(M)$ together with additional parameters from $M$). We first give a structure theory for such $T$: after passing to $T^{eq}$ and naming a parameter, $T$ is the same thing as a "pure torsor cover" of $T^{P}$, namely simply adjoining to $T^{P}$ a new sort for a torsor $S$ for a $\emptyset$-definable group $G$ in $T^{P}$, with no additional structure. We discuss relative stability, or stability over $P$, and give a characterization of relative stability, superstability, and $ω$-stability of $T$ in terms of $H$ having the stable chain condition, superstable chain condition, and $ω$-stable chain condition, respectively.

comments
Disagreement between authors
fields
Logic
pdf ↗ page arXiv:2607.23314 ↗

Let $d,h$ be positive integers with $h$ even. A set $\mathcal{A} \subseteq\mathbb{Z}^d$ is a $B_h$-set if the sums of $h$ elements of $\mathcal{A}$ are distinct up to the order of the summands. A $B_2$-set is also called a Sidon set, a Golomb ruler, and a Babcock set. Let $K\subseteq \mathbb{R}^d$ be a convex body containing the origin, and let $A_K(n)$ be the number of elements of $\mathcal{A}$ in $\bigcup_{t<n}t\ast K$. We prove that if $h$ is even then \[ \liminf_{n\to\infty} \frac{A_K(n)}{\left( vol(n\ast K)/\log n \right)^{1/h}} \le \left(\frac{4}{d\log 2} \cdot \frac{Γ(1+h/2)^2Γ(1+d/2)^2}{Γ(1+d/h)^{h}}\right)^{1/h}. \] The constant does not depend on $K$. As a special case, this explicitly bounds $\liminf_n A(n) \left(\frac{\log n}{n^d}\right)^{1/h}$, where $A(n)= | \mathcal{A}\cap[0,n)^d | $, which Rackham-Šarka (2010) had proved finite.

comments
27 pages, more general result than v1
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2607.23795 ↗

According to the Singer conjecture, the $L^2$-Betti numbers of a closed aspherical manifold are expected to vanish outside the middle dimension. In this paper, we study a natural analog of the Singer conjecture concerning the vanishing of twisted $L^2$-Betti numbers outside the lower middle dimension. These invariants can be thought of as $L^2$-Betti numbers of an infinite cyclic cover, depending on a first cohomology class. This is related to a previous conjecture by the author, which connects the twisted $L^2$-Euler characteristic to the Thurston norm, and which we prove for a class of closed arithmetic hyperbolic manifolds.

comments
22 pages. Fixed errors in Proposition 2.10 and Theorem 4.1. Added Section 4.3
fields
Geometric Topology
pdf ↗ page arXiv:2607.25615 ↗

Knowledge graph learning offers a powerful framework for representing and inferring structured knowledge, with broad practical applications. Two obstacles limit current methods: labeled triples are scarce for each entity and relation, which makes expressive models hard to train, and scoring functions are designed ad hoc, which limits their generalizability and leaves them without theoretical grounding. We address both obstacles with a theoretically grounded framework, with end-to-end guarantees, that extends and subsumes existing methods. The framework proceeds in two stages: multi-view unsupervised pretraining that integrates heterogeneous sources of entity side information into a shared representation, followed by supervised learning across multiple relation types. We establish a unified nonasymptotic risk bound that combines the subspace recovery error of pretraining and the sample complexity of the labeled data in a single guarantee, quantifying formally how large-scale unlabeled data from multiple views benefits downstream knowledge prediction. Synthetic experiments validate each component of the theory, and experiments on large-scale real-world knowledge graph benchmarks confirm the effectiveness of our approach.

comments
37 pages, 4 figures, 5 tables. To appear in the 40th Conference on Neural Information Processing Systems (NeurIPS 2026)
fields
Statistics Theory
pdf ↗ page arXiv:2607.26346 ↗

The enthalpy method was introduced in the late 1970s to simulate phase-change problems on fixed grids without explicitly tracking the moving phase-change front. It remains one of the most widely used approaches in academic and commercial software for the simulation of industrial melting and solidification processes. For pure phase-change materials (PCMs) that melt or solidify at a single temperature, the enthalpy method introduces an artificial mushy region bounded by the solidus temperature, $T^{\rm sol}$, and the liquidus temperature, $T^{\rm liq}$. As the numerical parameter $ΔT=T^{\rm liq}- T^{\rm sol}$ approaches zero, the solution obtained with the enthalpy method is generally assumed to converge to that of the classical Stefan problem, in which the phase-change front is infinitesimally thin. This assumption is largely based on benchmark studies performed under the simplifying assumption of equal solid and liquid densities. In this work, we systematically investigate the accuracy and spatio-temporal convergence properties of the enthalpy method for both low- and high-density-ratio phase-change problems. Because the limiting behavior $ΔT\rightarrow0$ is difficult to realize numerically, owing to the diminishing thickness of the mushy region, we formulate and analyze the finite-$ΔT$ mushy Stefan problem solved by the enthalpy method. We show that this problem possesses a self-similar structure that reduces the governing equations to a boundary-value problem involving two unknown parameters. The theoretical analysis also enables improvements to our previously developed low-Mach enthalpy method, enhancing its stability and accuracy as the density ratio between the two phases increases from $\mathcal{O}(1)$ to $\mathcal{O}(3)$.

fields
Numerical Analysis
pdf ↗ page arXiv:2608.00960 ↗

{We study the module structure of the polynomial ring, localized at the discriminant, over the ring of differential operators on the ring of invariants of the imprimitive complex reflection group $G(r,p,n)$, describing its simple components with explicit generators given by the higher Specht polynomials of Ariki–Terasoma–Yamada. The proof rests on a Jacobian lemma computing the discriminant of $G(r,p,n)$, combined with a double-centralizer argument. As particular cases ($r=2$, $p=2$ or $p=1$) we recover, and considerably shorten, the known decomposition theorems for the real reflection groups $W(D_n)$ and $W(B_n)$; we also treat $G(r,r,n)$ and $G(r,1,n)$ explicitly, with worked examples ($D_2$, $D_3$, $B_2$) and their central idempotents. Finally, applying the Galois descent equivalence of categories of Nonkané to $G(r,p,n)$ for the first time gives a second, generator-free description of the simple summands as twisted invariants.}

fields
Representation Theory, Commutative Algebra, Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2608.01474 ↗

Let $R_r(k)$ denote the diagonal $r$-color graph Ramsey number. We prove that there exist absolute constants $c,K>0$ such that \[ R_r(k)\le \exp\!\left(-c\frac{k}{r^2\log^4(2r)}\right)r^{rk} \] for every $r\ge2$ and every $k\ge Kr^2\log^6(2r)$. The proof combines a positive-coefficient root filter of variable order with a retained-spine refinement of the multicolor book method.b

fields
Combinatorics
pdf ↗ page arXiv:2608.01962 ↗

We couple a previously analyzed L-stable sequential two-stage fourth-order time formula to a specified fifth-order finite-volume residual for the periodic Goldstein–Taylor/Cattaneo equation in one and two dimensions. The required second time derivative is chosen as the exact derivative along the semi-discrete trajectory, $\mathcal G_h(U)=D\mathcal L_h(U)\mathcal L_h(U)$. For our linear reconstruction and flux, applying the same conservative face operator to $V=\mathcal L_h(U)$ yields this derivative exactly. A central face flux produces a skew-adjoint divergence–gradient pair, allowing a fixed-grid full-step asymptotic-preserving (AP) theorem for the implemented operator; for the specified central-flux discrete heat target, a wave-speed Rusanov flux has the same derivative closure but fails that target. This statement is not a claim about Rusanov-type discretizations in general. Within the previously established L-stable parameter interval, $C_q=5/183$ is the unique fixed coefficient within the admissible family, in the sense of the asymptotic damping exponent, that cancels the leading inverse-stiffness amplification, giving $R(-x)=O(x^{-2})$ rather than the generic $O(x^{-1})$ as $x=Δt/δ\to\infty$. Independent high-precision scalar calculations and the actual two-dimensional finite-volume transverse mode verify the exponent up to $x=10^5$; a mixed slow–fast state shows the resulting flux-error advantage for specified data. This damping statement does not optimize finite-stiffness accuracy or computational efficiency. The AP statements below concern the fixed-grid linear periodic problem with exact stage solutions; no mesh-uniform or nonlinear AP result is claimed.

fields
Numerical Analysis
pdf ↗ page arXiv:2608.03256 ↗

For a convex body $K \subset \mathbb R^d$ let $Δ(K)$ be the expected distance between two independent uniform points of $K$, and let $θ(K)$ be the corresponding expectation for normalized surface measure on $\partial K$. The Zaporozhets-Tarasov conjecture asserts $Δ(K) \le θ(K)$. We prove this conjecture in case $d=2$. In addition, we give a six-vertex convex polytope in $\mathbb R^3$ for which the reverse strict inequality holds, and obtain counterexamples in every dimension $d \ge 3$ by taking products with segments.

comments
Split off Section 5 from previous version to make it a separate manuscript
fields
Metric Geometry, Functional Analysis, Probability
pdf ↗ page arXiv:2608.06470 ↗

The set $A$ is a $B_h$-set if every element of the sumset $hA$ has a unique representation as a sum of $h$ elements of $A$. A $B_2$-set is also called a Sidon set. A $B_{h,Δ}$-set is a $B_h$-set $A$ whose sumset $hA$ is $Δ$-separated, that is, $|x-x'| \geq Δ$ for all $x,x' \in hA$ with $x\neq x'$. Upper and lower bounds are obtained for the cardinality of the largest $B_{2,Δ}$-sets contained in $\{1,2,\ldots, n\}$, that is, sets $A \subseteq \{1,2,\ldots, n\}$ such that, if $a,b,c,d \in A$ and $\{a,b\} \neq \{c,d\}$, then $|(a+b)-(c+d)| \geq Δ$.

comments
Revised and improved with new open problems; 11 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2608.07416 ↗

Conway's 99-graph problem asks whether a strongly regular graph with parameters srg(99,14,1,2) exists. We develop two complementary lines of attack. Fixing one vertex, the conditions lambda=1 and mu=2 force its neighbourhood to be a perfect matching and determine every edge between that neighbourhood and the remaining vertices. For (99,14,1,2), the unresolved part is therefore a constrained 12-regular graph on 84 vertices. We encode this reduction in CP-SAT and validate it by recovering the unique srg(9,4,1,2). We also prove by exhaustive enumeration that no circulant graph on Z/99 satisfies more than 68.0% of the CAISc constraints, and we give a validated orbit formulation for prescribed automorphisms. We then study the partial-score search problem. Fourteen human-designed search configurations reached at most 69.43%. Separately, we supplied the scoring function to an evolutionary program-search system. It produced a degree-preserving 4-vertex-switch tabu search whose best verified artifact scores 70.73%. The generated move differs from those used in our own searches and crosses a plateau that was stable under them. A tabu search restricted to graphs with a prescribed symmetry group, first Z/33 and then its subgroup of order 11, reaches a 14-regular graph scoring 76.67%. These results do not resolve the existence problem, but they reduce the exact search space and improve the best verified partial construction found in our experiments.

comments
An earlier version of this paper was accepted to the first Conference For AI Scientists (CAISc)
fields
Combinatorics
pdf ↗ page arXiv:2608.11211 ↗

The amalgamation decision problem asks whether the finite models of a given universal first-order sentence have the amalgamation property. We prove that this problem is ExpTime-hard for universal Horn sentences of maximum relation arity three, and 2ExpTime-hard when the arity is unbounded, thereby strengthening the previous best lower bounds for universal Horn sentences. The first reduction simulates runs of nondeterministic tree automata using a single ternary relation and unary and binary auxiliary relations. The second simulates finite winning strategies in an exponential corridor game. As a secondary contribution, we prove that deciding the winner remains 2ExpTime-complete for the game normal form used in our reduction, in which each move label determines a unique legal successor from every non-winning legal row.

comments
The upper-bound claims in v2 have been withdrawn due to an error in the proof. This version focuses on the new lower bounds
fields
Logic
pdf ↗ page arXiv:2608.12206 ↗

Let $S_g$ be a closed oriented surface of genus $g\ge2$. For a reductive representation $ρ:π_1(S_g)\to\mathrm{PU}(2,1)$, let $E_ρ$ be the energy function on Teichmüller space associated to equivariant harmonic maps into $\mathrm{CH}^2$. For every positive integer $d$ with $3\nmid d$, all sufficiently large $h$, and every $g>h$, we construct an irreducible reductive representation \[ ρ_{g,h,d}:π_1(S_g)\to\mathrm{PU}(2,1) \] with \[ τ(ρ_{g,h,d})=2h-2-\frac{2d}{3}\notin\mathbb Z, \qquad \mathrm{Crit}(E_{ρ_{g,h,d}})=\varnothing. \] Consequently, the associated branched-minimal-surface forgetful map is not surjective in these nonintegral Toledo components.

comments
Improved typesetting. Mathematics and content remain unchanged
fields
Differential Geometry, Algebraic Geometry, Geometric Topology
pdf ↗ page arXiv:2608.15714 ↗

We develop and analyze an increment-based $K$-$L$ integrator for dynamical low-rank approximation. This formulation eliminates the separate backward $S$-step and is algebraically equivalent to the fixed-increment projector-splitting integrator of Lubich and Oseledets. We establish a relaxed-exactness estimate that bounds the error in the low-rank approximation in terms of the prescribed increment error, with constants independent of small singular values. This estimate provides a framework for achieving robust high-order convergence through sufficiently accurate increments. We then construct low-rank Runge–Kutta methods in which both the stage and final approximations are computed using the $K$-$L$ integrator, without basis augmentation or rank truncation. Since classical Runge–Kutta order conditions alone do not guarantee robust high-order convergence for this construction, we derive sufficient conditions on the coefficients that ensure the required stage accuracy and establish robust convergence of order $p$. We identify explicit Runge–Kutta schemes of orders $p=2,3,4$ satisfying these conditions, and numerical experiments confirm the theoretical results.

fields
Numerical Analysis
pdf ↗ page arXiv:2608.17157 ↗

We study primes at which the reduction of an elliptic curve admits complex multiplication by an order in a prescribed imaginary quadratic field, a problem closely related to the Lang–Trotter conjecture for Frobenius fields. For certain non-CM elliptic curves $E/\mathbb{Q}$ and imaginary quadratic fields $K$, we show that either the number of primes $p\leq x$ at which $E$ has Frobenius field $K$ satisfies a logarithmic-type lower bound in $x$, or there are infinitely many supersingular primes at which the reduction of $E$ has CM by $K$. Assuming a $p$-adic approximation conjecture for singular moduli, we further obtain a quantitative lower bound in the supersingular case. Our approach extends Elkies's method for proving the infinitude of supersingular primes, combining a combinatorial argument with refined local estimates for singular moduli and Deuring's theory of complex multiplication. Finally, we use arithmetic intersection theory on modular curves to establish power-saving upper bounds for a restricted counting function.

comments
31 pages, comments are welcome!
fields
Number Theory
pdf ↗ page arXiv:2608.17639 ↗

This paper presents an improved full-wave solver for finite array antennas, and uses this solver to examine asymptotic properties of active impedance for large regular arrays. The improved solver is based on a preconditioning scheme that has been adapted for use on more general finite geometries, and an improved data structure. These two improvements result in a fast and stable solver with a lower memory footprint. By investigating the active impedance of the center element in finite arrays it is found that, even for arrays with 1000 elements, asymptotic behavior may differ appreciably from infinite arrays. Tied to these properties, different predictors on how the active impedance of the center element in the array behaves are presented. The two best predictors work very well for the wideband arrays investigated, and may be used to decide when array approximations, such as unit cell methods, are appropriate, rather than general statements on array size.

comments
13 pages, 11 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2608.17844 ↗

We define and study the arithmetic de Rham stack $X^{\operatorname{arith}}$ of a scheme $X$ over a field of characteristic $p$, and analyze its relation with related stacks such as the Hyodo–Kato stack. We show that $X^{\operatorname{arith}}$ gives a stack-theoretic approach to rigid cohomology and its coefficients, known as overconvergent isocrystals and arithmetic $D$-modules, which avoids the long-standing problem of frame-choosing in earlier approaches. We finally give some arithmetic applications of our formalism, such as a proof of Berthelot's conjecture on the preservation of overconvergent isocrystals by smooth proper pushforward.

comments
85 pages. New version with minor corrections. Comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2608.20203 ↗

We study the computational complexity of the decision versions of three classic classes of robust optimization problems: static robust optimization, two-stage (adjustable) robust optimization, and $K$-adaptability. We consider that the feasibility sets, the uncertainty sets, and the recourse sets are polyhedra or integer-programming-representable sets, the uncertainty is decision-independent or decision-dependent, and the feasible regions are bounded or unbounded. While these problems are well-established in the current literature, we give a systematic classification that places them in the complexity classes $\mathsf{P}$, $\mathsf{NP}$, $\mathsf{coNP}$, and higher levels of the polynomial hierarchy ($Σ_2^p$ and $Σ_3^p$), and, once decision-dependent uncertainty introduces quadratic constraints, in the existential theory of the reals and its hierarchy ($\exists\mathbb{R}$, $Σ_2\mathbb{R}$, and $Σ_3\mathbb{R}$) or among the undecidable problems. Beyond hardness reductions, we pay particular attention to membership proofs, establishing polynomial-size certificates even though the sets considered generally contain vectors of exponential encoding length. As a by-product, we give an alternative proof that bilevel linear optimization lies in $\mathsf{NP}$, exploiting its connection to decision-dependent robust optimization. For $K$-adaptability, we relate the problem to its static and two-stage counterparts, showing that hardness grows monotonically with $K$ and that, for fully discrete decision-dependent instances, $K$-adaptability reduces back to the static problem.

fields
Optimization and Control
pdf ↗ page arXiv:2608.21574 ↗

We prove that if $M$ is a connected complete parabolic Riemannian manifold and $N$ is a connected complete stochastically complete Riemannian manifold, then every bounded harmonic function on $M\times N$ is independent of the $M$-variable. Equivalently, pullback by the second projection induces an isometric isomorphism from the space of bounded harmonic functions on $N$ onto that on $M\times N$. In particular, the product of two parabolic manifolds has the bounded Liouville property, thereby answering Problem~16 of Grigor'yan's survey in the affirmative. The key analytic input is a total-variation memory-loss property of the heat kernel on a parabolic manifold. We establish this property by showing that the time-one heat kernel defines an aperiodic Harris recurrent transition kernel and then applying the row-merging theorem of Jamison and Orey.

comments
13 pages. v2: acknowledgments added. v3: author affiliation and contact information added; minor corrections and clarifications. Comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2608.22942 ↗

We prove that if a smooth affine complex surface has the same integral mixed Hodge structure as a smooth curve whose compactification is of positive genus, then it admits a smooth morphism to the curve with fibers isomorphic to $\mathbb{A}^1$. In particular, every such surface is the total space of a torsor for a line bundle on the curve. The motivation comes from Jouanolou's trick, to which this result gives a kind of converse in dimension $2$. We also give an example in the case of $\mathbb{P}^1$ which has the same integral mixed Hodge structure as $\mathbb{P}^1$ and simply connected but does not admit a smooth $\mathbb{A}^1$ fibration over $\mathbb{P}^1$.

comments
isomorphism in integral M.H.S. is used in the hypothesis of main theorem in place of rational M.H.S.. Also main theorem is proved for all smooth curves whose compactification has positive genus instead of just projective curves, A counter-example added in case of $\mathbb{P}^1$
fields
Algebraic Geometry
pdf ↗ page arXiv:2608.23021 ↗

Understanding how (multimodal) large language models perform on physics problems requires benchmarks that reflect the difficulty and breadth of expert-level physical reasoning. Existing physics benchmarks remain limited in the following two important ways: (1) short of high-difficulty datasets, and (2) lack of comprehensive coverage of visual forms, knowledge points, and step-by-step solution processes. As a result, model performance on current datasets may not be fully representative of their ability to solve complex physics problems. To address these issues, we present PhysElite, a large-scale bilingual multimodal benchmark for Olympiad-level physics reasoning. PhysElite contains 11,586 Olympiad-tier problems. For each problem, we provide corresponding visual diagrams, step-by-step bilingual Chinese-English solution derivations, and the final answer. We benchmark 18 open-source and closed-source MLLMs, and find that even the strongest model reaches only 33.7% answer accuracy. We additionally conduct step-level process evaluation to diagnose where models fail in the reasoning chain. Our datasets are released at https://github.com/PremiLab-Math/PhysElite.

comments
Annual Conference on Neural Information Processing Systems (NeurIPS) 2026
fields
Mathematical Physics
pdf ↗ page arXiv:2608.25097 ↗

Let $n\ge3$ and let $h:\A(r,1)\to\A(R,1)\subset\mathbb R^n$ be an onto homeomorphism with harmonic coordinate functions. We prove the sharp Nitsche bound \[ R\le R_{n,+}(r):=\frac{nr}{n-1+r^n}, \] and, when $h$ interchanges the two ends, the strictly stronger sharp bound \[ R\le R_{n,-}(r):=\frac{nr^{n-1}}{1+(n-1)r^n}. \] In each case, equality holds only for the corresponding radial harmonic homeomorphism, up to an orthogonal transformation. Both bounds and their equality cases extend to bounded harmonic maps in every dimension $n\ge2$. This requires nonzero degree of $h/|h|$ on interior spheres, $|h|\ge R$, and the corresponding $L^2$ limits of the modulus at the two ends. In the plane, we also prove the nonzero-winding-number conjecture of Iwaniec–Kovalev–Onninen [\emph{J. Amer. Math. Soc.} \textbf{24} (2011), 345–373], without endpoint modulus conditions. We prove a sharp $L^1$ contraction theorem for vector measures associated with spherical couplings. The first marginal is uniform, while the second is unrestricted. For bounded nonnegative nondecreasing zonal kernels, the optimal constant is the degree-one multiplier. If the kernel is also strictly increasing, equality holds exactly for couplings supported on orthogonal graphs. This theorem is the main tool in the proofs of the annular bounds and their rigidity.

comments
26 pages; Comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2608.27303 ↗

The online Ramsey game for graphs $G$ and $H$ is played on the infinite complete graph $K_\mathbb{N}$. In each round, Builder chooses an edge, and Painter colors it red or blue. The online Ramsey number $\tilde{r}(G,H)$ is the smallest integer $t$ for which Builder has a strategy guaranteeing a red copy of $G$ or a blue copy of $H$ within $t$ rounds. For every fixed integer $k\ge4$, the best-known asymptotic lower bounds for $\tilde{r}(K_{1,k},P_n)$ and $\tilde{r}(K_{1,k},C_n)$ are $\left(\frac{k+3}{4}+o(1)\right)n$ as $n\to\infty$. We improve the corresponding asymptotic upper bounds from $\left(k+o(1)\right)n$ to $\left(\frac{k+3}{3}+o(1)\right)n$ as $n\to\infty$.

fields
Combinatorics
pdf ↗ page arXiv:2608.27405 ↗

We prove uniqueness of finite-time geometric endpoints for the Möbius-invariant Willmore flow in $\mathbb{S}^3$ under uniform quantitative nonumbilicity. The multiplicity-counting varifolds converge, without reparametrization or Möbius renormalization, to a unique integral two-varifold. An intrinsic transport estimate gives quantitative total-variation convergence of the induced area measures on the fixed domain and bounded-Lipschitz Cauchy control of their pushforwards. Together with Allard compactness and rectifiability, this upgrades subsequential compactness to full-trajectory varifold convergence. The limit has generalized Euclidean mean curvature in $L^2$ with the natural endpoint lower-semicontinuity bound. For finite maximal trajectories with initial energy at most $8π$, Jakob's subsequential alternative becomes sequence independent: the limit is zero, or it has unit density and embedded Lipschitz support of genus zero or one. For Hopf-torus trajectories under the same energy bound, nonumbilicity is automatic and the anchored constant-speed profiles converge weakly in $W^{2,2}$ and strongly in $W^{1,2}$ and $C^{1,α}$ for every $α<\frac{1}{2}$. At infinite time, the same method yields a unique limit under an additional finite-dissipation-length condition.

fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2609.00501 ↗

Reverse-complement (RC) and palindromic (PAL) duplications insert a reversed copy of a length-$k$ block immediately after the block; an RC duplication also applies a fixed involutive complement to the inserted symbols. We study $q$-ary codes correcting $t$ such operations applied in sequence, where later operations may copy inserted symbols. For fixed $q\geq2$ and $k,t\geq1$, we prove that every length-$n$ code $C$ for either channel has redundancy $n-\log_q|C|\geq t\log_q n-O_{q,k,t}(1)$; for fixed $q,k$ and $1\leq t=t(n)=o(n)$ the lower bound is $t\log_q(n/t)-O_{q,k}(t)$. For fixed $k$, known codes for one length-$k$ insertion burst attain redundancy $\log_q n+O_{q,k}(1)$ for a single duplication of either type. For every even $k$ and any involutive complement, we show that the two channels are equivalent for every number of errors: the bijection complementing every other coordinate turns each RC duplication into a PAL duplication. This bijection therefore converts any $t$-error-correcting RC code into a PAL code of the same size, and conversely, with linear-time transfer of encoders and decoders. For every even $k$, we also determine the maximum number of descendants of one word under exactly two errors; by the bijection, it is the same for both channels. For fixed even $k$, a direct count using this maximum proves the existence of two-error-correcting PAL and RC codes with redundancy at most $4\log_q n+O_{q,k}(1)$. A known existence bound for two deletion bursts transfers to insertions with the same leading term as ours and a larger additive constant. For two errors, the converse gives $2\log_q n-O_{q,k}(1)$, a factor of two below these existence bounds.

comments
33 pages
fields
Information Theory
pdf ↗ page arXiv:2609.00779 ↗

In this paper, we propose accelerated inertial primal-dual dynamics for convex optimization problems with nonlinear convex inequality constraints. The proposed dynamics combine Nesterov accelerated vanishing damping $α/t$, a projected augmented-Lagrangian multiplier, and tangent extrapolation of the constraint mapping. Without assuming strong convexity, we establish global well-posedness and simultaneous $\mathcal O(t^{-2})$ decay rates for the constraint violation and the objective residual when $α\geq3$ and the extrapolation parameter satisfies a suitable compatibility condition. Under stricter parameter conditions, with $α>3$, we further prove that the primal-dual trajectory converges to a Karush–Kuhn–Tucker pair, both residuals decay as $o(t^{-2})$. Numerical experiments illustrate the theoretical results.

fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2609.01415 ↗

We study orthogonal polynomials of $d = d_1+d_2$ variables with respect to a wrapped product weight function $\Wb(\bm x,\bm y) = W_1(\bm x/ρ(\bm y)) W_2(\bm y)$ for $(\bm x, \bm y) \in \mathbb{R}^{d_1} \times \mathbb{R}^{d_2}$, where $ρ$ is either linear or the square root of a nonnegative quadratic polynomial, and identify all such polynomials that are eigenfunctions of a second-order linear differential operator. For $d =2$, it is known that there are primarily, up to affine transformations, five families of such polynomials, which are products or wrapped products of classical orthogonal polynomials of one variable; all five families have their counterparts in higher dimensions, but no characterization is known in dimension three or higher. Our study explores viable wrapped product families, finds explicit second-order differential operators for two new families of orthogonal polynomials in $d= d_1+d_2$ variables that have not been studied before when either $d_1>1$ or $d_2 > 1$, and provides, in particular, a complete list of such operators among all wrapped product orthogonal polynomials when $d = 3$. The list also includes four families that are eigenfunctions of a fourth-order differential operator, whereas no second-order operator is available. Moreover, orthogonal polynomials on the corresponding wrapped quadratic surfaces that are eigenfunctions of a second-order differential operator on the surface are also studied.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2609.01751 ↗

A critical quasilinear chemotaxis model with indirect signal production in space dimensions higher than two is studied under radial symmetry. Exploiting the variational structure of the system, the existence of a sharp mass threshold M\textsubscr{c} > 0 is established: all solutions with mass below M\textsubscr{c} are global and bounded, while those with mass above M\textsubscr{c} and sufficiently negative energy are global but blow up in infinite time. Moreover, the value of the critical mass M\textsubscr{c} is related to the best constant of a variant of a Hardy-Littlewood-Sobolev inequality.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.03713 ↗

We investigate limits of semigroups of stochastic matrices defined by their invariant distribution. Given probability vectors $q(β)$ depending on a parameter $β$, we introduce a notion of convergence as $β\to\infty$ for the corresponding semigroups of $q(β)$-preserving stochastic matrices and investigate the structure of the resulting limit. In general, the limiting semigroup differs from the semigroup preserving the limiting distribution, showing that these two operations do not commute. We develop a general framework for such limiting semigroups and study in detail the case in which the invariant distributions are Gibbs vectors at inverse temperature $β$. In that case, the limiting semigroup consists of block-upper-triangular stochastic matrices subject to additional substochasticity constraints. We characterise and enumerate their extremal elements and determine the preorder on probability vectors induced by the action of the semigroup. The resulting notion of Block-Triangular majorisation interpolates between ordinary majorisation and upper triangular (also known as unordered) majorisation. We show that it is completely characterised by a finite family of monotones and analyse the corresponding behaviour of R{é}nyi $α$-entropies as $β\to\infty$.

comments
19 pages, 1 figure, Major revision with presentation improved and typos fixed; Comments welcome!
fields
Mathematical Physics, Combinatorics, Probability
pdf ↗ page arXiv:2609.04057 ↗

Let $F$ be a non-archimedean local field of characteristic zero. Let $M$ be a Levi subgroup of $G = \mathrm{SL}(n,F)$. Consider the action on the discrete series of $M$ of the group of unitary unramified characters of $M$ (where a character acts by twisting). Given an orbit $\mathcal{O}$ for that action, let $W_\mathcal{O}$ be the global stabilizer of $\mathcal{O}$ in the Weyl group of $M$. We construct families of orbits $\mathcal{O}$ for which the action of $W_\mathcal{O}$ has no fixed point. More precisely, let $n \geq 8$ be an integer that is not prime and not equal to $9$. We attach families of orbits without fixed points to any divisor $m \geq 2$ of $n$ such that $m \;| \; q-1$ where $q$ is the order of the residue field of $F$. The Levi subgroup $M \subset G$ for the corresponding families has $m$ blocks of size $k\geq 2$ and $2$ blocks of size $m$. The core of the paper is the construction of superculpidal representations of $\mathrm{GL}(m,F)$ and $\mathrm{GL}(k,F)$ satisfying some conditions that we require to construct the families of orbits $\mathcal{O}$ that we expects. In addition, we study the fixed point problem for the dimensions $n$ that we excluded above, i.e., prime or small dimensions. We prove that there is always a fixed point under the action of $W_\mathcal{O}$ in those cases.

fields
Representation Theory
pdf ↗ page arXiv:2609.05055 ↗

A lattice Gabor frame consists of a window function and its time-frequency shifts along a lattice. We classify the lattices that admit Schwartz-class and, equivalently, Feichtinger frame windows. Except for symplectically irrational lattices of critical covolume 1, we determine the lattice-dependent achievable window smoothness and decay using the scale of modulation spaces. For symplectically rational lattices, including the rational lattices typically used in digital applications, the classification is governed by an integer lattice parameter introduced herein, the symplectic index gap. Our results extend the classical and amalgam Balian-Low theorems. The companion paper "Tilings, Packings, and Smooth and Compactly Supported Gabor Windows" develops the associated tiling-packing theorem and compact-support constructions.

comments
93 pages, 11 figures
fields
Functional Analysis
pdf ↗ page arXiv:2609.06255 ↗

Foundation models for ground states in spin-1/2 systems are a promising method for problems ranging from quantum chemistry to identifying new phase diagrams. Nearly all such models are currently pure-states that condition on the Hamiltonian's parameters, whose Monte Carlo samples give energy estimates according to the variational principle. In this contribution, we show that this representation is topologically obstructed. For any gapped Hamiltonian family whose ground-state bundle is non-trivial, every continuous normalized state-vector model has zero fidelity with the ground state at some parameter value in the Hamiltonian family. For that value, the energy is at least one spectral gap, $Δ$, with an $O(Δ)$ gap in an open-neighbourhood of that point. We show that this is a sufficient no-go also in the case of degenerate ground-state manifolds, time dynamics, and periodic systems with mixed space-time topology, demonstrating these obstructions on one- and two-qubit systems. We discuss how this causes a spike in the fidelity susceptibility, giving a numerical signature of a phase-transition where there is none. Finally, we show that operator-valued models canonically avoid these obstructions and preserve topological information, implying a structural necessity in representation for foundation neural quantum states.

comments
10 pages, 5 pages main text
fields
Mathematical Physics
pdf ↗ page arXiv:2609.07591 ↗

We study zeroth-order optimization of nonconvex functions with the aid of directional hints, which are cheap but potentially inaccurate approximations of the true gradient direction, given by linear subspaces at each iteration. To leverage these hints adaptively while maintaining robustness to their quality, we introduce Control-Variate Zeroth-Order Descent (CV-ZOD), a new framework that refines the classical zeroth-order gradient estimator with a control variate that can be set based on the directional hints. We first show that the oracle algorithm that optimally sets the reference vector and step size at each iteration achieves a convergence rate that interpolates between the first-order $O(1/T)$ rate and the zeroth-order $O(d/T)$ rate, depending on the quality of the hints along the trajectory. We then develop a practical variant of CV-ZOD that achieves the same oracle guarantee up to logarithmic factors, without any prior knowledge of the hint quality. We validate the method empirically on simulation-based scientific optimization tasks, demonstrating sustained progress on nonconvex landscapes where zeroth-order descent is slower and existing guided methods stall as guidance deteriorates.

fields
Optimization and Control
pdf ↗ page arXiv:2609.08277 ↗

In this paper we derive a Probably Approximately Correct (PAC)-Bayesian error bound for partially observed linear time-invariant (LTI) stochastic dynamical systems in state-space form with inputs and sub-Gaussian noise. Such bounds are widespread in machine learning, and they are useful for characterizing the predictive power of models learned from finitely many data points. The bound derived in this paper relates the expectation of prediction errors with the prediction error generated by the model on the data used for learning. In addition, we show that it can also be used to derive bounds for the parameter estimation error. In turn, this allows us to provide finite-sample error bounds for the prediction error and parameter estimation error for a wide class of system identification algorithms. Furthermore, as LTI systems are a sub-class of recurrent neural networks (RNNs), these error bounds could be a first step towards PAC-Bayesian bounds for RNNs.

fields
Optimization and Control
pdf ↗ page arXiv:2609.08740 ↗

This paper studies a time-inconsistent mixed regular-singular control problem in continuous time with non-exponential discount. We seek time-consistent equilibria in an intrapersonal game framework and propose two novel definitions of regular-singular equilibrium where both regular and singular controls are unified via control laws. The standard equilibrium definition allows simultaneous perturbations of both controls, while a mild definition restricts perturbations to one control at a time. Verification theorems providing sufficient conditions are established for both definitions. We illustrate the applicability of the theory through the effort and dividend problem. First, a mild equilibrium is constructed, yet not a standard equilibrium, highlighting the distinction between the two definitions. Moreover, we derive semi-explicit threshold-type equilibria under both a mixture of exponential discount functions and a pseudo-exponential discount function. In both cases, the convexity of the value function is rigorously established, the equilibrium conditions are verified, and the existence of the effort and dividend thresholds is proved. Numerical results reveal the impacts of exogenous parameters on the effort and dividend thresholds and the equilibrium value function, along with their economic implications.

fields
Optimization and Control
pdf ↗ page arXiv:2609.08877 ↗

Large linear programs can exceed the memory of a single compute node. Although first-order methods replace sparse factorizations with GPU-suited matrix-vector products, other solver phases can reintroduce a single-node memory limit. We present SHARDLP, a distributed GPU LP solver that keeps the matrix and primal-dual state partitioned from sharded input through solution output. On the Google PDLP benchmark, SHARDLP solves ten of eleven instances, compared with eight in the published CPU PDLP study. On the largest benchmark, eight H200 GPUs solve a 1.185-billion-variable, 6.338-billion-nonzero LP in 9.9 minutes; the published CPU experiment reports 21.06 hours on different hardware. Beyond this benchmark, separately checked multi-node solves reach up to 13.604 billion variables and 40.807 billion nonzeros, while validated executions span up to 76 GPUs across 29 compute nodes. For column-partitioned solves, support-aware communication skips GPUs that store no coefficients for a row; on an LP with 2.76 billion nonzeros, it cuts modelled communication by 92.97% and improves solver time by 1.27x-1.52x. The code for SHARDLP is available at https://github.com/ArnaudDeza/ShardLP.

comments
21 pages, 5 figures. Accepted at the 18th Annual Workshop on Optimization for Machine Learning (OPT 2026), NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2609.09108 ↗

We define a derived stack $\mathscr{Rep}_n(X)$ which generalizes the assignment $A\leadsto \operatorname{Rep}_n(A)$ to an algebra of its derived $GL_n$-representation variety of arXiv:1112.1449 from algebras $A$ to perfect stacks $X$ over characteristic 0 fields. In the case of a quasi-projective classical scheme $X$, we show that $\mathscr{Rep}_n(X)$ admits a subfunctor $\operatorname{Quot}^{n,\text{fr}}_{\mathscr{O}_X^n}(X)\subset \mathscr{Rep}_n(X)$, which is in fact represented by a derived scheme almost of finite type. We further construct a Fourier-Mukai integral transform between the derived categories of quasi-coherent sheaves on $X$ and $\operatorname{Quot}^{n,\text{fr}}_{\mathscr{O}_X^n}(X)$ which induces a trace map at the level of Hochschild homology generalizing the trace morphism constructed in arXiv:1112.1449 (for finitely presented commutative algebras). We show that the subfunctor $\operatorname{Quot}^{n,\text{fr}}_{\mathscr{O}_X^n}(X)$ is a derived enhancement of the framed locus of the Quot scheme of points and that this derived scheme is a $GL_n$-torsor over the stack of coherent length $n$ torsion sheaves. Hence, this stack is an analog of the derived character stack for quasi-projective schemes, and we show that for smooth, Calabi-Yau $X$, it inherits a shifted symplectic structure in the sense of arXiv:1111.3209 from the one constructed in arXiv:1812.11913 on the moduli stack of perfect complexes with proper support. This structure is shown to give a generalization of the classical symplectic structure on character varieties of surfaces of genus 1 constructed by Goldman \cite{gold}.

comments
31 pages. AI statement added, and typographic errors corrected. Some exposition improved
fields
Algebraic Geometry, K-Theory and Homology, Representation Theory, Symplectic Geometry
pdf ↗ page arXiv:2609.09633 ↗

We develop a time–frequency framework for lattice GKP codes in which ideal codewords are realized in the modulation space $M^\infty$ and identified, through a vector-valued Zak transform, with a finite logical fibre over the continuous syndrome torus. Multi-window Gabor analysis then represents the logical vector by a finite block of adjoint-lattice coefficients. We prove that the normalized block map is an isometry, obtain an explicit recovering projection, and derive stable logical reconstruction. We further construct normalizable GKP approximants as lattice-envelope Gabor multipliers and establish weak-$*$ convergence and asymptotically isometric encoding. Finally, we recover displacement syndromes from phase relations between translated coefficient blocks and quantify their stability under additive perturbations.

comments
minor changes
fields
Mathematical Physics, Information Theory, Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2609.10802 ↗

We study early stopping for stochastic gradient descent with a constant step size applied to noisy linear inverse problems with polynomially decaying spectrum. The iteration is stopped by the discrepancy principle, that is, as soon as its residual reaches the prescribed noise level. For Hölder source conditions below a saturation level determined by the polynomial decay, we prove that the mean-square reconstruction error at the stopping index is bounded by the classical rate, up to an explicit factor involving the step size and the incoherence of the design, and that the expected number of iterations is of the order of the oracle stopping index. The rate is minimax-optimal for deterministic noise whenever the spectrum contains an eigenvalue at the oracle scale and this factor stays bounded. The step size is restricted by a spectrum-weighted incoherence condition. The analysis allows rank-deficient designs and inconsistent observations.

fields
Numerical Analysis, Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2609.11273 ↗

We construct a compact, smooth, simply connected complex threefold. Its second and third integral homology groups are cyclic of order two, and its remaining homology groups agree with those of the six-sphere.

fields
Differential Geometry
pdf ↗ page arXiv:2609.11541 ↗

This paper investigates the structural properties of function spaces and their connections with Lawson-compactness and web spaces in domain theory. First, using finite-refinement and palette methods, we characterize the topological spaces $X$ for which the function space $[X\to L]$ is an RB-domain for every RB-domain $L$. In particular, we establish the equivalence between this preservation property and the condition that $X$ is compact, core compact, core coherent, and a web space. We further investigate its relationship with RW$^*$-spaces and obtain partial results concerning the Lawson-Mislove's problem. Second, we construct a countably based topological space $Z$ that is compact, core compact, core coherent, and a web space, but is neither a wide web space nor a C-space. More precisely, its lattice of open sets is a continuous frame satisfying $κ$-distributivity for every finite cardinal $κ\geq 2$, while failing to be $ω$-distributive. This provides a negative answer to a question raised by Erne and demonstrates that finite distributivity, even at every finite level, does not imply countable distributivity. Finally, by introducing labelled posets and employing constructions based on presheaves over finite sets and their element posets, we prove that every Lawson-compact domain is a Scott-continuous retract of a Lawson-compact algebraic domain, thereby answering a problem proposed by Kou. As applications, we show that the function space from an RB-domain to a Lawson-compact domain is Lawson-compact. Moreover, for an FS-domain $X$, we establish that $X$ is an RB-domain if and only if $[X\to L]$ is Lawson-compact for every Lawson-compact domain $L$. This characterization also yields the existence of an FS-domain $X$ and a Lawson-compact algebraic domain $L$ for which $[X\to L]$ is not continuous. This gives a negative answer to the question raised by Shen et al.

fields
General Topology
pdf ↗ page arXiv:2609.11671 ↗

For real random matrices $A_n=(a_{ij})_{1\le i,j\le n}$ with independent centered entries of unit variance, \citet{BaoPanZhou2015} established the classical logarithmic law under a uniform fourth-moment condition: \[ \frac{\log|\det A_n|-\frac12\log(n-1)!} {\sqrt{\frac12\log n}} \Rightarrow \mathcal N(0,1). \] We find that this Gaussian universality can be extended beyond the fourth-moment condition, with two distinct transitions in the center and fluctuation scale as the moment condition gradually weaken. The first critical condition is the uniform integrability of the family $\{|a_{ij}|^4/\sqrt{\log(e+|a_{ij}|)}\}_{n,i,j}$. The classical law remains valid under this weaker condition, with no change in center or scale. As the moment condition is weakened further, the classical center can fail. Replacing the classical center $\frac12\log(n-1)!$ by the actual mean $\mathbb E\log|\det A_n|$ preserves the standard Gaussian limit at the original scale and allows the moment condition to be relaxed to a second critical condition: uniform integrability of $\{|a_{ij}|^4/\log(e+|a_{ij}|)\}_{n,i,j}$. Under still weaker moment conditions, the classical scale $\sqrt{\frac12\log n}$ can also fail. Replacing this scale in turn by the actual standard deviation $\sqrt{\operatorname{Var}(\log|\det A_n|)}$ yields a standard Gaussian limit whenever the expectations of $|a_{ij}|^4/\{\log(e+|a_{ij}|)\}^α$ are uniformly bounded over $n,i,j$, for any fixed $α\ge0$. The results using the actual mean or standard deviation additionally assume uniformly bounded entry densities. We establish the sharpness of the first two critical conditions via counterexamples. We further obtain Berry–Esseen bounds for all three normalizations, with optimal rates under a uniform fourth-moment bound.

comments
98 pages
fields
Probability
pdf ↗ page arXiv:2609.11688 ↗

We introduce a notion of typical horseshoe, consisting of a pair of rectangles admitting Markov returns at times of positive lower density, with controlled hyperbolic geometry and orbits that shadow typical trajectories. We prove the abundance of typical horseshoes for the random standard map and establish several statistical properties of the system, including exponential mixing and large deviation estimates for the associated projective and two-point processes.

fields
Dynamical Systems
pdf ↗ page arXiv:2609.12908 ↗

Let $\Gs(2,q)$ denote the graph induced in the Grassmann graph by the $q$-ary simplex codes of dimension $2$. We determine its diameter for every prime power $q$. The cases $q=2,3$ are elementary, while the diameter for $q=4$ follows from a known description of the distance relation. We prove that the diameter equals $3$ for every $q\ge5$, so that it is $0$ for $q=2$, $2$ for $q=3$, and $3$ for all $q\ge4$. The proof uses the realization of two-dimensional simplex codes as projective lines and a ratio criterion for collinearity of simplex points. A consequence of a theorem of Marshall Hall on finite abelian groups yields a bridge lemma and gives the uniform upper bound $3$. To obtain the matching lower bound for $q\ge5$, we construct an explicit diagonal pair of simplex lines and rule out a common neighbor by two independent arguments, one based on moments and the other on products. For $q\ge7$, we also give an independent counting proof. The case $q=4$ is treated separately. In particular, for $q\ge4$ the simplex-code graph is not isometrically embedded in the ambient Grassmann graph.

fields
Combinatorics
pdf ↗ page arXiv:2609.13574 ↗

Let $R^\ast(n)$ be the minimum radius of a central circle externally tangent to nonoverlapping circles of radii $1,\ldots,n$. We prove that $R^\ast(n)=C_\ast n^2+o(n^2)$ and give finite linear programs that enclose $C_\ast$ with prescribed error. An exact angular comparison reduces the problem to marked points on a line with separation at least the geometric mean of each pair of marks. Concatenation with bounded joining cost and reassignment to the prescribed normalized radii prove existence of the limit. Balanced finite-word programs give a bracket of width $(1/k+1/r)/π$, before directed arithmetic error, using $k$ types and words of length $r$. We also obtain explicit geometric bounds. For the upper bound, we recover finite and countable reflected-block constructions by actual permutations, retaining all pair constraints. A coupled terminal-subset argument gives an explicit lower bound strictly above $1/8$. Together these give $C_{\rm term}+η_{\rm width}\le C_\ast\le U_4$. The lower endpoint comes from the terminal-subset argument, and the upper endpoint from the four-block construction; neither is asserted sharp. The finite-word scheme establishes computability; efficient high-precision evaluation and the structure of global optimizers remain open.

comments
9 pages. Revised exposition and reproducibility documentation. Standalone proof supplements S1 and S2 are supplied as ancillary PDFs, with their TeX sources included
fields
Metric Geometry
pdf ↗ page arXiv:2609.13630 ↗

We study rare nonresonant regions in a canonical one-dimensional disordered quantum spin chain by directly implementing the iterated Schrieffer-Wolff construction underlying the recent work of De Roeck, Giacomin, Huveneers and Prosniak on subdiffusive transport. For finite systems, we compute the probability that a disorder realization remains nonresonant through successive scales of the flow, while separately monitoring operator proliferation and the spatial localization of dressed local observables. The survival probability decays at most exponentially with system size over the numerically accessible regime. Resolving this decay scale by scale yields failure rates associated with successive Schrieffer-Wolff steps. The first rate is obtained analytically in excellent agreement with numerics, while higher-scale rates decrease rapidly throughout the regime studied. These results support the summability mechanism required for exponentially rare but parametrically long nonresonant regions, which provide the insulating bottlenecks responsible for subdiffusive transport. At the smallest couplings studied, the survival probability under our conditions exceeds the rigorous lower bound by six to seven orders of magnitude, demonstrating how conservative the constants required by the proof are while confirming that its underlying physical mechanism is quantitatively visible at accessible scales. More broadly, our results show how direct numerical implementations can provide an independent and physically transparent test of technically demanding constructive proofs, a methodology that may become increasingly useful as machine-assisted proofs become more common.

comments
41 pages, 9 figures, preprint format
fields
Mathematical Physics
pdf ↗ page arXiv:2609.13834 ↗

V. Fedorchuk, A. Chigogidze and T. Banakh in 2003 and V. Bogachev in 2024 posed the following questions: (i) is it true that $P_τ(X)$ is $C$-embedded in $P_σ(X)$; (ii) is it true that $P_R(X)$ is $C$-embedded in $P_R(βX)$ if and only if $X$ is pseudocompact, where $P_σ$, $P_τ$ and $P_R$ are the functors of probability measures on the space $X$ that are, respectively, $σ$-additive on the Baire $σ$-algebra, $τ$-additive, and Radon? The answers to these questions are negative. In this paper the questions are put into a general framework: for spaces of measures $Q_p(X)\subset Q_q(X)$ of various types we study when $Q_p(X)$ is $C$-embedded ($C^*$-embedded) in $Q_q(X)$. It is proved that for spaces of alternating measures $M_p(X)\subset M_q(X)$ the $C$-embeddedness, the $C^*$-embeddedness and the $G_δ$-density of $M_p(X)$ in $M_q(X)$ are equivalent, and a criterion in terms of sequences of continuous functions is given. The question of $C$-embedding of measure spaces is an extension of the question of coincidence of measure spaces, which is a development of the classical concepts of universally measurable and universal measure zero sets. Note (corrected version): incorrect statements of the previous versions are marked or removed; see the last section of the paper.

comments
14 pages
journal
E. A. Reznichenko and Yu V. Sadovnichiy. A new approach to universal measurement. Bulletin of the Institute of Mathematics of the National Academy of Sciences of the Kyrgyz Republic, (2):2, 2025
fields
General Topology, Functional Analysis, Probability
pdf ↗ page arXiv:2609.14414 ↗

Traveling waves are fundamental objects in reaction–diffusion systems; however, spatial heterogeneities can distort or inhibit their propagation. Determining whether a given heterogeneity results in propagation failure remains challenging, particularly in systems with coupled components. In this paper, we present explicit constructions of stationary coupled upper and lower solutions tailored to specific heterogeneities for a one-dimensional FitzHugh–Nagumo system. By leveraging the mixed quasimonotone structure of the system, these barriers yield sufficient conditions for the failure of propagation for families of trapped initial conditions. The stationary constructions establish directional signal blocking in FitzHugh–Nagumo neuron models with localized reaction heterogeneities, including light-gated ionic conductances, and with abrupt geometric variations; the resulting stationary barriers persist for sufficiently small recovery diffusion. Additionally, we introduce explicit almost stationary barriers, which provide conditional bounds on the expansion of componentwise threshold regions in homogeneous media.

comments
36 pages, 7 figures. The new version corrects some minor typos and adds a new optogenetics motivation
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.14944 ↗

We study the smallest nonzero eigenvalue of the sample correlation matrix $\mathbf{R}_n$ formed from a $p_n \times n$ data matrix with i.i.d. real entries $ξ$ of mean zero and unit variance, in the high-dimensional regime $p_n / n \to φ\in (0, \infty) \setminus \{1\}$. In the tall regime $φ> 1$, we prove almost-sure convergence of $λ_n (\mathbf{R}_n)$ to the lower Marčenko–Pastur edge $λ_- = (1 - \sqrtφ)^2$ without additional moment assumptions. In the wide regime $φ< 1$, we establish a phase transition at the third-order tail scale. If $t^3 \mathbb{P}\{\lvert ξ\rvert > t\} \to 0$ as $t \to \infty$, the smallest eigenvalue $λ_{p_n} (\mathbf{R}_n)$ converges in probability to $λ_-$. While if $t^3 \mathbb{P}\{\lvert ξ\rvert > t\} \to \infty$, then $λ_{p_n} (\mathbf{R}_n)$ converges in probability to zero. At the critical scale $t^3 \mathbb{P}\{\lvert ξ\rvert > t\} \to κ\in (0, \infty)$, the point process of eigenvalues in the lower gap $(0, λ_-)$ converges in distribution to a Poisson random measure with explicit intensity. In this critical regime, we also identify the nondegenerate limiting distribution of $λ_{p_n} (\mathbf{R}_n)$, which has a continuous density on $(0, λ_-)$ and a positive atom at $λ_-$.

comments
This manuscript has been merged into the revised version of arXiv:2610.06731.
fields
Probability
pdf ↗ page arXiv:2609.15731 ↗

We identify the sharp iterated-logarithmic thresholds at the critical exponent for quantitative measure equivalence and orbit equivalence between integer lattices. To be more precise, let $n>m$ be two positive integers, $α$ be a positive number and $( β_j)_{j \geqslant 1}$ be a finitely supported sequence of non-negative numbers. We show that there is a quantitatively $t^α\cdot \prod_{j \geqslant 1} ( \log^{(j)}{t} )^{-β_j} $-integrable measure equivalence from $\mathbb{Z}^n$ to $\mathbb{Z}^m$ if and only if either $α<m/n$ or $α=m/n$ and there is $j_* \geqslant 1$ such that $β_j= 1$ for all $1 \leqslant j < j_*$ and $β_{j_*} > 1$. Here $\log^{(j)}$ is the $j$-fold iterated logarithm. The same characterization holds for quantitative orbit equivalence. This characterization greatly strengthens the previous best-known result, due to the work of Delabie, Koivisto, Le Maître and Tessera (2022) and the work of Correia (2025), which asserts that there is a $t^α$-integrable ($α>0$) measure equivalence (or orbit equivalence) from $\mathbb{Z}^n$ to $\mathbb{Z}^m$ if and only if $α<m/n$. In particular, our result solves, in much stronger forms, two open problems posed respectively by Delabie, Koivisto, Le Maître and Tessera, and by Naryshkin and Petrakos.

comments
Comments welcome!
fields
Dynamical Systems
pdf ↗ page arXiv:2609.15816 ↗

Spectral contrastive learning keeps the $k$ directions along which two views of the data depend most strongly, while downstream tasks may need other directions. Existing guarantees for spectral features assume that the distribution of tasks has no preferred direction. We show that this isotropy condition is the wrong criterion. With linear probing, the task distribution affects the average probing gain only through the matrix $BΛB^\top$, where $B$ records the dependence between views and $Λ$ is the task covariance: optimal features span its top-$k$ eigenspace, whereas spectral features span that of $BB^\top$. Transfer therefore depends on alignment, and strongly uneven task preferences cost nothing when they favour the spectral directions. Otherwise the regret of spectral features is at most linear in the anisotropy of $Λ$. No representation chosen without task information improves this rate when the leading spectrum is flat, and a spectral gap makes it quadratic. With labelled tasks, the same matrix gives a correction: Fisher discriminant directions for a frozen encoder, or a one-term change to the spectral contrastive loss. We bound the regret of the correction by the error in estimating $BΛB^\top$, and compare this error with the misalignment of spectral features to decide when to correct. The analysis extends to finite samples, continuous variables and noisy views. Correction reduces synthetic held-out regret from $0.858$ to $0.003$ with $2000$ labelled tasks, and the decision rule gives the lowest regret among the tested rules at every bank size. On CIFAR-100, spectral features of frozen encoders keep most of the task signal on unseen classes, and where a bank of other classes would lower accuracy, the rule keeps them in every case.

comments
45 pages, 4 figures, 15 tables. Feedback and comments are welcome!
fields
Information Theory
pdf ↗ page arXiv:2609.15825 ↗

Let a finite group $A$ act coprimely on a finite group $G$, and let $C=C_G(A)$. Navarro asked whether an $A$-invariant irreducible character has linear Glauberman–Isaacs correspondent if and only if it is nonvanishing on $C$. We give counterexamples to this equivalence. We also prove that when $G$ is nilpotent, nonvanishing on $C$ implies that the Glauberman–Isaacs correspondent is linear.

comments
10 pages
fields
Group Theory
pdf ↗ page arXiv:2609.16227 ↗

We introduce new techniques for determining combinatorial properties of sets of multiple recurrence by considering weighted averages with quickly growing weights. Our main result is a far-reaching generalization of Szemerédi's Theorem which additionally confirms a conjecture of Bergelson-Moreira-Richter and contains as special cases both a variant of the Polynomial Szemerédi Theorem due to Bergelson-Leibman-Lesigne and the fact that if $f$ belongs to a broad class of smooth functions and satisfies $x^{d-1}\prec f(x)\prec x^d$ for some $d\in \mathbb{N}$ then for any $\ell\in \mathbb{N}$, any invertible measure preserving system $(X,\mathscr{B},μ,T)$, and any $A\in \mathscr{B}$ with $μ(A)>0$, the set $\{n\in \mathbb{N}: μ(A\cap T^{-[f(n)]}A\cap T^{-2[f(n)]}A\cap \cdots\cap T^{-\ell[f(n)]}A )>0\}$ is thick, meaning that it contains arbitrarily long intervals of natural numbers. Additionally, we formulate and prove a generalization to weighted averages of Boshernitzan's criterion for uniform distribution which we use in the proof of our main result.

comments
64 pages. This version fixes errors in Sections 3 and 5
fields
Dynamical Systems, Combinatorics
pdf ↗ page arXiv:2609.16554 ↗

In this paper, we introduce diassociative conformal algebras that unify both associative conformal algebras and diassociative algebras. We show that the category of diassociative conformal algebras is equivalent to the category of equivalence classes of formal distribution diassociative algebras. By employing its Maurer-Cartan characterization, we then define the cohomology of a diassociative conformal algebra and show that it carries a Gerstenhaber algebra structure. Our cohomology can be used to study deformations and extensions of the structure. Finally, we define averaging operators on associative conformal algebras and find their close relations with diassociative conformal algebras.

comments
Comments are welcome. Some corrections to the proofs of Theorem 3.9 and Proposition 3.10 have been made
fields
Mathematical Physics
pdf ↗ page arXiv:2609.17441 ↗

The flip symmetry on link diagrams induces an involution on Khovanov-Rozansky ${\frak{gl}}_{N}$ homology. We prove that this involution is the identity over the integers, generalizing a previous result of Chen and the author. The key ingredients of the proof are (1) a homotopy perturbation argument from a detailed study of the fork twist, which allows us to reduce the computation to planar ${\frak{gl}}_{N}$ webs, and (2) the computation of the flip map for planar ${\frak{gl}}_{N}$ webs via diagrammatics of Soergel bimodules. The latter computation can also be interpreted as a naturality result for the half twist action on type $A$ Soergel bimodules, which might be of independent interest.

comments
42 pages, many figures. v2: major revision, main result improved
fields
Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2609.18780 ↗

We introduce a matrix generalization of the cone of Harvey and Lawson and prove that it is an exact special Lagrangian manifold. We further show that it belongs to a family of exact special Lagrangian manifolds that foliate the balanced manifold arising in deep learning.

comments
17 pages, updated some remarks and references in v2
fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2609.20159 ↗

Let $R$ be a nonzero commutative unital ring and let $Γ$ be a row-finite, strongly aperiodic higher-rank graph with no sources and a nonempty finite vertex set. We determine the prime ideals that occur as annihilators of modules induced from simple isotropy modules. They are parametrised by maximal tails of $Γ$ and prime ideals $\mathfrak p$ of $R$ for which the fraction field of $R/\mathfrak p$ is obtained by inverting a single element. Under the product description of the prime spectrum, these are precisely its locally closed points. The realisation argument uses a dense periodic orbit in every finite maximal-tail quotient. We also construct an explicit faithful simple module for the Leavitt algebra $L_R(1,2)$ whenever $R$ is a Goldman domain. Consequently, $L_{k[t]_{(t)}}(1,2)$ is primitive although its coefficient ring is not a field. In this example the zero ideal is locally closed but not completely irreducible. We obtain full prime-to-primitive coincidence for coefficient rings with finite spectrum and for semilocal rings of Krull dimension at most one, and transfer the results to split pullback Kumjian–Pask algebras. For pullbacks over an uncountable field, the full primitive spectrum is described without assuming algebraic closedness.

fields
Rings and Algebras
pdf ↗ page arXiv:2609.20230 ↗

Let $n\geq3$, $2\leq k\leq n-1$, and $m=n-k-1$. We prove that a complete, connected, noncompact, oriented manifold $(M^n,g)$ with scalar curvature $R_M\geq k(k-1)$ is isometric to $\mathbb{S}^k\times\mathbb{T}^m_Λ\times\mathbb{R}$ if it admits a smooth proper map of non-zero degree to $\mathbb{S}^k\times\mathbb{T}^m\times\mathbb{R}$ whose spherical component is 1-Lipschitz. We also establish a weighted scalar curvature obstruction at infinity for sphere-torus targets with a higher dimensional Euclidean factor under suitable control of the Euclidean component. These results hold in all dimensions without a spin assumption.

comments
43 pages. Extended the noncompact Llarull type theorem from dimensions at most seven to all dimensions without a spin assumption. Added a weighted scalar curvature obstruction at infinity
fields
Differential Geometry
pdf ↗ page arXiv:2609.20498 ↗

We construct an explicit involution on Dyck paths satisfying $\defc\le\min(\area,\dinv)$ that interchanges area and dinv, where $\defc=\binom n2-\area-\dinv$ and $n$ is the semilength. In addition, we give an involution on Dyck paths with $\defc \le 2n-8$ that interchanges area and dinv. Finally, we give an explicit partition formula for the portion of the $q,t$-Catalan polynomial of total degree at least $\binom n2-2n+8$, thereby proving a conjecture of Lee and Li~\cite[Conjecture~4]{LeeLi11}. Altogether our results give a combinatorial explanation of $q,t$-Catalan symmetry in the region $\defc\le\max(2n-8,\min(\area,\dinv))$. Our constructions rely on a number of new combinatorial objects developed here and three main external tools: the dual Dyck insertion of \cite{Hawkes26}, the Garsia–Milne involution principle~\cite{GarsiaMilne81,Doyle19}, and the partition bijection of ~\cite{LoehrWarrington09}. We also explore rational analogs of these results, give an answer to Question~4.9 of Kiem and Lee~\cite{KiemLee24} and consider deficit up to $3n-15$ briefly.

fields
Combinatorics
pdf ↗ page arXiv:2609.21403 ↗

We study real-analytic, planar, maps, at a neighbourhood of an elliptic fixed point. We construct normal forms for them, when they admit a real-analytic first integral. We prove that a second first integral, when it exists, forces their linearisation. We consider both the resonant and the non-resonant case, whether the maps preserve a symplectic form or not. The second first integral is allowed to be smooth, real-meromorphic or real-analytic.

comments
2nd version, corrected and with two examples added
fields
Dynamical Systems
pdf ↗ page arXiv:2609.21417 ↗

We establish a global stochastic maximum principle for forward-backward stochastic control systems with an unbounded terminal condition and a generator that has quadratic growth and is convex in $Z$. The control domain need not be convex, and the diffusion coefficient may depend on the control. In this setting, the BMO martingale estimates used for quadratic BSDEs with bounded terminal conditions are no longer directly available. To overcome this difficulty, we work under an equivalent probability measure associated with the optimal trajectory and establish the estimates needed for the variational analysis. In particular, using a representation formula for convex quadratic BSDEs with conditional estimates, we derive estimates for the backward-state perturbations under this fixed measure. These estimates allow us to justify a second-order expansion of the cost functional and obtain the global stochastic maximum principle.

fields
Optimization and Control
pdf ↗ page arXiv:2609.21451 ↗

We study row-softmax self-attention with independent Gaussian query and key weights in the proportional regime, at fixed inverse temperature. Hayase, Collins, and Karakida proved Gaussian equivalence for the empirical squared singular-value distribution after removal of the Perron direction. A global law alone does not exclude finitely many nonleading outliers. We prove that no such outliers persist: the rescaled squared singular value $\ell s_k(A)^2$ converges in probability to the upper edge of their bulk law for every fixed $k\ge 2$. In fact, this convergence is uniform over any deterministic sublinear number of leading non-Perron indices. The proof uses an exact decomposition of the softmax normalization, conditions on the key matrix, identifies the conditional covariance exactly with a diagonally conjugated inner-product kernel, linearizes that kernel in operator norm, and applies the outside-support local law of Fan, Ma, Paquette, and Wang. A separate stability argument identifies the finite conditional deformed Marchenko-Pastur edge with the limiting bulk edge. We also derive a scalar formula for that edge throughout the proportional regime and recover the explicit square-model formula of Hayase, Collins, and Karakida, including its physical branch.

fields
Probability
pdf ↗ page arXiv:2609.23949 ↗

We establish a new method for the study of imaginary non-CM fields of arbitrary \(2\)-power degree and class number one. In particular, we show that for degrees greater than \(16\), dihedral fields either lie in the ray class field of one of the three imaginary quadratic fields \(\mathbb{Q}(\sqrt{-2})\), \(\mathbb{Q}(\sqrt{-3})\),\(\mathbb{Q}(\sqrt{-19})\),\(\mathbb{Q}(\sqrt{-43})\), \(\mathbb{Q}(\sqrt{-67})\), whose conductor is supported only on primes dividing \(2\), with explicit upper bounds on the relevant exponents, or are Hilbert class fields of imaginary quadratic fields. We also give a complete classification of the \(161\) imaginary non-CM fields of degree \(16\) with class number one, providing explicit tables of defining polynomials, Galois groups, base fields, and conductors. These \(161\) non-CM fields, together with the six CM fields classified by Louboutin and Okazaki \cite{lou7}, complete the classification of all imaginary fields of degree \(16\) with class number one. For CM fields, the problem reduces to computing relative class numbers via analytic class number formulae, whereas for non-CM fields the absence of a totally real subfield of index \(2\) requires a different approach and leads to a richer variety of Galois groups and ramification patterns.

fields
Number Theory
pdf ↗ page arXiv:2609.24114 ↗

Object-valued time series, including distributions, covariance matrices, networks, and compositions, lack the linear structure required by conventional autocovariance-based definitions of long memory. We develop an intrinsic framework for defining and estimating long memory in metric spaces of negative type. An isometric embedding yields a centered Hilbert-valued process, and the trace of its lag-covariance operator provides a signed, additive measure of temporal dependence. Crucially, this trace equals the difference between the marginal mean pairwise distance and expected lagged distance, so the framework and its estimators use only distances between the original objects. We define the memory parameter through the nonsummable decay of this trace and show that it coincides with the usual parameter in Hilbert-valued settings. Estimation uses Bartlett aggregates of distance-based lag measures. Estimating the common marginal distance from the same dependent sample induces a common-centering bias in these aggregates. We derive its finite-sample form and propose iterated block-difference corrections, log-ratio and multi-bandwidth log-slope estimators, and a localized self-consistency refinement. We establish consistency, document substantial bias reduction in simulations, and find long-memory evidence in foreign-exchange return distributions and U.S. electricity-generation compositions.

fields
Statistics Theory
pdf ↗ page arXiv:2609.24153 ↗

We consider $N \times N$ random band matrices $H = (H_{xy})$ with centered complex Gaussian entries, indexed by points $x,y$ on the two-dimensional discrete torus $(\mathbb{Z} / \sqrt{N} \mathbb{Z})^2$. The matrix entries $H_{xy}$ vanish whenever the distance between $x$ and $y$ exceeds a constant multiple of the bandwidth parameter $W$. We prove that, for any fixed $\varepsilon>0$, if $W\geq(\log N)^{1+\varepsilon}$, then all bulk eigenvectors are delocalized with high probability. Equivalently, this yields a lower bound of order $\exp(W^{1-\varepsilon})$ on the localization length of two-dimensional random band matrices for arbitrarily small constant $\varepsilon>0$, improving the superpolynomial lower bound $W^C$ for every fixed constant $C>0$ established in arXiv:2503.07606. A key ingredient of our proof is a new strategy that closes the resolvent flow analysis using only loop observables of order at most two, without relying on the higher-order loop hierarchy.

comments
79 pages. Extended the main results to smaller bandwidths, down to the scale of $\log N$
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2609.24426 ↗

We study the computational complexity of fundamental algorithmic problems -- membership testing, separation, valid-inequality testing, and linear optimization -- over polytopes and cones arising from cooperative games (also known as pseudo-Boolean functions). A central obstacle in the study of such problems is that a general cooperative game on $n$ players requires $2^n$ values, so the input size is $2^n$ for a game with $n$ players, making these computational tasks theoretically trivial. Restricting to $k$-additive games reduces the input size to $O(n^k)$, making such games a natural target for meaningful questions about the existence of efficient algorithms. On the positive side, we give an explicit extended formulation of size $O(n^k)$ for the core of $k$-additive $k$-monotone games, allowing all four problems to be solved by a single polynomial-size linear program -- in particular, circumventing the ellipsoid method that is needed when building from earlier tractability results of Deng and Papadimitriou, or of Edmonds. For the cone of $k$-additive $(k{-}1)$-monotone games, we give a complete characterization of its extreme rays and derive the same $O(n^k)$ bound on extension complexity, yielding a geometry-based proof and generalization of a result of Billionnet and Minoux. On the negative side, we show that for $l \leq k-2$ the cone of $k$-additive $l$-monotone games is computationally intractable: membership testing is not in NP (unless NP\,=\,coNP), valid-inequality testing is NP-complete, and extension complexity is at least $1.5^n$. Our hardness results yield, as a special case, a result of Crama and of Gallo and Simone. Furthermore, our hardness results also explain the lack of any good characterization of the extreme rays of the cone of $k$-additive $(k{-}2)$-monotone games.

fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2609.24593 ↗

In this article, we study germs of biholomorphisms of $(\C^n,0)$, $n\geq 2$ fixing the origin, the linear part at which has all its eigenvalues on the unit circle. We prove the existence of a {\it sectorial} transformation to a polynomial normal form of a non-degenerate 1-resonant biholomorphism under a Diophantine condition. We also give their holomorphic classification. We show that the {\it sectorial} automorphisms of the polynomial normal form are {\it exponentially flat} perturbations of the identity. We deduce the Gevrey character of the formal normalizing transformation and we show how the Gevrey index depends on the Diophantine exponent.

comments
In this last version, we improved the formal part in order to include two more new results : the sectorial centralizer of the normal forms are exponentially close perturbation of Identity as well as the Gevrey character of the formal normalizing transformation.
fields
Dynamical Systems, Complex Variables
pdf ↗ page arXiv:2609.24695 ↗

In this paper, we study Zhang twist of Leavitt path algebra $L_K(E)$ using a graded automorphism $σ$ induced by a graph automorphism such that the twisted algebra is a Leavitt path algebra over another graph $E_σ$ which is a twisted graph obtained from the original graph $E$. We also show that the hypothesis that $σ$ be induced by a graph automorphism cannot be dropped as we construct a graded automorphism of the Leavitt path algebra of an infinite graph whose Zhang twist is not isomorphic to any Leavitt path algebra. We also define the notion of noncommutative projective scheme for $\mathbb Z$-graded algebras that coincides with the notion of noncommutative projective scheme for connected $\mathbb N$-graded algebras defined by Artin and Zhang and study it in the context of twists of Leavitt path algebras. We establish combinatorial connection between the graphs $E$ and $E_σ$ and as a consequence, we show that many ring-theoretic properties are invariant for Leavitt path algebras under the twist by $σ$. In particular, we show that the invariant basis number property is preserved under Zhang twists considered here for finite graphs, whereas the module type is not preserved.

comments
We add an example where the twist of a Leavitt path algebra by a graded automorphism not induced by graph automorphism fails to admit the Leavitt path algebra structure. We also add a result showing that IBN is preserved under Zhang twist of Leavitt path algebras for finite graphs
fields
Rings and Algebras
pdf ↗ page arXiv:2609.24836 ↗

A fundamental question in physics is: When does classical behavior emerge from quantum systems? Bosonic Gaussian states provide a natural setting to explore this quantum-classical boundary, as they capture both the classical field behavior and the intrinsic quantum nature of light. Here, we address this problem from a learning-theoretic perspective by asking: When are bosonic Gaussian states classical to learn? That is, under what conditions (if any) can an n-mode bosonic Gaussian state be learned with as few samples, and with operations as simple, as are needed to learn a classical 2n-variate Gaussian distribution? We establish a smooth crossover in learnability governed by the state's thermal fluctuations: - Cold Gaussian states are non-classical to learn: When the covariance matrix satisfies $Σ\le(\frac12+O(\frac1n))I$, i.e. close to the vacuum covariance, tomography under single-copy (i.e., non-entangled) measurements fundamentally requires $Ω(n^3)$ copies, strictly exceeding the sample complexity $Θ(n^2)$ of learning classical Gaussian distributions. We show that this hardness persists even when few-copy entangled measurements are allowed. - Warm Gaussian states are classical to learn: When thermal fluctuations exceed the vacuum noise, parameterized by $Σ\ge(\frac12+ν)I$ for any parameter $ν>0$, we prove that single-copy tomography requires $N=Θ\left(n^2\min(n,1+ν^{-1})\right)$ copies. This bound is tight and is achieved by simple, non-adaptive, unentangled heterodyne measurements. Crucially, for $ν=Ω(1)$, the sample complexity drops to $Θ(n^2)$, matching the classical case. Our results tightly characterize a quantum-to-classical crossover in the learnability of bosonic Gaussian states, reveal a novel connection between fundamental physics and statistical learning theory, and have implications for real-world sensing experiments.

comments
comments welcome. v2: corrected typos and slightly expanded discussions
fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2609.26705 ↗

The principal {\it commutation formula} underlying the paper by Deift [24], is of the type \[ - z (AB - z I)^{-1} + A (BA - z I)^{-1} B = I, \quad z \in [ρ(AB) \cap ρ(BA)]\backslash\{0\}, \] where, temporarily, and for simplicity only, $A,B$ represent bounded operators in a Banach space. A fundamental consequence of this commutation formula is the fact that $AB$ and $BA$ are {\it essentially isospecral} in the sense that \[ σ(AB) \backslash \{0\} = σ(BA) \backslash \{0\}. \] Moreover, under appropriate trace class hypotheses, this implies the fundamental identity for (Fredholm) determinants \[ \det(I - AB) = \det(I - BA), \] which extends to modified (or regularized) Fredholm determinants. In this paper we briefly recall some of the applications of these commutation formulas to isospectrality, integrable systems, regularization of PDEs, and estimates in Statistical Mechanics and Quantum Field Theory discussed in [24]. Subsequently, we review some of the ramifications of commutation formulas that were established over the past fifty years, including determinants and dimension reduction, random matrix theory and dimension expansion, integrable operators, Poncelet's porism, interpolation, eigenvalue computation, KPZ, Pfaffians, the focusing Gross-Pitaevskii equation, one-dimensional scattering theory, Floquet theory, and the Miura transformation connecting the KdV and mKdV hierarchies.

comments
56 pages, 2 figures
fields
Spectral Theory
pdf ↗ page arXiv:2609.27151 ↗

When do orthogonal measurements extract all accessible information? We introduce a posterior algebra for full-rank ensembles. Its commutativity determines whether an information bound is attained; its joint eigenspaces then classify optimal finite-outcome measurements. For two states, we constructively prove Shor's conjecture in finite dimension, including singular states. Orthogonal measurements can fail at fixed guessing error: a discontinuous basis switch forces some qubit pairs to need three outcomes. A Tsallis information score can require three outcomes even without an error constraint.

comments
35 pages, 6 figures, 4 tables, including End Matter and Supplemental Material. Revised title and exposition, with expanded treatment of posterior algebra and optimal-measurement structure. The original version was first made publicly available on Zenodo on 13 August 2026: https://doi.org/10.5281/zenodo.21911604. Numerical code and data: https://doi.org/10.5281/zenodo.24009410
fields
Mathematical Physics
pdf ↗ page arXiv:2609.27992 ↗

We develop a novel pathwise approach to study the convergence of the law of killed diffusion processes conditioned on non-absorption, towards a quasi-stationary distribution (QSD) as time goes to infinity. We start from the general observation that the dynamics of an absorbed Markov process conditioned upon survival up to time $T>0$ is the minimizer of the pathwise relative entropy with respect to its unconditioned dynamics, under a simple distributional constraint at that time; in other words, a Föllmer process. We then show how this result applies to a Brownian diffusion process softly-killed at a state-dependent regular rate, and characterize the minimizer and its drift change. In the case when the diffusion process is moreover reversible, we leverage these ideas and recent results on the propagation of weak log-concavity of HJB semigroups to prove that, under strict asymptotic convexity of the potential, the conditioned dynamics satisfies a contractivity property in $1$-Wasserstein distance, uniformly in $T>0$. We then establish the existence of a QSD with a large domain of attraction and deduce the exponentially fast convergence to it of the conditioned semigroup in the $1$-Wasserstein distance as $T$ goes to infinity. Finally, we deduce the exponentially fast convergence, also in $1$-Wasserstein distance, of the law of the corresponding Q-process towards its equilibrium.

fields
Probability
pdf ↗ page arXiv:2609.29042 ↗

We establish global $W^{2,p}$ solvability for the Poisson equation with mixed Dirichlet–Neumann boundary conditions in two classes of domains in all dimensions $n\geq 2$. For $C^{1,α}$ domains with a Reifenbeg flat interface, we obtain the optimal range $1<p<4/3$, provided that $α>1-1/p$. For Lipschitz polyhedra with facewise boundary decompositions, we obtain solvability for $p$ close to $1$. In both settings, we establish endpoint $W^{2,1}$ solvability for data in an adapted atomic Hardy space. Applications of the methods to Lamé systems are also discussed.

comments
20 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.30090 ↗

We characterize, up to logarithmic factors, the optimal higher-order oracle complexity of finding approximate solutions to composite monotone inclusion problems, formed by the sum of a smooth single-valued monotone operator and a maximal monotone set-valued operator. We introduce the Anchored Extra-Proximal (AEP) framework, which combines an anchored extrapolation step with an inexact anchored proximal update satisfying a relative-error condition. This framework recovers the composite Fast Extragradient method in the first-order setting and yields natural higher-order extensions through Taylor approximations of the smooth operator at the extrapolated point. For every $p\geq 2$, assuming that the $(p-1)$th derivative of the single-valued operator is $L_p$-Lipschitz continuous and the initial distance to a solution is at most $R$, we combine AEP with a bisection line search to obtain a $p$th-order method that attains a tangent residual of at most $\varepsilon$ in $\widetilde{O}((L_p R^{p}/\varepsilon)^{\frac{2}{3p-1}})$ oracle calls. We complement this result with a worst-case lower bound of $Ω((L_p R^p/\varepsilon)^{\frac{2}{3p-1}})$ for every deterministic algorithm in the $p$th-order oracle model, without imposing any prescribed update structure. For the subclass of smooth nonexpansive fixed-point problems, we further establish a lower bound of $Ω(\min\{R/\varepsilon, {(L_p R^{p}/\varepsilon)}^{\frac{2}{3p-1}}\})$. By choosing between AEP and Halpern iteration, we match this lower bound up to logarithmic factors, thereby also settling the deterministic oracle complexity of smooth nonexpansive fixed-point problems.

comments
54 pages; added a lower bound on nonexpansive fixed-point problems and updated discussion of concurrent work
fields
Optimization and Control
pdf ↗ page arXiv:2609.30212 ↗

For every admissible ideal $\mathcal{I}$ on $\mathbb{N}$, we prove that every regular space with a $σ$-hereditarily closure-preserving (HCP) $\mathcal{I}$-$sn$-network is $\mathcal{I}$-$sn$-metrizable, answering Problem~5.2 of Zhou–Liu–Liu–Lin. The proof combines existing characterizations with a local countability bound. If $y_n\to_{\mathcal{I}} x$ in a space $X$ and $\{n:y_n\ne x\}\in\mathcal{I}^{+}$, then every point-discrete family of $\mathcal{I}$-sequential neighborhoods of $x$ is countable. If no such sequence exists at $x$, then $\{x\}$ itself is an $\mathcal{I}$-sequential neighborhood. These alternatives imply that every space with a $σ$-point-discrete $\mathcal{I}$-$sn$-network is $\mathcal{I}$-$snf$-countable. We say that $\mathcal{I}$ has local HCP-finiteness if, in every $T_1$ space, the convergence and support assumptions above imply that each HCP family of $\mathcal{I}$-sequential neighborhoods of $x$ is finite. A countable Rudin–Keisler antichain of free ultrafilters gives an admissible ideal without this property, so the countability bound cannot in general be strengthened to finiteness. Every $P^{-}$ ideal has local HCP-finiteness. We give sufficient conditions for Fubini products, heterogeneous Fubini sums, and increasing unions to preserve this property. These results establish local HCP-finiteness for the finite Fubini powers of $\mathrm{Fin}$, Katětov's first limit-stage ideal $\mathrm{Fin}^ω$ and its finite successors, the tree-derived rank-$ω$ ideal $\mathcal H_{<ω}$, and the inductive-limit ideal $\mathrm{Fin}_ω$. All these examples except $\mathrm{Fin}$ fail $P^{-}$.

comments
33 pages
fields
General Topology, Logic
pdf ↗ page arXiv:2609.30317 ↗

In this paper, we consider linear stochastic systems with control-linear noise and periodically sampled measurements. We address the problem of feedback stabilization in the mean-square sense. The main contribution of the paper is to provide a necessary and sufficient condition for feedback stabilization. In particular, we relate feedback stabilizability of the stochastic system to the existence of a fixed point of a Riccati-type algebraic equation and, further, to the existence of a solution to an infinite-horizon optimal control problem.

fields
Optimization and Control
pdf ↗ page arXiv:2609.30438 ↗

Let $G/P$ be a flag manifold with $G$ simple. We determine the rational homotopy groups $π_{\ast }(G/P)\otimes \mathbb{Q}$ and describe the rational cohomology ring $H^{\ast }(G/P;\mathbb{Q})$ solely in terms of the rational homotopy types of $G$ and $P$, respectively. The proof is based on the restrictions of basic Weyl invariants of $G$ to suitable simple factors of $P$, which also address a key nonvanishing issue not settled by earlier approaches of Meier, Shiga-Tezuka, Kotschick, and Terzic.

comments
16 pages
fields
Algebraic Topology, Algebraic Geometry
pdf ↗ page arXiv:2609.30591 ↗

We proved a log-star comparison between the expectation threshold $q(\mathcal F)$ and the fractional expectation threshold $q_f(\mathcal F)$ for any nontrivial increasing family $\mathcal F$ on a finite ground set $V$ of size $|V|=N$. Specifically, we show that $$q_f(\mathcal F)\le64\log_2^*(N+2)\,q(\mathcal F),$$ where $\log_2^* x$ is the iterated logarithm of base-2. Using similiar methods, one can extend this result to the following stronger form: there exists a universal constant $C>0$ such that \[ q_f(\mathcal F)\le Cq(\mathcal F)\log_2^*(l(\mathcal F)),\quad q_f(\mathcal F)\le Cq(\mathcal F)\log_2^*(\operatorname{VC}(\min\mathcal F)), \] where $l(\mathcal F):=\max\{2,\max_{S\in\min\mathcal F}|S|\}$ and $\operatorname{VC}(\min\mathcal F)$ denotes the VC-dimension of $\min\mathcal F$. On October 7, 2026, OpenAI released a result proving the equivalence of fractional and integral thresholds, which supersedes the findings in this note. The authors are keeping this note for historical reference.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2609.30680 ↗

Outliers are essential for evaluating and improving the robustness of machine learning systems, especially when future distributions may differ significantly from historical training data. In high-stakes applications, robustness often depends on rare cases that finite datasets fail to capture, making simple resampling or perturbation insufficient for stress scenario generation. Existing outlier synthesis methods typically rely on sparse neighborhoods, low support latent regions, or classifier boundary crossings, which can be heuristic, unstable, and tied to specific modalities or architectures. We therefore propose Sinkhorn Boundary Outlier Generation (SBOG), a structured framework for latent-space outlier generation that couples Sinkhorn optimal transport geometry with distributionally robust boundary modeling. The resulting Sinkhorn-induced support cost guides the sampler toward weakly supported boundary regions, while semantic constraints prevent uncontrolled drift from the intended context, yielding controlled deviations from the in-distribution reference measure rather than arbitrary sparse-region samples. Experiments on time series anomaly generation and image outlier synthesis show that our framework produces informative, semantically controlled outliers and improves downstream robustness evaluation across modalities, providing a foundation for stress scenario generation beyond empirical support.

comments
Accepted by NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2609.31470 ↗

We prove that the Kählerness of a finitely presented, residually finite group is not determined by its profinite completion, which answers a question asked independently by Arapura and Libgober. In the proof, we give explicit constructions to characterize the absolute Dynkin types that admit non-isomorphic real forms of higher-rank Lie groups containing torsion-free arithmetic lattices with isomorphic profinite completions.

comments
28 pages, comments welcome
fields
Geometric Topology, Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2609.31523 ↗

Let $P_q$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_q]$ over the prime field of two elements, $\mathbb F_2$, with the degree of each $x_i$ being 1. We study the {\it hit Peterson problem} of finding a minimal set of generators for $P_q$ as a module over the mod-$2$ Steenrod algebra, $\mathcal{A}.$ In this note, we present the minimal sets of $\mathcal{A}$-generators for $P_5$ in the cases where the degree are sufficiently general.

comments
7 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2609.32475 ↗

In the planar $n$-body problem, Moeckel and Montgomery \cite{MM25} showed that there is no infinite spin for total collision solutions, when the reduced and normalized configuration converges to an isolated central configuration. Following their approach, generalizations have been obtained for partial collision solutions and parabolic solutions in the planar case, and for total collision solutions in the spatial cases by various authors, all under the same assumption that the reduced and normalized configuration converges to an isolated central configuration. Here we prove there is no infinite spin for any collision or parabolic solution in all dimensions without such an assumption.

comments
With more typos fixed and reference updated
fields
Dynamical Systems
pdf ↗ page arXiv:2609.33250 ↗

Matchgate circuits describe classically tractable dynamics in a physically relevant setting while nonetheless exhibiting features characteristic of complex quantum systems, such as high amounts of magic. This invites the broader question: to what extent are typical complexity measures saturated under trivial dynamics? Here, we address this by studying the behaviour of different Heisenberg-picture complexity measures in random matchgate ensembles. Our main technical contribution is a tractable and generalisible free-fermionic unitary Weingarten calculus formulated entirely in the Majorana basis. This method is tailored to computing moments of operators, and simplifies to a combinatorics problem which depends on the boundary conditions prescribed by a given operator functional. Using this framework, we derive closed-form expressions for the typical local-operator entanglement, operator stabiliser entropy, and higher-order out-of-time-ordered correlators. For extensive initial Majorana strings, both operator entanglement and stabiliser entropy obey volume laws, even though the underlying circuits remain classically simulable. Out-of-time-ordered correlators can likewise become exponentially small, showing that their late-time saturation value alone does not witness computational hardness and constituting a classically tractable example of emergent free independence. Finally, we relate these separations to operator resource theories, showing how operator entanglement beyond the Gaussian baseline lower-bounds the number of non-Gaussian gates in doped matchgate circuits. Our results present a practical toolbox for computing exact averages over random matchgates, while clarifying the distinction between quantum resources versus simulation complexity, and their dependence on the representation being exploited.

comments
19 pages main + 16 pages appendix; many figures. Comments welcome! v2 note added; updated references
fields
Mathematical Physics
pdf ↗ page arXiv:2609.38300 ↗

We propose a holographic dual of the relative entropy of entanglement for a boundary tripartition $A:B:C$. Our proposal is that, at the leading order, \begin{align} E_R(ρ_{AB}) = \frac{1}{4G_N}\Big[\mathrm{Area}(Γ_{\min}) - \mathrm{Area}(γ_{AB})\Big] \notag \end{align} where $Γ_{\min}$ is the minimal bulk tripartition surface and $γ_{AB}$ is the minimal surface homologous to $AB$. For a general random tensor network, we prove the corresponding upper bound by constructing a separable state associated with $Γ_{\min}$ and evaluating its relative entropy. We also establish the matching lower bound rigorously for networks of one, two, and three Haar random tensors by bounding the maximal tripartite product-state overlap. In appropriate geometries, the minimal tripartition surface can form a nontrivial tri-junction resembling the Mercedes logo.

comments
55 pages, many figures
fields
Mathematical Physics
pdf ↗ page arXiv:2609.38815 ↗

Reinforcement learning and contextual bandit algorithms have become increasingly common in sequential decision-making applications. When these methods are deployed in high-stakes domains, there is growing interest not only in learning effective policies, but also in conducting statistical inference for quantities learned under adaptive data collection. However, classical procedures applied naively in these settings can fail: even when estimators are unbiased, their variance becomes path-dependent and as a result may not be asymptotically normal. A growing literature has emerged to ameliorate this problem, but solutions tend to be problem specific and often rely on correct specification of a working model. In this work, we develop a unified framework for constructing asymptotically valid confidence intervals to cover smooth functionals of nonparametric M-estimands under adaptive sampling. Under Neyman orthogonality, we provide two novel methods for performing inference: (1) a self-normalized statistic based on the realized quadratic variation of the influence function and (2) a statistic using a plug-in estimate of the conditional variance based on reweighted influence function increments. Our results allow for flexible nonparametric estimation of nuisance parameters and remain valid under model misspecification. Our theory is supported by a simulation study for a dynamic pricing application which demonstrates that this method can produce asymptotically valid confidence intervals where standard methods fail.

comments
47 pages, 5 figures. Accepted at The Fortieth Annual Conference on Neural Information Processing Systems (NeurIPS 2026)
fields
Statistics Theory
pdf ↗ page arXiv:2609.39274 ↗

For every integer $d\geq4$, we construct pairs of projective toric manifolds of complex dimension $d$ that are not homotopy equivalent but have isomorphic integral cohomology rings and homotopy equivalent 5-fold suspensions. We also construct pairs of quasitoric manifolds over the $d$-dimensional cube with these properties. Our construction starts with a closed, oriented smooth manifold $B$ of real dimension $6$ whose integral cohomology ring is generated by $H^2(B)$. For a class $u\in H^2(B)$, let $L_u$ denote the complex line bundle with first Chern class $u$, and set $P_u=\mathbb P_B(L_0\oplus L_u)$. We show that if $u,v\in H^2(B)$ satisfy $uv=0$, then, for every finite product $N$ of complex projective spaces, the manifolds $P_{u+v}\times N$ and $P_{u-v}\times N$ have isomorphic integral cohomology rings and homotopy equivalent 5-fold suspensions. To distinguish their homotopy types, we introduce the sets of strong zero-product pairs $\mathrm{SZ}^{n,m}(X)\subseteq H^n(X)\times H^m(X)$, which are preserved by homotopy equivalences. Using these sets, we give explicit conditions on $u$ and $v$ ensuring that these manifolds are not homotopy equivalent, and exhibit toric and quasitoric examples satisfying these conditions.

comments
22 pages. Comments are welcome
fields
Algebraic Topology
pdf ↗ page arXiv:2609.39707 ↗

Every non-linear plane Cremona map can be decomposed into quadratic maps, and the minimum number of quadratic maps required is called its quadratic length. It is known that plane Cremona maps of degree 3 have quadratic length either 2 or 3. In this paper, we study the quadratic length of plane Cremona maps $\varphi$ of degree 4. Recall that either $\varphi$ is de Jonquières, i.e. it has a base point of multiplicity 3, or it is not de Jonquières. In the latter case, $\varphi$ has quadratic length 2, whereas in the former case we prove that $\varphi$ has quadratic length 3, 4, or 5, and we classify those maps that reach the upper bound.

fields
Algebraic Geometry
pdf ↗ page arXiv:2609.39943 ↗

We investigate the recurrence coefficients of monic generalized Charlier polynomials for the weight $ρ_μ(k)=μ^k/(k!)^2$, $μ>0$. The coefficients satisfy a discrete Painlevé reduction, and their deviations from the limiting values $β_n\sim n$ and $γ_n\simμ$ occur on a factorial rather than algebraic scale. A comparison with the recessive solution $J_n(2\sqrtμ)$ of the associated discrete Bessel equation, together with a Hankel-determinant sector decomposition, identifies the connection constant as one. For fixed $μ>0$, this gives $β_n-n\simμ^{n+1}/[n!(n+1)!]$ and $μ-γ_n\simμ^{n+1}/(n!)^2$. We further derive a uniform expansion for the normalized sector factor $Φ_n(μ)=e^{-μ}\mathcal R_n(μ)$, valid for $0<μ\le cn$ with each fixed $c<1$: $\logΦ_n(μ)=μ[(n/(n+1))^2-1] -μ^2(2n-1)/[2(n+1)^4] +O_c(μ(1+μ)^{3/2}/n^4)$. The proof uses transition-content moments for Plancherel growth and weighted Poisson-tail estimates. It yields joint refinements of both recurrence coefficients in the subcritical linear regime. We distinguish these quantitative asymptotic results from the classical Painlevé, Toda, and Young-diagram identities on which the analysis rests.

comments
in press
journal
Review in Mathematical Physics, 2026
fields
Mathematical Physics
pdf ↗ page arXiv:2610.00396 ↗

Let $\mathcal{A}$ be an extension-closed proper abelian subcategory of a triangulated category $\mathcal{C}$, and put $\mathcal{D}_\ell=Σ^\ell\mathcal{A}*\cdots*\mathcal{A}$ for $\ell\geq 1$. Assuming that $\operatorname{Hom}_{\mathcal{C}}(Σ^p\mathcal{A},\mathcal{A})=0$ for $1\leq p\leq\ell+1$, we construct homology functors $H_i:\mathcal{D}_\ell\to\mathcal{A}$ for $0\leq i\leq\ell$ and prove that triangles in $\mathcal{D}_\ell$ induce natural long exact sequences in $\mathcal{A}$. If $\mathcal{C}$ is Krull–Schmidt, we introduce compatible sequences of subcategories of $\mathcal{A}$ and use them to classify the homology-determined subcategories $\mathcal{A}\subseteq\mathcal{X}\subseteq\mathcal{D}_\ell$ that are closed under extensions and direct summands.

comments
Revised the exposition and proofs; updated the abstract, introduction, and examples
fields
Representation Theory
pdf ↗ page arXiv:2610.01155 ↗

We study conditional fluctuations of smooth mean-field systems on a torus with symmetric stable common jumps of index $0<α<1$. A positive-strip estimate makes empirical Poisson acceptance errors negligible at the sampling scale. Given the full Poisson master, the conditional laws converge in probability to a centered Gaussian kernel in a negative Sobolev path space. In dimension one, quantile coupling preserves this limit for microscopic marks with relative tail remainder $O(x^{-ρ})$, where $ρ>\tfracα{2}$. A second-order tail expansion identifies the response when this condition fails: it shifts the conditional Gaussian mean at criticality and, when nonzero, dominates sampling below criticality. We also identify the transition from a stable to a Brownian rank error. In a translation model, rank and clock couplings give the same microscopic laws but different path fluctuations. Rank coupling gives a functional Gaussian limit. Clock coupling admits no diverging additive path normalization at the limiting center.

comments
39 pages, 1 table
fields
Probability
pdf ↗ page arXiv:2610.01391 ↗

Moving an atom and splitting it symmetrically can give the same weak change in a Lévy characteristic, yet produce Wasserstein errors of different orders. We explain this through first- and second-order expansions of the distribution function for infinitely divisible laws with a Gaussian factor. The expansions are uniform over Lipschitz tests and include distributional directions from moving atoms. When the first response is nonzero, analyticity gives the signed second coefficient of the Wasserstein–1 distance. When it vanishes, a finite second displacement moment gives a quadratic response, with a positive coefficient whenever the dispersion is nonzero. For local balanced remeshing, we prove matching bounds in terms of grid-alignment variance and construct a linear program with a controlled optimization gap. We also determine the sharp transition as Gaussian smoothing vanishes. The appendices give proofs, metric speed and length, and multivariate and state-dependent extensions.

comments
70 pages
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2610.01411 ↗

Electromagnetic duality in the toric code has order two at the level of anyon types and acts as a Hadamard-type logical transformation on the encoded quantum information. Here, we ask whether it can likewise be realized microscopically as an order-two Clifford operation. For the $\mathbb{Z}_2$ toric code, we prove that any locality-preserving Clifford realization of electric-magnetic exchange cannot have order two. Our proof is fully general and requires neither translation symmetry with restricted families of system sizes nor a fixed pairing between vertex and plaquette stabilizers. Geometrically, the proof locally emulates the unavoidable crossing between electric and magnetic strings, similar to a cross-cap in a non-orientable manifold. Extending the problem to the $\mathbb{Z}_N$ toric code, we find that an order-two Clifford realization exists for odd $N$, whereas it is impossible for even $N$. Our result shows that the order-two exchange of closed-string operators cannot be extended to an order-two exchange of open-string operators.

comments
36 pages, many figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.02097 ↗

Let $θ$ be an ordinal and let $(N_α)_{α\leqθ}$ be a continuous increasing tower of closed normal subgroups of a Hausdorff topological group $G$, with $N_0=\{e\}$. Write $ρG$ for the Raikov completion of $G$, and put $K_α=\overline{N_α}^{ρG}$ and $H_α=GK_α$. The successive and limit differences of the groups $H_α$ mark the first stages at which points of $ρG$ become old quotient points. For every nonzero ordinal $θ$ and every set $S\subseteq(0,θ]$, there is a Hausdorff pseudocompact Boolean group with a continuous tower of closed normal subgroups such that every member of the tower is pseudocompact and the nonempty strata occur exactly at the stages in $S$. The terminal quotient can simultaneously be chosen isomorphic to $\mathbb Z/2\mathbb Z$, and for every $δ<θ$ the successive factor $N_{δ+1}/N_δ$ is compact exactly when $δ+1\notin S$. Thus a tower may have a single nonempty stratum at a limit stage even when every successive factor is compact. For a closed normal subgroup $N$ of $G$, let $\widehat q:ρG\toρ(G/N)$ extend the quotient homomorphism and put $K=\overline N^{ρG}$. Over $gN\in G/N$, the fiber in $ρG\setminus G$ is $g(K\setminus N)$, homeomorphic to $ρN\setminus N$, while for $y\in\widehat q(ρG)\setminus(G/N)$ the entire $\widehat q$-fiber lies in $ρG\setminus G$ and is homeomorphic to $ρN$. For precompact kernels this gives a canonical decomposition, and nested quotients give the two-stage identity underlying the transfinite filtration. Further results concern pseudocompact Raikov remainders and include countable Abelian examples.

comments
24 pages
fields
General Topology, Group Theory
pdf ↗ page arXiv:2610.02212 ↗

We derive checkable convergence, error, and execution-cost bounds for repeating a supplied finite control sequence from a static Lindblad stabilization certificate and complete implementation data, including concurrent background dynamics. The static decay bound and error bounds from static to planned evolution and from the plan to execution together bound the actual cycle's contraction factor in one fixed Lyapunov metric. For target-preserving planned and actual paths and a controller returning to its initial state each cycle, a uniform contraction bound below one gives cycle-end convergence from every initial state under cycle-varying uncertainty. Uniformly bounded within-cycle amplification in that metric extends this convergence throughout physical time when cycle durations are bounded above and away from zero. With leakage, uniform error bounds relative to certified target-preserving paths give explicit long-time distance bounds. Cycle and within-cycle bounds also screen a specified finite hardware library for sequences certified to meet and maintain a prescribed tolerance. In a four-level cascade with finite pulses, calibration and timing errors, always-on dephasing, and bounded pumping, the selected sequence brings every initial state within trace distance $0.1$ of the target in one complete cycle of explicitly bounded duration and maintains that tolerance under repetition.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.02362 ↗

We refine the real enumerative invariants insensitive to changes in the real structure introduced in our previous paper on del Pezzo surfaces, and extend these refined invariants to arbitrary rational surfaces. The construction involves a choice of an auxiliary conic bundle together with a Pin-structure. We prove that the resulting invariants are independent of these auxiliary choices and establish recursive relations for their computation.

comments
42 pp, 5 Tables, To the new version two subsections are added as a part of "concluding remarks"
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.02445 ↗

We study the focusing inhomogeneous nonlinear Schrödinger equation with an inverse-square potential, in the mass-supercritical and energy-subcritical regime and in every dimension $N\ge3$. Two lines of research on this model have so far developed separately, namely the scattering theory below the ground state and the variational theory of solutions with prescribed mass. We connect them. We compute explicitly the minimax level $m_a(c)$ of the energy on the Pohozaev manifold of mass $c$, introduced by Hajaiej, Luo and Wang, in terms of the sharp constant of the associated Gagliardo–Nirenberg inequality. We prove that the minimizers of $m_a(c)$ are exactly the optimizers of this inequality lying on the Pohozaev manifold, and that they are ground states of the stationary problem. This answers a question left open by these authors. We then show that $m_a(c)$ is a sharp dynamical threshold. Below it, the sign of the Pohozaev functional is preserved by the flow. If this sign is positive, the solution is global. If it is negative and the datum has finite variance, the solution blows up in finite time. For the three-dimensional cubic model, the global solutions also scatter, by the scattering criterion of Hajaiej, Luo and Wang read in its scale-invariant form. As consequences, we obtain the strong instability of all normalized ground states, with destabilizing data on the same mass sphere, the strict monotonicity of the threshold with respect to the coupling constant, and a positive lower bound for $m_a(c)$ which is uniform up to the critical Hardy coupling.

comments
The title has been revised, and the presentation has been further enhanced and improved
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.02933 ↗

For the coupled three-dimensional double well $H=\tfrac12|p|^2+2\sum_i(q_i^2-1)^2-\sum_{i<j}q_i^2q_j^2$ we exhibit, at the first excited energy level (and also at the ground state), a linear functional on polynomials of degree $\le 6$ that satisfies every constraint of the standard level-3 eigenstate bootstrap, has a strictly positive definite moment matrix, and nevertheless assigns a negative value to a nonnegative polynomial. It is therefore an interior point of the level-3 relaxation that is realized by no quantum state. The construction reflects a fact that holds at every level: the eigenstate rows never reach the top-degree momentum moments. At level 3, where strictly feasible points exist, this means that the corresponding block of the moment matrix carries no information about which energies admit one. Every algebraic ingredient is an exact rational certificate, and the only numerical ingredients (spectral enclosures of an eigenfunction) are carried out in rigorous ball arithmetic.

comments
16 pages. Submission to SciPost Physics Core. Code and certificates included as ancillary files. v3: SciPost format, new title, references to the eigenvalue moment method added, conclusion section added; results unchanged
fields
Mathematical Physics
pdf ↗ page arXiv:2610.03362 ↗

For every simply connected space $X$ of finite rational type with Poincaré duality cohomology, we prove $MTC(X)=TC_0(X)=TC_0^M(X)$: module, rational and monoidal rational topological complexity coincide. Neither formality nor finiteness of the total rational homotopy is required. For every rationally retractive map $f$ between simply connected spaces of finite rational type, we prove $relcat(f_Q)\le msecat(f_Q)+1$. This bound is sharp for rationally retractive maps. Both proofs reduce to the same question: can a module nullhomotopy taking values in a split Sullivan model be chosen with values in its kernel ideal? Comparing resolutions of consecutive ideal powers achieves this after increasing the exponent by one; for diagonals, Poincaré duality preserves the exponent. An ideal-preserving form of Hess's construction then converts the module nullhomotopy into a compatible algebra retraction.

fields
Algebraic Topology
pdf ↗ page arXiv:2610.04153 ↗

We determine the fixed-maturity right tail of the SABR model with $β\in(0,1)$ absorbed at zero, for every correlation $ρ$: the probability $P(k)$ that the forward ends above $f_0e^k$ satisfies $-k^{-2}\ln P(k)\to(1-β)^2/(2ν^2T(1-(ρ\wedge0)^2))$. The implied volatility therefore tends to $ν\sqrt{1-(ρ\wedge0)^2}/(1-β)$. Henry-Labordère's conjectured limit $ν/(1-β)$, which Hagan's leading-order formula also gives, holds for $ρ\ge0$ and fails for $ρ<0$, where survival keeps the noise orthogonal to volatility above a moving square-root barrier. The Gaussian estimate behind his second conjecture does not hold for $ρ<0$; the rate is instead given by the intrinsic distance within the survival domain.

comments
v2: adds a comparison with Hagan's formula and shorter proofs for nonnegative correlation; states the saddle-point value of the potential (Section 6.4) as a large-strike limit rather than a constant; minor corrections; revised exposition. 38 pages, 4 figures
fields
Probability
pdf ↗ page arXiv:2610.04209 ↗

The primary objective of this paper is to establish the pointwise almost everywhere convergence of the singular integrals of Christ-Journé type. To this end, we prove the weak type $(1,1)$ estimate for the corresponding maximal operator defined as \[ T^*[a] f(x):= \sup_{r>0}\left|\int_{|x-y| > r} K(x-y) \int_0^1 a(tx + (1-t)y)\, dt f(y)\, dy\right|, \] where $K$ is a Calderón–Zygmund kernel and $a\in L^\infty$. This result resolves a problem posed by Seeger (Rev. Mat. Iberoam., 2014).

comments
Exposition improved and typos corrected, 29 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.04673 ↗

We study the problem of computing the tightest \(α\)-potential approximation of a general-sum game over continuous action spaces, within a prescribed class of potential functions and when each player has access only to its own utility function. The difficulty is twofold: the approximation error involves a worst-case search over an infinite set of unilateral deviations, and the required utility information is distributed across players. For a linear-in-parameters potential class, we use an exact finite-tuple reformulation that separates the problem into a global outer search over deviation tuples and distributed convex inner problems. We develop a primal–dual inner oracle tailored to this structure and establish a uniform one-sided accuracy guarantee. This oracle can be combined with global outer search to obtain an end-to-end guarantee on the outer optimization error. We also develop a projected zeroth-order outer method as a computationally lighter alternative for higher-dimensional problems. Numerical experiments illustrate the accuracy–computation tradeoff between the two outer-search methods and show that the proposed optimization framework can improve upon analytical \(α\)-potential constructions.

comments
15 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.05516 ↗

We study a dynamical optimal transport problem on path-space with kinetic cost and nonlocal interaction. For a Gaussian interaction kernel, cyclical monotonicity and the regularity of the effective endpoint cost yield a conservative vector field associated with the initial momentum of the optimal trajectories. Separately, the Gaussian interaction potential $W_{π_0}$ satisfies a uniform gradient estimate and, under a quantitative condition on the interaction strength, is a classical and hence viscosity subsolution of an eikonal equation. We also derive the Euler–Lagrange dynamics directly from path-space optimality by means of endpoint-preserving perturbations of the optimal path measure. The associated phase-space marginals satisfy a measure-valued Liouville-type, or nonlocal kinetic, equation driven by the smooth Gaussian self-consistent force. Conversely, a superposition principle lifts suitable measure-valued solutions of the phase-space continuity equation to measures on phase-space trajectories. Thus path-space optimal transport provides a variational connection between endpoint geometry, eikonal behavior of the Gaussian interaction potential, and kinetic mean-field dynamics.

comments
38 pages, 1 figure, added a reference and included organization/summary of paper. Comments welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.05754 ↗

We establish a criterion for the irreducibility of Verma modules over symmetrizable Kac–Moody superalgebras. Our main tool is the Weyl-Kac denominator identity.

fields
Representation Theory, Mathematical Physics
pdf ↗ page arXiv:2610.06109 ↗

We establish phase transitions in the first-order asymptotics of the largest and smallest nonzero eigenvalues of high-dimensional sample correlation matrices formed from data with i.i.d. centered real entries of finite variance, allowing an infinite fourth moment. Because of self-normalization, spectral outliers are driven by collisions of large entries in distinct rows of a common column rather than by individual large entries. The resulting phase transitions depend jointly on the aspect ratio and the entry tail, producing staircase boundaries in the phase diagram. We prove convergence to the corresponding Marčenko–Pastur edges in subcritical regimes and to deterministic outlier levels in supercritical regimes. In critical regimes, Poisson limits for the point processes of spectral outliers and nondegenerate limiting laws for the extreme eigenvalues are established.

comments
This version merges the original manuscript with arXiv:2609.15731v1 to give a unified treatment of both spectral edges
fields
Probability
pdf ↗ page arXiv:2610.06731 ↗

The Kannan–Lovász–Simonovits (KLS) conjecture asserts that isotropic log-concave probability measures have Poincaré constants bounded by a universal constant, independently of dimension. In this work, we provide a deterministic variational proof that the Poincaré constant $C_P(μ)\le25$, where $μ$ is any isotropic log-concave probability measure. The proof centers on mean-zero integration of compatible symmetric tensor fields. Starting from constant tensors, we obtain factorially normalized Appell polynomials by iterating this procedure. Using moment estimates and a quadratic variance inequality, we establish geometric bounds on these iterated primitives through a \emph{joint} variational argument over the measure and test function. At a maximizing pair, stationarity in the test function controls the weighted sum of the two highest-order cumulant terms arising from the measure variation. To extend these bounds to arbitrary compatible fields, we use a weighted Helmholtz–Hodge decomposition of weighted divergence, the formal adjoint of differentiation. Controlling the curl in the decomposition yields a curvature comparison for the integration operators, uniformly in tensor order. Combining this comparison with the Appell bounds gives a bound on the full integration operator and hence the stated Poincaré inequality. The estimate is independent of the auxiliary positive curvature, allowing approximation to general isotropic log-concave measures.

fields
Probability, Functional Analysis, Metric Geometry, Spectral Theory
pdf ↗ page arXiv:2610.07728 ↗

In this paper we develop a parabolic version of the method of moving planes on systems with a mixed local and nonlocal diffusion operator, that being $\mathcal{L} = -(-Δ)^s + Δ$, where $(-Δ)^s$ is the integral fractional laplacian. We then use this result to study the quenching phenomena occurring in said systems with a singular absorption term of the type $(1-u)^{-p}$. We prove that there exists a range of multiplicative parameters for which every solution presents quenching, and that for any initial datum $u_0$, there exists a small enough multiplicative parameter such as the solution is globally defined. We also prove that the quenching phenomena cannot happen arbitrarily close to the boundary, but they are contained in a compact subset of the domain.

comments
26 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.08014 ↗

In this paper, we study strong uniqueness for smooth instantaneously complete Chern-Ricci flows on noncompact complex manifolds. Under suitable reference metric and positivity assumptions, we establish strong uniqueness for initial Hermitian metrics which are Kähler outside a compact set. The initial metric may be incomplete, and no curvature bounds or metric equivalence assumptions are imposed on the evolving solutions. In particular, we obtain strong uniqueness from complete initial metrics in this class with bounded Chern-Ricci curvature. We also prove stationarity of flows from the Euclidean metric on $\mathbb{C}^n$ and uniqueness of the instantaneously complete flow from the Euclidean metric on the complex unit ball for all positive time. Finally, on complex surfaces, we show that a Ricci flow remaining Hermitian for a fixed complex structure is Kähler at all times if it is Kähler at one time, and derive a corresponding strong uniqueness result for Ricci flows in this class.

comments
In this second version, we simplified some proofs and add a direct and simple proof for a special case in appendix
fields
Differential Geometry
pdf ↗ page arXiv:2610.08233 ↗

We compute the relative isoperimetric profile of the three-dimensional unit cube. Up to cube isometries and complementation, its minimizers are corner eighth-balls, edge quarter-cylinders and coordinate slabs, with both adjacent families minimizing at $4π/81$ and $1/π$. At each fixed volume the perimeter deficit bounds the squared $L^1$ distance to the minimizing family, with optimal exponent two. Near each transition the deficit controls the minimum, over the two adjacent families, of squared distance plus excess perimeter. The best constant for distance to the minimizing family decays linearly as the volume approaches a transition. We also obtain the conjectured profile for $(0,β)\times(0,1)^2$, $0<β\le1$, and resolve the three-dimensional case of Brezis's Open Problem~10.1.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.08644 ↗

We determine the consistency strength of the existence of a regular uncountable cardinal carrying no amenable $C$-sequence. It is equiconsistent with the existence of an inaccessible cardinal $κ$ which is $Π^1_ξ$-indescribable for every $ξ<κ^+$ in the transfinite second-order hierarchy of indescribability. For the lower bound, we prove that the failure of amenability at $κ$ implies that $L$ contains such a cardinal at or below $κ$, using constructible guessing sequences, correct constructible levels, and a transfinite induction. For the upper bound, we prepare the cardinal so that every proper initial segment of a full Hechler iteration of length $κ^+$ preserves weak compactness. Each final $C$-sequence appears at a bounded stage and is captured at the next stage on a stationary set; the remaining closed iteration preserves that capture.

comments
Updated the submission metadata. The upper bound is reduced from a $Π^2_1$-indescribable cardinal to an inaccessible $κ$ that is $Π^1_ξ$-indescribable for every $ξ<κ^+$. We now also establish an exact lower bound in $L$, determining the consistency strength and proving equiconsistency.40 pages
fields
Logic
pdf ↗ page arXiv:2610.09086 ↗

In this paper, we investigate the stability threshold of the two-dimensional Boussinesq system around the Couette flow in an infinite channel $\mathbb{R}\times[-1,1]$ under Navier-slip boundary condition. To address nonlinear echo chains induced by temperature-vorticity coupling, we construct a two-level frequency-dependent temporal decomposition, with the two levels matched to the infinite and finite superposition principles for the equation, respectively. By fully exploiting the enhanced dissipation effect at each decomposition level, we prove that if the initial perturbation $(ω^{in}, θ^{in})$ around the Couette flow satisfies $\|ω^{in}\|_{H^4_{x,y}\cap L^1_xH^4_y}\leq cν^{\frac{1}{3}}$, and $\|θ^{in}\|_{H^5_{x,y}\cap L^1_xH^5_y}\leq cν^{\frac{2}{3}+}$, the Boussinesq system admits a globally asymptotically stable solution. It should be emphasized that the method in this paper provides an effective approach for the hydrodynamic equations with coupling effects.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.10005 ↗

We introduce general methods to derive lower tail large deviation principles, for a variety of nonlinear problems of combinatorial interest. These methods are especially effective in "critical" regimes, where the nonlinearities are not sparse enough for Poissonian lower tails (e.g., Janson's inequality does not provide a sharp tail bound), but the situation is not so dense that combinatorial effects dominate (e.g., we cannot directly apply the theory of hypergraph containers or the relative entropy framework of Kozma-Samotij). In particular, these are regimes where one expects interesting phase transitions to occur. Our results have a number of consequences related to subgraphs in random graphs, answering various questions of Warnke and Jenssen-Perkins-Potukuchi-Simkin. For example, consider a random graph $G\sim \mathbb G(n,p)$, and let $L_\triangle(n,p)=\log\Pr[G\text{ is triangle-free}]$. The first-order asymptotics of $L_\triangle(n,p)$ have long been known in all parameter ranges except the critical regime where $p$ has order of magnitude $1/\sqrt n$. We are able to fill this gap: for any fixed $c>0$, we show that $n^{-3/2}L_\triangle(n,c/\sqrt n)$ converges to a limit expressed in terms of a two-parameter variational problem, which has a single phase transition at $c\approx 4.341$. In contrast, we show that there is no such phase transition for the probability that $G$ is $C_{2\ell}$-free, for any fixed even cycle $C_{2\ell}$. We also obtain some applications in combinatorial design theory. Addressing conjectures of Glock-Kühn-Lo-Osthus, Kelly, and Kwan-Sah-Sawhney-Simkin, we obtain new estimates on the number of order-$n$ Steiner triple systems with no Pasch configuration and the number of order-$n$ Latin squares with no $2\times 2$ Latin subsquare (both tight up to a factor of $\exp(o(n^2))$).

fields
Combinatorics
pdf ↗ page arXiv:2610.10233 ↗

Steinke and Zakynthinou(2020) introduces the Conditional Mutual Information (CMI) framework of analyzing the information complexity of learning algorithms based on algorithm-dependent information-theoretic quantities. We study one of these quantities, the evaluated Conditional Mutual Information (eCMI). It has been an interesting question whether the optimal PAC guarantee for VC classes can be recovered from the algorithm-dependent analyses via CMI. And we show that it is possible to recover this guarantee by constructing a learning algorithm whose eCMI is of order O(d) in the realizable case, where d is the VC-dimension of the concept class. Specially, our algorithm is a randomized Majority-of-5 base learners with optimal in-expectation generalization guarantee.

fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2610.10600 ↗

We introduce a systematic way to use the subobject functor on any category to set up a framework for generalized topological and measure-theoretic notions and inferences. Concretely, we develop two connected calculi: 1. a fourfold calculus derived from notions of smallness and density that generalizes, among other things, topological density and measure-theoretic negligibility, 2. a twofold calculus that generalizes topological and measure-theoretic inference procedures. The resulting theory is distinguished in that it is inter-categorical in character: its definitions can be applied not just to describe smallness and density of subobjects in any category and classify morphisms by how they handle them, but also functors and natural transformations by how they transform them, somewhat like the theory of limits but with a simple and intuitive conceptual meaning that applies to each incarnation. We provide examples of these notions from many areas of mathematics and outline their unfolding throughout category theory as we add assumptions that bring them closer to classical settings, which we complete by generalizing the topological duality of open and closed subsets and outlining a possible framework for a categorical measure theory. Central to this interaction is the subobject 2-functor and the 2-category of upward-bounded preorders, so in the last part of the text we provide a study of their function. Concretely we derive representation theorems for this 2-functor and 2-category and a conjecture about how to generalize these theorems to n-categories.

comments
127 pages, 41 figures, part of my Ph.D. thesis
fields
Category Theory, General Topology
pdf ↗ page arXiv:2610.10930 ↗

Let $M$ be a type III von Neumann algebra, and let $N$ be a semifinite von Neumann algebra. We prove that the Banach space $M_*$ does not embed isomorphically into the Banach space $N_*$. More generally, we prove that $L_p(M)$ is not isomorphic to a subspace of $L_p(N)$ for $1\le p<2$. In particular, the Banach isomorphism class of $L_p(M)$ distinguishes type III algebras from semifinite algebras for $1\le p<\infty$, $p\ne2$. This answers several long-standing open questions in the literature.

fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.11055 ↗

We prove that for any prime $p$ and tame level $N\geq4$, the weight map from the cuspidal Hilbert eigenvariety constructed by Andreatta–Iovita–Pilloni for a totally real field $F$ to the weight space is proper in the sense of Buzzard–Calegari, under a non-vanishing hypothesis on certain Sen polynomials of Galois representations at the primes above $p$. In particular, this yields the properness of the eigenvariety away from non-positive integral Sen weights. Our approach extends the $p$-adic Hodge-theoretic argument of Diao–Liu. When $p$ has a unique prime of $F$ above it, we remove this hypothesis and obtain unconditional properness, by establishing base-change compatibility for spaces of overconvergent Hilbert modular forms and analyzing the associated spectral variety over certain closed subspaces of the weight space.

comments
38 pages. Substantially revised: corrected several typos and strengthened the main result by establishing unconditional properness when $p$ has a unique prime of $F$ above it
fields
Number Theory
pdf ↗ page arXiv:2610.12605 ↗

The linear arrangement of a simple graph $G = (V,E)$ is a bijective labeling $π$ of the vertices of $G$ to the set $\{1, \ldots, n\}$. The maximum linear arrangement ($\texttt{maxLA}$) problem is to determine whether $G$ has a labeling such that the sum of labels across $G$'s edges, $\sum_{uv \in E} |π(u) - π(v)|$, is at least a given value $k$. Minimum linear arrangement ($\texttt{minLA}$) is defined analogously. Both $\texttt{maxLA}$ and $\texttt{minLA}$ are known to be NP complete for general graphs. $\texttt{minLA}$ has shown to be NP complete for bipartite graphs by Evans and Shiloah in 1975. It has been an open problem whether the same holds for $\texttt{maxLA}$. In this paper we prove that $\texttt{maxLA}$ is NP complete for bipartite graphs.

comments
11 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.12613 ↗

We prove scattering in $L^2(\mathbb R^2)$ for real-valued solutions of the Kadomtsev–Petviashvili II (KP-II) equation with localized initial data. The localization is measured in scale-invariant Lorentz or mixed Lebesgue spaces. The admissible data include all real-valued Schwartz functions. To the best of our knowledge, this is the first result establishing scattering for the KP-II equation for every real-valued Schwartz initial datum, without any smallness assumption and without the zero mean condition. We also show that some localization is necessary: there are smooth real-valued initial data of arbitrarily small $L^2$ norm, with a logarithmic moment, for which the solution does not scatter in $L^2$.

comments
94 pages. The scattering theorem is extended to more initial data. This version also constructs smooth initial data of arbitrarily small $L^2$ norm whose solutions fail to scatter in $L^2$ in both time directions
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.13753 ↗

The $q$-deformed Weil-Petersson volumes of Do and Norbury are the top-degree parts of Okuyama's discrete volumes, which are defined by topological recursion on the spectral curve of the double-scaled SYK (DSSYK) model. We show that the same $q$-deformed volumes can also be obtained from a double-scaled matrix model whose disk density is found by zooming in on the soft edges of the DSSYK density. Applying the same procedure to the hard edge of $\mathcal{N}=1$ DSSYK, we obtain candidate $q$-deformed $\mathcal{N}=1$ super Weil-Petersson volumes. They are polynomials of fixed degree, and they reduce to $\mathcal{N}=1$ super Weil-Petersson volumes in a scaled $q\to1$ limit. These candidate volumes differ from the $\mathcal{N}=1$ volumes of Do and Norbury in (arXiv:2510.12431) up to what we call ``irrelevant'' contributions which exactly vanish in the scaled $q\to 1$ limit. Together, these results demonstrate how $q$-deformed volumes can be naturally associated to the spectral edges of various DSSYK models and provides an intuitive way to construct them in supersymmetric contexts.

comments
18 pages + appendices, updated references and fixed typos in v2
fields
Mathematical Physics
pdf ↗ page arXiv:2610.13899 ↗

Zavarzina asked whether every bijective non-contractive self-map of a precompact quasi-metric space is an isometry. We show that it need not be, even when the space is hereditarily precompact. On the integers, take the distance of an irrational rotation and add a fixed toll $c>0$ to every step from a nonnegative integer down to a smaller one. The resulting space, the toll spiral, is a hereditarily precompact quasi-metric space, and the shift $n\mapsto n+1$ is a bijective non-contractive map that is not an isometry. The construction works over any metric space $Y$: for every bijective isometry $σ$ of $Y$ and every point whose $σ$-orbit is aperiodic and totally bounded, adding the same toll along the orbit gives such a counterexample, for instance over the $p$-adic odometer. The conjugate of the toll spiral is not even precompact, so the hypothesis on the conjugate in Zavarzina's positive result cannot be dropped, even for bijections. The toll spiral is also not expand-contract plastic, since the inverse shift is a non-expansive bijection that is not an isometry. For an arbitrary bijective non-contractive map $F$, the distance from $F^kx$ to $F^ky$ has a limit as $k\to-\infty$; $F$ is an isometry for this limit, and the excess $D_0$ of the distance over it is the defect. On a hereditarily precompact space, we prove a monochromy theorem: if a pair $(a,b)$ has positive defect $η$, then there are natural numbers $t_1<t_2<\cdots$ such that either $D_0(a,F^{-Δ}a)>η/4$ for every difference $Δ=t_j-t_i$ with $i<j$, or $D_0(F^{-Δ}b,b)>η/4$ for every such $Δ$. Three boundary results delimit the remaining question; the open case, that of separated spaces compact in one of their topologies, has since been settled by the author (arXiv:2610.14301). The construction, in general and for the circle, is machine-checked in Lean 4 using Mathlib, with no unproved steps.

comments
18 pages. Lean 4 verification files included as ancillary files and archived with the paper at Zenodo, doi:10.5281/zenodo.22801324. v2: numbering unchanged; a note at the end of Section 7 reports what the author has since answered, including Questions 7.1 and 7.6
fields
General Topology, Functional Analysis
pdf ↗ page arXiv:2610.13973 ↗

A geometric $(n_4)$ configuration is a set of $n$ points and $n$ lines in the real projective plane such that every point lies on exactly four of the lines and every line contains exactly four of the points. The question of which $n$ admit such a configuration was posed by Grünbaum in 2000, and successive work of Bokowski, Grünbaum, Schewe, Pilaud and Cuntz settled every case but $n=23$. We settle this last case by bounding the symmetry of such configurations and classifying the most symmetric ones exactly. We prove that for every prime $n\equiv3\pmod4$ the group of projective symmetries of a geometric $(n_4)$ configuration has order at most four, explaining why symmetric constructions failed at $n=23$, and the same argument bounds the symmetry of $(n_5)$ configurations for primes $n\not\equiv1\pmod5$. Reducing the Klein four-group case to 4021 bilinear polynomial systems and solving all of them exactly with Gröbner bases, we show that exactly two $(23_4)$ configurations reach this bound up to projective equivalence and that there are no others even over $\mathbb{C}$. Both are self-polar; the first has integer coordinates and the second is defined over $\mathbb{Q}(\sqrt{17})$ but not over $\mathbb{Q}$. Consequently geometric $(n_4)$ configurations exist if and only if $n\ge18$ and $n\ne19$. The same classification recovers Cuntz's $(22_4)$ and $(26_4)$ configurations and finds three new combinatorial types at $n=22$ and $94$ at $n=26$. Among self-polar $(23_4)$ configurations with a single involution we find $50$ more, defined over number fields of degree at most $7$. Four of them deform in one-parameter families, and computing three of these exactly, one birational to the modular curve $X_1(11)$, we prove that there are infinitely many geometric $(23_4)$ configurations, among them infinitely many with rational coordinates that are self-polar and have no projective symmetry.

comments
To be presented at the 2027 Joint Mathematics Meetings, Chicago (AMS Contributed Paper Session on Combinatorics, I, January 12, 2027)
fields
Combinatorics
pdf ↗ page arXiv:2610.14099 ↗

On a totally bounded metric space, every non-contractive self-map is an isometry. For quasi-metric spaces this fails. Here quasi-metrics are $T_1$: $d(x,y)=0$ implies $x=y$. Zavarzina gave a hereditarily precompact counterexample and asked whether rigidity holds at least for bijections. The author's toll spiral (arXiv:2610.13973) shows that it does not. We prove that compactness restores it: every compact quasi-metric space is expand-contract plastic, that is, each of its bijective non-contractive self-maps is an isometry. Countable compactness suffices, as does compactness of the conjugate topology. Bijectivity is needed, even on a compact, hereditarily precompact space. For arbitrary non-contractive self-maps, we prove rigidity when the space is hereditarily precompact and its conjugate topology is sequentially compact, in particular when it is also Yoneda complete; neither hypothesis can be dropped. Such maps are then surjective. In both theorems the $T_1$ axiom can be weakened to $R_0$, $d(x,y)=0$ implies $d(y,x)=0$, if hereditary precompactness is taken to mean that every sequence has a left K-Cauchy subsequence; surjectivity then holds up to points at distance 0 both ways. The weaker $T_0$ axiom is not enough: there is a $T_0$ space, compact in both topologies and satisfying all the other hypotheses of both theorems, with a bijective non-contractive non-isometry. Finally, for an asymmetric norm in finite dimension, the classical theorem makes the symmetric unit ball and sphere rigid for all non-contractive self-maps, and the forward ones if the norm is $T_1$. In infinite dimension, the symmetric ball and sphere need not be plastic, and for the forward ones we pose the quasi-metric form of the unit-ball question of Cascales, Kadets, Orihuela and Wingler. The two theorems and the counterexamples of Section 6 are machine-checked in Lean, except the steps listed at the end.

comments
23 pages. Lean 4 verification files included as ancillary files and archived with the paper at Zenodo, doi:10.5281/zenodo.23265517. Answers two questions of the toll-spiral paper, arXiv:2610.13973. v2: Section 7 on asymmetric unit balls added. v3: numbering unchanged; notes that the maps of the second theorem are surjective, and derives Proposition 7.1 from the classical theorem
fields
Functional Analysis
pdf ↗ page arXiv:2610.14301 ↗

When an outcome is missing not at random, identification is commonly restored by a shadow variable: a covariate that predicts the outcome but is excluded from the response mechanism. The literature treats the first requirement, relevance, as a yes-or-no condition. We make it continuous, parametrizing it by a scalar that scales the shadow variable's entire contribution to the moment conditions, and ask what inference costs as that scalar vanishes. One functional of the inverse weight governs the answer. We characterize it exactly, show that it fixes the effective sample size, and use it to sharpen the rates of the estimator that avoids the weight. The characterization is concrete. Whether the functional saturates or diverges turns not on boundedness of the outcome but on whether the tilting variable has an atom at its essential supremum: a binary outcome saturates, a uniform one does not. It also bounds how far a scanned set reaches, and that reach grows only as the square root of the logarithm of the sample size, so a thousandfold increase buys one unit of tilt while the set to be scanned widens. A reanalyzed credit-scoring study shows the cost: a characteristic an optimizing selector uses cannot satisfy exclusion.

comments
50 pages, 2 figures. Replication package: https://doi.org/10.5281/zenodo.23262503. v3 adds three antecedent citations, corrects a screen that coded threshold rules linearly, extends the screen to a continuous outcome, and bounds the scorecard coefficients under a bounded departure from MAR. v2 consolidated the work at the moderators' request. Two papers are under separate review
fields
Statistics Theory
pdf ↗ page arXiv:2610.14695 ↗

We prove decay estimates for oscillatory integral operators along $(y_1, y_2, y_1^2+y_2^2)$ in the finite field and the continuous settings. In the continuous setting, our result allows a bi-parameter maximal modulation, which extends the one-parameter version previously established by Pierce and Yung. Our approach is different from theirs. Then we discuss three applications of our estimates: a power saving bound for certain pattern finding problem in finite fields, a short approach to $L^p$ boundedness of an one-parameter Pierce–Yung operator, and $L^p$ boundedness of a bi-parameter Pierce–Yung operator.

comments
28 pages, an inaccurate use of integration by parts and several minor typos fixed, AI usage updated, introduction expanded with one more reference. Comments are welcome!
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.14841 ↗

Let $ν_1(n)$ and $ν_2(n)$, respectively, denote the number of representations of the natural number $n$ as the following form \begin{equation*} n=p_1^2+p_2^2+p_3^4+p_4^4+p_5^4+p_6^5+p_7^8, \end{equation*} and \begin{equation*} n=p_1^2+p_2^2+p_3^3+p_4^4+p_5^5+p_6^6+p_7^8, \end{equation*} where $p_1,\dots,p_7$ are primes in both above cases. In this paper, it is proved that $ν_1(n)\gg n^{43/40}(\log n)^{-7}$ holds for every sufficiently large integer $n$ subject to $n\equiv1\pmod2$ and $n\equiv\pm1\pmod3$. Moreover, we also establish that $ν_2(n)\gg n^{43/40}(\log n)^{-7}$ holds for every sufficiently large integer $n$ subject to $n\equiv1\pmod2$. These results improve and enhance the earlier work of Andrade [1] and Wang-Tian [17], respectively.

comments
12 pages
fields
Number Theory
pdf ↗ page arXiv:2610.15142 ↗

We study the effect of boundary conditions on the selection of wavenumbers in pattern-forming systems. Prior work established that, for a large class of boundary conditions, equilibria only within a narrow band of wavenumbers are compatible with the boundary. We demonstrate here that for a large class of initial conditions, solutions evolve towards an extremal member of this narrow band of equilibria. In fact, this extremal member is linearly stable, nonlinearly unstable, and the convergence is realized through a series of snapping events at the boundary. We observe this behavior in simulations of the Swift-Hohenberg equation when the pattern forming region is confined to a large spatial interval through a parameter quench. We prove the convergence in a phase-diffusion approximation using comparison principles and astutely chosen subsolutions that mimic the snapping behavior.

comments
18 pages, 4 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.15201 ↗

For every $n\geq 1$, we construct continuum-many pairwise non-conjugate actions of $\operatorname{SL}(n+1,\mathbb{Q})$ by homeomorphisms on the $n$-sphere. None of these actions extend to a continuous action of $\operatorname{SL}(n+1,\mathbb{R})$. Our construction refines a blow-up procedure of Bowden and Mann, allowing the stabiliser action inside each blown-up disc to be prescribed. We motivate studying these actions and record some related observations.

comments
Minor changes and expanded references. Comments welcome!
fields
Dynamical Systems, Group Theory, Geometric Topology
pdf ↗ page arXiv:2610.15653 ↗

Let $\mathfrak{g}$ be a symmetrizable Kac-Moody algebra with root system $Φ$. A subset $S\subseteqΦ$ is closed if $α,β\in S$ and $α+β\inΦ$ imply $α+β\in S$. For finite and affine Kac-Moody algebras, this closure property is known to extend from pairs to arbitrary finite sums that are roots. We prove that every closed subset of the root system of any symmetrizable Kac-Moody algebra is closed under arbitrary finite sums that are roots. The proof uses real-root strings, a simultaneous separation lemma for positive imaginary roots, and a lemma on when the sum of two positive imaginary roots is again a root. As an application, we extend a necessary condition for wideness of regular subalgebras from finite and affine types to all symmetrizable Kac-Moody algebras: the symmetric closure of the roots associated to a wide regular subalgebra is the entire root system.

fields
Representation Theory
pdf ↗ page arXiv:2610.15923 ↗

Let $K$ be a number field of degree $n_K$, and let $h(K)$ denote the smallest absolute value of the imaginary part of a non-trivial zero of its Dedekind zeta function $ζ_K$. In 1979, Hoffstein proved the unconditional bound $h(K)\leq 0.87+o(1)$ as $n_K\to\infty$. In a 1990 survey, Odlyzko announced the stronger bound $h(K)\leq 0.54+o(1)$ without proof. No improvement on Hoffstein's bound has since appeared with a published proof. We construct a comparison kernel from a linear combination of three identities and show that Hoffstein's original parameters give $h(K)<0.825$ for sufficiently large $n_K$. We generalise Hoffstein's method via Stechkin's trick and prove $h(K)<0.58$ for all sufficiently large $n_K$, giving the best proved estimate to date. Moreover, $ζ_K$ has at least $c n_K$ non-trivial zeros with imaginary part in $[0,0.58]$, counted with multiplicity, for some $c>0$ and $n_K$ large enough.

comments
Updated
fields
Number Theory
pdf ↗ page arXiv:2610.16010 ↗

Linear complementary dual (LCD) codes are linear codes that intersect their dual trivially. We study double circulant (Euclidean) LCD codes over the finite chain ring $R=\mathbb F_2+u\mathbb F_2$, where $u^2=0$. Using the Chinese Remainder Theorem and the factorization of $x^n-1$, we derive an explicit enumeration formula, with a separate treatment of the constituent corresponding to $x-1$, which is not obtained by a formal specialization of the previously known counting formula over $\mathbb F_q[u]/(u^k)$. Assuming Artin's primitive root conjecture for $2$, we show that the binary Gray images contain an asymptotically good family of rate $1/2$ which attains the asymptotic Gilbert–Varshamov bound, i.e., whose relative distance can approach $H_2^{-1}(1/2)$ from below. More importantly from the constructive viewpoint, by combining Gray images with a known extension construction, we obtain a binary LCD code with previously unknown parameters $[29,15,7]$ and construct two explicit permutation-inequivalent binary LCD codes with parameters $[45,23,9]$ and nine binary LCD codes with the best known parameters.

fields
Information Theory, Rings and Algebras
pdf ↗ page arXiv:2610.16121 ↗

We prove cone restriction estimates under half-scale dimensional conditions. Building on the framework of Du–Li–Wang–Zhang, we incorporate the broad restriction estimate of Ou–Wang and a localized multilinear estimate obtained through cyclic bilinear pairing and multilinear Kakeya bounds for local packet energies. For certain ambient and weight dimensions, our estimates are sharp in suitable ranges of $p$, up to an $R^\varepsilon$ loss.

comments
More detailed AI Disclosure
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.16294 ↗

How individuals respond to their neighbors' opinions shapes whether a networked group reaches consensus. This paper analyzes synchronous discrete-time opinion dynamics on a fixed influence network, where individuals use either weighted-average (WA) or weighted-median (WM) opinion-aggregation mechanisms with individual-specific inertia coefficients. We characterize equilibria through graph-theoretic conditions on opinion level sets and WA balance equations, proving that every solution converges to a Lyapunov-stable equilibrium. We define type-dependent cohesive sets, whose WA members assign all their influence weight to the set and WM members assign at least half. The absence of two disjoint such sets gives a necessary and sufficient graph-theoretic criterion for consensus from any initial condition. Otherwise, an open set of initial conditions leads to persistent dissensus. Converting WM individuals to WA cannot create type-dependent cohesive sets and preserves existing guarantees of consensus from any initial condition. If the conversion eliminates every disjoint pair of these sets, the converted system also guarantees consensus from any initial condition. Four numerical studies examine the locations and proportion of weighted-average individuals, as well as the influence weights, while comparing the consensus criterion with finite-horizon simulation outcomes. In the four network ensembles with 100 individuals, the observed frequency of reaching a prescribed consensus tolerance is nondecreasing with WA proportion at each tested simulation horizon. This trend supports the consensus-promoting role of WA individuals, although individual realizations need not follow it.

comments
29 pages, 10 figures, including supplementary material
fields
Optimization and Control
pdf ↗ page arXiv:2610.16406 ↗

This paper is concerned with the spatially inhomogeneous Fermi-Dirac-Fokker-Planck equation posed on a classical kinetic phase space. The nonlinear factor $f(1-f)$ appears both in the transport term and in the collision part of the Fokker-Planck operator, accounting for the exclusion principle of fermions. We prove the existence and uniqueness of global solutions without any smallness or close-to-equilibrium assumptions. To construct solutions, we use a vanishing viscosity approximation by adding a Laplacian in the spatial variable. We derive uniform estimates for the regularized problem and obtain compactness in the space of functions of bounded variation $(BV),$ allowing us to pass to the limit as the spatial viscosity vanishes. Since the limiting equation is degenerate with a nonlinear transport, we formulate an appropriate notion of entropy solutions incorporating the kinetic structure of the equation. We prove uniqueness within this class and show that every vanishing-viscosity limit satisfies the entropy formulation. Our result provides a global well-posedness theory beyond the perturbative regime.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.16700 ↗

We consider a random subgraph G_p(n,r,<s) of the complete distance graph G(n,r,<s) whose vertices are the r-element subsets of the set {1,...,n} and whose edges join pairs of subsets that intersect in fewer than s elements; each edge survives independently of the others with probability p. The stability of the Erdos-Ko-Rado theorem is the event that the independence number of the random subgraph equals that of the original graph, N = C_{n-s}^{r-s}. For fixed r and s, two-sided bounds for the critical probability, whose ratio depends on r and s, were obtained by P. A. Ogarok and A. M. Raigorodskii. In this paper we establish the order of the critical probability for growing r=r(n) and s=s(n): if min{C_r^s r^2, s r^3} = o(n), then the upper and lower bounds differ only by an absolute constant factor. The proof is elementary; only one of the two branches of the growth condition uses the complete nontrivial-intersection theorem of Ahlswede-Khachatrian.

comments
17 pages. Accepted for publication in Problems of Information Transmission. This is a preprint of the Work accepted for publication in Problems of Information Transmission, © 2026, Pleiades Publishing, Ltd
fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.16955 ↗

Rotation symmetric Boolean functions are important structured families in the theory of Boolean functions, where cyclic invariance permits compact algebraic descriptions while retaining nontrivial local behavior. We investigate their sensitivity through binary necklaces and monomial orbit sums. In the necklace quotient of the Boolean cube, ordinary adjacency does not record the number of coordinate flips: we give a directed flip-multiplicity formula involving stabilizers and distance-two near-periods, and derive exact local sensitivity formulas when the number of variables is an odd prime. For monomial rotation symmetric functions we determine sensitivity for all odd degrees and for quadratic orbit sums. For the consecutive-monomial family of every even degree $d\ge4$, we prove a run-cluster inequality and obtain the eventual exact formula $s(F_{d,n})=n-\min\{r,d+2-r\}$, where $n\equiv r\pmod{d+2}$, under the stated length hypothesis. The consecutive quartic case follows explicitly. We also evaluate sensitivity for cyclic run-threshold functions. Our results provide exact combinatorial and complexity-theoretic information about cyclic Boolean functions and clarify how cyclic symmetry governs local sensitivity.

comments
Version 2 29 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.17006 ↗

We investigate block sensitivity and certificate complexity of monomial rotation-symmetric Boolean functions, obtaining exact formulas and structural classifications for several families. For odd-degree monomial rotation-symmetric functions, the equality $s(f)=n$ established in our earlier work yields $bs(f)=C(f)=n$. For quadratic monomial rotation-symmetric functions, we determine both measures completely and prove that block sensitivity equals certificate complexity. For consecutive quartic monomials, we determine sensitivity, block sensitivity, and certificate complexity in every residue class of the number of variables. Our principal result is an exact global block-sensitivity formula for consecutive monomials of every even degree $d\ge4$. Writing $n=q(d+2)+ρ$, where $0\leρ<d+2$ and $q\ge\max\{2,d/2-1\}$, we prove \[ bs(F_{d,n})=n-\min\left\{\left\lceil\fracρ{2}\right\rceil,d+2-ρ\right\}. \] We also establish the corresponding sensitivity formula by a self-contained argument, yielding arbitrarily large gaps between sensitivity and block sensitivity as the degree varies. For certificate complexity, we obtain exact pointwise formulas for structured run-and-gap configurations and establish additional global equalities, including $C(F_{6,8q+5})=bs(F_{6,8q+5})=8q+2$ for $q\ge2$. Our methods combine cyclic run decomposition, parity arguments, explicit sensitive-block constructions, and constant-subcube certificates. The exact global certificate complexity for arbitrary even degrees remains open.

comments
Version 2, 44 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.17100 ↗

We prove that, for any two integers $2\le m<n$, a bounded operator $A$ on a complex Hilbert space satisfying \[ A^{*k}A^k=(A^*A)^k, \qquad k\in\{m,n\}, \] is quasinormal. More generally, we show that the inequalities \[ A^{*m}A^m\ge(A^*A)^m \quad \text{and} \quad A^{*n}A^n\le(A^*A)^n \] already imply quasinormality. Together with the known single-exponent counterexamples, this completely resolves the reduced Embry problem for bounded operators: the identities $A^{*k}A^k=(A^*A)^k$, $k\in S\subseteq\{1,2,\ldots\}$, characterize quasinormality if and only if $S$ contains at least two distinct integers greater than one. We also resolve the flatness problem for operators of class $\mathcal A$: equality between two consecutive normalized moments $(A^{*n}A^n)^{1/n}$ and $(A^{*(n+1)}A^{n+1})^{1/(n+1)}$, with $n\ge2$, implies quasinormality. Both results rely on an interpolation estimate obtained either from Hansen's inequality or from the transformer inequality for weighted operator geometric means. The solution to the reduced Embry problem additionally uses an extremal argument for optimal power bounds.

fields
Functional Analysis
pdf ↗ page arXiv:2610.17303 ↗

We derive a recurrence for logarithmically weighted Möbius sums by combining Möbius inversion with the Euler-Maclaurin summation formula. Consequently, starting from estimates of orders zero, one and two, we obtain polynomial approximations for these sums for every nonnegative integer exponent of $\log$. We then extend these estimates to sums with coprimality conditions via a convolution identity and to sums weighted by the reciprocal of the sum-of-divisors function. We also study the nonnegativity of the latter sums for every positive integer logarithmic order, establishing that they never change sign.

comments
Updated
fields
Number Theory
pdf ↗ page arXiv:2610.17720 ↗

Optimal control problems become computationally challenging when the system dynamics are nonsmooth, learned from data, or available only through a simulator. In such settings, derivatives may be difficult to obtain, and evaluating different control actions through repeated trajectory simulations can be expensive. We propose Hamiltonian Primal-Dual Policy Optimization (HPDPO), a method that uses numerical costates to guide the search for improved controls. The costates are estimated using finite differences of the numerical model and are used to rank candidate actions. Rather than performing a full remaining-horizon simulation for every candidate, HPDPO evaluates a small set of promising alternatives and accepts a control update only when it decreases the discrete objective. We derive a first-order costate-based approximation for ranking candidate actions and establish descent of the discretized objective under rollout-verified updates. We test the method on scalar and multidimensional control problems, including examples with nonsmooth and learned dynamics. The results show good agreement with analytical or published reference solutions and lower simulation costs than the direct-rollout methods considered. HPDPO requires only forward model evaluations, without analytical or automatically differentiated derivatives of the dynamics or a learned value function.

fields
Optimization and Control
pdf ↗ page arXiv:2610.18524 ↗

Let $F:M^n\to\Sph^{2n+1}$ be a minimal Legendrian immersion of a connected closed manifold, where $n\ge3$, and let $B$ be its second fundamental form. We prove that if $|B|^2\le(n-1)(n+2)/n$, then, up to a unitary transformation, $F$ parametrizes a totally geodesic sphere or is a finite covering of the image of the minimal Calabi product of a point and a totally geodesic Legendrian sphere. This proves Conjecture 1 of Luo and Sun [Ann. Inst. H. Poincaré C Anal. Non Linéaire 40 (2023), p. 548].

comments
20 pages. Title Changed; Calculation simplified; References added. All comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2610.18536 ↗

A set $A$ of integers is an $h$-basis for $n$ if every integer in $[0,n] = \{0,1,2,\ldots,n\}$ belongs to the sumset $hA$, that is, can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. The classical postage stamp problem asks for the largest integer $n_h(k)$ such that $[0,n_h(k)] \subseteq hA$ for some set $A$ of nonnegative integers of size $k+1$. We consider the effect of allowing negative elements. Let $n^{\flat}_h(k)$ be the largest integer such that $[0,n^{\flat}_h(k)] \subseteq hA$ for some set $A$ of integers of size $k+1$ containing at least one negative integer. For $k=2$, we have $n^{\flat}_h(2) < n_h(2)$ if $h$ is odd or $h=4$ and $n^{\flat}_h(2) = n_h(2)$ if $h$ is even and $h \neq 4$. Proofs of these comparison results were autonomously discovered and formally verified in Lean by https://aristotle.harmonic.fun/}{Aristotle}, a formal reasoning agent developed by https://www.harmonic.fun/}{Harmonic}. In this paper we give new proofs of these results.

comments
10 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.19470 ↗

We construct countable, stable, $ω$-categorical structures with at most two binary relations whose CSPs exhibit three complexity regimes: NP-complete, decidable but not in NP, and undecidable. The templates arise from a controlled Hrushovski construction of stable $ω$-categorical graphs $M_α$ for suitable irrational parameters $α>1$. Some of these graphs have NP-complete CSPs. Expanding the graphs $M_α$ by the non-edge relation turns age membership into a restriction of the CSP. For every time-constructible bound $t$, there is such an expansion whose CSP is decidable but not in DTIME$(t)$. For an explicit parameter $α$, the restriction to complete instances belongs to $\mathrm{coNP}$ and the full CSP belongs to $Σ_2^{\mathrm P}$. Separating the ages of the $M_α$ using graphs with large girth and prescribed density yields $2^{\aleph_0}$ distinct CSPs of these expansions, all but countably many of which are undecidable.

comments
36 pages
fields
Logic
pdf ↗ page arXiv:2610.19940 ↗

We develop a boundary value and potential theory for elliptic operators \[ L=-\Div(A\nabla)+\B\cdot\nabla \] with form-bounded drift in one-sided chord-arc domains. Assuming that the positive part of $\Div\B$ has sufficiently small form bound, we establish local regularity estimates and solvability of the Dirichlet problem, and construct the associated harmonic measure. Under the additional assumption $\Div\B\le0$, we construct a Green's function and prove pointwise and gradient estimates. For the characteristic distributional identity with a Dirac mass at the pole to hold, we will additionally assume either $\Div\B=0$ or $\B\in L^{n,1}_{\textup{loc}}(Ω)$. Moreover, in the divergence-free case, we obtain a local lower bound for the Green's function, CFMS estimates, doubling of harmonic measure, a comparison principle for nonnegative solutions with zero trace, and a change of pole formula. Finally, we construct, in the upper half-space, an operator of the form $-Δ+\B\cdot\nabla$ with $\B$ form-bounded and divergence-free, whose harmonic measure exhibits dimension drop.

comments
49 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.19983 ↗

Given a family of $N$ i.i.d. Gaussian points in a $d$-dimensional normed space, what is the probability that some linear transformation maps it to the unit sphere? The case of a Euclidean space is known as the ellipsoid fitting problem and has recently attracted major attention. We initiate a study of this fitting problem in a general normed space, both asymptotically and in a fixed dimension. We specifically focus on the space $\ell_\infty^d$, where a combinatorial reformulation allows us to show that $cd^2/\log d$ points can be fitted with high probability. We illustrate that the geometry of the normed space is reflected in the fitting problem by showing that in dimension $2$, the spaces $\ell_2^2$ and $\ell_\infty^2$ are characterized by having extremal fittability properties.

fields
Probability, Functional Analysis
pdf ↗ page arXiv:2610.20299 ↗

We establish a smoothness criterion for Fano varieties with quotient singularities. As an application, we show that if $X\to B$ is a Lagrangian fibration from a compact hyper-Kähler manifold and $B$ has quotient singularities, then $B$ is a projective space.

comments
14 pages, comments are very welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.20496 ↗

We introduce and study commutative rings whose regular ideals, or all ideals, factor into square-difference factor absorbing ideals. We establish permanence under finite products, suitable localizations and quotients, and coefficient descent for monoid algebras. For an SP-domain, the regular factorization property is equivalent to the localization obtained by inverting $2$ being zero or Dedekind; equivalently, the maximal ideals avoiding $2$ are invertible and form a discrete subspace in the inverse topology. Over an arbitrary domain, we characterize unique functorial splitting of localization on all torsion modules by a condition excluding nonzero prime chains across the vanishing set of the localized element. Complementary localizations of one-dimensional Prüfer domains give a decomposition of invertible ideal groups and an exact Picard-group sequence. For an SP-domain whose Picard group has finite exponent $m$, every irreducible element has local valuation at most $m$. We also give regular-ideal criteria for arbitrary idealizations and a complete strong-factorization criterion over von Neumann regular bases. The zero ideal is treated separately throughout, and explicit examples show why unrestricted quotient and localization assertions fail.

comments
20 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2610.20884 ↗

Received OFDM grids preserve both pilot and payload observations, yet wireless foundation models are rarely pre-trained on them. We introduce LWM-TF, a 9.58M-parameter factorized masked autoencoder pre-trained on complex 5G NR uplink grids taken after the FFT and before channel estimation. Each block attends first across OFDM symbols and then across resource blocks and receive antennas, and the mask follows the same two axes. Because the payload phase is unpredictable, the model reconstructs the normalized log-power of each masked token and predicts its scale separately; ablations show that the two terms are complementary and that this target outperforms complex-signal reconstruction. The encoder is pre-trained on 850,496 physical uplink shared channel (PUSCH) slots from a 10^6-slot dataset simulated with the NR transmit chain under various channel conditions. With the encoder frozen, linear probes classify modulation, predict CRC success, and detect UE mobility. On a separately generated test set, 16 labeled slots per class give 0.85 modulation accuracy, 0.82 CRC area under the ROC curve (AUROC), and 0.73 mobility AUROC, ahead of a supervised CNN on every paired draw. With 10,000 labels the probes reach 0.94, 0.96, and 0.92, well above engineered receiver statistics, and detect mobility where the CNN stays at chance. Without any impairment labels, distances in the frozen feature space flag unseen waveform impairments with 0.78 macro AUROC, against 0.68 for receiver statistics. A single pre-trained encoder thus provides receiver features that transfer across tasks, most strongly when labels are scarce.

comments
Accepted for publication in IEEE Journal of Selected Topics in Signal Processing (JSTSP)
fields
Information Theory
pdf ↗ page arXiv:2610.21013 ↗

In this paper, all complete gradient Yamabe solitons of dimension at least three are classified. More precisely, we show that complete steady gradient Yamabe solitons are either rotationally symmetric manifolds or scalar-flat manifolds. We also classify nontrivial complete shrinking and expanding gradient Yamabe solitons.

comments
30 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.21078 ↗

Let $K$ be a number field, and let $S$ be a finite set of primes of $K$ containing all primes above $2$ and all archimedean primes. Let $G_{K,S}$ be the Galois group of the maximal algebraic extension of $K$ unramified outside $S$. We prove two refined lower bounds for the Krull dimension of unrestricted global Galois deformation rings of continuous absolutely irreducible representations of $G_{K,S}$ over finite fields of characteristic $2$. As applications, we construct the first counterexamples to the dimension conjecture in every dimension $n\geq 2$ over every number field with a real prime. Over every totally real number field, these constructions also yield the first examples of such universal deformation rings that fail to be complete intersections. Furthermore, we propose a modified dimension conjecture over arbitrary number fields and in every dimension.

comments
28 pages. v2:Revised proofs and a general formulation of the modified dimension conjecture
fields
Number Theory
pdf ↗ page arXiv:2610.21298 ↗

A central conjecture of Ferroni, Jochemko, and Schröter posits that every positroid is Ehrhart positive. While Ehrhart positivity has recently been verified for notable classes such as lattice path matroids and series-parallel matroids, the general conjecture remains open. In this paper, we prove that the base polytope of any paving positroid has positive Ehrhart coefficients. This establishes a new class of Ehrhart positive positroids and provides substantial evidence supporting this conjecture.

comments
24 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.21501 ↗

Let $\mathcal{M}$ be a simple matroid of rank $r$ on the ground set $[n]=\{1,\ldots,n\}$, let $T_{\mathcal{M}}(x,y)$ denote its Tutte polynomial, and let $\mathrm{OS}(\mathcal{M})$ denote its Orlik-Solomon $\mathbb{C}$-algebra. We say that $\mathrm{OS}(\mathcal{M})$ determines $T_{\mathcal{M}}(x,y)$ if, for every simple matroid $\mathcal{N}$, an isomorphism $\mathrm{OS}(\mathcal{M})\cong\mathrm{OS}(\mathcal{N})$ of $\mathbb{C}$-algebras, without regard to the grading, implies $T_{\mathcal{M}}(x,y)=T_{\mathcal{N}}(x,y)$. Falk conjectured that the Orlik-Solomon $\mathbb{C}$-algebra of every simple matroid of rank three determines its Tutte polynomial. We prove that this holds for every simple matroid of rank at most three, thereby resolving Falk's conjecture.

comments
17 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.21812 ↗

We prove a weak $(1,1)$ estimate for the full Poisson Littlewood–Paley $g$-function on every complete Riemannian manifold without boundary, with an explicit universal constant approximately equal to $2.06970$. The estimate requires no curvature restriction, volume doubling, heat kernel bound, or stochastic completeness. The proof combines a precise Poisson maximal inequality with a good-set energy estimate derived from a convex entropy identity. The constant is sharp for the abstract combination of these two estimates; no optimality is claimed for the operator norm. Local elliptic regularity is used to justify the passage to arbitrary real $L^1$ data. As an application, we obtain weak $(1,1)$ estimates for certain spectral multipliers represented by Poisson time derivatives with coefficients in $L^2((0,\infty),dt/t)$.

comments
In this revision, we improve the constant in the main weak (1,1) estimate and add several remarks on the scope and extensions of our results. We thank Prof. Hong-Quan Li for pointing us to his paper (Potential Analysis, 2017) with Peter Sjögren on the Laplacian with drift on real hyperbolic spaces, which helped us simplify the proof of Proposition 2.4
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.21847 ↗

To solve a large class of noncompact problems ubiquitous in random functional analysis and its applications, most of compactness-based fundamental theorems established for normed spaces or locally convex spaces are required to be extended for random normed modules and random locally convex modules in an appropriate way of weakening compactness. To achieve this goal, in this paper we first develop stable set theory by introducing some new set-theoretic tools, then propose a class of topological spaces with a stable structure, called stable topological spaces, and in particular propose and systematically develop the theory of stably compact spaces, which is a natural generalization of that of compact spaces. The resulting theory is of independent interest from the perspective of general topology since its investigation requires an analysis of stratification structures coordinated with partitions of unity in a complete Boolean algebra. Finally, we show the power of the theory of stable compactness by establishing random Banach-Alaoglu, random James and random Banach-Bourbaki-Kakutani-Šmulian theorems.

fields
Functional Analysis
pdf ↗ page arXiv:2610.22185 ↗

In this paper we prove a uniform lower bound for the length of a planar distance set under a bound on the concentration of mass. For each $0<η<1$, we obtain $b(η)>0$ such that every compact $F\subset\overline{B}(0,1)$ carrying a Borel probability $ν$ with $ν(B(z,r))\le2r^{1+η}$ for all $z\in\mathbb{R}^2$ and $0<r\le1$ satisfies $|ΔF|\ge b(η)$. For a compact planar set $E$ of diameter $D>0$ carrying a probability with $μ(B(z,r))\le A(r/D)^{1+\varepsilon}$ for all centers and $0<r\le D$, where $A\ge1$ and $0<\varepsilon<1$, localization gives $|ΔE|\ge c_{\varepsilon,p}DA^{-p}$ for each fixed $p>1/\varepsilon$, with $c_{\varepsilon,p}>0$ depending only on $\varepsilon$ and $p$. In particular, every compact planar set of Hausdorff dimension greater than one has a distance set of positive length. The proof uses scale-dependent cutoffs to construct approximants to a fixed positive distance measure. The same approximants have summable total-variation errors and summable integrals of the squared modulus of their Fourier transforms over the corresponding dyadic bands. We develop the multiscale method of OpenAI's release on October 6, 2026 in the plane and prove the estimates with constants uniform over the normalized family. This paper is for expository purpose only and is not intended for publication.

comments
Substantially revised and expanded; now student-friendly. For expository purpose only. Develops the multiscale method from OpenAI's Oct. 6 release. Not intended for publication
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.22222 ↗

We extend Wright's enumeration of connected labelled graphs with fixed surplus to irreducible critical finite type kernels and continuous compact type kernels satisfying a positivity condition. Let $\mathsf{C}_t(k,r)$ denote the total weight of connected labelled graphs with $k$ vertices and surplus $r$. Let $u>0$ satisfy $Ku=u$ and $\int u dμ=1$, and put $α=\int u^2 dμ$ and $β=\int u^3 dμ$. We prove that the rooted-tree radius $ρ$ is positive and real analytic near $1$, with $ρ(1)=1$ and $\logρ(t)=\frac{α^2}{2β}(t-1)^2+O(|t-1|^3)$, and that, for fixed $r\in\mathbb{Z}_{\ge0}$ and $0\le L<\infty$, $\mathsf{C}_t(k,r)=w_rβ^{(r-1)/2}e^{-k}ρ(t)^{-k}k^{k+3r/2-2}\{1+O_{r,L}(k^{-1/2})\}$, uniformly for $|t-1|\le Lk^{-1/2}$, where $w_r$ is the classical Wright constant. At criticality, the leading constant depends on the kernel only through $β$, under the stated normalization of $u$. At $t_n=1+λn^{-1/3}$, exact component identities combine with these asymptotics to give fixed size factorial densities and local size and surplus point-process limits for deterministic finite type models and annealed compact type Bollobás-Janson-Riordan models. With sizes rescaled by $β^{1/3}n^{-2/3}$, the limit is the Aldous process at parameter $αβ^{-2/3}λ$, and the corresponding type profiles concentrate at the Perron law $p(dx)=u(x)μ(dx)$. For every bounded uniformly positive countable critical kernel, we construct graph sequences with growing finite supports and the same local limits, and identify the additive shift of the critical window caused by spectral perturbations of order $n^{-1/3}$.

comments
58 pages, 3 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.23003 ↗

The Julia package QRecoupling evaluates classical and quantum recoupling coefficients, such as Clebsch-Gordan coefficients and $3j$ and $6j$ symbols, and user-defined sums of factorial products, with numerical, exact and symbolic targets. One compact factorial rule covers classical and deformed evaluations, while its cyclotomic exponents reveal common factors and determine which terms contribute at unitary levels. Adaptive arithmetic resolves strongly cancelling sums, while exact tests in quantum integers distinguish algebraic zeros from small nonzero values without a computer-algebra system. At spin cutoff 500, classical $3j$ and $6j$ symbols are evaluated about 7 and 15 times faster than with WIGXJPF. For the tested quantum deformations, relative errors remain below $4\times10^{-14}$ through spin cutoff 400. Recurrences compute fusion matrices with 401 channels about 100 times faster than loops over their entries. The resulting coefficients support recoupling identities, changes of coupling basis and tensor-network calculations.

comments
21 pages, 4 figures, 5 tables. Software: https://github.com/sethkasante/QRecoupling.jl (v0.6.4, doi:10.5281/zenodo.24027544)
fields
Mathematical Physics
pdf ↗ page arXiv:2610.24074 ↗

In this paper, we provide a comprehensive study of how the classical Black–Scholes-type market framework behaves in an infinite-dimensional setting. The asset prices are modeled by stochastic evolution equations in a separable Hilbert space. The evolution of the risk-free asset and the corresponding discounting operators are governed by a strongly continuous group of bounded linear operators. Accordingly, we consider contingent claims with Hilbert-space-valued payoffs, whose values are discounted through the corresponding operators. Within this framework, we investigate the pricing and hedging of contingent claims, deriving the corresponding Hilbert-space-valued Black–Scholes equations and establishing exact replication results for both strong and mild solutions. We also study the special case where the infinitesimal generator is given by $A=rI$, allowing for real-valued contingent claims. We further investigate no-arbitrage and market completeness, introducing a Hilbert lattice structure to formulate arbitrage and characterizing attainability through operator equations associated with martingale representations. We also establish asymptotic completeness through finite-dimensional noise truncations. We introduce geometric Brownian motions in Hilbert spaces and derive sufficient conditions for the existence and uniqueness of an equivalent risk-neutral measure, together with explicit pricing formulas for some tractable examples. These results extend key aspects of the classical Black–Scholes framework to markets with infinite-dimensional asset-price dynamics. As a concrete application, the model can be interpreted as a segmented market consisting of a sequence of one-dimensional geometric Brownian motions.

comments
38 pages
fields
Functional Analysis, Probability
pdf ↗ page arXiv:2610.24169 ↗

Let $X$ be an abelian surface of Picard rank 1 with ample generator $H$. We show that, for a Mukai vector $\mathbf{v}=(r,mH,χ)$ with $r,m\geq 1$ and $χ\leq 0$, the first Brill-Noether loci $\{E \;|\; H^0(E)\neq 0\}$ in $M_X(\mathbf{v})$ is nonempty of the expected codimension $1-χ$. As an application, we study the rank 1 Segre invariant on these abelian surfaces. Specifically, for $\mathbf{v}$ a Mukai vector of a $μ$-stable sheaf of $\mathrm{rank}\geq 2$, we compute the Segre invariant of the general sheaf in $M_X(\mathbf{v})$, and we determine the numbers which arise as the Segre invariant of a sheaf in $M_X(\mathbf{v})$.

comments
27 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.24251 ↗

Reinforcement learning (RL) solves the explore-exploit problem by training a learner on reward; its multi-agent, resource-sharing form has an equilibrium allocation as its optimum -- the ideal-free distribution (IFD), the Nash equilibrium of a congestion game. We show a minimal swarm approximates it with no learner at all. We present a decentralized, learner-free method for this problem: agents explore by heavy-tailed (Levy) flights, recruit neighbours to a discovery through a degree-normalized threshold cascade, and disperse as a patch crowds. The method drives the collective to the shape of the equilibrium allocation (pooled spatial matching slope 1.14, R^2=0.61) with no training, no stored parameters, and no reward in its dynamics; it reaches this as a self-organized attractor and holds it, re-finding it when the resources move -- though it reaches the shape, not the exact equilibrium, and stays measurably exploitable (Nash-gap 1.46). Coupling recruitment to movement causes the allocation: removing it collapses the matching (slope 0.006). Against Proximal Policy Optimization (PPO) learners (feedforward, centralized-critic, graph message-passing, and recurrent) trained in the same sensing-limited environment, the method at zero training is the only arm left unbiased w.r.t. the IFD gradient (slope ~1, CI containing 1, vs learners 0.69-0.97, all under-concentrating) and ties the best learner's harvest where resource is clustered, while the learner collects more where resource is scarce (0.33 vs 0.22) and holds a tighter per-capita intake. Learning buys precision and transfer across reward structures, not a better allocation shape. A companion paper develops the mechanism.

comments
26 pages, 13 figures, 5 tables, code and data: https://github.com/galenwilkerson/self-organizing-reinforcement-learning
fields
Mathematical Physics
pdf ↗ page arXiv:2610.25113 ↗

We investigate increased-order generalized synchronization between four- and five-dimensional memristive Hindmarsh–Rose neurons, focusing on the selection and stabilization of the synchronization map. An analytical construction combines a prescribed nonlinear map with adaptive control, retaining the memristive switching contribution explicitly in the error dynamics. Lyapunov analysis establishes asymptotic synchronization under uniform strict dissipativity and yields a switching-independent decrease estimate outside an explicit error neighborhood. Numerical simulations exhibit error decay beyond the sufficient convergence conditions. A complementary data-driven construction uses next-generation reservoir computing to learn predictors from uncoupled full-state trajectories and an affine synchronization map through dynamical consistency. The resulting sampled-data controller achieves small residual tracking errors without access to the governing equations. Relative to a reference map within the data-driven framework, the learned map reduces median control effort approximately eightfold while improving tracking accuracy. These results connect synchronization-map selection with conditional convergence guarantees and reduced control requirements.

comments
21 pages, 35 references
fields
Dynamical Systems
pdf ↗ page arXiv:2610.25164 ↗

Existing regression inference methods for nonstationary heavy tailed data are largely limited to unit roots tests. Functional central limit theorems (FCLTs), which are commonly used for the asymptotic analysis of nonstationary models, are inapplicable to nonstationary data characterized by a memory parameter $d<1$ and a stability parameter $α<2$. Furthermore, it is well known that inference under nonstationarity is often non-conventional, and this issue is exacerbated in the presence of heavy-tailed data. The interaction of long memory and heavy tails significantly enlarges the nonstationary region—i.e., the covariate model space—where conventional inference methods typically fail. To address these challenges, we propose a new limit theory and methods that facilitate both workable asymptotics and conventional inference in parametric regressions involving stationary and nonstationary heavy-tailed covariate processes. Specifically, our approach develops a limit theory for three classes of heavy-tailed weakly nonstationary processes (hereafter, HT-WNPs), which lie on the threshold of nonstationarity (cf. Duffy and Kasparis, 2021, Annals of Statistics). We also develop limit theory for functionals of strongly nonstationary heavy-tailed fractional processes. We demonstrate that the proposed methods, particularly a weighted extension of IVX, facilitate conventional inference for a broad class of stationary and nonstationary heavy-tailed covariates. This class includes mildly and nearly integrated arrays, as well as nonstationary fractional processes with memory parameter $1-1/α<d<2-1/α$, where $α\in(1,2]$. A related weighted instrumental-variable estimator is also considered, primarily for estimation purposes.

comments
186 pages, 9 figures, 37 tables. Substantially revised version focusing on weighted instrumental variable and IVX inference. The theoretical development and proofs have been reorganized, and the bibliography has been revised and updated
fields
Statistics Theory
pdf ↗ page arXiv:2610.25237 ↗

We develop an algorithmic approach to mixed Tate Chabauty–Kim theory for the full unipotent fundamental group of $\mathbb{P}^1 \smallsetminus \{0,1,\infty\}$, beyond the polylogarithmic quotient used in previous work. The key step is computing the cocycle evaluation map in the presence of a nontrivial motivic Galois action, using relations among motivic multiple zeta values. This yields explicit Kim functions involving multiple polylogarithms, as well as an algorithm for solving the $S$-unit equation whose halting is implied by certain natural conjectures. As an application, we prove new instances of Kim's Conjecture, including the first examples with $\#S = 2$.

comments
77 pages; added new Chabauty--Kim computations with #S=2; comments welcome
fields
Number Theory
pdf ↗ page arXiv:2610.25365 ↗

The topologically twisted index of 3d ADHM theory can be written as a sum over solutions to the Bethe Ansatz Equations (BAEs) of the XXZ-type model constructed from quantum toroidal $\mathfrak{gl}_1$. Via a novel numerical algorithm, we solve for all $p(N)$ physical solutions at $N\leq 21$, where $p(N)$ denotes the number of partitions of $N$. Surveying these solutions, we find that in addition to the known "1-cut" solution dual to dyonic black holes, where the gauge holonomies are distributed along a single curve in the complex plane, there are "dressed" 1-cut solutions dual to combined configurations of the black hole and M2-branes, $m$-cut solutions dual to $\mathbb{Z}_m$ orbifolds of the black hole, a discrete family of solutions interpolating between the 1-cut and 3-cut solutions whose bulk dual is not yet identified, together with other exotic solutions, at each value of $N$. We show that the $1,2,3$-cut solutions and interpolating solutions all have a well-defined large $N$ limit, and analytically compute their leading order distribution of gauge holonomies. Whenever possible, we fit the contributions of the solutions to the index to all orders in the $1/N$ expansion with high-precision numerics, and extract the leading non-perturbative correction. With exceptions, these are matched with the results of equivariant localization in the bulk, and the action of wrapped M2-branes respectively.

comments
Added clarifications and references, updated Appendix D
fields
Mathematical Physics
pdf ↗ page arXiv:2610.27097 ↗

Learned barrier certificates provide a principled mechanism for establishing safety of stochastic systems, but their validity may deteriorate during deployment when the underlying dynamics differ from those used for training. We propose an anytime-valid runtime monitor that audits a learned barrier certificate using observed closed-loop trajectories. The monitor is intended to detect loss of statistical support for the deployed barrier condition; it does not by itself guarantee detection before unsafe entry or safety of a subsequent intervention. Specifically, the conditional barrier-drift condition is formulated as an episode-wise sequential hypothesis test, and observed barrier increments are transformed into a nonnegative test supermartingale, yielding finite-sample false-alarm control under arbitrary stopping times. Inspired by finite-horizon safety verification, we further introduce a deterministic temporal shaping of the monitoring boundary, making the monitor more conservative early in a prescribed deployment horizon while preserving anytime-validity. The monitor is designed to detect statistical evidence that the safety certificate is no longer consistent with the observed dynamics, rather than to predict unsafe entry. To assess the monitor empirically, we evaluate empirical alarm behavior under valid and invalid certificates. Code and data are available at https://github.com/FormalCert-AI/runtime-barrier-monitor.

comments
Update-v2: add stepwise falsification guarantee theorem, VLA experiments, and acknowledgment
fields
Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2610.27726 ↗

Motivated by prescribed Chern scalar curvature problems in complex geometry, we study the equation $Δ_{\mathbb S^{N-1}}V+λ(e^V-1)=0$ with $λ>0$ on spheres. For $N\ge4$ and $λ>2(N-2)$ with $λ\ne2N$, we prove the existence of a nonconstant smooth solution that is axially symmetric and symmetric about the equator.

fields
Differential Geometry
pdf ↗ page arXiv:2610.28520 ↗

We prove that for every open $U \subseteq \mathbb{R}^n$ the spherical projection of every gradient trajectory $θ(t)$, $t \geq 0$, of a definable $C^1$-potential $F \colon U \to \mathbb{R}$ has finite length and, in particular, converges (directional convergence). In other words, every gradient trajectory of a definable $C^1$-potential has finite total angular motion. Here, definable means definable in an arbitrary o-minimal structure expanding the real field. Notably, the gradient trajectory in this result is an arbitrary solution of the gradient flow differential equation (whose solutions may not be unique) with no further assumptions: The gradient trajectory may be unbounded and diverge to infinity or it may be convergent. The established theorem therefore provides affirmative answers to both the gradient conjecture at infinity for definable potentials and the definable Thom gradient conjecture. We extend our conclusions from the Euclidean metric to a general class of ambient metrics including Riemannian metrics and we establish uniform local upper bounds for the lengths of the spherical projections of gradient flow trajectories. We finally apply our findings to the training of deep neural networks (DNNs) to conclude that, in the case of definable and continuously differentiable activation and loss functions, the spherical projection of the DNN training flow must always converge (directional convergence).

comments
143 pages
fields
Dynamical Systems, Algebraic Geometry, Classical Analysis and ODEs, Logic
pdf ↗ page arXiv:2610.29211 ↗

The study of three-vertex subgraph densities has developed along two complementary lines: exact finite realization in large graphs of a given order, and asymptotic approximate realization by sequences of graphs. We bridge these viewpoints for the edge density and the four induced three-vertex subgraph densities. By analyzing local modifications of finite samples from graphons, we show that, for any nonempty subset of these densities, every asymptotically feasible target vector lying a fixed positive distance from the boundary of the corresponding feasible region is realized exactly by a graph of every sufficiently large order, subject only to the natural arithmetic constraints. Thus, in the interior of these feasible regions, asymptotic feasibility implies exact finite realizability up to the unavoidable arithmetic obstructions.

comments
20 pages, 1 figure. v2: Added acknowledgments, author affiliation and contact information, keywords, and MSC classification; minor formatting changes. Mathematical content unchanged
fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.30166 ↗

We prove that every compact orbifold with corners admits a triangulation compatible with all its corners: for every $k\ge1$, each connected component of the $k$-corners maps onto the image of a subcomplex, and every open simplex lies in the set of points of a single depth. Faces need not be embedded, and the local groups may permute boundary components. The proof turns the boundary hyperplanes of linear charts into mirrors by means of the squaring map, which, unlike the folding $y\mapsto|y|$, is compatible with smooth changes of charts, and then applies the triangulation theorem for orbit spaces of proper Lie groupoids.

fields
Geometric Topology, Algebraic Topology
pdf ↗ page arXiv:2610.31001 ↗

A non-zero $m \times n$ (0, 1)-matrix $A$ is called a {\em nullspace matrix} if each entry $(i, j)$ of $A$ has an even number of $1's$ in the set of entries consisting of $(i, j)$ and its rectilinear neighbors. These matrices correspond to even dominating sets of $m \times n$ grid graphs. We study these matrices and consider those that cannot be constructed from smaller nullspace matrices.

fields
Combinatorics
pdf ↗ page arXiv:2610.31475 ↗

In 1981 Guibas and Odlyzko showed that the set $A$ of all words of a given length $n$ that avoid a given word $p$, and the set $B$ of all words of length $n$ that avoid a given word $q$, have the same cardinality if and only if $p$ and $q$ have the same self-border lengths. Carrigan et.~ al.~ ask in if there is a ``natural'' bijection between $A$ and $B$. This paper makes partial progress toward answering that question. We provide such a bijection by imposing additional conditions on $p$ and $q$, but we also obtain a stronger conclusion: there is a ``natural'' bijection $Φ$ from the set of all finite words to itself that swaps $p$ and $q$ in each word $Ω$, meaning that $Ω$ has a $p$ or $q$ at a given position iff $Φ(Ω)$ has, repectively, a $q$ or a $p$ at that same position. An algorithm is given for converting $Ω$ into $Φ(Ω)$.

fields
Combinatorics
pdf ↗ page arXiv:2610.31967 ↗

We study the structure of amenable subrelations of treeable measure-class-preserving equivalence relations, applying the Radon–Nikodym topography perspective initiated in our companion paper [TTD25]. For a nowhere smooth amenable subrelation, we show that the ends selected by each class in Adams's end selection theorem are precisely those which are nonvanishing along that class. From this, we derive a number of structure results about nowhere smooth amenable subrelations of treeable equivalence relations. For example, we show that every nowhere smooth amenable subrelation is contained in an essentially unique maximal amenable subrelation. This yields an anti-treeability criterion, which we use to show that every nonamenable locally compact second countable group with noncompact amenable radical is not treeable, and that every nonamenable nonunimodular treeable group has a compact open subgroup.

comments
Added Proposition 5.10 and made minor cosmetic changes
fields
Logic, Dynamical Systems
pdf ↗ page arXiv:2610.32038 ↗

We establish a dynamical convergence-divergence criterion for all functions with a prescribed modulus of continuity to have continuous sub-actions. The divergence part of the criterion, which gives functions that do not have any bounded sub-action, is valid for general dynamical systems with a weakly repelling fixed point. This unifies and generalises versions of the Mañé cohomology lemma for uniformly expanding maps, and results of Morris for maps with an indifferent fixed point. One consequence is that for any infinite compact metric space $(X,ρ)$, and Lipschitz Ruelle-expanding map $T:X\to X$, a metric transform $ω$ satisfies Dini's criterion $\int_0 ω(s)s^{-1}\, ds <\infty$ if and only if all functions that are Lipschitz for $ω\circρ$ have continuous sub-actions. Another consequence is that if $T$ is an expanding circle map of Manneville–Pomeau type $α\in(0,1)$, then $ω$ satisfies the convergence criterion $\int_0 ω(s)s^{-1-α}\, ds <\infty$ if and only if all functions that are Lipschitz for $ω\circρ$ have continuous sub-actions. For the latter class of maps, with $ω$ satisfying the convergence criterion, we prove a Livšic theorem for functions $f$ that are Lipschitz for $ω\circρ$: if $\int f\, dμ=0$ for all invariant measures $μ$, then $f=\varphi\circ T-\varphi$ for a function $\varphi$ that is Lipschitz with respect to $D_α(ω)\circρ$, where $D_α(ω)(t)= \int_0^t ω(s)s^{-1-α}\, ds$.

comments
48 pages, 3 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.32484 ↗

An oddomorphism to $K_n$ is a proper colouring with $n$ colours in which every vertex is designated odd or even, every vertex has in each other colour class a number of neighbours of its own parity, and every colour class contains an odd number of odd vertices. We prove that an oddomorphism witness to $K_n$ on at most $n+6$ vertices contains a $K_n$ minor with every branch meeting the witness's specified odd set. The conclusion holds inside any graph containing the witness and therefore applies to weak oddomorphisms. The bound is sharp: for every $n\ge8$ the minimum order of a graph admitting a weak oddomorphism to $K_n$ but having no $K_n$ minor is exactly $n+7$. The extremal example is a fifteen-vertex graph with an oddomorphism to $K_8$, obtained from the doubled theta graph of Kriesell and Mohr by adding one vertex adjacent to the seven roots; we give a structural proof that it has no $K_8$ minor, including their counting argument for the rooted case. We also prove that every witness to $K_4$, of arbitrary order, has a $K_4$ minor with every branch meeting its original odd set. The roots need not be prescribed or have distinct colours. In six colours, we prove that a fibre of size at most two forces a $K_5$ minor rooted in the original odd set, with no bound on the other fibres. In particular every six-colour witness on at most seventeen vertices has such a model. A separate technical companion records further results on related root-apex graphs, an attachment theorem and a bounded nine-colour statement, together with their computational provenance; none of it is used here. The qualitative clique-target existence problem has been solved in recent work; our results concern exact source-order bounds and control of the original odd set.

comments
78 pages, main article and technical companion combined; includes computational provenance and verifier source. Revised introduction and references; added original-odd-set-rooted K4 theorem and all-order small-fibre K6-to-K5 theorem, implying the seventeen-vertex bound
fields
Combinatorics
pdf ↗ page arXiv:2610.33283 ↗

Prediction is one of the most important research topics in statistics and machine learning. Moreover, in the domain of streaming data analysis, real-time prediction has become a rapidly growing research field in recent years, owing to the abundance of streaming data. In many fields of scientific research, such as biomedical research, weather forecasting, and traffic management, improving real-time prediction of streaming data is crucial in general. However, the complicated features of streaming data, such as large-scale and high-velocity, impose both theoretical and computational challenges to the development and evaluation of real-time prediction in this field, especially when the investigator has multiple models at hand. To overcome these challenges, we propose a novel Renewable Model Averaging method through Quadratic approximation (ReMAQ) for generalized linear model (GLM) for streaming data. By approximating the model averaging procedure for GLMs (which is typically a convex optimization problem) with a quadratic optimization formulation, ReMAQ allows us to update the model averaging prediction sequentially when a new batch of data arrives, without accessing the entire historical data. Moreover, ReMAQ is also computationally efficient as one only needs to consider a quadratic programming problem in each steps of updating. Under certain regular conditions, we also show that the proposed ReMAQ weight is asymptotically equivalent to that by the oracle model averaging based on the inaccessible full data, the asymptotic optimality of ReMAQ is then established accordingly. The proposed method is also assessed by simulation studies. We apply our proposed ReMAQ in the study of the Airline On-Time Performance Dataset and the results demonstrate the superiority our method in practical situations.

comments
26 Pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2610.33665 ↗

We study the minimax regret rate for episodic kernel-based reinforcement learning, where the expected reward and transition density belong to a Sobolev reproducing kernel Hilbert space (RKHS), with continuous state and action spaces, and adversarial initial states. For Sobolev smoothness parameter $ν>0$, state dimension $d_S$, and action dimension $d_A$, we prove that the minimax expected regret over $T$ episodes is $\widetildeΘ(T^{\max\{e_A,e_B\}})$, where $e_A=\frac{ν+d_A}{2ν+d_A}$, $e_B=\frac{ν+d_A+3d_S/2}{2ν+d_A+2d_S}$ with the other model parameters fixed. The two exponents reflect the distinct difficulties of action selection and learning across states. We introduce Sobolev Optimal Value Iteration (\texttt{SOVI}), which attains this rate from observed rewards and transitions. For fixed smoothness and reference-kernel lengthscale, its regret bound has a prefactor polynomial in the state-action dimension $d=d_S+d_A$, horizon $H$, reward and transition RKHS norm bounds $B_r,B_p$, and the norm-comparison factor $Λ$, up to logarithmic factors; $Λ=1$ for normalized Matérn kernels. The algorithm separates initial action selection from continuation-value estimation and combines local polynomial approximation with the shared RKHS structure of the approximation errors. Our matching upper and lower bounds determine the optimal dependence on the number of episodes for Sobolev kernel-based reinforcement learning regret minimization. Thus, we partially address the open problem in Vakili(2024) under Sobolev kernel RL.

fields
Statistics Theory
pdf ↗ page arXiv:2610.34045 ↗

Let $\Bbbk$ be an algebraically closed field of characteristic different from $2$. We realize the four-dimensional selfinjective algebra $Ω(1)$ as an admissible infinite cyclic orbit algebra of the repetitive Kronecker category. Thus an algebra long stated to be nonstandard is of Euclidean type in the orbit-algebra sense. We also identify a gap in an earlier proof of its nonstandardness and give an independent proof by determining all connected Galois covering sources of $Ω(1)$. Together, these results disprove the implication from Euclidean type to standardness in the equivalence explicitly stated by Bocian–Holm–Skowroński (2004) and Bocian–Skowroński (2005). They also contradict the standardness conclusion of the Proposition in \S2.1 of Skowroński (1989); its main theorem in \S1.5 assumes standardness and is not contradicted by this example.

comments
29 pages. Added Theorem A(3), exhibiting two connected Galois coverings with simply connected source whose composite is not Galois. New Sections 7 and 8 give the construction and lifting criteria yielding sufficient conditions for standardness
fields
Representation Theory, Category Theory, Rings and Algebras
pdf ↗ page arXiv:2610.34119 ↗

We study the two-dimensional quadratic Schrödinger equation $(i\partial_t+Δ)u=λ_1u^2+λ_2\overline u^{\,2}$ with initial data of size $\varepsilon$ in a weighted $H^2$ space. We prove almost global existence, with a lifespan of at least $\exp(c/\varepsilon)$ and decay at the optimal linear dispersive rate $t^{-1}$. Our proof is based on the space–time resonance method introduced by Germain, Masmoudi, and Shatah. The main new ingredient is the construction of a Besov-type profile space $\mathcal Z$, together with one-sided weighted bilinear estimates and spatially localized nonstationary phase estimates. This framework allows us to close the bootstrap argument without controlling the global second spatial moment of the free profile.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34237 ↗

A set of positive integers is admissible if equal sums of finite subsets always have equal numbers of summands. Let $a(N)$ count the nonempty admissible subsets of $\{1,\ldots,N\}$, and let $b(N)$ count those with maximum $N$. We prove $\log a(N)\sim\log b(N)\simπ\sqrt{2N/3}$, establishing the sharp logarithmic asymptotic proposed by Nicolas. More generally, let $Q_h(N)$ count the subsets for which each integer has subset-sum representations of at most $h$ distinct cardinalities. Uniformly for all positive integers $h,N$, we prove $\log Q_h(N)\asymp\min\{N,\sqrt{hN}\}$ with absolute implied constants. Every infinite set satisfying the same condition for some fixed $h$ has counting function $o(\sqrt x)$. At $h=1$, the latter two results settle conjectures of Erdős, Nicolas and Sárközy, strengthening the proposed vanishing lower limit to a full limit. The proofs record each subset sum together with its cardinality and use the counting theorem of Campos and the structure theorem of Carpenter, Defant and Kravitz. The sharp count also uses Nicolas's partition enumeration and an elementary construction of a long restricted-sum progression. Finally, we give an exact partition formula for the odd sets with separated alternate cardinality layers suggested by Nicolas.

fields
Combinatorics
pdf ↗ page arXiv:2610.34372 ↗

Using webs, we prove that Kazhdan-Lusztig mu-coefficients for symmetric groups grow at least exponentially with the rank, already for pairs labeled by a three-row rectangle.

comments
44 pages, many figures, Lean verification available, comments welcome
fields
Representation Theory, Combinatorics, Quantum Algebra
pdf ↗ page arXiv:2610.34982 ↗

Let f $\in$ C[x, y] be a trinomial and let g $\in$ C[x, y] be a sparse polynomial with N monomials (N $\ge$ 1). We address the problem of bounding the local intersection multiplicity of the bivariate polynomial system f = g = 0 at an isolated root q $\in$ (C * )^ 2 only in terms of N . Our main result establishes that the local multiplicity of the system at any isolated solution q $\in$ (C * ) ^2 is at most (N -1)(N +2)/ 2 , independently of the degrees of f and g. Furthermore, we know that this bound is sharp for N = 3.

fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2610.35037 ↗

We prove that every critical spherical catenoid in a geodesic ball of hyperbolic three-space has Morse index four and nullity two. This resolves Medvedev's index conjecture throughout the parameter range of the catenoid family. The kernel consists precisely of the normal components of rotations that preserve the center of the ball and tilt the axis of the catenoid. As consequences, the radius of the supporting ball increases strictly along the family, and each critical spherical catenoid admits a smooth family of free boundary constant mean curvature deformations in its supporting ball. The proof combines a global boundary inequality obtained from a Wronskian, a positive Dirichlet eigenfunction supplied by the time component of the unit normal, and a Riccati comparison for the angular mode $k=2$. A ground-state identity then yields positivity of every angular mode $k\ge2$. We also show that the energy index of every critical spherical catenoid in $\mathbb{H^3}$, that is, the index of the second variation of its energy, equals four; hence the inequality between the energy index and the spectral index conjectured by Medvedev for geodesic balls of $\mathbb{H^n}$ fails.

comments
18 pages. v3: added Theorem 2 and Section 9: the energy index of every critical spherical catenoid in $\mathbb{H^3}$ is four, disproving the inequality in Medvedev [10, Remark 7]
fields
Differential Geometry, Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2610.35651 ↗

In this paper, we study the algebraic properties of $\mathcal{S}_θ$ --- the class of truncated Toeplitz plus truncated Hankel operators --- on the model space $\mathcal{K}_θ$. We also give a complete characterization of the intersection class of truncated Toeplitz and truncated Hankel operators. As a by-product of our findings, we give a complete characterization for $S_θ$, where $θ$ is a finite Blaschke product and also obtained the commutant of $S_θ+ S_θ^{*}$ in that case.

comments
Pages 24. Revised. A new reference was added
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2610.35897 ↗

We prove a separated entropy bump theorem for two-weight $L^2$ inequalities for positive operators defined by Carleson sequences on a probability space with a general filtration. The bump conditions use conditional averages of martingale maximal functions and involve the first power of the entropy penalty, removing the square appearing in the separated condition of Treil and Volberg. As a consequence, we obtain separated Orlicz bump estimates for a class of doubling Young functions. The final section describes a direct Orlicz argument that removes the doubling assumption and the monotonicity assumption on $\frac{Φ(t)}{t\log t}$, and discusses extensions to other exponents. These results apply, in particular, to sparse operators. The proof uses principal sequences, a natural global extension of principal sets, and combines a good-$λ$ estimate with a weighted Carleson embedding to obtain the required testing inequalities.

comments
32 pages. Revised title; added an introduction and expanded the references. Added a discussion of direct Orlicz bump estimates and extensions to other exponents, together with minor corrections
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.35949 ↗

Consider the countably infinite reduced free product $D$ of copies of $(\mathrm C([0,1]),λ)$, where $λ$ is Lebesgue measure. It is proved that finite and countable reduced free products of unital separable nuclear UCT $\mathrm C^*$-algebras with respect to a chosen family of faithful traces are classified, after adjoining $D$, by the Elliott invariant. In other words, an isomorphism between the naive K-theory invariants of two such algebras is induced by an isomorphism between the algebras.

comments
110 pages. The section of range and models is revised. The class of C*-algebras considered in the paper is also shown to be closed under unital strong Morita equivalence
fields
Operator Algebras
pdf ↗ page arXiv:2610.36459 ↗

Stationary tail computation for high-dimensional reflected Brownian motions (RBMs) remains computationally challenging. Building on NN4MGF's shared-coordinate basic-adjoint-relationship (BAR) framework, we develop Holomorphic Cauchy Networks (HCNs). Native complex-valued rational Cauchy subnetworks enforce holomorphicity on pole-free domains, removing sampled Cauchy-Riemann penalties and their input-derivative graphs. Exact origin anchoring and boundary-coordinate exclusion enforce structural identities, while anchored interactions represent dependent transforms. Under holomorphic-log assumptions, we establish simultaneous value and first-derivative approximation for the constrained architectures and a mixed-derivative lower bound for coordinate-only representations under nonzero cross-covariance. Closed-form real-axis derivatives and sequential backpropagation further control memory. On the same NVIDIA H100 NVL, the tested 30D HCN configuration uses approximately tenfold less peak allocated memory and has 9.7-fold lower mean update time than NN4MGF; extrapolation to the respective scheduled update counts gives a projected full-schedule update-time ratio of 58.2. With 64 million sampled base inputs per high-dimensional run, HCN reaches 50 dimensions on a laptop GPU with 6.367% mean relative error over thresholds 1 through 8. Degree-matched comparisons yield lower reported mean relative errors over the primary evaluation ranges, including 1.422% versus 6.684% on the 2D Harrison non-product benchmark. On a 10D correlated RBM benchmark, HCN achieves 3.829% mean relative error over thresholds 1 through 8 against a simulation reference, compared with 19.386% for an independent-marginal baseline.

comments
28 pages, 3 figures, 14 tables. Updated the 10D simulation reference and revised the exposition. Code available at https://github.com/KehanWang126/holomorphic-cauchy-networks-rbm
fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2610.36558 ↗

We extend the Bakry–Émery curvature framework on graphs, broadening its applications and strengthening the resulting diameter bounds. We study diameter bounds and finiteness for amply regular graphs, distance-regular graphs, $(s,c,a,k)$-graphs, and locally strongly regular graphs. In particular, for an amply regular graph with parameters $(v,k,λ,μ)$, we prove that \[{\rm{diam}}(G)\le4+8\log\frac{k}{\max\{λ,μ\}}\] when $μ>2$ and $k\ge3λ^2/μ$, improving the previous linear bound $4k/(λ+4)$ to a logarithmic bound. We also address several related conjectures. In their monograph \emph{Distance-Regular Graphs}, Brouwer, Cohen, and Neumaier conjectured that every amply regular graph with $μ>1$, except the icosahedron, satisfies ${\rm{diam}}(G)\le2k/(λ+2)$. We confirm this bound when $μ>λ+1$ and give counterexamples to the conjecture with $μ=λ$. For amply regular graphs with $μ\geλ$ and $μ>1$, we obtain ${\rm{diam}}(G)\le 2k/μ+1$. This proves the Qiao–Park–Koolen conjecture. In 1983, Terwilliger conjectured that every $(s,c,a,k)$-graph with $c>1$ is finite. We prove this conjecture when ``$s>2$, $c>2$, $(s,c)\ne(4,3)$'' and when ``$s=2$, $c>7$''. Moreover, we prove Weetman's finiteness conjecture for locally strongly regular graphs when the local parameter $μ>1$, and disprove his stronger conjecture that every strongly regular graph is an $\mathscr{S}$-graph. We also prove that every graph whose local graphs all have rank 3 is finite, which in particular proves a conjecture of Soicher in 1992.

fields
Combinatorics
pdf ↗ page arXiv:2610.36620 ↗

Let $p$ be an odd prime. Let $G$ be a rank two definite unitary group as defined by Barnet-Lamb et al. in [2]. In this article, we determine explicit modular local Serre weights for mod $p$ Galois representations $\barρ_h$ associated to eigenforms $h$ of $G$, with arbitrary weights and small slopes. As a consequence, we also determine modular global Serre weights in certain cases. We show analogous results for certain Hilbert modular eigenforms corresponding to totally definite and indefinite quaternion algebras. In proving our results, we identify the non-singular submodules in quotients of certain symmetric power $\mathbb{F}_q[\text{M}_2(\mathbb{F}_q)]$--modules by Dickson polynomials and their twisted versions.

comments
35 pages. Improved slope bounds and the inclusion of global Serre weights
fields
Number Theory
pdf ↗ page arXiv:2610.37261 ↗

We present a geometric framework for realizing quantum Schur algebras with unequal parameters, via constructible sheaves on flag varieties arising from non-split groups of Lie type. In the special cases of general unitary groups and minus-type orthogonal groups, this framework yields the iSchur algebras with unequal parameters, which are closely related to the quasi-split iquantum groups of type AIII. Such a geometric realization enables the construction of canonical bases, integral forms, and monoidal categorification for these unequal-parameter iSchur algebras and the corresponding iquantum groups. This material is not a formal generalization from the equal-parameter case to the unequal-parameter case. A nontrivial arithmetic structure is imposed on the geometric structure of split groups, giving rise to many new phenomena. For example, the support varieties of generators of an integral form may not be rationally smooth, the categorification is provided by the category of descent data of semisimple complexes fixed by the twisted Frobenius, and the positivity of the canonical basis is established using a refined covering.

comments
81 pages
fields
Representation Theory, Group Theory, Quantum Algebra
pdf ↗ page arXiv:2610.37291 ↗

We prove early-stopped, target-to-output KL guarantees for Brownian interpolant Euler sampling from the true source under arbitrary Borel couplings, even with nonintegrable endpoints. At fixed stopping time and noise level, a fourth displacement moment yields an $O(N^{-1})$ discretization term. A second moment suffices for fixed-law convergence with grid refinement and vanishing drift error. For one fixed coupling with no displacement moment above two, the original and comparison paths have KL of orders one and $1/\log N$ relative to the exact-drift Euler path. On the same geometric grid, terminal KL is at most $C/N^2$. The path decomposition identifies the information about the source discarded by Markov projection. When the original bridge is Markov, current-state Euler sampling has an $O((M_2+d)/N)$ discretization term. We prove expected stopped-output KL consistency for a learner trained on iid endpoint pairs with fresh true-source initialization. In a spatial image control, iterative sampling has worse fair energy scores than direct prediction with resampled residuals. Uniform terminal rates for general second-moment couplings remain open.

comments
51 pages, 2 figures, including an 8-page main text. Revised exposition and streamlined appendices
fields
Probability
pdf ↗ page arXiv:2610.37413 ↗

We compute the $RO$-graded Tambara functor of $H\underline{\mathbb{Z}}$ for every finite cyclic group. We introduce a valuation language for homotopy groups to give the explicit formula for products, restrictions, transfers, Weyl actions, and norms. Besides the computation, We also develop a theory that reconstructs a genuine equivariant spectrum as the homotopy limit of a finite diagram of homotopy fixed-point spectra, Tate spectra, and only one localization spectrum at the terminal of the diagram. We call it the Tate compression theory. From it we also give a filtration for $π_\star(H\underline{\mathbb{Z}})$, compatible with products, restrictions, transfers, Weyl actions, and norms.

comments
71 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2610.37885 ↗

An algorithm is proposed, analyzed, and tested for solving nonlinearly constrained continuous optimization problem instances wherein the objective function is defined by an expectation over a random variable argument and the constraints include inequalities (and perhaps equalities) involving functions that may be nonconvex. The algorithm combines a retrospective-approximation strategy for handling the objective and an interior-point approach for handling the constraints. In each iteration of an outer loop, the objective is approximated by an empirical average over a set of realizations of the random variable argument and the resulting sampled problem is solved with an interior-point method that allows inexact search-direction computations for computational flexibility. Termination conditions for the interior-point method are tailored for those needed for convergence guarantees by the outer loop. Over the outer loop, the sample set is updated adaptively in such a manner that convergence guarantees for solving the original optimization problem can be assured. The results of numerical experiments are presented, which show that the proposed algorithm can outperform competing methods that have comparable theoretical guarantees.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38857 ↗

In this paper, we apply higher-order tangent bundles and higher-order derivative maps to study countable subgroups of the diffeomorphism group ${\rm Diff}(M)$ of a closed smooth manifold $M$. Using this framework, we introduce the concept of higher-order $μ$-discreteness for subgroups $Γ< {\rm Diff}(M)$, and show that both the strong Novikov conjecture and the coarse Baum–Connes conjecture hold for countable groups with higher-order $μ$-discreteness. Finally, we give examples showing that higher-order $μ$-discreteness encompasses a strictly larger class of subgroups of $\operatorname{Diff}(M)$ than its lower-order counterpart.

fields
Functional Analysis
pdf ↗ page arXiv:2610.40062 ↗

We prove a local $Tb$ theorem with testing conditions on metric balls, for possibly non-doubling measures of polynomial growth on geometrically doubling metric spaces. It resolves the maximal-truncation version of Hofmann's local $Tb$ problem for all $1<p,q\leq\infty$, without assuming antisymmetry of the Calderón-Zygmund kernel. Our theorem allows accretive systems of complex testing measures satisfying a quantitative small-set condition; these measures need not be absolutely continuous with respect to the underlying measure. Testing requires only a one-level $L^0$ bound for maximal truncations, with an alternative for balls on which the underlying measure concentrates in a set of small relative diameter. We also remove antisymmetry from the known buffered and unbuffered fixed-truncation criteria. The proof combines a mixed corona decomposition adapted to the two testing systems with two-measure $L^2$ estimates for suppressed operators. We obtain the following applications: - If $Ω\subset\mathbb{R}^{n+1}$, $n\geq 2$, is a bounded domain with Ahlfors regular boundary satisfying the interior corkscrew condition, and the Neumann problem for the Laplacian in $Ω$ is solvable with data in $L^p$ for some $1<p<\infty$, then $\partialΩ$ is uniformly rectifiable. The proof applies the matrix-valued version of the theorem to the Cauchy-Clifford operator. - In the parabolic space $\mathbb{P}^n$, local time-directed $A_\infty$-type conditions on caloric and adjoint caloric measure imply $L^2(σ)$-boundedness of the spatial gradient of the heat single layer potential for boundary measures $σ$ with upper parabolic $(n+1)$-growth. This gives a parabolic counterpart of the harmonic-measure theorem of Mourgoglou and Tolsa without Ahlfors regularity, corkscrew or Harnack chain assumptions.

comments
141 pages. v2: we added the application to the Neumann problem
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40135 ↗

Collision-free motion planning for multi-agent robotic systems remains an active research area because of the complexity of coordinating robot trajectories, with applications ranging from coordinated drone shows to autonomous operations on land, in the air, and on water. Importantly, the analytical difficulty of nonconvex collision-avoidance constraints has so far driven the development of exclusively numerical methods. We derive a complete analytical characterization of the optimal trajectories for two robots with zero initial and final velocities, under double-integrator dynamics and a squared-acceleration objective. We prove that these trajectories belong to eight distinct contact families and determine which family applies for each configuration of initial and final positions. We analyze the geometrical properties of the optimal trajectories and provide a numerical algorithm for computing them. These insights have already been adopted to improve the performance of numerical methods for multi-agent motion planning by several orders of magnitude.

fields
Optimization and Control
pdf ↗ page arXiv:2610.41558 ↗

This note derives the full Hamiltonian equations of motion on extended phase space for nonconservative and/or nonautonomous dynamical systems, with particular attention given to the momentum coordinate and generalized force associated with time. Time reparameterization is also considered, clarifying when it does or does not preserve Hamiltonian structure. The analytical mechanics framework is used throughout, with all developments formulated in terms of arbitrary symplectic coordinates; the main developments are not predicated on a Lagrangian description.

fields
Mathematical Physics, Symplectic Geometry
pdf ↗ page arXiv:2610.41635 ↗

The reduction number of the maximal ideal of a localization (or even faithfully flat extension) need not increase under specialization. Nevertheless, for each fixed local ring the reduction numbers of the maximal ideals of all its localization have a finite common bound. A connection to (generalized) Loewy length is given.

fields
Commutative Algebra
pdf ↗ page arXiv:2610.41659 ↗

A proper coloring $\varphi$ of a graph $G$ is called proper conflict-free if, for every non-isolated vertex $v$, some color appears exactly once in its open neighborhood $N_G(v)$. For a nonnegative integer $k$, a graph $G$ is proper conflict-free $(\mathrm{degree}+k)$-choosable if, for every list assignment $L$ satisfying $|L(v)|\ge d_G(v)+k$ for each $v\in V(G)$, there exists a proper conflict-free coloring $\varphi$ of $G$ with $\varphi(v)\in L(v)$ for each $v\in V(G)$. We prove that every connected graph other than the $5$-cycle $C_5$ with maximum average degree less than $8/3$ is proper conflict-free $(\mathrm{degree}+2)$-choosable. This improves the maximum average degree bound $18/7$ of Kashima, Škrekovski and Xu, and removes the assumption $g(G)\ge7$ from the $8/3$ theorem of Qi, Song and Cao. We also show that the $(\mathrm{degree}+2)$ list-size bound is best possible for graphs with maximum average degree arbitrarily close to $8/3$ from below. As an immediate consequence, our theorem implies that every planar graph of girth at least $8$ is proper conflict-free $(\mathrm{degree}+2)$-choosable.

fields
Combinatorics
pdf ↗ page arXiv:2610.41668 ↗

We classify the connected components of support $τ$-tilting graphs of surface rigid algebras associated with partial tagged triangulations of punctured marked surfaces with nonempty boundary. For a connected algebra, the graph is disconnected precisely when the algebra is weakly symmetric, has at least two simple modules and has Cartan rank one. There are then exactly two components. The completion graph of every nonzero $τ$-rigid pair over a connected surface rigid algebra is connected. Suppose the defining partial tagged triangulation is nonempty and all its endpoints are punctures. Then the realization of the support $τ$-tilting complex is homotopy equivalent to a sphere of dimension $\operatorname{rank}C_A-1$. Signed endpoint vectors give an explicit homotopy equivalence. Under the same endpoint hypothesis, $τ$-tilting finiteness is equivalent to positive definiteness of the Cartan matrix. In the finite case, we determine the primitive $g$-vector ray generators in endpoint coordinates and give a surface criterion distinguishing the root sets of types $A$, $D$ and $C$. The homotopy construction also applies to Brauer graph algebras with arbitrary vertex multiplicities.

comments
40 pages, 5 figures; added results on spherical homotopy types; revised exposition and title
fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2610.41703 ↗

Uniform random sampling of strings is overwhelmingly dominated by high-complexity strings, leaving the much smaller set of low- and intermediate-complexity strings largely unexplored. Here, we adapt the nested neutral set estimator (NNSE), a Monte Carlo rare-event sampling method, to estimate the distribution P(K) of complexity values for binary strings of fixed length. NNSE allows us to explore the full complexity landscape, including exponentially rare low-complexity regions that are inaccessible to direct sampling, for string lengths up to several hundred. We apply the method to several widely used complexity measures: Lempel-Ziv 76 (LZ76), Lempel-Ziv 78 (LZ78), context tree weighting (CTW), the block decomposition method (BDM), and block entropy. We further introduce uniform complexity weighting (UCW), which gives equal weight to different complexity levels rather than to individual strings. Using NNSE to perform UCW sampling allows us to compare complexity measures across their full range in a dataset-independent way. This reveals differences in their behavior for low- and intermediate-complexity strings that are practically inaccessible to conventional uniform sampling.

fields
Information Theory
pdf ↗ page arXiv:2611.00162 ↗

We prove a representation theorem for finite series-parallel viscoelastic networks composed of springs and spring-pots of a common order $0<α<1$. Using classical representation results for complete Bernstein and Stieltjes functions, we show that the associated complex shear modulus, expressed in an appropriately chosen auxiliary variable, admits a finite partial-fraction representation with simple poles on the negative real axis. Its reciprocal admits an analogous representation with a possible additional pole at the origin. Inverting the corresponding Laplace transforms gives finite fractional Prony representations of the relaxation modulus and creep compliance with non-negative amplitudes. These results provide a rigorous proof of a corrected version of the Mainardi-Spada conjecture for this network class. A six-element network illustrates the construction.

comments
21 pages, 3 figures, improved presentation and reference list
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00750 ↗

In this paper, the first in a series devoted to finite-time singularities of point-vortex systems in domains with boundaries, we investigate finite-time boundary collisions and interior collapse for three vortices in the upper half-plane $\mathbb{H}^+$. We first prove that finite-time boundary collisions are impossible for arbitrary nonzero vortex circulations, without any restrictions on their signs or algebraic relations. The result excludes both simultaneous boundary collapse and individual vortex approaches to the boundary, without requiring convergence of the vortex trajectories. In contrast, we establish the existence of finite-time interior collapse by treating the boundary-induced interactions as a perturbation of the classical self-similar Gröbli collapse in the full plane. Under suitable conditions on the vortex circulations and collapse profile, we prove the existence of a one-dimensional local strong stable manifold of the augmented rescaled system, which generates exact solutions in which three distinct vortices collapse simultaneously at any prescribed interior point $z^*\in\mathbb{H}^+$. Moreover, these solutions are asymptotically self-similar, with the characteristic square-root collapse rate $O(\sqrt{T-t})$.

comments
39 pages
fields
Dynamical Systems, Mathematical Physics, Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.01014 ↗

P. Gao and L. Zhao obtained an asymptotic formula for the smoothed first moment of primitive cubic Dirichlet \(L\)-functions over \(\Q\) with conductors coprime to \(3\), with a main term of order \(Q\) and error \(O\left(Q^{\frac{7}{8}+\eps}\right)\) under the generalized Lindelöf hypothesis. Building on their double Dirichlet series, we assume the generalized Riemann hypothesis and separate an explicit secondary term of order \(Q^{\frac{5}{6}}\) in the same family, with error \(O\left(Q^{\frac{23}{28}+\eps}\right)\). We explicitly evaluate the secondary coefficient and prove that it is strictly negative. We also prove unconditionally that the secondary polynomial in the squarefree second moment of the natural cubic Hecke \(L\)-functions over \(\Q(\sqrt{-3})\) has degree one and strictly positive leading coefficient, which we evaluate explicitly.

fields
Number Theory
pdf ↗ page arXiv:2611.01451 ↗

We develop an axiomatic approach to the boundary Harnack principle on diameter-uniform domains in proper doubling metric measure spaces. Under critical-density and upper-contraction assumptions, we establish a scale-invariant one-sided boundary comparison between nonnegative supersolutions and positive solutions as well as Hölder continuity of quotients of positive solutions. Our framework does not require linearity or rectifiable curves. Applications include classical elliptic equations with Dirichlet and Neumann boundary conditions, spectral fractional Laplacians, harmonic functions on fractals, and Pucci operators.

fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.01586 ↗

For $k\ge 3$, let $T_k(3)$ denote the least $N$ such that every $3$-coloring of $[1,N]$ contains a monochromatic solution to $x+(k-1)y=z$. The formula $T_k(3)=k^3+2k^2-2$ is already known: it follows from a Theorem of Chang, De Loera, and Wesley. Their proof uses a symbolic SAT certificate with $685$ polynomials and $9468$ solution triples. The purpose of this paper is to give an independent, explicit proof based on a much smaller certificate. We exhibit a fixed set $\Xmin$ of $33$ polynomials in $k$ and the $144$ polynomial identities $z=x+(k-1)y$ among them, and show that no $3$-coloring of $\Xmin$ avoids a monochromatic identity. The resulting case analysis has $62$ cases, depth $8$, and uses only two elementary rules; it is given in full and independently checked by a program. We also prove that $\Xmin$ is a critical subset of minimum cardinality of the $51$-element set from which it was extracted, and describe the rigid structure shared by all extremal colorings of $[1,k^3+2k^2-3]$. The lower bound is supplied by an explicit recursive coloring. In the notation $s_a(3)$ of the first author, with $a=k-1$, the formula is $s_a(3)=a^3+5a^2+7a+1$, which was conjectured before.

comments
We have added a discussion of the earlier result of Chang, De Loera, and Wesley (ISSAC 2022), which establishes the same numerical formula under an equivalent change of variables. We have clarified the scope of our contribution, emphasizing the independent proof, the smaller polynomial certificate, and the structural results concerning extremal colorings
fields
Combinatorics
pdf ↗ page arXiv:2611.01714 ↗

In this paper, First, we prove that for every topological MV-algebra the topology is induced by a uniformity. As a application, we obtain that every topological MV-algebra is completely regular and every \(T_0\) first countable topological MV-algebra is metrizable. Second, we study the completion of the canonical difference uniformity in topological MV-algebra. Finally, we construct some examples show that not all topological MV-algebras are canonically completable and the property of canonically completable topological MV-algebra does not imply local order convexity.

comments
22
fields
General Topology
pdf ↗ page arXiv:2611.01779 ↗

We consider unconstrained minimization of a possibly nonconvex function $f:\mathbb{R}^n\to\mathbb{R}$ whose $p$th derivative is Lipschitz continuous, with $p\geq3$, when derivative information is available only through order $p-2$. The unavailable tensors $\nabla^{p-1}f$ and $\nabla^pf$ are reconstructed from central finite differences of $\nabla^{p-2}f$. Since the two reconstructions have different point-query costs, we use a block length $m$ for the order-$p$ approximation and a subblock length $\ell\leq m$ for the order-$(p-1)$ approximation. The latter is transported between consecutive reconstruction points using the stored order-$p$ approximation. This leads to an adaptive regularization method that does not require prior knowledge of the Lipschitz constant. We prove finite termination at an $ε$-approximate first-order stationary point and derive an explicit bound on the number of bundled order-$(p-2)$ oracle queries. For $m=(p-2)n^2$ and $\ell=(p-2)n$, the accuracy-dependent term has dimension–accuracy scaling $n^{3/p}ε^{-(p+1)/p}$. Thus the method retains the $ε^{-(p+1)/p}$ dependence of full order-$p$ regularization while using derivatives only through order $p-2$. Within the dense reconstruction framework considered here, using separate block and subblock lengths gives dimension dependence of order $n^{3/p}$, compared with $n^{4/p}$ when a common length is imposed.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01819 ↗

We investigate the contact of regular surfaces in $\mathbb{R}^4$ with spherical cylinders $S^2(r) \times \mathbb{R}$. We introduce cylindrical directions of these surfaces, defined by the axes of spherical cylinders having degenerate contact with the surfaces, and show that these directions capture the ridge condition of projected regular surfaces under orthogonal projection along these directions.

fields
Differential Geometry
pdf ↗ page arXiv:2611.01912 ↗

We prove the Díaz$\unicode[Arial]{x2013}$Park conjecture for sharpness of saturated fusion systems. More generally, for every saturated fusion system $\mathcal F$ over a finite $p$-group and every Mackey functor for $\mathcal F$ over the localisation $\mathbb{Z}_{(p)}$ of the integers at $p$, the higher limits of its contravariant part over the centric orbit category vanish in all positive degrees. In particular, the subgroup and normaliser decompositions of every $p$-local finite group $(S,\mathcal F,\mathcal L)$ over the $\mathcal F$-centric subgroups are sharp. This answers in the affirmative a question in the list of important open problems in [M. Aschbacher, R. Kessar and B. Oliver, Fusion Systems in Algebra and Topology, Cambridge Univ. Press (2011)], and proves the sharpness conjecture stated in [M. Aschbacher and B. Oliver, Fusion systems, Bull. Amer. Math. Soc. (2016)] and Conjecture 1.2 of [E. Yalç$\unicode[Arial]{x131}$n, Higher limits over the fusion orbit category, Adv. Math. (2022)]. The proof is algebraic and does not rely on the classification of finite simple groups.

comments
Lean and Rocq unconditional formalisations (about 62,000 and 100,000 lines of project source). Compilation on personal laptop took about 2.7 hours for Lean under Windows and 3.4 hours for Rocq under Linux. There is a report that describes the details of the formalisations and the underlying theories. See the acknowledgemets for more details
fields
Group Theory, Algebraic Topology, Category Theory, Representation Theory
pdf ↗ page arXiv:2611.02043 ↗

In this paper we adopt a topological perspective to extend two theorems of classical infinitary logic to the infinitary logic of Keisler's general real-valued structures: the omitting types theorem and Scott's theorem. There the formulas need not be uniformly bounded, and no moduli of continuity are required, as they are in the metric extensions of the classical theorems; neither equality nor a metric is required. The omitting types theorem holds for every countable fragment, because the space of Henkin types of the fragment is Čech-complete. Scott's theorem characterizes every structure with countable sorts, among all structures, up to approximate equivalence, and the classes of this equivalence are Borel sets in the Polish space of structures on the natural numbers. With the monoid of surjections of the natural numbers in place of the group of permutations, we also prove López-Escobar's theorem for classical infinitary logic without equality.

fields
Logic
pdf ↗ page arXiv:2611.02247 ↗

We study online newsvendor learning with bounded demand, censored observations, and convex nonlinear shortage costs. Because stockouts can conceal the shortage magnitudes needed by gradient-based algorithms, we use randomized ordering to construct unbiased subgradient estimates. We characterize admissible randomization distributions within this framework and develop an online inventory policy that combines the resulting subgradient estimates with gradient-based updates. Our regret analysis quantifies the cost of randomization via the estimation variance and an additional loss term. We characterize the randomization distributions that minimize this objective. For piecewise-linear shortage costs, the optimal distribution is computed through a linear-time recursion; for costs with bounded curvature density, it is characterized by a scalar ordinary differential equation. The policy achieves expected regret of $O(T^{2/3})$ against the best fixed order in hindsight over $T$ periods. Under independent demand and suitable curvature of expected losses, the bound improves to $O(\sqrt{T})$. Matching minimax lower bounds establish rate optimality over the corresponding classes with a fixed marginal-cost bound. Both rates extend to nonperishable inventory under uniformly positive conditional expected demand. Numerical experiments on synthetic and retail data show improvements over alternative policies using censored observations.

comments
30 pages of main text and 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.02267 ↗

Jiang and Zhu [J. Combin. Theory Ser. B 137 (2019) 112–117] asked whether every $k$-choosable graph is $(km+1:m)$-choosable for every positive integer $m$. We show that, for all integers $k\ge3$, $m\ge2$, and $t\ge0$ satisfying $m>8t+ε$, where $ε\in\{0,1\}$ and $m\equivε\pmod2$, there is a graph with chromatic number and choice number both equal to $k$ that is not $(km+t:m)$-choosable. This answers their question negatively for every $k\ge3$ and $m\ge10$. In particular, our construction yields a $3$-choosable graph on $91$ vertices that is not $(6:2)$-choosable, answering a question of Dvořák, Hu and Sereni [Adv. Comb. (2019), Paper No.~5]. More generally, for every fixed $b\ge1$, $m\ge2$, and $t\ge0$, we construct an $(a:b)$-choosable graph that is not $(am+t:bm)$-choosable for all sufficiently large $a$, with an explicit bound on $a$. Let $F(a,b)$ be the supremum of the strong fractional choice numbers of $(a:b)$-choosable graphs. We prove that for every fixed $b\ge1$, $F(a,b)-\frac ab$ tends to infinity as $a\to\infty$.

fields
Combinatorics
pdf ↗ page arXiv:2611.03151 ↗

The Stable Fluids algorithm is a fractional step method for solving the incompressible Navier-Stokes (NS) equations in an unconditionally stable way. It was initially developed for visual effects and allows real-time simulations because of its low computational complexity. The method solves the advection step by using the method of characteristics which is implemented via linear interpolation. This results in excessive diffusion of vorticity and is one of the main reasons for the physical inaccuracy of the algorithm. We propose Kernelized Stable Fluids with Sparse Cholesky Preconditioning (KSF-Chol) in order to address this shortcoming and make the algorithm thereby suitable for engineering problems and scientific computing. The algorithm is modified by replacing the linear interpolation approach with kernel interpolation in the advection step. We accelerate the computationally expensive kernel interpolation by using sparse Cholesky preconditioning and a near-/far-field approach and optimize both methods for computations on a uniform Cartesian grid. KSF-Chol achieves per time step a near-linear computational complexity of $\mathcal{O}(N\log^d(N/\varepsilon_{\mathrm{chol}}))$ in space and time. We test KSF-Chol against reference solvers and numerical reference data on multiple 2D and 3D benchmarks and demonstrate a significantly reduced numerical diffusion as well as a competitive accuracy concerning the computation of relevant flow quantities.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03263 ↗

Asymptotic independence between sum-type and maximum-type statistics arises repeatedly across many areas of probability and statistics, particularly in high-dimensional testing and random matrix theory. Motivated by the shared structure underlying existing proofs, which is obscured by their model-specific formulations, this note isolates a common intermediate principle. We introduce a finite-exceedance dependence principle: if the finite-exceedance dependence error vanishes at every fixed order and high-order exceedances are mildly controlled, then a finite-order Bonferroni argument yields asymptotic independence between the sum and the maximum. We further give an independent-proxy criterion for verifying this: for each finite set of exceedances, it suffices to construct an exactly independent proxy for the sum-type statistic whose approximation error is negligible in aggregate. Local deletion under dependency graphs and Gaussian regression and residualization are two examples. The framework gives modular derivations of existing sum–max independence results.

comments
28 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.03351 ↗

We classify the algebraic principal ideals of alternating quadratic random operators under dimension-free two-sided curvature bounds. For the centered evaluation of a Hilbert two-form, an explicit covariance compensator determines the principal ideal after every fixed compact perturbation. For fixed spectral choices, the compensator is a compact linear function of the full covariance with explicit finite-dimensional approximation bounds; its class modulo the independent Gaussian ideal is intrinsic. For fixed spatial weights of rank at least two and a trace-class kernel, all attainable principal ideals form an exact order interval. Every intermediate ideal is realized by a Gaussian covariance arbitrarily close to the identity while each row retains its standard Gaussian law. For these spatial weights, trace class is also the exact kernel domain for raw evaluation under every law in the curvature class. The proof uses a conditional-residual criterion for linear operators, polarization, and finite-rank approximation. Applications include Wiener area and dependent matrices with doubly monotone variance weights. A logarithmic example separates principal ideals with identical membership in every Schatten class.

comments
30 pages
fields
Probability
pdf ↗ page arXiv:2611.03495 ↗

Let $λ$ be the Liouville function. We prove Let $λ$ be the Liouville function. We prove \[ \mathcal{I}_λ(X)=\int_{\mathbb{T}}\left|\sum_{1\leqslant n\leqslant X}λ\left(n\right)\mathrm{e}\left(nα\right)\right| \mathrm{d}α \gg X^{\frac{1}{4}}. \] This removes the $X^\varepsilon$ loss in the previous result of Pandey and Radziwiłł~\cite{PandeyRadziwill2026}. In the second paper in this series, we will prove that \[ \limsup_{X \to \infty} \frac{\log \mathcal{I}_λ(X)} {\log X} \geqslant\frac{1}{3}. \]

comments
7 pages. Comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.03589 ↗

On a hereditarily precompact quasi-metric space, every non-contractive bijection $F$ is asymptotically an isometry along its backward orbits: for all $a$ and $\varepsilon>0$, $0\le d(Fx,Fy)-d(x,y)<\varepsilon$ for $x$ far in the past of $a$ and all $y$. Zavarzina asked whether every such bijection of a precompact space is an isometry; the author's toll spiral (arXiv:2610.13973) answered no. Each such $F$ has a register, a quasi-pseudo-metric $λ^-\le d$ for which $F$ is an isometry, with round-trip distances totally bounded on orbits; after completion, $F$ acts on each orbit as a rotation of a compact monothetic group, its rigid shadow. The defect $d-λ^-$ from $x$ to $y$ is at most the fee of $x$ (the supremum of its defects to earlier iterates) and at least the excess of $x$'s fee over $y$'s now or at any earlier time, less their round-trip register distance; the fee never decreases forward along orbits and tends to zero backward. In this sense, every such $F$ is a toll over its rigid shadow. The fees bound the defect but do not determine it: three spirals show it can depend on $y$, vanish at a distant $y$ even when $x$ has a positive fee, and be positive toward later iterates of $x$. The toll-spiral paper asked whether every such map is conjugate to a tolled extension, a fixed toll zone over an isometric shadow, possibly with infinitely many zones. If only descents are charged, the answer is no, even up to bi-Lipschitz conjugacy; on each infinite orbit, a map is such an extension over its register exactly when its ascents carry no defect. Fees may vanish at any rate, but for zone tolls (two-valued, shift-monotone, subadditive along their routes) they reach zero at a finite depth. The general results hold on quasi-pseudo-metric spaces where every sequence has a left K-Cauchy subsequence; all but the statements listed at the end are machine-checked in Lean.

comments
23 pages. Lean 4 verification files included as ancillary files and archived with the paper at Zenodo, doi:10.5281/zenodo.23544811. Answers Question 7.6 of the toll-spiral paper (arXiv:2610.13973): negatively for tolls charging only descents, positively in structural form. v2: adds the structural answer (Corollary 1.3) and tolled extensions (Section 6.4); v1's 6.3-6.8 are now 6.4-6.9
fields
General Mathematics
pdf ↗ page arXiv:2611.03681 ↗

We describe an algorithm that, given a postcritically finite quadratic polynomial, outputs a finite state machine whose regular language is the set of angles whose dynamical rays land on the Hubbard tree, generalizing an example of Milnor. We do this by extracting orbit portraits from angled internal addresses, and constructing a suitable Markov partition of angle intervals. A main application is computing direct ray connections between Hubbard trees in matings of quadratic polynomials, and understanding when ray connections between the trees first appear when moving along veins of the Mandelbrot set. If one of the mating parameters is fixed, we prove that first ray connections are picked up at parabolic parameters or tips of veins. We also prove that the locus of parameter pairs in two given veins for which there are no ray connections between the trees is open. Additionally, we show that there are no ray connections between small Julia sets in matings of locally connected rabbit tunings.

comments
66 pages, 7 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.04190 ↗

We construct canonical projective birational models of normal proper integral algebraic spaces over arbitrary fields. The construction preserves the intrinsic quasi-projective core and is natural under semilinear isomorphisms. For smooth proper integral input in characteristic zero, we combine an intrinsic choice of ideals with Włodarczyk's principalization to obtain a canonical tower of blowups in smooth centers ending in a smooth projective variety. Consequently, every compact connected Moishezon manifold admits a smooth projective bimeromorphic model to which all automorphisms lift compatibly. The main ingredient is a family-sum argument yielding an intrinsic finite selection of maximal tuples of boundary ideal germs; successive modifications strictly decrease the boundary-image dimension. We also construct canonical quasi-projective models for nonproper normal input and a greatest schematizing ideal for separated finite-type algebraic spaces over noetherian bases. Oda's threefold illustrates the construction.

comments
25 pages, 2 figures. v2: normal algebraic spaces over arbitrary fields, nonproper and marked variants, canonical schematization, and expanded proofs and examples
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.04314 ↗

We introduce a combinatorial principle $\textsf{SC}(κ)$, for any regular cardinal $κ\ge ω_2$, which asserts the existence of a family $\mathcal{Y} \subseteq [H(κ)]^ω$ of elementary substructures of $H(κ)$ which is closed under finite intersections and satisfies that for stationarily many $N \in \mathcal{Y}$, if $M \in \mathcal{Y}$ and $M \cap ω_1 < N \cap ω_1$, then $M \cap N \cap κ\in N$. We explore the idea of defining forcings with side conditions consisting of finite subsets of such a family $\mathcal{Y}$. If $\textsf{SC}(ω_2)$ holds, then there exists a thin stationary subset of $[ω_2]^ω$, and consequently $\textsf{SC}(ω_2)$ is independent of ZFC. Assuming that $μ$ is a Mahlo cardinal, the Lévy collapse $\mathrm{Col}(ω,<μ)$ forces that $\textsf{SC}(κ)$ holds for all regular cardinals $κ\ge ω_2$. Local instances of $\textsf{SC}$ can be forced using matrices of models or derived as consequences of square principles. We apply the principle $\textsf{SC}$ to define two kinds of forcings: a streamlined version of a strongly proper collapse, and a forcing which is strongly proper on a stationary set and adds arbitrarily many Baumgartner clubs. Finally, we prove two consistency results using forcings derived from $\textsf{SC}$ related to Aronszajn trees, the guessing model principle, strong failures of club guessing, and the higher dominating number.

comments
Submitted
fields
Logic
pdf ↗ page arXiv:2611.04362 ↗

We investigate the structure of locally analytic representations of $p$-adic groups, and establish a sufficient condition for the irreducibility of locally analytic vectors in certain Banach representations of $D^\times$, where $D$ is the quaternion division algebra over $\mathbb{Q}_p$. As an application, we prove that $\mathrm{JL}(ρ)^{\mathrm{an}}/\mathrm{JL}(ρ)^{1\text{-}\mathrm{alg}}$ is a topologically irreducible locally analytic representation of $D^\times$ under certain genericity conditions on $ρ$. Here $\mathrm{JL}(ρ)$ is the $ρ(-1)$-multiplicity space in the image of $Π(ρ)$ under Scholze's functor, and $Π(ρ)$ is the representation associated to $ρ$ by the $p$-adic local Langlands correspondence.

comments
40 pages, no figures
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.04514 ↗

Self-similar solutions play an important role in the formation of singularities in the Yang–Mills equations. In five space dimensions, these equations admit infinitely many self-similar solutions with an increasing number of unstable modes. It was observed numerically in [1] that all excited profiles share the least unstable eigenvalue $λ=5$. We explain this remarkable spectral property by an elementary construction of the corresponding eigenfunction.

comments
6 pages, v2: added numerically computed eigenvalues and extended the discussion of special modes in higher dimensions
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.04861 ↗

We study structural defects in fixed points of block substitutions, building on arXiv:2604.12637 and providing its technical supplement. We develop an automata-based framework to characterize their occurrence and derive verifiable combinatorial criteria. We also introduce simplifications for the construction and analysis of these automata, including tensor-product decompositions, that clarify the mechanisms underlying structural defects and their emergence.

comments
20 pages, 23 figures. Comments are welcomed
fields
Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2611.04880 ↗

For a stochastic program $\min_{z\in Z} c^T z + h(z)$ with a random cost vector $c$, regret, or the expected value of perfect information, is usually computed by re-solving the problem scenario by scenario. We show that regret is determined by the covariance between the cost vector and the optimal decision $π^s(c)$. The identity is exact and holds without regularity assumptions once the covariance is integrated along the path from the mean to each scenario. With $c_s=E[c]+s(c-E[c])$, $Reg=-\int_0^1 s^{-1} Cov(c_s,π^s(c_s))\,ds$. Three consequences follow. First, the plain covariance is always an upper bound: $0\le Reg\le-Cov(c,π^s(c))$. Second, when the optimal decision rule is affine, as in unconstrained and equality-constrained (e.g., budget-constrained Markowitz) quadratic programs, regret equals exactly one half of the covariance. For purely linear objectives, an affine rule forces zero regret. Third, the ratio of regret to covariance lies in $[0,1]$ and is governed by the shape of the covariance profile along the path. The noise level at which this profile first becomes positive is a decision-stability margin that tightens the bound. The identity also holds scenario by scenario for any predicted cost, so it applies to linear and combinatorial programs with discontinuous decision rules. We give dimension-free concentration bounds and a central limit theorem for the plug-in estimator. Across 7 problem classes, 8 cost distributions, and the shortest-path benchmark of Elmachtoub and Grigas (2022) with $10^6$ draws per configuration, the identities hold to within quadrature error, and the covariance bound holds in every scenario.

comments
13 pages
fields
Information Theory
pdf ↗ page arXiv:2611.05227 ↗

For integers $e\ge3$, let $f_3(n,e+3,e)$ denote the maximum number of edges in an $n$-vertex $3$-uniform hypergraph containing no $e$ distinct edges spanning at most $e+3$ vertices. The lower-bound part of a longstanding conjecture of Erdős, Frankl, and Rödl from 1986 asserts that $f_3(n,e+3,e)\ge n^{2-o(1)}$ for every fixed $e\ge3$. We prove that $f_3(n,9,6)\ge n^2\exp(-O((\log n)^{2/3}))$, resolving the first open case not covered by the classical construction of Ruzsa and Szemerédi in 1976, which established $f_3(n,6,3)\ge n^{2-o(1)}$. We also establish near-quadratic lower bounds for $f_3(n,e+3,e)$ with $e=9,10,11$. We further extend the result for $e=6$ to every fixed uniformity $r\ge4$.

comments
21 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.05261 ↗

We propose a new refinement of the (blockwise) Alperin weight conjecture taking dimensions of simple modules (or degrees of irreducible Brauer characters) into consideration. This is similar to Giannelli's refinement of the (Alperin--)McKay conjecture. We prove this new refinement for blocks with a cyclic or Klein four defect group, for inertial blocks (which include the Broué–Puig nilpotent blocks), and for $p$-blocks of $p$-solvable groups.

comments
Corrected some typos; Propositions 4.3 and A.1 were added
fields
Group Theory, Representation Theory
pdf ↗ page arXiv:2611.05271 ↗

We study critical Gibbs partitions whose component law is in the domain of attraction of a spectrally positive stable law of index one. In the dense phase, we prove a local limit theorem for the number of components and functional limits for their sizes. We also describe convergent and divergent condensation regimes, and a phase transition at a boundary in which the dense and condensation contributions compete.

fields
Probability
pdf ↗ page arXiv:2611.05285 ↗

We prove that every obstruction to noncontextual hidden variables in quantum mechanics is finite, including the obstructions that rest on Gleason's hypothesis of countable additivity. Since Kochen and Specker, such obstructions have been certified by finite configurations of rays, at the level of propositional logic: once a configuration is fixed, the obstruction is the inconsistency of finitely many Boolean constraints. Compactness, the source of these configurations, cannot reach the obstructions that rest on countable additivity: in infinite dimension the finite-dimensional events admit a finitely additive noncontextual valuation, and countable additivity constrains infinitely many events at once. The tool is a theorem of infinitary real-valued logic that takes the place of compactness: every countable theory of closed conditions without models is refuted by a well-founded tree of finite contradictions, given by the winning strategies of a model existence game. Quantum probability is axiomatized by such a theory, whose standard models are exactly those of Gleason's theorem. In the strategy we construct, a hypothetical noncontextual measure is not refuted by a configuration fixed in advance: through countable additivity, the measure itself selects the four-dimensional subspace in which the measure fails. The same logic defines, in the standard models, exactly the $σ$-projective sets of probabilities. Statements about $σ$-projective sets often go beyond ZFC, as the measurability of all these sets does; our theorems are nevertheless proved in ZFC, since the only determinacy they use is that of open games.

fields
Logic
pdf ↗ page arXiv:2611.05656 ↗

Dantzig-Wolfe reformulation strengthens the linear relaxation of a mixed-integer program by convexifying a chosen set of constraint families, and every candidate costs a column generation run. The choice is hard when families strengthen the bound only together; the classical inequalities of lot sizing, network design and facility location rest on such zero-marginal groups. We prove that when each evaluation convexifies at most $s$ of $k$ families, any method that observes only bounds needs a covering number of evaluations, of order $k^w$, to find a hidden group of $w$ families. A prediction that misses $e$ members reduces the cost to $Θ(k^e)$ by a staged search, so the evaluations a prediction saves measure what the predictor knows. We study two sources of predictions: a lookahead at an optimal LP dual, blind to groups whose families share no variable, and a language model that reads the model, which JointDW verifies with the staged search and interleaves with the lookahead at a bounded loss. Zero-marginal groups appear in three of ten MIPLIB-NL models with an improvable bound and in all 59 standard lot-sizing, network-design and facility-location instances, where GCG's detector convexifies a set with no gain on 38 of them. On MIPLIB-NL the strongest language models find the groups about as often as the lookahead, and on textbook models their predictions rest on the names. Given every coefficient of a larger model, one reasoning model names the classical group in all but one answer, also with the names permuted or removed, and needs fewer evaluations than the lookahead for pairs of families; a predictor trained on the same class matches this only after hundreds of labeled evaluations. On the benchmark instances the language models name the best pair more often than the lookahead and the detector, and the sets of GPT-6.1 Sol come closest to the branch-and-price time of the best set.

comments
32 pages, 4 figures, 26 tables. Code and data: https://github.com/junbolian/JointDW
fields
Optimization and Control
pdf ↗ page arXiv:2611.05726 ↗

Pontryagin's Maximum Principle is said to be "normal" for the problem at hand when it has a solution (maximizer u*) that explicitly involves the problem's cost function, making the maximum principle helpful (while in the opposite situation it is of no help). The aim of the present paper is, for Lagrange optimal control problems without state constraints, to identify classes of problems for which the Principle is normal. General conditions are introduced that guarantee normality, and classes of problems that satisfy these conditions are identified. Such classes include problems for which the constrained (by bounds on the control values) "augmented" reachable set, with cost along an upward vertical axis, has a convex lower-boundary function and the optimal terminal state lies in the relative interior of the reachable state set, with the terminal constraint within the affine hull of that set. Such classes include problems for which the constrained (by bounds on the values of the control signal) "augmented" (with the cost value along an upward "vertical axis") reachable set has a "convex" lower boundary for which the optimal terminal state lies in the relative interior of the set of reachable states. Special attention is given to Lagrange steering problems: sufficient conditions are obtained on a nested sequence of sub-classes of such problems, culminating with the class of steering problems with scalar control signal and linear time-invariant (LTI) state dynamics and objective integrand, for which normality is guaranteed whenever all eigenvalues of the state dynamics matrix A are real (e.g., if A is symmetric or triangular or the system is overdamped) or have small enough imaginary parts; simple 2 x 2 examples show that, in contrast with the situation in the finite-dimensional case, this property does not extend to arbitrary A matrices.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05743 ↗

We study accelerated proximal gradient methods with general stepsizes for convex composite multiobjective optimization, where each objective is a smooth convex term plus a proper closed convex term and the proximal subproblem keeps a separate offset for each objective. For a two-parameter root momentum rule with trajectory-dependent coefficients, we construct a new energy function and establish an energy identity. This yields sharper convergence guarantees: boundedness, weighted square summability of the displacements, a merit-function rate of $o(k^{-2})$, and displacement decay of $o(k^{-1})$ whenever the first parameter converges to a value in $(0,1)$; the second parameter need not converge or have bounded total variation. At the critical value $α=3$, we obtain $u_0(x^N)\le \frac{2\ell R}{N(N+3)},$ together with $O(1/N)$ displacement decay, square summability, and weak Pareto convergence. The remaining little-$o$ question at $α=3$ is reduced to the vanishing of a nonnegative critical energy. For $1<α<3$, we prove the rate $O(N^{-(α-1)})$, and for every $α>0$ we obtain $u_0(x^k)\to0$, $F_i(x^k)\to c_i$, and $\sum_k D_k/k<\infty$. A JOS1 experiment numerically validates the predicted little-$o$ separation and the rate behavior.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06125 ↗

How many environments and samples does it take to separate $d$ Gaussian sources whose variances change across environments? Each source has a signature, its vector of variances. The Riesz $2$-energy $E_j$ of source $j$ sums the inverse Fisher informations for rotating it towards other sources. With known whitening, we prove a worst-case squared-angle risk lower bound of order $E_j/(n+E_j)$ for orthogonal estimators at every $n$ and $d$. A quadratic pencil given the signatures attains $E_j/n$ up to a constant above a separation-dependent sample threshold, even with estimated whitening. For well-spread signatures at fixed $K$, the energy grows as $d^2$, $d\log d$ and $d$ for $K=2$, $3$ and $K\ge4$, respectively. A design with $K\asymp\log d$ and pairwise Fisher information bounded below by a constant makes $d\log d$ samples sufficient. The eigenvectors of a single fixed linear combination have an average first-order error coefficient of at least order $d^2$. Simulations up to $d=1000$ support the first-order predictions, and on task fMRI the energy helps rank split-half instability.

fields
Information Theory
pdf ↗ page arXiv:2611.06228 ↗

In this paper,we consider a stable numerical method for the Stokes-Biot model. We adopt the standard formulation of the Stokes equations coupled with the mixed formulation of the Biot system involving the additional total pressure variable. We construct the semi-discrete scheme on polygonal meshes by employing weak Galerkin finite element methods for spatial discretization. It is convenient to incorporate the interface conditions into the semi-discrete scheme via the edge-based degrees of freedom. Furthermore, we give a fully discrete scheme based on the backward Euler method. We establish the well-posedness of these two schemes and provide a rigorous error analysis. Finally, we present some numerical examples to verify the convergence and stability of our algorithm under a wide range of some physical parameters.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06335 ↗

The Siler model describes mortality from birth to old age as the sum of a declining immaturity hazard, a constant background hazard, and an increasing senescence hazard. Its remaining life expectancy has no known closed form, and numerical evaluation alone does not reveal how the immaturity hazard enters it. We show that the remaining-lifetime distribution at age $x$ is Gompertz–Makeham with a Poisson-distributed Makeham term. Successive Makeham terms differ by the rate at which immaturity mortality declines, and the Poisson mean is the cumulative immaturity hazard remaining after age $x$. In a latent-clock construction, individuals carry a Poisson number of constant-rate clocks, and selection removes those carrying more clocks first. Integrating the mixture yields an exact series for remaining life expectancy with a closed-form truncation bound. The life expectancy lost to immaturity mortality is close to the probability of carrying a clock times life expectancy with that hazard removed, with a closed-form error bound. In annual fits to Swedish female mortality, this loss at birth fell from 4.3 years in 1900 to less than 0.01 years in 2020, a decline equal to 15\% of the gain in life expectancy at birth, and the approximation was always within 0.06 years.

comments
17 pages, 4 figures, 1 table. Code and data: https://github.com/scpatricio/siler-poisson-mixture
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.06376 ↗

We construct nonisomorphic separable real Banach spaces whose multiplicative Lipschitz distance is one. Building on OpenAI's graph-space construction, we arrange two sequences of graph spaces into countably many blocks and form two spaces that differ by a single additional block. This block distinguishes their linear structures: one space contains a complemented copy of $\ell_1(c_0(\ell_2))$, whereas the other does not. By mapping the additional block to increasingly late positions and rearranging the remaining blocks, we obtain homeomorphisms whose Lipschitz constants and those of their inverses tend to one, while both spaces and their norms remain unchanged.

comments
66 pages. Added information on the Lean formalization, its public release, and the use of AI in its development. Mathematical results unchanged
fields
Functional Analysis
pdf ↗ page arXiv:2611.06493 ↗

``Emergence'' refers to the fact that different mathematical languages and theories seem to be required to describe scientific theories that operate at different spatial and temporal scales. Highly circumscribed, special cases of emergence have been investigated using many different formal tools, including coarse-graining (over space and / or time), renormalization, dimension reduction, broken symmetry, and various formulations of causality. Here we extend the mathematics of model theory to unify and extend these earlier investigations. As a preliminary application of our framework, we investigate canonical examples of emergence, including the emergence of genetics from chemistry, of psychology from neurobiology, and of different forms of collective behavior from the laws governing their constituent parts. By exploiting the power of model theory we also uncover many aspects of emergence that were previously obscured. In particular, we uncover some of the rich hierarchical structure that relates different scientific fields. For example, we show that scientific fields can be related via a collection of multiple partial orders, all defined over the same set. On the other hand, under an alternative relation among scientific fields, one which allows cycles, we show that it is possible that the set of all of scientific fields must collapse into a single scientific field. Going forward, these investigations point to the formal tools that might need to be developed in order to arrive at a deeper understanding of this emergent hierarchy of scientific reality.

comments
52 pages, 44 pages main text, 3 figures
fields
Logic
pdf ↗ page arXiv:2611.06641 ↗

There is a large body of work on distributed optimization for problems in Euclidean space. However, many existing algorithms and analyses do not directly transfer to problems defined on manifolds. Therefore, in this paper we propose a distributed asynchronous optimization algorithm for problems on Riemannian manifolds. The algorithm we develop is a parallelized form of Riemannian block coordinate descent in which all agents can compute and communicate asynchronously. We assume only "partial asynchrony", namely that all delays in computations and communications obey some finite bound, and we omit the common assumptions of convexity of the objective and compactness of the manifold. Under mild conditions, we prove that agents' iterates drive the Riemannian gradient of the objective to zero, and we derive a rate of convergence for the norm of the gradient. In simulations, we compare to a synchronous baseline algorithm under varying communication delays and numbers of agents. In example problems, we empirically show that our algorithm converges up to 8.5 times faster and attains up to 24 times lower suboptimality over a finite horizon.

comments
19 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.06722 ↗

In this paper, we provide an infinite family of counterexamples to Tokareva's conjecture on sums of two bent functions. The conjecture states that every Boolean function in an even number of variables $n$ of algebraic degree at most $n/2$ can be written as the sum of two bent functions. We show that for every $n=2^k\geq 8$, the symmetric function $F_n=1+σ_2+σ_4+σ_6+\cdots+σ_{n/2}$ has degree $n/2$ and cannot be written as a sum of at most two bent functions. Here $σ_j$ is the elementary symmetric Boolean polynomial of degree $j$. Furthermore, we show that the eight-variable member of this family can be represented as the sum of exactly three bent functions. Using the connection between bent-sum decompositions and derivatives of bent functions, we also obtain an infinite family of balanced Boolean functions that cannot be derivatives of bent functions.

comments
18 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.06744 ↗

The Behrens–Fisher fiducial interval for the difference of two normal means is known from the numerical work of Robinson (1976) to be conservative, but a proof has been lacking. The results here prove that the fiducial interval for any linear combination of $k$ normal means has coverage probability at least its nominal level for all values of the unknown variances. Taraldsen (2026) explains this in more detail using the original data of Behrens (1926). The proof presented in the following rests on a novel plug-in inequality: if a threshold function controls a scaled sum of pivots pointwise in the scale vector, then it also controls the sum with the observed scales plugged in, provided the location errors satisfy a concentration condition formulated through a weighted geometric mean. Independent normal errors satisfy the condition.

fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.06987 ↗

We give necessary and sufficient coefficient conditions for stochastic exponentials driven by multidimensional diffusions to be true martingales. The classical reduction to non-exit of the diffusion with Girsanov-shifted drift separates the analysis into smooth boundary points, infinity, and nonsmooth boundary pieces. On smooth domains, under regularity and non-explosion hypotheses, martingality is equivalent to nonpositivity of the shifted Fichera drift, provided an explicit local condition holds where that drift vanishes and the stochastic integrand is unbounded. At infinity, Feller's test gives exact criteria when a scalar function of the diffusion reduces to a one-dimensional diffusion up to a time change with rate comparable to a positive function of the scalar coordinate. General radial and projection tests supply sufficient conditions. Applications give explicit necessary and sufficient conditions for inverse-CIR and $4/2$ models with correlated factors and singular stochastic integrands, including critical equality cases. The coupled non-affine examples go beyond direct scalar Feller tests and affine Riccati criteria, and exhibit boundary exits not decided by tests at infinity. Further exact criteria cover logarithmic boundary singularities, weighted distances, and an absorbed factor. The martingale conditions also yield uniqueness criteria for associated valuation equations.

comments
Revised literature discussion; added results on uniform integrability and martingality under variable time changes
fields
Probability
pdf ↗ page arXiv:2611.07083 ↗

Selecting the most suitable unmanned aerial vehicle (UAV) to intercept a moving target is challenging when multiple vehicles have different speeds, initial headings, turning capabilities and launch delays, particularly in environments containing obstacles. This paper develops a computationally efficient framework that integrates minimum-time interceptor selection with obstacle-avoiding path planning for heterogeneous UAVs. The interception problem for each UAV is formulated as a minimum-time optimal control problem and solved numerically using an arc-parameterised nonlinear programming model based on Dubins-type paths. The candidate trajectories consist of minimum-radius circular arcs, straight-line segments and tangential obstacle-boundary arcs, with exact geometric distance constraints imposed to ensure obstacle avoidance along the entire path. To improve computational efficiency, a closed-form lower bound on interception time is incorporated into a bound-and-select algorithm that eliminates UAVs unable to improve the best verified feasible interception time. The proposed pruning strategy preserves the best computed interception decision obtained through full enumeration while reducing computational effort. Numerical experiments investigate the effects of target speed, UAV turning radius, launch delay and obstacle configuration. Across 20 randomly generated scenarios involving up to eight UAVs, the proposed approach reduces average computational time by approximately 85$\%$ for eight-vehicle teams without changing the selected interceptor or its computed interception time. The proposed approach provides an efficient method for selecting a single UAV and generating feasible Dubins-type interception trajectories in obstacle-constrained environments.

comments
30 pages and 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.07279 ↗

Nathanson observed that, for four-element sets $A$ of integers, the most frequent sizes of the iterated sumset $hA$ are separated by triangular numbers. Senger proved this and suggested an analogue for larger sets. We establish this pattern for $k$-element subsets of $\{1,\ldots,q\}$, for every fixed $k\geq3$, where $h\geq2$ is either fixed or grows slower than $q^{1/(2k-1)}$. As $q\to\infty$, almost every such set has the largest possible $h$-fold sumset, and almost every exception has one of $h-1$ explicit smaller sizes. The differences between consecutive sizes among these $h$ values are consecutive $(k-2)$-dimensional simplex numbers.

comments
19 pages. Lean 4 formalization included as ancillary files
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.07303 ↗

We give a true $Π^0_1$ sentence $\varphi$ which is independent of Peano Arithmetic. Moreover, if $\widehatφ$ denotes its interpretation on $ω$ as a sentence of set theory, then $\widehatφ$ is a $Π^0_1$ sentence independent of ZFC.

comments
Reference [6] is corrected, also added Remark 2.8
fields
Logic
pdf ↗ page arXiv:2611.07321 ↗

We consider numerical approximations of shallow-water and thin-film flow models with capillary effects. These models lead to third-order differential equations, and we work with an augmented model with second-order derivatives. For a wide class of such models, which includes the classical shallow-water model and thin-film flow models under gravitational force, we develop a fully discrete energy-conserving scheme for both the quadratic and fully nonlinear capillary models. Numerical results show that the proposed scheme is stable and conserves total energy in the absence of dissipative effects.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.07360 ↗

Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra of type $B$ or $C$ over ${\mathbb C}$. Given $κ\in{\mathbb C}$, let $V^κ(\mathfrak{g})$ be the universal affine vertex algebra associated with $\mathfrak{g}$ at level $κ$. We characterize the weights of minimal singular vectors of $V^κ(\mathfrak{g})$ with respect to the generalized Cartan matrix, when $V^κ(\mathfrak{g})$ is not simple and $κ$ is not critical. Furthermore, we determine the corresponding longest Weyl elements in the Kashiwara-Tanisaki character theorem of the singular vectors.

fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2611.07917 ↗

For any $m$ pairwise commuting matrices $\{A_i\}_{i=1}^{m}\subset \M_n(\F)$, we prove $\dim_\F \F[A_1,\cdots, A_m]\leq (2^m-1)(n-1)+1$, answering Bergman's question on the existence of a linear bound for a fixed number $m$.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.08135 ↗

We determine the maximum number of common zeros in projective space of any set of linearly independent homogeneous polynomials of the same degree, when the degree is smaller than the cardinality of the finite field. This proves the conjecture of Beelen, Datta, and Ghorpade, resolving a longstanding problem on common zeros and determining the complete weight hierarchy of the corresponding projective Reed-Muller codes. The proof uses Green's hyperplane restriction bound, combined with a footprint argument that reduces the problem to the affine case solved by Heijnen and Pellikaan. Wei duality then determines the hierarchy in sufficiently large degrees, recovering the complete hierarchy in every degree for the projective plane. Finally, we prove an upper bound valid in every degree, and conjecture that it is always sharp.

fields
Information Theory, Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.08203 ↗

We describe the shifted Lagrangian geometry of curves in Radko surfaces, through their global integrations and their homotopy Poisson algebras. We construct the adjoint symplectic groupoid of the surface explicitly, show that admissible curves integrate to embedded Lagrangian subgroupoids, which are 1-shifted Lagrangians, and characterize when their shifted intersections are clean. For a component of the degeneracy locus, a canonical Hamiltonian flow on its shifted self-intersection recovers the modular period. On the infinitesimal side, the homotopy Poisson algebra of a connected admissible curve not contained in the degeneracy locus is $L_\infty$-isomorphic to its underlying cochain complex, and its $L_\infty$-isomorphism class is determined by the total contact multiplicity. The brackets of arity at least two can be removed by a change of tubular neighbourhood exactly when all contacts are transverse. At tangential contacts, the binary bracket retains the modular vector field. We establish this distinction using a general characterization of the $L_\infty$-isomorphisms induced by changes of tubular neighbourhood, valid for arbitrary coisotropic submanifolds.

fields
Symplectic Geometry, Differential Geometry, Quantum Algebra
pdf ↗ page arXiv:2611.08248 ↗

Two-stage contagion, in which adoption requires two contacts with adopters, combined with population turnover produces bistability and relaxation oscillations, but no chaos, in Katriel's differential equations. From the elementary reactions, without reference to the differential equations, we derive a discrete-time model in which the population is updated in rounds of length $τ$, as in elections, meetings or turns of a game: each individual makes at most one transition per round, events compete as exponential risks, and adoptions take effect from the next round. The model is a Markov chain whose large-population limit is a map $F_τ$; Katriel's equations are recovered as $τ\to0$. Taking the probability $p$ of adoption after a single contact as bifurcation parameter, with rates and round length fixed, $F_τ$ goes from extinction through a window of chaos to a stable equilibrium; for $β/γ=46$, $μ/γ=0.002$, $γτ=5.5$ the computed window is $0.023\le p\le0.056$, bounded by the invasion threshold and by a boundary crisis beyond a subcritical Neimark–Sacker point. One-stage contagion ($p=1$), $p=0$ and permanent adoption showed no chaos in our scans. In all tests the chaotic attractor was unique up to coexistence with simpler attractors, with one positive Lyapunov exponent. In the same window Katriel's equations have a periodic relaxation cycle with troughs of $10^{-44}$--$10^{-164}$: the round structure does not create the oscillation but turns it into chaos and shrinks the oscillatory range in $p$ from $(0.022,0.41)$ to $(0.022,0.056)$. The chaos is thus not an artefact of discretising a stable state, but a property of two-stage contagion with synchronous updating.

comments
24 pages, 11 figures, 8 tables; includes Supplementary Material (6 pages, 6 figures, 4 tables)
fields
Dynamical Systems
pdf ↗ page arXiv:2611.08353 ↗

We prove a logarithmic central limit theorem for a tagged particle in infinite-dimensional Dyson Brownian motion at inverse temperature $β=2$, starting from the sine$_2$ point process. The fluctuation is of order $\sqrt{\log t}$, which is subdiffusive and substantially slower than the polynomial fluctuations of classical short-range interacting particle systems, reflecting the rigidity induced by long-range logarithmic repulsion. We further identify the scaling limit as the singular Gaussian field corresponding to the zero-Hurst parameter, which provides a realisation of the singular Gaussian field as a scaling limit of a tagged particle raised by Dürr, Goldstein and Lebowitz (Comm. Pure Appl. Math. 38 (1985)).

comments
V2: added two references of Dandekar-Krapivsky-Mallick and streamlined minor presentations
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.08365 ↗

We determine the dimension of the space of $\mathfrak{sl}(2)$-invariant (n)-ary differential operators on weighted densities for arbitrary weights, including the singular cases in which the usual elimination procedure breaks down. The proof relies on the strong Lefschetz property established by Stanley \cite{s} and Watanabe \cite{w}. We also investigate the corresponding problem in the super case.

fields
Differential Geometry
pdf ↗ page arXiv:2611.08418 ↗

We establish characterizations of h-dichotomies for noninvertible evolution families acting on Banach spaces, in terms of appropriate notions of expansiveness and uniform noncriticality. Our results extend the corresponding characterizations previously obtained for invertible evolution families. To the best of our knowledge, no such characterizations have previously been established for general noninvertible evolution families. A key difference is that noninvertibility makes the structure of the stable spaces more delicate: in our positive-half-line result, finite codimension must be imposed at every time, rather than only at the initial time. We show by an example that the latter, weaker condition is insufficient. We also study evolution families on the negative half-line, using duality to obtain corresponding characterizations in terms of dual expansiveness and dual uniform noncriticality. General growth rates are treated by a time-rescaling argument.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.08451 ↗

We determine the sharp condition for local superharmonicity of positive singular solutions to the critical polyharmonic equation $(-Δ)^m u=u^{\frac{n+2m}{n-2m}}$, where $m\geq2$ is an integer and $n>2m$. For a solution in a punctured ball with a nonremovable singularity at zero, local superharmonicity holds if and only if \(\liminf_{x\to0}u(x)>0\). The threshold is sharp. In the biharmonic case $m=2$, for every $n\geq5$, we construct smooth positive solutions of $Δ^2u=u^{\frac{n+4}{n-4}}$ in a punctured ball with a nonremovable singularity at $0$, satisfying $\liminf_{x\to0}u(x)=0$ and $\limsup_{x\to0}u(x)=+\infty$, while $-Δu$ converges to a finite negative limit along a fixed ray. The construction relies on an infinite array of concentrating bubbles arranged on concentric polygons, with a Lyapunov–Schmidt reduction controlling their interactions against a vanishing background.

comments
52 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.08984 ↗

We study recurrence, rigidity and uniform rigidity of multipliers on semisimple commutative Banach algebras. For a power-bounded multiplier $T$ on a Tauberian, self-adjoint algebra $\mathfrak{A}$, we show that $T$ satisfies each of these properties if and only if the multiplication operator on $C_0(Δ(\mathfrak{A}))$ induced by the Gelfand transform of $T$ does. One consequence of our analysis is that, if $Δ(\mathfrak{A})$ is $σ$-compact, then recurrence implies rigidity for such multipliers. We examine in detail the multipliers of the Fourier algebra $A(G)$. In particular, we show that recurrence of a multiplier of $A(G)$ is equivalent to recurrence of the corresponding multiplier on $C_0(G)$ when the connected components of $G$ are open. For multipliers that are not power bounded, a flexible construction based on chains of compact subgroups of a locally compact abelian group $G$ produces multipliers of $A(G)$ that are rigid but not uniformly rigid, and multipliers that are recurrent but not rigid, such that in each case the corresponding multiplier on $C_0(G)$ is uniformly rigid. Via the Fourier-Stieltjes transform, these results describe the recurrence and rigidity properties of convolution operators on $L^1(G)$.

fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.09186 ↗

We investigate the mathematical and computational aspects of the logarithmic strain space framework for finite-strain models in nonlinear continuum mechanics, focusing on the classical von Mises elastoplastic model with linear kinematic hardening. To overcome the lack of coercivity and lower-semicontinuity in the quadratic Hencky energy, we introduce higher-gradient regularization and prove the existence of energetic solutions for rate-independent quasistatic evolution under time-dependent Dirichlet loading. Complementarily, we develop a vectorized MATLAB finite-element implementation of the framework leveraging page-wise matrix functions and operations, and our custom vectorization library. Computational benchmarks show that local tensor operations are significantly accelerated, the logarithmic-strain approach does not substantially increase computational costs, and the implementation robustly handles large rotations and deformations.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09492 ↗

Based on the recent breakthroughs by OpenAI and consequently by Binder-Ivrii-Prause-Smirnov, we develop a finite-scale folding method for the nonlinearity of a schlicht function, based on a signed critical-point count for superharmonic potentials and a quantitative target cutoff. Furthermore, we use a cylindrical root transform to reduce the logarithmic cost of access to the point at infinity. Combined with a Littlewood-Paley formula as well as dilation, the method yields the maximal asymptotic variance bound $Σ_{\max}^2\le1$ for the unrestricted schlicht class of normalized univalent functions.

comments
11 pages
fields
Complex Variables, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.09697 ↗

We propose an algorithm for estimating the Cholesky factorization of positive, semi-definite matrices without pivoting. Our method has the same data access pattern as the canonical Cholesky method, and therefore is amenable to familiar hardware optimization techniques. Our method interprets the factorization task as a variational problem and in turn solves it using an induced dynamical system. We study the rate of convergence of this dynamical system to its stationary state for both positive definite and semi-definite matrices. Numerical experiments validate that our method is competitive with pivoted Cholesky on several practical examples.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09706 ↗

Get each issue by email →