Paperlane

no. 11 · from the archive← Fri 6 Nov archive Tue 10 Nov →

Monday, 9 November 2026

566 papers in 32 fields

Optimization and Control32

We introduce structure-aware optimal transport diagnostics for assessing whether empirical time-series dynamics are compatible with a prescribed predictable-drift class. Our approach translates a pathwise property of stochastic processes into a finite-dimensional projection problem over empirical transition laws, encoding admissibility as row-wise moment constraints on local couplings and quantifying deviations via a Kullback–Leibler projection gap $G_{λ,k}$. This yields both a principled diagnostic and a scalable Bregman–Dykstra algorithm that retains the efficiency of Sinkhorn-type methods while incorporating structural constraints. Calibrated against a Brownian reference null, $G_{λ,k}$ separates process classes that are indistinguishable by second-order statistics alone—including fractional Brownian motion and BSS processes sharing identical Hurst indices—without asymptotic resampling or continuous-time recovery. This positions the method as a general tool for structure-aware model validation of sequential data.

comments
10 pages; 3 figures; 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.08505 ↗

Neuronal excitability is a nonlinear phenomenon, and the complexity of spiking experimental traces sometimes looks defeating. The present paper takes the view point that excitability is a neuromodulated property, and aims to demonstrate that the neuromodulation of spiking is amenable to the classical linear analysis tools of control theory. We illustrate the value of linear feedback analysis as an alternative to bifurcation analysis in the simple yet classical example of spiking modulation by the A-type potassium current.

comments
8 pages. Submitted to European Control Conference ECC 2027
fields
Optimization and Control
pdf ↗ page arXiv:2611.08571 ↗

We present branch-extended automatic differentiation (BEAD), a software package that provides information about inactive branches of piecewise-differentiable functions, intended for use in nonsmooth optimization algorithms. BEAD is implemented in Python, building on the popular JAX framework. For supported nonsmooth operations such as abs and max, BEAD identifies alternative branches within tolerance from the given input, and computes gradients of the resulting branches extended to the given input. Such information has been previously used for robust optimization methods, but has required error-prone and tedious manual differentiation, unlike BEAD, which is fully automated for functions written in NumPy-like JAX code. Our experiments show that our approach is as accurate as manually written derivative code, and offers more flexibility in modifying the function and choosing between branch-discovery rules. While we were originally motivated by the manifold sampling algorithm for nonsmooth composite objectives, we also integrate BEAD branch-extension gradients into a nonsmooth BFGS-SQP solver. On two small nonsmooth test problems, the resulting path-aware search resolves failures or substantially reduces the number of evaluations required by the BFGS-SQP solver.

fields
Optimization and Control
pdf ↗ page arXiv:2611.08637 ↗

Multiplayer Federated Learning (MpFL), introduced by Yoon et al. (2025), extends classical federated learning to settings where clients are rational players in a game with individual objectives and strategies, seeking an equilibrium. A natural baseline is Per-Player Local SGD (PEARL-SGD), where each player performs several local SGD steps before exchanging strategies through a central server. However, the original PEARL-SGD formulation does not extend cleanly to compressed communication. Directly compressing the players' strategies can prevent convergence to the equilibrium, even with deterministic gradients. To address this issue, we reformulate PEARL-SGD so that players communicate local strategy increments rather than the strategies themselves. Without compression, the two formulations are equivalent, but with compression, increment sharing preserves exact convergence, allowing us to design the communication-efficient compressed PEARL-SGD (C-PEARL-SGD). Beyond compression, we also consider variance reduction as another axis of improvement, introducing PEARL-SVRG and its compressed variant C-PEARL-SVRG. Under the original MpFL assumptions, we establish convergence guarantees for all variants through a unified parametric inequality. Numerical experiments, including distributed spectrum sensing, demonstrate the practical benefits of our methods over vanilla PEARL-SGD.

fields
Optimization and Control
pdf ↗ page arXiv:2611.08686 ↗

We develop a Fokker–Planck feedback control framework for a stochastic susceptible–infected–recovered–susceptible (SIRS) epidemic model with three intervention mechanisms targeting disease transmission, loss of immunity, and recovery. The interventions are formulated as space- and time-dependent feedback controls that influence both the drift and diffusion coefficients of the underlying stochastic differential equations, allowing control of the probability distribution of epidemic states. We investigate the existence of optimal controls and derive first-order necessary optimality conditions involving a forward Fokker–Planck equation, a backward adjoint equation, and a Hamiltonian minimization condition. For numerical approximation, we combine a Chang–Cooper discretization of the diagonal drift–diffusion terms with a finite-difference treatment of cross-diffusion and a sequential quadratic Hamiltonian (SQH) algorithm for computing the optimal feedback policies. We also examine sufficient-decrease and convergence properties of the SQH iteration. Numerical experiments consider four epidemiological objectives involving cumulative infection burden, infection-threshold exceedance, terminal susceptible population, and a combination of running and terminal costs. The resulting feedback policies exhibit distinct spatial and temporal structures depending on the epidemiological objective. Monte Carlo simulations of the underlying stochastic system illustrate that the optimized interventions can substantially reduce infection growth and undesirable epidemic outcomes relative to uncontrolled dynamics. The proposed framework provides a distribution-based approach to stochastic epidemic control that integrates mathematical analysis, numerical optimization, and state-dependent intervention design.

fields
Optimization and Control
pdf ↗ page arXiv:2611.08708 ↗

Nonconvex constrained optimization problems are commonly solved by a Newton method for necessary conditions (sequential linear/quadratic programming) or a barrier reformulation (interior-point methods). We present a vector Lyapunov analysis for Newton-type algorithms based on constraint violation and optimality of the primal solutions to a sequence of approximate optimization problems. We thus prove local stability and convergence by constructing a strict Lyapunov function for the primal solution.

comments
Extended version of submission to the 2027 European Control Conference
fields
Optimization and Control
pdf ↗ page arXiv:2611.08729 ↗

Can a network look stable at every layer and still be exponentially unstable as a whole? The Lipschitz constant of a neural network is a basic stability quantity appearing in optimization guarantees, generalization bounds, and robustness certificates. Deep networks naturally admit two such notions, input Lipschitzness, measuring sensitivity to data perturbations, and parameter Lipschitzness, measuring sensitivity to weight perturbations. We prove that, for deep networks with normalization layers, with batch normalization as the canonical example, both Lipschitz constants can grow exponentially with depth and hence with parameter dimension, even under strong per-layer norm control such as $\|W_\ell\|_2\le 1$, and already for linear activations. Thus, a mechanism widely used to stabilize training can create severe worst-case instabilities that are invisible locally, i.e., from layerwise norm bounds alone. Parameter-Lipschitz explosion turns Lipschitz-dependent nonsmooth optimization guarantees into exponential-in-dimension bounds for deep normalized networks, while input-Lipschitz explosion makes worst-case Lipschitz-based generalization and robustness certificates vacuous. The latter also yields a concrete rank-separation mechanism for adversarial vulnerability. The theory predicts that perturbations introducing new singular directions should be amplified much more strongly than perturbations at the same noise level that remain within the input's original singular subspace. Experiments on MNIST, Fashion-MNIST, and CIFAR-10 support this prediction, showing that rank-creating perturbations cause substantially sharper drops in accuracy, confidence, and margins than same-subspace perturbations.

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

Single-cell RNA and ATAC data collected across developmental stages provide time-course snapshots of transcriptional and regulatory states. Since sequencing is destructive, trajectories between these snapshots must be inferred from independently sampled cell populations. Existing approaches typically infer continuous dynamics in a single modality or integrate RNA and ATAC in a shared representation. Here we present Cross-Omics Aligned Trajectory Inference (COATI), which extends unbalanced synchronized dynamical optimal transport to time-dependent cross-modal maps for reconstructing coupled trajectories in distinct RNA and ATAC state spaces. We evaluated COATI on synthetic benchmarks and four developmental datasets using held-out-stage reconstruction and lineage analyses. COATI improved reconstruction of cell populations at held-out stages, including recovery of chromatin-state heterogeneity within cell types, and better preserved developmental lineage relationships. The unbalanced formulation allows the inference of population mass changes, which were shown to associate with DNA-replication programs at early stages and lineage-maturation programs later in development. The coupled trajectories enabled analysis of lineage-specific transcriptional and chromatin changes and their temporal relationships during development. Lineage responses inferred by COATI agreed with independent CRISPR perturbation results, and the inferred regulatory patterns were consistent with independent epigenetic data.

fields
Optimization and Control
pdf ↗ page arXiv:2611.08853 ↗

Interconnecting large data centers can be delayed by grid requirements on demand flexibility, ramping limits, and ride-through performance. This paper proposes an optimization-based framework to size a Battery Energy Storage System (BESS) that accelerates data center grid integration by providing BESS capacity required to meet selected flexibility and grid-support requirements. The model co-optimizes BESS power rating and energy capacity while allocating capability across three services: (i) demand response over a specified duration, (ii) mitigation of high-magnitude, high-frequency load fluctuations through reserved active power with zero net state-of-charge change, and (iii) voltage support via reactive power capability at the point of common coupling. Minute-level operational scheduling enforces state-of-charge feasibility and load ramp constraints, and incorporates a controllable queue of delay-insensitive computing tasks to enhance flexibility. A case study using a real data center load profile demonstrates the proposed method and quantifies the BESS power-energy requirements and operational trade-offs needed to satisfy the multi-service constraints, providing practical guidance for interconnection planning and deployment.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09001 ↗

Sellers must price substitutable products while meeting operational requirements such as price limits and sales targets. Nested logit captures stronger substitution among similar products, but these requirements can undermine the structure used to solve unconstrained pricing problems. We develop an exact reformulation and a global optimization method for a fixed assortment with price bounds and weighted price caps. The key novelty is to concentrate the difficult interactions at the nest level while retaining convex optimization over individual products, without discretizing prices or approximating demand. This structure makes the number of nests, rather than products, govern the exponent in a conditional worst-case complexity bound. The method returns feasible prices together with a bound on how much profit could still be gained, allowing decision makers to assess solution quality even when computation stops early. Extensions cover purchase-probability bounds and price-order rules, with explicit accounts of their computational cost. In synthetic experiments, the method certifies solutions for assortments of up to 500 products with few nests. Projecting unconstrained prices onto the feasible set loses up to 32.60% of profit relative to direct constrained optimization, highlighting the value of jointly optimizing substitution and feasibility.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09023 ↗

We study the minimum squared resolvent diagonal among Jacobi matrices with prescribed eigenvalues. For the zeros of $P_n^{(α,β)}$, we construct a canonical realization and bound its asymptotic cost against the optimum. Its rescaled inverse converges to the Green operator of a reflection-symmetric singular Schrödinger operator with Bessel-zero spectrum. A Green-coordinate identity places this construction and all finite realizations in the same density framework. Mass-constrained spectral problems then give computable lower bounds. The bounds meet at $α=1/2$, with optimal energy $2/15$, and have first-order contact with derivative $-13/75$. We classify the constrained extremal profiles and the three endpoint geometries of the canonical density. Two polynomial families with the same limiting edge spectrum have different limiting optimal energies. For Nesterov momentum $(s-1)/(s+1)$, the optimal leading endpoint Hessian-drift gain among nonnegative-link Jacobi realizations is $\sqrt{2}$ times the original gain. An explicit isospectral flow strictly improves the standard one-sided realization for $α>-1/2$, $α\ne1/2$.

comments
56 pages, 2 figures, link to Lean formalization
fields
Optimization and Control, Spectral Theory
pdf ↗ page arXiv:2611.09050 ↗

Generalized Nash equilibrium (GNE) problems model self-interested agents coupled through their costs and shared constraints, and arise throughout control applications that allocate a scarce common resource. Such problems typically admit a continuum of equilibria, so any implementation must \emph{select} one. This selection is not neutral: it decides how the cost of the shared constraint is distributed among the agents, a decision often expected to be fair. The variational GNE (v-GNE), which charges all agents a uniform shadow price, is the conventional choice and is frequently advocated as fair. Through the lens of \emph{comparability} from social choice theory, we show that the GNE set itself requires no inter-agent comparability of costs, whereas the v-GNE implicitly assumes cardinal unit comparability, one of the stronger notions. We then introduce the fair GNE (f-GNE), which selects an equilibrium by explicitly optimizing a fairness metric matched to the comparability at hand, and give constructive routes to compute it for single-constraint and linear-quadratic games. An electric-vehicle charging game serves as a running example throughout this self-contained tutorial.

comments
Book chapter, 25 pages, 4 figures. To appear in Socio-Inspired and Socially Aware Control for Complex Systems, Springer
fields
Optimization and Control
pdf ↗ page arXiv:2611.09060 ↗

Exponential cone optimization has received considerable attention in the modern literature, but studies involving nonlinear objective and constraint functions are still limited. This work can be seen as one of the first steps toward understanding nonlinear exponential cone optimization (NECO) problems. Here, we ask the question "Can smooth equality constraints replace nonlinear exponential cone constraints?". From a practical point of view, even squared slack reformulations in nonlinear programming introduce difficulties. However, such reformulations can be useful for studying optimality conditions. Motivated by this observation, in this work, we use a smooth surjective parameterization of the exponential cone to reformulate NECO as an equality-constrained nonlinear program (RNLP). We then analyze Karush-Kuhn-Tucker (KKT) and second-order optimality conditions for NECO through RNLP. Although feasibility is represented exactly, the KKT conditions for RNLP do not in general guarantee those for NECO. We characterize this correspondence through multiplier restrictions that are equivalent to a second-order condition involving only slack variables. We also establish an exact curvature identity showing that RNLP reproduces the sigma term of NECO without additional assumptions. Finally, we prove the relationships between second-order necessary and sufficient conditions for the two problems. We identify when RNLP can be used to rule out local minimizers of NECO or establish strict local optimality for NECO without explicitly evaluating the sigma term.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09108 ↗

In this paper, we investigate second-order necessary and sufficient optimality conditions for a class of $C^{1,1}$ sparsity constrained optimization problems via a disjunctive programming approach. More precisely, by utilizing the limiting/Mordukhovich second-order subdifferential of the associated Lagrangian function, we establish new second-order necessary and sufficient optimality conditions for local optimal solutions. These results are derived under mild assumptions and extend several existing results in the literature. In addition, we apply our theoretical developments to sparse multiobjective optimization problems and derive second-order optimality conditions for efficient solutions.

comments
25 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.09146 ↗

How large can the multiplier step be in the classical two-block alternating direction method of multipliers (ADMM)? We keep the penalty fixed and use the usual primal updates. We consider finite-dimensional problems with closed proper convex objectives. We assume that a Karush-Kuhn-Tucker point exists and that each block subproblem attains its minimum at every step. Under these assumptions, the constraint images and the multiplier converge for a range of factors that extends beyond the golden ratio. The constraint matrices may be rank deficient. For larger steps, we construct two fixed compact polytopes and give an explicit threshold below two. The polytopes admit an infeasible periodic orbit for every factor at or above this threshold. At that threshold, ADMM can cycle even for smooth strongly convex objectives. This gives a negative answer to Glowinski's question about the full interval from zero to two. A different pair of piecewise-quadratic objectives gives geometrically growing residuals. For the general convex class, we locate the endpoint of the uniform convergence interval near 1.88688256. A convergence certificate on the unit circle gives the lower bound, while a separate periodic orbit gives the upper bound. Exact arithmetic verifies that the two bounds differ by less than 0.000000174.

comments
24 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.09169 ↗

Model predictive control (MPC) of nonlinear systems with discrete decisions leads to mixed-integer nonlinear programs (MINLPs) whose combinatorial complexity often prevents real-time deployment. In this paper, we propose a decomposition-based MPC method that reorders and reduces computations to shorten the delay between receiving a state measurement and applying the control input. Before the measurement arrives, we solve a continuous relaxation of the MINLP at a predicted state and construct a mixed-integer quadratic program (MIQP). Once the measured state is available, we solve the MIQP that reconstructs the discrete controls and simultaneously performs one sequential quadratic programming step toward the corresponding nonlinear solution. To reduce the combinatorial complexity in the horizon length, we either fix the integer controls or relax their integrality over the prediction horizon tail, while retaining an integer-feasible first control input. We derive error bounds relating the nonlinear objective values obtained with the horizon-tail approximations to the optimal value of the original mixed-integer problem. In a data center cooling example, the proposed method reduces mean feedback computation time by 94% relative to a state-of-the-art MINLP method with a total closed-loop cost difference of less than 1%.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09187 ↗

We consider nonlinear systems whose measured output is the product of an unknown matrix and a known saturation function of the unmeasured state. Generating excitation that allows the matrix to be recovered from the output is challenging when the dynamics are largely unknown. We exploit saturation to construct this excitation. Under a geometric accessibility condition, we derive explicit open-loop controls that drive the state into regions where the saturation takes prescribed values. For componentwise saturations, this condition holds generically with as few as two independent control directions. The controls require no state measurement and only partial knowledge of the dynamics, with no information on the structure of its nonlinear part. The resulting regressor is known in advance, and the unknown matrix is recovered exactly by a closed-form regression. Under stronger structural assumptions and with sufficiently many independent outputs, an output feedback tracks prescribed reference trajectories within the unsaturated region to arbitrary accuracy and permits exact state recovery. Suitably chosen references then also enable exact identification of linearly parameterized (nonlinear) dynamics. We analyze robustness to measurement noise and illustrate the method numerically in the presence of both measurement and dynamical noise.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09188 ↗

Estimating the state of a dynamical system from observations is a crucial task in robotics and control. Despite their empirical success, recurrent models often lack formal guarantees on convergence and robustness. We bridge this gap by analyzing these architectures from the perspective of nonlinear observer theory. By framing RNNs as a time-discretization of continuous latent dynamical systems (Neural ODEs), we demonstrate that enforcing a contraction condition on the latent flow guarantees the existence of a smooth, injective map of the true physical state into the latent space. We prove that this architecture acts as a tunable observer: by increasing a single scalar gain that scales the latent vector field, the estimation error can be driven to an arbitrarily small neighborhood of zero at an exponentially fast rate. We further establish quantitative bounds on the MLP complexity required to decode this latent state, and extend our formal guarantees to the discrete-time residual RNN implementation. We validate the theory on a real mobile robotic task, where a provably contracting model outperforms a vanilla GRU with substantially more stable training. We also report that unconstrained GRUs converge to contracting dynamics on this task, suggesting that contraction is an emergent property of well-trained sequence models.

journal
40th Conference on Neural Information Processing Systems (NeurIPS 2026), Neural Information Processing Systems Foundation, Dec 2026, Paris, France
fields
Optimization and Control
pdf ↗ page arXiv:2611.09217 ↗

This paper proposes a novel controller for a double-integrator agent to track a moving target with bounded velocity on a hyperboloid $\mathbb{H}^n$. The control law uses the intrinsic Riemannian structure of the hyperboloid, including the logarithm map, covariant derivative, and parallel transport, to make all its terms coordinate-free. Such formulation eases the implementation of the proposed tracking controller in the ambient Minkowski space without doing any additional chart computations. We use Barbalat's lemma for the hyperboloid to establish the convergence proof. Later, the proposed tracking controller is extended to a leader-follower formation control, where each agent reaches at a desired position around a moving leader in $\mathbb{H}^n$. We validate the results with numerical simulations considering two different target trajectories, geodesic and spiral, as examples.

comments
7 pages, 10 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.09261 ↗

For linear continuous-time systems, we solve the signal temporal logic (STL) control problem by translating it from continuous to discrete time such that a solution to the discrete-time problem guarantees a solution to the original continuous-time one. We split control synthesis into three hierarchical tasks. First, we discretize the continuous-time STL formula into a discrete-time one by sampling the temporal behavior it specifies. We accordingly discretize the continuous-time system by constructing a discrete-time model such that the input-state trajectories of the continuous-time system can be characterized as piecewise polynomial interpolations of the input-state trajectories of the discrete-time model. Second, we exploit this characterization to formulate mixed-integer linear constraints on the discrete-time trajectories that allow for planning a trajectory whose piecewise polynomial interpolation satisfies the continuous-time STL formula. In fact, system discretization and trajectory planning are performed in such a manner that any feasible solution to these constraints gives a discrete-time trajectory that can be transformed into a continuous-time one guaranteed to satisfy the original STL formula. Third, we propose a step-by-step algorithm to construct the control input that realizes such continuous-time trajectory.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09283 ↗

The paper introduces PH-Symb, a novel symbolic structure-preserving identification method, that combines Kolmogorov Arnold networks and sparse regression to build explicit port-Hamiltonian (pH) models from data. Unlike other Machine Learning or neural pH approaches, PH-Symb recovers physically interpretable and explicit-symbolic components and enforces pH structure by construction. It also introduces a new normalization method that preserves the pH structure. It allows handling both identification from input-state-output (ISO) data and input-output (IO) data, and applications show it delivers interpretable models and lower errors than neural baselines on synthetic and real-world systems.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09334 ↗

In parametric linear optimization problems, the objective function or the feasible set depends linearly on one or several real-valued parameters. The goal is to provide an optimal solution set, i.e., a set containing an optimal solution for each non-parametric problem induced by a particular choice of parameter values. In this paper, we consider right-hand-side single-parametric linear programming problems (RHS-PLPPs) that are usually very difficult to solve exactly. An optimal solution set of minimum cardinality can be infinite, while a representation by optimal bases may still require super-polynomially many different bases. Hence, we develop approximation methods for RHS-PLPPs that compute approximation sets of polynomially bounded cardinality, each containing, for every parameter value, a feasible solution whose objective value is at most a prescribed multiplicative factor times the optimum. Our first approach constructs an approximation set using a greedy staircase procedure and yields an FPTAS under general sufficient conditions. We show that these conditions hold for some important classes of RHS-PLPPs. For monotone instances, in which the feasible sets are nested as the parameter varies, our algorithm yields an approximation set of minimum cardinality. Beyond monotonicity, we establish near-minimum cardinality guarantees under more general sufficient conditions. Finally, we introduce a dual approximation algorithm that returns solutions with objective value no greater than the optimum while allowing a controlled multiplicative violation of the parameter-dependent right-hand sides.

comments
This research was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - Project number 508981269, and GRK 2982, 516090167 "Mathematics of Interdisciplinary Multiobjective Optimization"
fields
Optimization and Control
pdf ↗ page arXiv:2611.09378 ↗

The traveling salesman problem (TSP) asks for a minimum-length Hamiltonian cycle in a complete weighted graph. Its approximability depends on the edge lengths: unrestricted instances admit no constant-factor approximation unless $\mathrm{P}=\mathrm{NP}$, metric instances admit Christofides' $3/2$-approximation, and fixed-dimensional Euclidean instances admit a PTAS. We study $β$-TSP, where the edge lengths satisfy $ \ell_{uw}\leqβ(\ell_{uv}+\ell_{vw}) \qquad \forall\,u,v,w\in V\ \text{pairwise distinct}, \quad β\in\left[\tfrac{1}{2},1\right]. $ The condition arises naturally in various settings, for example, when metric travel times are combined with positive service times at the vertices. The previous best approximation algorithm, due to Böckenhauer et al., ranges from $1$ at $β=1/2$ to $3/2$ as $β$ approaches $1$. We obtain a strictly better guarantee for every $1/2<β<1$ by combining two simple constructions whose guarantees counterbalance each other. We also improve the best known approximation hardness bound for every $1/2<β<1$.

comments
12 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.09421 ↗

We present a data-driven representation of the finite-horizon behavior of deterministic controllable continuous-time LTI systems. We first introduce a notion of persistency of excitation for continuous-time signals that does not require the signal to be differentiable. We then show that, when the input is persistently exciting in this sense, the closure of the range of a Hankel integral operator built from a single input-output trajectory equals the behavior of the system over a finite time horizon. This result provides a nonparametric representation of system trajectories directly in terms of measured data, without requiring an explicit parametric model of the system.

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

This paper was generated by an AI model (Claude Opus 5.5, Anthropic) under the author's direction; all results come from computations run on the author's machine, and every reference was checked. Weight-space programming (WSP) is the idea that a large language model (LLM) can write the weights of a small neural network directly, guided only by reading forward-pass outputs, with no gradient training. We test whether WSP can improve exact operations research algorithms where they rely on cheap scoring rules. In four studies, an LLM wrote small multilayer perceptrons that (i) select arcs, labels and ng-neighbourhoods inside column generation for the vehicle routing problem with time windows, and (ii) choose branching variables in SCIP's branch-and-bound. The algorithms stay exact whatever the weights; a bad network only costs time. In column generation, no lever gave a material gain. In branching on synthetic classes, a hand-written network solved independent-set instances in 0.37x the time of SCIP's default rule (18 paired instances, Wilcoxon $p<10^{-5}$) and matched or beat networks trained by imitation of strong branching, but on 39 MIPLIB 2017 instances it solved 19 versus 24. In an application built from the real GTFS feed of Atlanta's transit agency (MARTA), a crew scheduling set-partitioning model solved by a native C plugin with SCIP's factory settings, the LLM-written rules took 0.63x the default's time on 32 held-out instances ($p<10^{-4}$), but SCIP's plain pseudocost rule did exactly as well (ratio 0.99, $p=0.19$). In these settings, the gains came from being cheap, not from what the LLM wrote. All code, logs and the numbers behind every figure are released.

comments
17 pages, 13 figures, 2 tables. Text, figures, code and analysis generated by Claude Opus 5.5 (Anthropic) under the author's direction; all experiments run locally. Code, logs and data: https://github.com/butkeraites/llm-written-weights-or . Also posted on Optimization Online
fields
Optimization and Control
pdf ↗ page arXiv:2611.09559 ↗

Decision-focused learning trains prediction models to improve downstream decisions, but many methods require costly solver calls or optimal-solution labels. We propose a solver-free decision-focused learning framework for NP-hard edge-selection problems with uncertain parameters in the objective, the constraints, or both. A neural optimization layer is first trained without solution labels, using problem objectives and constraint penalties. Graph-informed edge scoring and iterative refinement encourage concentrated and structurally consistent continuous decisions. The layer is then frozen, and a prediction model is trained through its continuous output using a problem-specific loss evaluated under observed parameters. At deployment, the predictor, optimization layer, and a lightweight decoder produce decisions without solving the original NP-hard problem. Experiments on the asymmetric traveling salesperson and endpoint-free orienteering problems show consistently better decision quality than prediction-focused learning and improvements over most evaluated decision-focused baselines. Our framework requires less training time than the evaluated decision-focused baselines, even when optimization-layer pretraining is included. Neural deployment also produces decisions faster than solver-based deployment, offering a better quality-efficiency trade-off. The layer also reduces training cost in existing decision-focused methods when used as an approximate optimization oracle.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09560 ↗

We introduce a notion of intrinsic differentiability for functionals on the space of finite nonnegative measures equipped with the Wasserstein–Fisher–Rao (WFR) distance, also known as the Hellinger–Kantorovich (HK) distance. The resulting static first-order calculus accounts simultaneously for spatial transport and mass reweighting. We characterize regular barycentric logarithms through optimal semicouplings and measurable selections at the transport threshold, and prove their tangency at arbitrary finite source measures. The defining expansion extends to non-optimal semicouplings, with remainder of smaller order than the square root of their cost. This yields differentiation formulas for simultaneous transport and reweighting and uniqueness of the gradients. We also give a sufficient criterion in terms of regular flat derivatives. We characterize differentiability of one half the squared WFR distance by a common optimal Monge transport–growth representation with no target mass created from the cone vertex. Equivalently, the regular barycentric logarithm is unique and its norm equals the distance; the gradient is minus this logarithm. Finally, we formulate the corresponding calculus on probability measures. On $\mathcal{P}_2(\mathbb{R}^d)$, WFR differentiability implies intrinsic Wasserstein differentiability, with the transport component of the WFR gradient coinciding with the Wasserstein gradient. Whenever a flat derivative exists, one quarter of the reaction component agrees almost everywhere with its centered representative. As a byproduct we obtain a Wasserstein differentiability result for the squared $\mathrm{WFR}$ distance.

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

For a rank-$r$ matrix $A\in\mathbb{R}^{m\times n}$, ah-symmetric reflexive generalized inverses $H$ with few nonzero rows give least-squares solutions that are fast to evaluate and use few variables. A known determinant-based local search finds one with exactly $r$ nonzero rows and 2,1-norm within an essentially tight factor $r$ of the minimum at an exact local optimum. We let the nonzero rows of $H$ lie in a set $K$ of $k\ge r$ indices and study how to choose $K$. We bound the loss of this restriction (restricted over unrestricted minimum 2,1-norm) by a simple geometric certificate and establish that a local search maximizing the squared rank-$r$ volume of the corresponding columns of $A$ gives loss at most $\sqrt{k(r+εk)/(k-r+1)}$, where $1+ε$ is the swap tolerance. With $ε=0$ this is $r$ at $k=r$ and less than $\sqrt{2r}$ for $k\ge2r$; with $ε=1/k$ the search runs in polynomial time on rational data. The same support yields an ah-symmetric reflexive generalized inverse with spectral norm within a factor $\sqrt{1+(n-k)(r+εk)/(k-r+1)}$ of that of the Moore-Penrose pseudoinverse. The loss guarantees hold for every norm on the rows. In general, our certificate bound is tight up to a factor depending only on $k/r$, and on some instances, for a suitable row norm, so is the loss bound; for the 2,1-norm, however, the certificate can overestimate the loss by a factor $\sqrt r$. The local search is the Fedorov exchange algorithm of 0/1 D-optimal design; this yields a fast implementation and, via the Kiefer-Wolfowitz theorem, supports of at most $r(r+1)/2+1$ rows with certificate at most $\sqrt r$, best possible in general. On instances from earlier work, the observed loss is far below the guarantee, and the method matches two ADMM heuristics when few rows are removed and otherwise gives 2,1-norms up to 27% smaller, one to two orders of magnitude faster.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09719 ↗

We propose a fixed-point acceleration method for optimization over probability measures, applicable to a variety of machine learning problems. We represent probability measures as pushforwards of a reference distribution through a neural network map and equip the parameter space with the induced pullback Wasserstein metric. This geometric structure allows natural gradient descent to be interpreted as a fixed-point iteration on a Riemannian manifold. We accelerate this iteration using Riemannian Anderson mixing method, which exploits historical residuals to capture approximate second-order information without forming Hessians. In the present parametric setting, the manifold is represented by Euclidean coordinates endowed with a point-dependent metric, simplifying retraction and vector transport. We evaluate the method on multimodal sampling, PDE-based inverse problems, aggregation dynamics, Bayesian logistic regression, and generative modeling. Across the tested tasks, Anderson mixing reduces the number of natural-gradient iterations and achieves competitive performance relative to SGD and Adam in terms of both loss-gradient evaluations and wall-clock time. These results suggest that fixed-point acceleration is an efficient tool for improving the computational efficiency of training on parametric Wasserstein methods.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09723 ↗

We study the linear multidimensional Fornasini–Marchesini recurrence with uniformly bounded boundary data prescribed on the open coordinate faces. Attractivity is understood in the sense of Pringsheim convergence, in which all discrete indices tend to infinity. We establish that attractivity alone implies Lyapunov stability, and consequently is equivalent to asymptotic stability, for an arbitrary number of discrete directions. Our proof combines inheritance of attractivity by lower-dimensional subsystems, a Baire-category uniform boundedness argument, and word-sum estimates to control coordinate slabs outside the Pringsheim tail. We use a generalized spectral stability criterion proved in a separate companion preprint, without reproving that criterion here. We also obtain a uniform exponential interior estimate and contrast our boundary/convergence convention with an earlier two-dimensional attractivity theorem.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09750 ↗

We study a class of Cucker-Smale-type systems with a binary interaction potential subject to an external control input. We apply an instantaneous rolling horizon control (IRHC) feedback to address two different control problems: full set-point stabilization of a spatial configuration with zero velocity and stabilization of the center of mass at a desired position with zero mean velocity using a single external agent. The IRHC feedback has been shown to preserve the port-Hamiltonian structure of the corresponding open-loop systems. We analyze how the control parameters and the time discretization affect convergence rates and oscillation frequencies and compare the IRHC feedback with the corresponding IDA-PBC feedback obtained by omitting an additional correction term. For the reduced center of mass dynamics, we derive explicit predictions for continuous- and discrete-time spectral decay rates and oscillation frequencies and verify these predictions numerically. For the full nonlinear particle system, the controller comparison is done by numerical experiments.

fields
Optimization and Control
pdf ↗ page arXiv:2611.09838 ↗

This paper presents a deterministic geometric procedure for analysing affine constraints over fixed ellipsoidal regions, motivated by chance-constrained set approximation. Analytical tests classify inequalities as always violated, never violated, or cutting. Pairwise tests determine whether two inequalities can be strictly violated at a common point, yielding a compatibility matrix. The tests follow from quadratic optimisation and the Karush–Kuhn–Tucker conditions, with explicit treatment of tangencies, parallel normals, and degenerate inequalities. The formulation applies in arbitrary finite dimensions and provides geometric information for subsequent bounds on simultaneous sampled violations and safe-region approximation.

comments
6 pages, 1 figure
fields
Optimization and Control
pdf ↗ page arXiv:2611.09860 ↗

Analysis of PDEs31

The following equation is considered: $$-Δ_p u(\boldsymbol{x}) + Δ_q u(\boldsymbol{x}) = f\big(\boldsymbol{x}, u(\boldsymbol{x})\big)\text{ for } \boldsymbol{x} \in Ω, \qquad u(\boldsymbol{x}) = 0 \text{ for } \boldsymbol{x}\in \partial Ω.$$ We start by showing that the energy functional associated with the considered problem no longer has the properties typical of its non-competing counterpart, which prevents a direct application of standard variational and monotonicity methods. Using Ekeland's variational principle combined with properties imposed on the nonlinear term~$f$, we prove the existence of a nonzero generalized solution to the problem. It is also shown that in the one-dimensional case $Ω= (-1,1)$, assuming that $f$ satisfies the symmetry conditions $$f(x,u) = f(-x,u) = -f(x,-u),$$ together with the sign condition $f(x,u) \geq 0$ for $u \geq 0$ and an appropriate growth bound on $f$, a convex relaxation of the action functional yields the existence of a positive weak solution. Furthermore, we prove that in this setting, and under a slightly stronger sign condition $$f(x,u) > 0\text{ for }u > 0,$$ all global minimizers of the action functional do not vanish in $(-1,1)$ but fail to be of class $C^1$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.08624 ↗

We study autonomous elliptic systems with Uhlenbeck structure of the form \[ -\operatorname{div}\big(\mathfrak a(|Du|)Du\big)=0 \quad \text{in }\ Ω\subset \mathbb R^n \] Under two-sided quantitative $(p,q)$-growth conditions on $\mathfrak a$, we prove gradient Hölder continuity with constants and exponent depending only on the dimensions, $p$ and $q$. This improves the classical theory initiated by Uhlenbeck by removing the continuity requirement on $\mathfrak a'$. The proof uses nonlinear comparison systems whose regularity follows from a scalar uniformly elliptic equation. Under weaker $(p,q)$-growth conditions on the convex function $\varphi(t):=\int_0^t s\mathfrak a(s)\,ds$, we obtain local $W^{1,s}$-regularity for every $s>1$, and hence Hölder continuity of solutions with every exponent less than one. An additional lower growth condition on $\mathfrak a$ yields local Lipschitz continuity, even when $\mathfrak a$ is discontinuous.

comments
36pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.08635 ↗

We consider the nonlinear Hardy-Hénon parabolic equation $ u_t=Δu+|x|^l|u|^αu,$ $t>0,$ $x\in\mathbb{R}^N$ or $x\in\mathbb{R}^N\setminus\{0\}$, with $N\ge1$, $l>-\min\{2,N\}$, $α>0$, with nonnegative initial datum $u_0$. We first establish new criteria for finite-time blow-up. We then derive optimal upper bounds for the life-span $T_{\max}(λ\varphi)$ of solutions arising from the initial datum $u_0=λ\varphi$. These estimates establish a precise dependence of $T_{\max}(λ\varphi)$ on both the initial profile $\varphi$ and the parameter $λ$ in the small and large-amplitude regimes.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.08662 ↗

Several examples of one-homogeneous classical solutions to the one-phase free boundary problem with an isolated free boundary singularity are known. Adapting the approach of Caffarelli, Hardt, and Simon for minimal surfaces, we construct non-conical classical solutions with an isolated free boundary singularity by perturbing a one-homogeneous solution $U$. Moreover, if $U$ is strictly stable (respectively, non-degenerate), then any solution sufficiently close to $U$ is also strictly stable (respectively, non-degenerate).

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

Alt and Caffarelli proved an Allard-type $ε$-regularity theorem near the flat one-homogeneous minimizer of the one-phase free boundary problem. A natural follow-up question is whether an analogous regularity result holds near singular minimizing cones. In this paper, we prove such an $ε$-regularity theorem near a strongly integrable one-phase minimizing cone with an isolated singularity. More precisely, we show that, after a suitable translation and rotation, the free boundary of any non-degenerate weak solution sufficiently close to the cone is graphical over the free boundary of a leaf of the De Silva–Jerison–Shahgholian foliation. This result is analogous to recent $ε$-regularity theorems in minimal surface theory by Edelen and by Edelen–Spolaor; our proof adapts the strategy of Edelen to the one-phase setting.

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

In the present paper, our primary focus is on the Boussinesq equations with fractional velocity dissipation $Λ^αu$ and temperature diffusion $Λ^βθ$. On the critical balance line $α+β=1$, establishing global regularity for weak velocity dissipation has been obstructed by the quadratic convective-buoyancy feedback, and all available results below $α=\frac{10}{13}$ require a smallness assumption on the initial temperature. In this paper, we prove large-data global regularity across the extended regime $α>\frac{\sqrt{57}-5}{4} \approx 0.637$. This provides a step beyond the previous barrier $α=\frac{10}{13}$, unconditionally dismantling the temperature smallness assumption that has persisted in the literature for over a decade. The mathematical mechanism relies on a high-order Quadratic Normal Form transformation $H=ω-R_αθ-\Bop(θ,θ)$ tailored to eliminate non-resonant quadratic vorticity-temperature interactions. Crucially, by uncovering the exact physical scalings of the underlying multilinear commutators and maintaining sharp fractional conjugates in the $L^m$-energy framework, we ensure that the global energy closure is governed entirely by the quadratic thermal dissipation. Once an integrability threshold $m>\frac{2}α$ is attained, a fine Littlewood-Paley transport estimate drives a fractional regularity gain $H \in B_{r,\infty}^{3α-2}$, ensuring the velocity field achieves critical drift regularity $C^α$. By Silvestre-type drift regularization, this spontaneously generates positive Hölder continuity for the temperature, which in turn elevates the drift regularity strictly beyond the critical threshold, unlocking non-local Schauder estimates to prevent finite-time singularity formation.

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

We prove fractional geometric rigidity estimates and fractional Korn's first inequalities with general singular weights in bounded uniform domains in $\mathbb R^n.$ The classical choice of the energy well $SO(n)$ for the geometric rigidity estimate fails due to the lack of a notion of orientation for Lebesgue fields. The remedy is to choose $O(n)$ as the energy well. Due to the recently developed theory of local-to-nonlocal passage of rigidity estimates developed by the first author, both estimates reduce to the analogous local estimates on the cube, which we prove in several steps by compactness and linearization arguments.

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

We determine the sharp condition for local superharmonicity of positive singular solutions to the critical polyharmonic equation $(-Δ)^m u=u^{(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^{(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 the sharp constant $C(p,γ)$ in Maz'ya's planar weighted inequality \[ \int_{\mathbb{R}^2}|\nablaψ|^p|x|^{p(γ-1)}\, \mathrm{d} x \le C(p,γ)\int_{\mathbb{R}^2}|D^2ψ|_{\mathrm{F}}^p|x|^{pγ}\, \mathrm{d} x, \] where $|\cdot|_{\mathrm{F}}$ denotes the Frobenius norm. For every fixed $1\le p<\infty$, with $a=γ-1+2/p$, we prove \[ C(p,γ)^{-1}=2^{p/2}|a|^p+O_p(|a|^{p+1})\qquad(a\to0). \] The leading term comes from the first angular harmonics after the Emden–Fowler transform. We also determine explicit exterior parameter rays on which the unrestricted constant equals the radial value $(1+a^2)^{-p/2}$. The proof uses an entropy identity and a homogeneous calibration. In the remaining transition region, we obtain symmetry-breaking intervals and a necessary and sufficient condition for nonnegativity of the periodic second variation at the radial state. An explicit example shows that global symmetry breaking can occur even when this second variation is nonnegative.

comments
25 pages; submitted to a journal on 16 September 2026
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09009 ↗

We classify positive classical solutions of the Lane–Emden system \begin{align*} \begin{cases} -Δu=v^p & ~~\text{in }\mathbb{R}^n\setminus\{0\},\\ -Δv=u^q &~~ \text{in }\mathbb{R}^n\setminus\{0\}, \end{cases} \end{align*} with a nonremovable singularity at $0$ (i.e., $\lim_{x\to0}u(x)=\lim_{x\to0}v(x)=+\infty$), where $n\ge3$ and $p,q>0$ satisfy \[ \frac1{p+1}+\frac1{q+1}=\frac{n-2}{n}. \] Without additional growth or integrability assumptions, we establish radial symmetry about the origin, strict radial decrease, and global two-sided power bounds for both components. Furthermore, every such solution can be written as \[ u(x)=|x|^{-α}U(\log|x|),\qquad v(x)=|x|^{-β}V(\log|x|), \] where $α=\frac{n}{q+1}$, $β=\frac{n}{p+1}$, and $(U,V)$ is either the positive equilibrium $(A,B)=((\fracαβ)^{\fracα{2}}, (\fracαβ)^{\fracβ{2}})$ or a positive nonconstant periodic solution of the associated Emden–Fowler system. These periodic solutions form a Delaunay family: for every $\varepsilon\in(0,A)$, there is a unique profile pair, up to translation in $t=\log|x|$, with $\min_{\mathbb{R}}U=\varepsilon$. The Hamiltonian energy provides an alternative parameter, decreasing continuously and strictly from zero to the equilibrium energy as $\varepsilon$ increases from $0$ to $A$. The common least period of the two components tends to infinity as $\varepsilon\downarrow0$ and to the period of the linearized oscillation at $(A,B)$ as $\varepsilon\uparrow A$. The classification includes the case of a sublinear exponent.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09029 ↗

Alt, Caffarelli and Friedman established the existence of two-dimensional asymmetric incompressible jet flows in [Asymmetric jet flows. Comm. Pure Appl. Math. 35, 29–68, 1982]. In their formulation, the constant fluid speed $λ$ on the free boundaries and the downstream asymptotic angle $θ$ are selected as part of the solution. In this paper, we prove that the asymmetric jet is unique for a prescribed nozzle and mass flux. We first establish the strict vertical monotonicity of the stream function $u$ and introduce the partial hodograph coordinates $ξ=x$ and $η=u(x,y)$, which map every fluid domain onto the same fixed strip. Under this framework, each jet is characterized by a height function $y=h(ξ,η)$, which determines the vertical position along the streamline $u=η$ at horizontal coordinate $ξ$. By analyzing the difference between the height functions of two candidate jets on this strip, we derive an elliptic equation with Dirichlet conditions on the fixed walls and conormal conditions on the free boundaries. Combining these mixed boundary conditions with the asymptotic behaviors, we first establish the uniqueness of the free-boundary fluid speed $λ$. For the resulting common speed, a local perturbation of the height function near a nozzle endpoint, together with the maximum principle, proves that the two height functions must coincide. Inverting the partial hodograph transformation then establishes the uniqueness of the physical jet.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09070 ↗

We continue our study of a PDE-constrained variational model for maximizing the total reaction flux by optimizing the spatial distribution of catalytic materials, such as enzymes. The total amount of enzyme is fixed, and the substrate concentration is governed by a reaction-diffusion equation with prescribed boundary values. We consider both linear and nonlinear Michaelis-Menten reaction kinetics. In previous work, we constructed a maximizing sequence, computed the first and second variations of the reaction functional, and established the nonexistence of local maximizers. Here, we conduct a more comprehensive analysis. We prove that the functional is strictly concave for linear kinetics but need not be concave or convex for nonlinear kinetics. We also show that no critical points exist. We then characterize maximizing sequences and identify all their possible limiting measures. Our analysis reveals the mechanism of reaction maximization through spatial localization: maximizing sequences concentrate enzymes near the portion of the boundary where the substrate concentration is largest. Moreover, the landscape of the functional defining the total reaction differs between the linear and nonlinear cases, a point less emphasized in applications. Consistent with existing biophysical studies, these findings motivate the development and analysis of regularized models.

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

We investigate the mass threshold for the two-dimensional Keller-Segel system coupled with the incompressible Navier-Stokes equations. In the absence of fluid interaction, the classical Keller-Segel system admits a well-known $4π$-critical-mass dichotomy: for every suitably regular initial datum of total mass \(m<4π\), the associated no-flux initial-boundary value problem admits a global bounded classical solution, whereas for \(m>4π\), there exist smooth initial configurations of mass $m$ such that the associated solution blows up in finite or infinite time. For the fluid-coupled system, Winkler first established global generalized solvability under the condition \(m<2π\) and proposed an open question whether the fluid action may lower the critical blow-up mass to some value lying between $2π$ and $4π$. In the present work, we resolve this open problem and show that the presence of the fluid does not alter the critical mass threshold, and the entire classical subcritical regime remains intact: every admissible initial datum with total mass \(m<4π\) generates a unique global classical solution that is uniformly bounded with respect to time. Our proof relies on the construction of a new quasi-energy inequality. The key underlying observation is that combining relative isoperimetric estimates with rearrangement techniques yields a Gagliardo-Nirenberg inequality on bounded planar domains with an explicit leading constant.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09160 ↗

We study positive solutions of $u_t-Δu+x_1^{2α}|u|^{q-1}u=0$ in the half-space $\{x_1>0\}$, with $α>-1$ and $q>1$, vanishing on $\{x_1=0\}$ and at $t=0$ away from the origin. Let $q_c=(N+3+2α)/(N+1)$. For $1<q<q_c$ we prove that there is exactly one positive self-similar solution continuous away from the origin, and that its profile satisfies Gaussian bounds that are sharp up to multiplicative constants. For $q\ge q_c$ there is none. We also show that, after removing the Gaussian factor, the profile has an angular limit shape $Φ$ in every mode, give an integral formula for its Kummer coefficients, prove that $Φ$ is real-analytic and is the uniform limit of the rescaled profiles, that $Φ/(η_1/|η|)$ is monotone along meridians, and that $Φ$ is proportional to $η_1/|η|$ if and only if $2α+q=1$. Every self-similar solution of finite energy, or continuous away from the origin, is dominated in absolute value by the positive one, and for $(N+4+2α)/(N+2)\le q<q_c$ the only nontrivial ones are $\pm u_s$. For $α=0$ existence, uniqueness and the upper bound are due to Marcus and Véron; the lower bound with the sharp exponent and the description of $Φ$ are new also in that case. The existence and uniqueness proofs use a Brezis–Oswald type comparison principle and explicit barriers, given by explicit formulas; the analysis of $Φ$ uses Kummer functions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09179 ↗

We extend the radial threshold classification of Duyckaerts and Merle on the lower kinetic branch to nonradial solutions of the three-dimensional focusing energy-critical nonlinear Schrödinger equation in \(\dot H^1(\mathbb R^3)\). At the ground state energy and with initial gradient norm strictly below that of the ground state, every solution is global and either scatters in both time directions or is a symmetry transform of the special solution \(W^-\), possibly after conjugate time reversal. The proof combines Su and Zhao's below-threshold scattering theorem with a coercivity estimate for the interaction form at threshold under a kinetic gap and a local analysis near the ground state orbit.

comments
29 pages. Comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09185 ↗

For every $n\ge3$ and $(n+1)/(n-1)<p<(n+2)/(n-2)$, we construct positive solutions of $Δu+u^p=0$ in the half-space with zero Dirichlet data away from the origin, the homogeneous singular profile there, and Poisson-kernel decay at infinity, resolving a question of del Pino–Musso–Pacard. Under a weighted non-degeneracy condition, these half-space solutions serve as building blocks for positive very weak solutions in smooth bounded domains, singular along prescribed compact smooth boundary submanifolds of normal dimension $n$. We verify non-degeneracy in the initial stable interval and at and just beyond its threshold when this lies below $(n+2)/(n-2)$. For isolated boundary singularities, the construction applies throughout the strict subcritical interval outside a locally finite exceptional set.

comments
99 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09221 ↗

We establish an interior $\varepsilon$-regularity criterion for suitable weak solutions of the unforced stationary Navier–Stokes equations in an open set $Ω\subset\mathbb R^5$. There exists a universal constant $\varepsilon_\ast>0$ such that $x_0$ is regular if, for some ball $B_R(x_0)\subsetΩ$ with $R>0$, \[ \frac1R\int_{B_R(x_0)}|\nabla u|^2\,dx \leq \varepsilon_\ast^2. \] The main difficulty is that the Dirichlet energy controls the velocity oscillation while its mean may be arbitrarily large. Subtracting the mean introduces a large constant drift into the perturbation equation. Moreover, smallness in $H^1$ alone is insufficient to close a direct nonlinear elliptic estimate in five dimensions. We overcome these difficulties through uniform Oseen estimates and a relative-energy comparison yielding quadratic improvement of the perturbation. As a consequence, the singular set has zero one-dimensional upper Minkowski content on every compact subset of $Ω$, and hence local upper Minkowski dimension at most one.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09289 ↗

We study obstacle problems for Kolmogorov-type operators that diffuse in one variable and transport in another. Such problems describe American options on running averages. Under a cone estimate, a strong monotonicity condition on the solution in the diffusive direction, we show that the free boundary is a graph in the diffusive direction with Hölder continuous first derivatives in the Euclidean sense, and that every free boundary point is regular. The key observation is that a Euclidean Lipschitz free boundary is flat at the intrinsic scale. For the American fixed-strike Asian option we verify the cone estimate, so that its exercise boundary has the same regularity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09428 ↗

In this paper, we study the asymptotic behavior of weak solutions to the following critical $p$-Laplace equation \[ -Δ_p u=u^{p^*-1}, \quad u\ge0 \quad\hbox{in }B_1\setminus\{0\}, \] where $Δ_pu=\diver(|\nabla u|^{p-2}\nabla u)$ is the classical $p$-Laplacian with $1<p<n$, $p^*=\frac{np}{n-p}$ is the Sobolev critical exponent and $B_1\setminus\{0\}\subset \mathbb{R}^n$ is the punctured unit ball. We develop a nonlinear potential-theoretic method to establish sharp upper bounds for solutions, without using the method of moving planes or moving spheres. Furthermore, we use Steiner symmetrization to study the radial symmetry of global singular solutions, and thereby classify all Fowler singular solutions. Finally, we prove that every local singular solution is asymptotic to a global Fowler singular solution.

comments
41 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09440 ↗

We construct steady solutions of the two-dimensional Euler equations on smooth annular domains that are isolated, modulo scaling, in the $L^\infty$ vorticity topology. They are highly unstable: any Yudovich trajectory remaining sufficiently close to such an equilibrium on an open time interval is a stationary multiple of it and, moreover, at fixed energy, enstrophy and circulations, distinct nearby trajectories cannot return even weakly to the equilibrium. Further, on any non-circular annulus, we show that this kind of isolated, highly unstable equilibria occurs arbitrarily close in the Yudovich norm to smooth equilibria which are themselves non-isolated.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09444 ↗

This paper constructs a time-dependent thermal-fluid-solid multiphysical coupled model describing the interaction between a free fluid and a thermo-poroelastic medium and provides a rigorous mathematical analysis. The model consists of the incompressible Navier-Stokes equations and the heat equation in the free-fluid region, together with the thermo-poroelasticity equations in the porous medium. The two regions are coupled on a fixed interface through conditions for normal velocity, tangential velocity, stress balance, temperature continuity, and heat flux continuity. Under a small-data assumption, we prove the existence and uniqueness of a weak solution for this fully dynamic nonlinear coupled system. The proof employs the Galerkin method to construct semi-discrete approximations, establishes uniform a priori estimates that enable the extension of local solutions to global ones, and invokes compactness arguments to pass to the limit, yielding a solution to the original coupled system.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09482 ↗

We prove the global nonlinear stability of small planar contact waves for the three-dimensional full compressible Navier–Stokes equations in $\R^3$ under general $H^4(\R^3)$ perturbations, without any $L^1$ integrability or zero-mass assumptions. Unlike the one-dimensional problem or the periodic channel, the problem in $\R^3$ admits neither a Poincaré inequality in the transverse directions nor a square-integrable anti-derivative. Our proof relies on three main ingredients: a perturbation around the one-dimensional Navier–Stokes solution starting from the smooth contact profile, a formulation of the low-order perturbation system in the velocity, pressure, and entropy variables with separate estimates for the velocity–pressure pair and the entropy, and the construction of characteristic and space-time Gaussian weight functions. Combining these weighted estimates with higher-order derivative bounds and homogeneous Gagliardo–Nirenberg interpolation yields global stability and algebraic $L^\infty$ decay rates in $\R^3$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09485 ↗

In this article, we discuss the scaling behaviour of the singularly perturbed Tartar square, revisiting the results by [Rüland-Tribuzio '22]. Therein, it was proven that both lower and upper bounds satisfy a behaviour of the same type, up to a small mismatch of logarithmic powers. We show by an improvement of the ansatz free lower bound that the logarithmic powers indeed match and that the bounds are of order $\exp( - C \log(\varepsilon^{-1})^{1/2} )$ for suitable constants $C = C_{\rm low}$ and $C = C_{\rm upp}$, where $\varepsilon$ denotes the singular perturbation parameter. More specifically, the bootstrap argument in the Fourier space is refined by resorting to Fourier multipliers enjoying $L^\infty$-bounds which are constructed via de la Vallée Poussin kernels. Regarding upper bounds, we perform iterated branching constructions sharpening the upper bound of [Winter '97] which resorted to an iteration of laminates as a competitor. Eventually, the mismatch of upper and lower bound is quantified, and for quadratic energies we obtain the bounds $C_{\rm low} \leq 7.0339$ and $C_{\rm upp} \geq 2 \log(2) - ν$ for any $ν>0$.

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

The spherical Stein–Tomas inequality maps $L^2(\mathbb S^2)$ into $L^4(\mathbb R^3)$. We study its refinement in which the angular input is measured by the strictly weaker Besov norm $B^0_{2,4}(\mathbb S^2)$. The central separated-band inequality bounds the squared $L^2$ norm of the product of extensions from degrees $L\ll K$ by $C(L/K)$ times the squared input norms. An exact spherical-Hankel expansion controls the far field, while angular-momentum leakage and transversality handle the Fresnel region. We construct scale-separated, normalized angular bands for which the extension norm is equivalent to the $\ell^4$ norm of the coefficients. This proves that the fourth-power summation is optimal and quantitatively distinguishes the result from the classical $\ell^2$ summation. As an application, small angular Besov data generate small $L^4$ solutions to the cubic nonlinear Helmholtz equation in $\mathbb R^3$, with a smallness condition that remains sharp on multiscale data even when their $L^2$ norm is arbitrarily large or infinite. The associated on-shell nonlinear scattering amplitude has improved angular $B^0_{2,4/3}$ regularity, and its leading cubic term is quantitatively decoupled across widely separated angular bands.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09507 ↗

For every finite $p\ge1$, the body-centered cubic lattice uniquely minimizes the $p$th moment of the Voronoi cell among three-dimensional lattices of covolume one, up to orthogonal transformations. This proves the Graf–Luschgy conjecture for three-dimensional lattice quantizers (\cite{GL}).

fields
Analysis of PDEs, Mathematical Physics, Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.09523 ↗

We prove a new monotonicity formula for the two-dimensional Neumann elasticity equation with connected boundary. From this we deduce a regularity result for two-dimensional minimizers of the Griffith energy with connected crack set: the crack may be partitioned into regular points, triple junctions, and cracktips. We give a classification of the global minimizers of the Griffith energy with connected crack set. Finally, we discuss some consequences of the monotonicity formula on the evolution of the stress intensity factors along a crack, which may present independent interest.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09562 ↗

We prove generalized and classical Harnack inequalities for non-negative smooth solutions of divergence-form semilinear subelliptic equations on Carnot groups. The proof combines smooth horizontal Gauss–Green and coarea formulas, energy estimates for level sets, a Vitali covering argument, and a horizontal Keller–Osserman barrier. The companion paper, Reference [10], develops the geometric foundations and extends the estimates to weak solutions with nonsmooth data.

comments
74 pages. The companion paper [10] can be found at https://doi.org/10.5281/zenodo.24013096
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09590 ↗

We provide a variational formulation of a finite-dimensional Follow-the-Leader system through a minimizing-movement scheme based on a discrete transport distance with nonlinear mobility. Despite the degeneracy of the kinetic action at maximal density, we prove finiteness of the distance, $C^1$ regularity of geodesics, and suitable Euler–Lagrange relations. For a decreasing external potential, we show that the JKO scheme yields an approximate implicit Euler discretization of the Follow-the-Leader dynamics. Consequently, as $τ\to0^+$, the piecewise affine interpolations converge, up to a subsequence, to a $C^1$ solution of the continuous Follow-the-Leader system. This complements the many-particle convergence theory for the discrete nonlinear-mobility transport distance by establishing the continuous-time limit at fixed number of particles.

comments
30 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09781 ↗

We establish a unified framework to study the continuity and complete continuity of the principal eigenvalue functional $λ_1(V,m)$ associated with the following $(p,A)$-Laplacian operator involving both sign-changing potential $V$, and positive weight $m$ in a Morrey space: \begin{align*} -Δ_{p,A}(u) + V|u|^{p-2}u &= λm|u|^{p-2}u \quad \text{in}\,\, Ω, u &= 0 \quad\quad\quad \quad\quad \text{on}\,\, \partialΩ, \end{align*} where $1<p<N$, $λ\in\mathbb{R}$ is a parameter, and $Ω\subset \mathbb{R}^N (N \geq 2)$ is a bounded domain with boundary $\partial Ω$. As a consequence, we investigate the existence and uniqueness of optimal principal eigenvalues $λ_1(V,m)$ over a weakly compact subset of the Morrey space. Finally, we derive a formula for the derivative of $λ_1(V,m)$ with respect to regular perturbations of potential $V$, and positive weight $m$ within a closed subspace of Morrey space. Our results develop analytic tools to overcome the lack of separability and reflexivity in Morrey spaces to investigate this eigenvalue problem. In particular, the study is new even for the linear case $p=2$. We also emphasize that the tools established are applicable for a wide class of PDEs with coefficients in Morrey spaces.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09793 ↗

We investigate the large-time behavior of nonnegative solutions to the time-fractional nonlinear diffusion equation $\partial_t^α(u-u_0) = Δu^m$, $0<α<1$, $m>0$, in a bounded domain with the homogeneous Dirichlet boundary condition. We prove that the rescaled solution $t^{\fracα{m}}u$ converges as $t\to\infty$ to an asymptotic profile $S$ characterized by $-ΔS^m = u_0/Γ(1-α)$. Moreover, we show that $t^αu^m$ converges to $S^m$, which admits an explicit representation in terms of the Green function and the initial datum. In contrast to the classical case $α=1$, the asymptotic profile depends explicitly on the initial datum.

comments
30 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09858 ↗

We prove unconditional uniqueness for the Korteweg–de Vries (KdV) equation in $C_tH^{-1}_x(\mathbb R)$ and the real defocusing modified KdV equation in $C_tL^2_x(\mathbb R)$ within the class of Green solutions, an intrinsically well defined solution notion that encodes the evolution at these low regularities through the diagonal Green functions of the associated Lax operators. A key contribution is automatic local smoothing: the Green identities imply $q\in L^2_{\mathrm{loc}}$ for KdV and $u_x,u^2\in L^2_{\mathrm{loc}}$ for mKdV in spacetime, with estimates uniform over spatial translates. The uniqueness results therefore identify every Green solution in these classes with the continuous extension of the corresponding Schwartz flow.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09885 ↗

Numerical Analysis27

Thermal simulation is becoming increasingly critical in modern IC design and manufacturing. Feynman–Kac random walk methods can estimate localized temperatures without solving the global field, but in practical settings without Dirichlet boundaries they require very long paths to control the truncation residual. This paper presents FasterRW, a continuation-value framework for accelerating Feynman–Kac thermal random walks. We prove a stopping-time residual identity showing that the expected tail after truncation equals the current attenuation weight multiplied by the temperature at the stopping location. This identity enables a prior-corrected single-point estimator: a cheap, noisy prior replaces the unknown continuation value, making the truncation bias scale with prior error rather than absolute temperature and yielding an error-controlled threshold-selection rule. For multi-point queries, FasterRW further converts cross-query pass-through tails into pseudo-samples and refines the resulting observations in prior-error coordinates through kriging. Compared with prior state-of-the-art methods, FasterRW achieves up to $28\times$ acceleration while maintaining accuracy. Our code is open-sourced at https://github.com/ShiningSord/FastRW.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.08490 ↗

We study deterministic numerical integration on open subsets of $\mathbb R^d$ of volume one. Let $e_n$ be the minimal worst-case error using at most $n$ function values. For twice continuously differentiable functions with the normalized Lipschitz bounds proposed by Novak, we prove $e_n\geq v_d^{-2/d}n^{-2/d}/(4(d+2))\geq(8π\mathrm e)^{-1}n^{-2/d}$, where $v_d$ is the volume of the Euclidean unit ball. This resolves Novak's conjecture: the lower-bound constant is independent of the dimension and the shape of the domain. A midpoint rule on the cube has the same rate, up to an absolute constant. The proof uses smooth functions that vanish near the sample points and are large elsewhere. The bound therefore remains valid when each sample supplies all local information about the function. For scalar linear targets continuous in the uniform norm, we prove a second result on the global smooth class with prescribed function, gradient, and Hessian bounds: adaptive local information has the same minimal error as values and gradients at points chosen in advance. We give extensions to function recovery, finite integration measures, and anisotropic derivative bounds.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.08524 ↗

In solving systems of nonlinear equations, one of the main objectives is to construct iterative methods that attain high orders of convergence using as few evaluations as possible. However, the information a method obtains during each iteration imposes limitations on the order it can guarantee. The Cordero–Torregrosa conjecture proposes a bound on this order in terms of the number of evaluations of the function and its Jacobian. In this work, we prove this bound for the universal local order of one iteration, without requiring the number of Jacobian evaluations to be less than or equal to the number of function evaluations. In particular, our result also covers the case in which more evaluations of the Jacobian than of the function are performed. The proof encompasses deterministic, causal, memoryless methods whose rules may be arbitrary, without imposing rationality, continuity, or computability conditions. Moreover, we prove that when each Jacobian evaluation is performed at a point where the value of the function is already known, a more restrictive bound on the order of convergence can be obtained. Finally, we propose a new conjecture that establishes a refined bound through a product of factors determined by the distribution of evaluations, under additional dimensional conditions. These results provide a better understanding of the limitations imposed by the available information and raise new possibilities for studying high-order iterative methods.

comments
44 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.08801 ↗

We study kernel approximation and multilevel residual correction for functions with values in a manifold that admits a global logarithm onto a finite-dimensional Hilbert space, such as positive definite matrices, exponential Lie groups, and Hadamard manifolds. Approximating in logarithmic coordinates keeps the approximant on the manifold and transfers Hilbert-space error estimates verbatim. To express these errors in the natural geometry of the target, we prove metric comparisons. In particular, we obtain a sharp, scale-invariant bound between the log-Euclidean and affine-invariant distances on positive definite matrices, with a constant that depends only on condition numbers. For multilevel approximation, compactly supported kernels scaled to the fill distance give algebraic convergence with sparse, uniformly well-conditioned systems. These guarantees require appropriate sample locations and approximation scales. Compact groups are treated through a principal logarithm, where a bi-invariant metric gives error bounds with constant one. Finally, the log-Euclidean and Karcher means differ by $\mathcal O(r^3)$ near the identity and by $\mathcal O(r^2)$ around a general point, where $r$ is the logarithmic data radius and the second bound is sharp.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.08817 ↗

Physics-informed neural networks (PINNs) often suffer from imbalanced optimization of competing loss components, particularly when approximating solutions with high-frequency or multiscale features. Although existing balancing strategies have proven effective in alleviating this difficulty, the mechanisms governing the evolution of individual task contributions to Adam's parameter updates remain insufficiently understood. We introduce task-wise indicators to characterize this evolution and identify three distinct training regimes: smooth variation, intermittent spikes, and persistent oscillations. Focusing on the early smooth regime, we combine discrete-time analysis with a continuous-time singular perturbation framework under the full-batch setting and the parameter regime $(1-β_2)/(1-β_1)\ll1$. A first-order approximation of the locally attracting slow manifold reveals two factors governing the step-to-step redistribution of task contributions: curvature-related alignment disparities and differences in the coordinatewise distributions of preconditioned task gradients. Both factors involve Adam's shared second-moment estimate. Inspired by AdaTask, we propose Gradient-Modulated Adam (GMAdam), which modulates incoming task gradients using task-specific second-moment estimates. Numerical experiments on high-frequency Poisson and wave equations, the Allen-Cahn equation, and two-dimensional lid-driven cavity flow ($Re=100,400$) demonstrate consistent improvements in predictive accuracy over AdaTask at comparable computational cost.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.08910 ↗

We develop an abstract variational framework for convergence rates of parametrized problems and their Galerkin approximations, with applications to nonlocal diffusion. The main objective is to quantify modeling and discretization errors in terms of the nonlocal horizon, the mesh size, the Sobolev regularity of the local solution, and the compatibility of boundary data. We establish error estimates in energy and $L^2$ norms and develop an adaptation of the Aubin–Nitsche argument that uses regularity of the limiting local dual problem. This approach yields improved $L^2$ estimates without requiring additional regularity of the nonlocal dual solutions, including for integrable kernels. We apply the framework to two constant-horizon nonlocal Laplacians with exterior boundary data and to heterogeneous localization models with classical Dirichlet, Neumann, and Robin conditions. The resulting estimates provide quantitative guarantees of asymptotic compatibility and improve existing error bounds under weaker regularity assumptions. Numerical experiments illustrate the convergence rates and examine the sharpness of the estimates.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09011 ↗

Physics-Informed Neural Networks (PINNs) often struggle to approximate solutions with sharp gradients due to optimization difficulties and spectral bias. Motivated by the principle of gradient equidistribution from the stretching approach in grid generation, which redistributes solution gradients to reduce functional complexity, we propose Coordinate Transformation PINNs (CTPINNs), which incorporate learnable coordinate transformations to map the physical domain into a computational domain where the physical solutions become approximately affine, making them easier for neural networks to learn. We propose two constructions of the transformation: an explicit construction based on Majorants and an implicit construction based on invertable neural networks. Experimentally, the explicit construction can improve accuracy for PDEs with available explicit coordinate transformations, and the implicit construction can be combined with other advanced PINN models as an efficient plug-in module to improve performance across a range of challenging PDE benchmarks.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09053 ↗

We establish strong convergence rates for a fully discrete method of the one-dimensional stochastic Burgers equation driven by additive rough noise. Using the Cole-Hopf transformation, the equation is converted into a linear stochastic heat equation, which is discretized by a spectral Galerkin method in space and an accelerated exponential Euler method in time. A numerical approximation of the original solution is then reconstructed through a regularized inverse Cole-Hopf transformation. The analysis combines strong Sobolev error estimates with the positivity and inverse-moment bounds for the transformed solution. For additive space-time white noise, the numerical method achieves mean-square convergence rates arbitrarily close to 1/2 in space and 1/4 in time. The rates are slower when the noises are rougher.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09135 ↗

We consider the inverse problem of determining the location, orientation, shape, and material parameters of a small elastic inclusion embedded in a homogeneous medium from full-aperture measurements of the scattered field. Using a small-volume expansion, we derive explicit leading-order expressions for four Kirchhoff migration imaging functionals, denoted by PP, PS, SP, and SS, corresponding to the four combinations of pressure (P) and shear (S) waves used for receiver- and source-side backpropagation. The resulting point-spread functions quantitatively characterize the resolution of each mode and show that the SS mode achieves the highest spatial resolution. For an elliptic inclusion, we show that the PP mode uniquely determines the elastic moment tensor (EMT) within the leading-order asymptotic model, thereby enabling the reconstruction of the material and geometric parameters of the inclusion. For a general small scatterer, the reconstruction may instead be interpreted as an effective elliptic representation determined by its leading-order EMT. For a disk, the parameter-identification problem is underdetermined; nevertheless, explicit upper and lower bounds on its volume are derived. We further analyze the model error arising from neglected cross-mode contributions when the distance from the center of the measurement configuration is not sufficiently large relative to the elastic wavelengths. Numerical experiments support the theoretical predictions and demonstrate the effectiveness of the proposed imaging and reconstruction methods.

fields
Numerical Analysis, Mathematical Physics
pdf ↗ page arXiv:2611.09137 ↗

Double-model methods select a regularization parameter by matching the discrepancy between two reconstructions of the same data to a prescribed target. The Structured-Surrogate Double-Model (SSDM) framework is developed around a computationally inexpensive structured surrogate of the forward operator and a spectrally explicit perturbation, with the selected parameter subsequently applied to the original inverse problem. Given a prescribed target, parameter selection requires neither prior knowledge of the noise level nor training data. For a class of Tikhonov regularization problems, the squared discrepancy is shown to attain a strict maximum at zero regularization, decay as $λ^{-2}$, and decrease strictly beyond an explicit phase-aware threshold. A complementary, data-dependent certificate is established to guarantee strict monotonicity on finite intervals, enabling unique and reliable target matching even when the global threshold is overly conservative. The discrepancy is further connected to directional roughness in image deblurring, providing a geometric interpretation of the selection principle. Experiments on synthetic images and on synthetically blurred natural photographs illustrate the theoretical findings and demonstrate the practical applicability of certified parameter selection.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09158 ↗

Preserving density bounds and mass conservation, together with a conservative momentum discretization and exact incompressibility, is a central challenge in high-order simulations of variable-density incompressible flow. We develop a structure-preserving discontinuous Galerkin method that couples conservative density transport with an \(H(\mathrm{div})\)-conforming mixed discretization of the momentum equation. The method uses a partitioned time integrator: density is advanced explicitly by strong-stability-preserving Runge–Kutta stages with a bound-preserving limiter, while momentum is updated by a linearly implicit backward differentiation formula. The transport velocities are extrapolated from previously computed mixed velocities. Because the discrete solenoidal space is linear, this extrapolation preserves elementwise zero divergence and single-valued normal traces, providing compatible transport velocities without an auxiliary reconstruction or projection. For source-free transport on triangular meshes with impermeable or periodic boundaries, we prove bounds for density cell averages and limiter control-point values under the stated spatial, quadrature, and stagewise Courant–Friedrichs–Lewy conditions. The conservative fluxes and mean-preserving limiter yield global mass conservation. Numerical experiments on triangular and structured rectangular meshes demonstrate the expected convergence rates, machine-level divergence errors, and bound preservation, including in a low-density regime with high density ratio.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09171 ↗

This paper compares various Rosenbrock and Rosenbrock W-methods. To achieve this, some methods implemented in the Julia package OrdinaryDiffEqRosenbrock.jl are selected and benchmarked using test examples. The test examples include stiff ODE problems as well as differential-algebraic equations. In addition to the already known methods, the new W-method Rodas4PW is introduced and included in the tests.

comments
16 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.09174 ↗

This paper studies direct scattering by periodic fluid–solid interfaces and interface reconstruction from multifrequency near-field data. Using Helmholtz decomposition and quasi-periodic single-layer potentials, we formulate a coupled boundary integral system with the standard stress traction, establish its equivalence to the original fluid–solid transmission problem under suitable assumptions, and construct a corresponding Nyström discretization. For near-field observations at finitely many measurement points, we establish local Fréchet differentiability of the observation map with a quadratic remainder estimate. In the smooth setting, the derivative transmission problem and its boundary integral formulation are used to compute the observation Jacobian required for interface reconstruction. The interface is reconstructed by regularized Gauss–Newton iteration in a Fourier space that is progressively enriched as the frequency increases. Numerical experiments assess direct-solver accuracy and reconstruction performance for different interfaces, material configurations, and noise levels.

comments
29 pages, 2 figures, 3 tables
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2611.09201 ↗

The purpose of this article is to study the convergence of a lattice Boltzmann method (LBM) for a simple diffusion equation. The LBM is proven to be stable and consistent in some sense, so that convergence results may be obtained. The approach is similar to asymptotic analysis in the literature, although the schemes are also studied for intermediate time scalings. Usually, LBM are used in the range of acoustic regime, where $δ$t ___ $δ$x, or in diffusive scaling, with $δ$t ___ $δ$x 2 . In this work, we study any intermediate scaling $δ$t ___ $δ$x 1+r with r $\in$]0; 1]. The goal is to prove that this scaling is capable of approximating an advection-diffusion equation, provided the relaxation rate is chosen in accordance with $δ$x. Convergence results are established and match the previously known results in the diffusive regime. The second objective is to prove that several choices for the initial condition are suitable for convergence. In particular, the usual choice of equilibrium distribution at initial time guarantees that the LBM scheme yields an accurate approximation of the macroscopic quantities.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09245 ↗

We propose a semi-implicit, exactly well-balanced finite volume scheme for the two-dimensional shallow water equations over a non-flat bottom, aimed at the low-Froude-number regime. The method combines a Suliciu-type relaxation of the pressure with a flux splitting that separates the fast acoustic waves from the slow transport ones: the pressure subsystem is integrated implicitly and the transport subsystem explicitly, so that the time step is no longer restricted by the acoustic stability condition. Written in terms of its Riemann invariants, the pressure subsystem decouples into independent one-dimensional problems along the grid lines, each of them governed by a banded linear system whose bandwidth does not depend on the mesh. The implicit step therefore requires no non-linear solver and costs O(NxNy) operations, regardless of the acoustic Courant number. A two-dimensional exactly well-balanced reconstruction, whose limiter weights are frozen within each time step, preserves this linear structure for the second-order scheme. We prove that both the first- and the second-order schemes preserve water-at-rest equilibria exactly, and we assess them on several two-dimensional benchmarks, where they resolve fine-scale velocity structures on coarse meshes and run up to 8.5 times faster than standard explicit Riemann solvers.

comments
59 pages, 10 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.09281 ↗

Tensor-product splines mapped from a square to a disk-like domain form a discrete de Rham complex, but at the coordinate singularity the pushed-forward $0$-, $1$- and $2$-forms are discontinuous, unbounded and not square integrable. Existing polar constructions impose either high-order regularity on the $0$-forms only, or first-order regularity on the whole complex. For general disk-like mappings composed with a smooth diffeomorphism, we construct polar subspaces of all three tensor-product spaces that are conforming, form a cochain complex with the cohomology of the disk, and are $\mathcal{C}^{\mathfrak{r}-m}$ at the center for $m$-forms, for any $\mathfrak{r}$ up to the spline degree, under a compatibility condition between the mapping and the angular basis. The construction enriches the $2$-form space with projected polynomials and lifts them to curl-like $1$-forms by Poincaré-type homotopy operators, which reduce to cumulative sums of radial B-spline coefficients, so that the homotopy identities hold exactly. The same operators yield sparse commuting projections that preserve total flux and circulation, and boundary-compatible homotopies that solve the curl–curl problem with a single mass-matrix inversion. In 3D, the tensor product with a periodic 1D complex carries all properties over to stellarator-like solid tori. Numerical experiments confirm optimal projection accuracy and the predicted regularity, show that the regularity conditions suppress the stiff central modes of the curl–curl operator, allowing more than ten times larger time steps than first-order polar spaces, and that compatible high-order regularity is required for convergent guiding-center orbits near the axis of a discrete vacuum field.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09292 ↗

Accurate approximation of soliton solutions of the Korteweg–de Vries (KdV) equation remains challenging for physics-informed neural networks (PINNs) due to localized wave structures, high-order spatial derivatives, nonlinear interactions between solitons, and difficulties in long-time prediction. In this work, we address these challenges using a scaling PINN framework to approximate KdV soliton solutions. The framework transforms the governing equation into a normalized form, approximates its solution using a PINN solver, and reconstructs the solution in the original variables through inverse scaling. We introduce scaling transformations and PINN solvers tailored to one- and two-soliton problems. For the one-soliton case, we employ a PINN solver that incorporates a traveling-wave coordinate to capture soliton propagation. For the two-soliton case, we employ a two-step training procedure for the PINN solver. The first step learns the individual soliton profiles and estimates their propagation speeds, while the second step uses the estimated speeds to construct traveling-wave coordinates in the PINN solver and approximate the full two-soliton solution, including nonlinear interactions. We also introduce soliton-informed sampling (SIS), which places additional collocation points around the soliton trajectories. Numerical results show that the scaling PINN framework accurately captures one-soliton propagation, resolves two-soliton interactions, and preserves soliton profiles during long-time extrapolation in both cases. An additional three-soliton experiment suggests the applicability of the proposed two-step training procedure to multi-soliton solutions.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09339 ↗

Preserving the energy dissipation properties of gradient flow equations is important for the stability and reliability of numerical approximations, particularly in long-time simulations. In this paper, we propose a class of energy-dissipation-preserving physics-informed deep operator splitting networks (EDP-PI-DOSnets) for solving gradient flow equations. The proposed framework incorporates classical structure-preserving numerical schemes into neural network architectures, allowing the corresponding discrete energy dissipation laws to be preserved. In particular, suitable constraints are imposed on the convolution kernels to ensure that the learned discrete operators are symmetric and negative semidefinite. Furthermore, several network formulations are developed based on the Crank–Nicolson (CN), scalar auxiliary variable Crank–Nicolson (SAV/CN), and relaxed discrete variational derivative (R-DVD-1) schemes. Meanwhile, a physics-informed loss function based on the residuals of the governing equations is employed. Numerical experiments show that the predicted solutions are in good agreement with the reference solutions while satisfying the corresponding discrete energy dissipation laws. The results also suggest stable behavior during long-time recursive prediction and the potential applicability of the proposed framework to two-phase flow problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09430 ↗

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 ↗

We establish rigorous local-error bounds for the entire family of symmetric Zassenhaus splittings for possibly unbounded operators, under explicit assumptions on commutator bounds, regularity-preserving flows, and conjugation identities. Truncated symmetric Baker-Campbell-Hausdorff expansions yield an explicit coefficient formula for the Zassenhaus exponents and identify vanishing commutator expressions. In order to extend these cancellations to the realm of unbounded operators, we prove a general theorem on finite expansions of multiple operator conjugations with controlled integral remainders. For splittings of order 2n, our argument gives the sufficient commutator-length bound 4n-1, revealing regularity requirements that are not apparent from the formal order calculation. Using the Schrödinger equation with a quadratic potential as an example, we show that the order-dependent regularity requirements can reduce to one fixed weighted Sobolev space for all splitting orders.

comments
First version. 34 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.09571 ↗

We study a Bayesian inverse problem in EUV reflectometry, where optical constants and layer thicknesses are inferred from angle- and wavelength-resolved reflection measurements. The physical process is modeled and evaluated using an efficient forward model based on the transfer matrix method. As an alternative to computationally expensive sampling-based inference, we employ an Eulerian, entropically regularized Jordan-Kinderlehrer-Otto (JKO) scheme that minimizes the Kullback–Leibler divergence via proximal steps in the Wasserstein space. Using the Benamou–Brenier dynamic formulation and a Hopf-Cole transform, each JKO step is reformulated as a pair of heat equations coupled only through their initial and terminal conditions, enabling an efficient fixed-point solver. The resulting high-dimensional densities are discretized on tensor-product grids and represented in tensor-train format, exploiting Kronecker structure for scalable computation. Preconditioning based on estimated posterior moments further improves tractability. We test the method with numerical experiments on EUV reflectometry data for a ruthenium–silicon ($\ce{Ru}$ on $\ce{Si}$) specimen and compare the learned tensor-train posterior to ensemble Markov chain Monte Carlo (MCMC) reference samples. We demonstrate a use case in which we are able to reuse the tensor-train posterior to obtain samples for shifted target distributions with less computational effort than a comparable MCMC method.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09574 ↗

Quantum linear system algorithms offer theoretical potential for solving large sparse systems from PDE discretizations. However, applying them directly to fine-scale problems remains impractical on near-term hardware because of limited qubits, restricted circuit depth, and noise. They also prepare a quantum state rather than solution coefficients, whose recovery requires measurement and reconstruction. In this work, we develop a hybrid quantum-classical coarse-to-fine finite element framework for heterogeneous Darcy flow. We investigate whether a measured quantum coarse solution improves fine-grid initialization and reduces subsequent classical solver work. Rather than solve the full fine-scale system on a quantum device, we apply a method inspired by the Variational Quantum Linear Solver (VQLS) to the Galerkin coarse system. We reconstruct the approximate coarse solution from measurements, prolongate it to the fine grid, and use it to initialize a classical preconditioned iterative solve.} Numerical experiments on steady heterogeneous Darcy flow and a time-dependent SPE10-based problem show that measured quantum coarse solutions can improve fine-grid initialization, while classical correction recovers accurate pressure fields. The effect on classical solver iterations depends on the problem. All quantum computations were simulated using Qiskit Aer.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09593 ↗

Coupled thermo-hydro-mechanical (THM) models describe interactions among displacement, fluid pressure, and temperature in geothermal systems. Fine-mesh simulations over many time steps are costly, particularly with heterogeneous permeability and thermal conductivity or fracture networks that alter fluid and heat transport. Proper orthogonal decomposition (POD) reduces the number of unknowns but can require many modes because its reconstruction is linear. We apply SparseModesNet to reconstruct coupled THM solutions using a small set of selected modes and a neural-network nonlinear decoder. Starting from a larger collection of candidate modes, SparseModesNet selects modes to reduce reconstruction error rather than simply retaining those with the highest energy. We compare SparseModesNet with POD on three problems: a two-dimensional heterogeneous medium, a two-dimensional connected fracture network, and a three-dimensional geometry based on Utah FORGE fractures. We evaluate reconstructed displacement, pressure, and temperature fields, as well as pressure- and temperature-based quantities of interest. We also test temporal interpolation by training on a subset of snapshots and reconstructing omitted snapshots within the same time interval. For the same reduced dimension, SparseModesNet achieves smaller reconstruction errors than POD and accurately recovers the solution fields and selected geothermal quantities of interest.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09616 ↗

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 ↗

We develop a conforming virtual element framework for differential forms on general polytopal meshes in arbitrary dimension and at arbitrary order. Recursive local Hodge-Laplace boundary value problems define a trimmed virtual de Rham complex, from which moment constraints yield a complete subcomplex. The local spaces of these two complexes contain the trimmed and complete polynomial spaces of differential forms, respectively, and admit unisolvent degrees of freedom and computable polynomial projections. The canonical interpolants commute with the exterior derivative, and both complexes have cohomology isomorphic to that of the continuous de Rham complex. For both virtual families, we establish negative-norm inverse estimates and mesh-uniform norm equivalences in all form degrees. We further derive canonical interpolation error bounds and discrete Poincar'e inequalities. As an application, we obtain an inf-sup stable mixed Hodge-Laplace method with harmonic variables and optimal-order convergence under sufficient regularity. Moreover, the two conforming complexes are cochain isomorphic to their fully discrete counterparts (J. Eur. Math. Soc., 2025, doi:10.4171/JEMS/1602), and the norm equivalences provide a key analytical bridge between the conforming and fully discrete formulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09813 ↗

In this work, we propose a mass-lumped finite element method for the Allen-Cahn equation that incorporates nonlinear mobility which may degenerate. The spatial approximation uses continuous, piecewise linear, mass-lumped finite elements, while convex splitting is employed for the double-well potential in time. Under the standard non-obtuse mesh condition, it is shown that the resulting fully discrete method preserves the maximum-bound principle unconditionally: if the initial approximation takes values in $[-1, 1]$, then so does the numerical solution at every time level. Additionally, the method dissipates the original discrete Ginzburg-Landau energy without any time-step restriction, even when the mobility vanishes at pure phases. This analysis relies on the monotonicity of the lumped finite element operator and the convexity of the split potential. Numerical experiments confirm these theoretical properties and demonstrate the robustness of the method in phase-separation dynamics involving degenerate mobility.

comments
8 pages, 1 table, 1 figure
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2611.09832 ↗

In this study, we present a comparison of iterative methods for the compressible Reynolds equation with Navier slip boundary conditions, based on a fully compressible cavitation model for lubricated bearings. We establish the existence and uniqueness of the solution to the two-dimensional problem. We introduce the Kirchhoff transformation to reformulate the nonlinear density-pressure relationship into a quasi-linear problem. We develop an efficient numerical approach to solve the two-dimensional nonlinear problem. The methods examined are the Gauss-Seidel method, the Newton-Raphson method and parallelized nonlinear Jacobi method, applied to one- and two-dimensional slider bearing configurations. The overall solution time is shown to depend strongly on the choice of method.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09853 ↗

Probability27

Within many ecological populations, survival and reproduction exhibit a dependence on social interactions with relatives. As one example, resource excess is often shared according to genealogical proximity. When viewed as a branching system, an individual's offspring distribution acquires an effective dependence on genealogical structure. In the specific case that a large, local family structure leads to a large set of offspring, this can be viewed as a form of genealogical reinforcement. To capture this mechanism, we introduce a branching model of finite-depth genealogical dependence. Given partial observations of this reproducing population and its genealogy, we would like to reject the hypothesis of independent branching and estimate the strength of dependence. We present a statistical framework for detection and estimation, combining analytical results with simulation-based validation. We then identify our branching model with a tree-valued multitype branching process on a finite type space, providing a rigorous characterization of the expected structural reinforcement. Finally, we discuss how these tree-valued interactions can be accommodated within a broader class of stochastic processes.

fields
Probability
pdf ↗ page arXiv:2611.08548 ↗

Let $X$ be a continuous Gaussian process in $\mathbb{R}^d$, $d\ge2$, with independent components of roughness $H\in(\tfrac14,1)$, possibly with a linear drift, and let $X^n$ be its piecewise-linear interpolant on a mesh of width $δ$. We study how well the truncated signature of $X^n$ approximates that of the natural lift of $X$, in mean (the weak error) and in $L^2$ (the strong error). Over a class of drivers defined by quantitative regularity conditions, the weak error at every fixed truncation level is $O(δ^{γ(H)})$ with $γ(H)=\min(2H,4H-1)$, uniformly over the class, and for truncation levels $M\ge4$ fractional Brownian motion attains this rate. For centred drivers the weak error vanishes at levels $1$ to $3$, Gaussian or not. It first appears at level~$4$, where we compute its leading constant for independent fractional Brownian motion in $d=2$: on $(\tfrac12,1)$ it is $1/(2\sqrt3)$, independent of $H$, and on $(\tfrac14,\tfrac12)$ it is given by a $ζ$-series. For fractional Brownian motion with drift, a level-$3$ error of the same order appears for $H\ge\tfrac12$. Below $\tfrac12$ the drift reaches the rate only at levels $\ge5$ (proved for $d\ge3$). The strong error is of exact order $δ^{2H-1/2}$ for fractional Brownian motion with $H\in(\tfrac12,1)$, so in mean square the weak error lies a full power of $δ$ below it. For $H\le\tfrac12$ the strong error is $O(δ^{\vartheta})$ for every $\vartheta<2H-\tfrac12$, uniformly over the class, and the exponent $2H-\tfrac12$ cannot be improved. Finally, we construct pairs of laws in the class whose mesh data have the same law but whose expected signatures differ by order $δ^{γ(H)}$. Hence no quantity computed from the mesh data has mean within $o(δ^{γ(H)})$ of the expected signature uniformly over the class.

fields
Probability
pdf ↗ page arXiv:2611.08588 ↗

We study, at the logarithmic mollification scale $η^{-2(d+1+α)}\leδ\log N$ of Chen, Daus, Holzinger and J{ü}ngel, the fluctuation field $V^N=\sqrt N(μ^N-u_η)$ of the moderately interacting multi-species particle system whose mean-field limit is the Shigesada- Kawasaki-Teramoto (SKT) cross-diffusion system. The field is centred at the solution $u_η$ of the mollified equation, which depends on $N$ through $η$. On a scale of weighted Bessel-potential spaces of negative order we prove that the laws of $(V^N,M^N)$ are tight, where $M^N$ is the martingale part. Every limit point of $M^N$ is a continuous Gaussian martingale with an explicit deterministic bracket. Every limit point of $V^N$ is a weak solution, and the mild solution, of a linear Ornstein-Uhlenbeck SPDE whose drift is the linearisation of the SKT operator at the limit $u$. The initial field and the martingale are independent, and weak solutions are unique given both, so the whole sequence converges in law, jointly with the martingale part, and the limit is unique in law among solutions of the martingale problem. The noise is $d M_i=div(\sqrt{2u_iΘ_i}dW_i)$, with $Θ_i=σ_i+\sum_jf(a_{ij}u_j)$ and $W$ a cylindrical Wiener process on $L^2(\mathbb{R}^d;\mathbb{R}^{nd})$. The hypotheses are those of Chen, Daus, Holzinger and J{ü}ngel, including the smallness and the nonnegativity on $\mathbb{R}$ of the nonlinearity $f$. We add radial kernels $B_{ij}$, the independence of the initial data and the Brownian motions across particles and species, a smaller $δ$, a regularity budget on $u_0$, a strengthened smallness condition on $f$ that makes the backward system diagonally dominant in weighted spaces, and an integer Sobolev index $s$.

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

Interacting urn schemes have emerged as an important framework for studying reinforcement phenomena in interacting stochastic systems (see, e.g., \cite{launay2011interacting,launay2012generalized,WARM2014,aletti2017interacting,Synchronisation-2,kaur2023interacting,kaur2023interacting2}). Most existing results, however, are restricted to finite systems. In this article, we investigate interacting urn schemes involving infinitely many urns, where the interactions are naturally described by a directed graph. The reinforcement or drawing mechanism at each urn depends on the compositions of its in-neighboring urns. To analyze the asymptotic behavior of these systems, we develop a representation of the urn dynamics in terms of branching Markov processes evolving on a class of random forests introduced in this article. This extends the representation approach of \cite{bandyopadhyay2022new}, originally developed for single Pólya urn schemes, to interacting urn schemes on locally finite directed graphs. Using this representation, we establish almost sure convergence of the color proportions under standard conditions on the reinforcement matrix or kernel. In particular, we show that the convergence holds independently of the topology of the underlying graph, and hence our results also apply to undirected graphs, where the interactions are bidirectional. We further investigate measure-valued generalizations and other related reinforced stochastic processes, illustrating the broad applicability of the representation approach. Finally, we discuss connections with self-organized criticality.

comments
60 pages
fields
Probability
pdf ↗ page arXiv:2611.08611 ↗

The transition function of the Wright-Fisher diffusion with selection is a fundamental object for non-neutral evolutionary modelling and likelihood-based inference, but, unlike in the neutral case, existing representations are impractical or inefficient. Spectral approaches rely on truncation levels that grow with selection strength and the number of alleles, thus leading to rapidly increasing computational costs, while existing duality-based expansions lead to multi-type dual processes whose transition probabilities involve intractable normalising constants. In this paper we obtain a new transition-function representation for the multi-allelic Wright-Fisher diffusion with parent-independent mutation and genic selection that makes transition-law evaluation and simulation practically feasible in regimes where existing methods are costly or unavailable. The key tool is a new gamma duality, obtained by augmenting classical polynomial duality by an exponential tilting and yields a multivariate birth-death dual with fully explicit infinitesimal rates and an entrance-boundary construction. This is used to express the Wright-Fisher transition law as an explicit mixture of standard Dirichlet components, with mixing weights obtained from the dual started from its entrance boundary. We characterise the dual stationary distribution and its small-time behaviour, and develop practical and efficient sampling procedures for both transition and stationary laws, including a fast approximate stationary sampler with explicit error control. Numerical experiments illustrate substantial runtime gains over specialised methods in regimes where they apply, while our approach remains applicable for arbitrary numbers of alleles and selection coefficients.

fields
Probability
pdf ↗ page arXiv:2611.08623 ↗

Martingale optimal transport (MOT) is a fundamental framework in robust finance, yet its stability under marginal perturbation no longer holds in high dimensions $d\geq 2$. In this paper, we introduce Wasserstein-relaxed entropic martingale optimal transport (WEMOT), which combines Wasserstein relaxation of the second marginal with entropy regularization. This formulation ensures stability under perturbations of the marginals, thereby facilitating numerical implementation. We establish strong duality and dual attainment for WEMOT, which leads to efficient Sinkhorn-type algorithms. We further prove a convergence rate of WEMOT to MOT as regularization parameters vanish, and also the quantitative stability of WEMOT with respect to marginal perturbations.

comments
49 pages, 5 figures
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2611.08743 ↗

We consider affine stochastic recursions $X^x_{n+1}=A_{n+1}X^x_n+B_{n+1}$ in $\mathbb{R}^d$, where $(B_n,A_n)$ are i.i.d. in $\operatorname{Aff}(\mathbb{R}^d)$ with strongly irreducible and proximal linear part. In the critical regime where the top Lyapunov exponent vanishes, we show that the recursion is locally contractive in every direction, yielding uniqueness, up to a positive multiplicative constant, of the $μ$-invariant non-zero Radon measure. This extends to every dimension $d\geq 2$ a result of Babillot-Bougerol-Élie (1997) in dimension one. The proof is based on the study of the asymptotic behaviour of the "joint process" $(X^x_n,X^y_n)$, using geometric and measure-theoretic properties of the diagonal affine action. A key ingredient is an abstract criterion for the total dissipativity of semigroup actions, which we apply to this process.

comments
64 pages, 4 figures
fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2611.08806 ↗

We study the problem of causal effect identification from an arbitrary set of observational and/or interventional distributions, which we call Universal Identifiability (uID). The uID problem generalizes existing classical identifiability (ID) and general identifiability (gID) problems, which considered the identification problem from either mere observational distributions or a specific type of interventional distributions. Prior research has established graphical criteria to determine when a causal effect is identifiable in ID and gID problems. Moreover, algorithms that leverage do-calculus and basic probability manipulations have been proposed to compute these effects. Consequently, it has been shown that do-calculus is both sound and complete in these problems. Despite these well-established results, a formal definition of what it means for the do-calculus to be complete does not exist. We propose a rigorous formalization for the completeness of the do-calculus and show that the completeness results in previous work remain valid. However, for more general problems, such as uID, the rules of do-calculus are no longer complete. This is perhaps the reason why the uID problem has remained open thus far.

fields
Probability
pdf ↗ page arXiv:2611.08916 ↗

In this note, we correct an error in the proof Theorem 1 of Comm. Math. Phys. 401 (2023), 2459-2482.

comments
5 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.09151 ↗

Motor insurance claims management increasingly faces a dual objective: controlling claim costs while reducing greenhouse-gas emissions associated with vehicle repair decisions. This paper proposes a bivariate, discrete-time modelling framework that links the dynamics of financial claims and repair-related carbon footprint inspired by a BINAR(1) dependence structure, allowing for temporal persistence, cross-dependence and a positive/negative correlation between the two dimensions. Using externally sourced emission factors and cost information for replacement parts, we operationalise the carbon footprint of claims under two repair pathways: new parts versus circular-economy reused parts (PIEC). We then conduct scenario analyses in which the acceptance rate of reused parts varies, and we quantify the joint implications for expected monetary outlays and CO 2 -equivalent emissions. Results show that higher PIEC acceptance can simultaneously reduce expected emissions and average claim cost, and the magnitude of the joint benefit depends on the dependence structure and persistence captured by the BINAR(1) process. The proposed framework provides a transparent, reproducible tool for insurers to evaluate repair-policy levers and to align claims operations with decarbonisation targets while retaining an explicit stochastic risk perspective.

fields
Probability
pdf ↗ page arXiv:2611.09213 ↗

We study mesoscopic fluctuations of linear eigenvalue statistics for random $d$-regular graphs on $N$ vertices with fixed $d\ge 3$. Revisiting the approach developed by Dumitriu-Johnson-Pal-Paquette (2013) and Johnson (2015), we establish a mesoscopic central limit theorem in the bulk and identify its universal limiting variance. Our result applies to test functions with smooth compactly supported Fourier transforms and to a specific range of spectral scales $(\log N)^{-1}\llη\ll 1$. In particular, this case study allows the mesoscopic scale to tend to zero arbitrarily slowly.

fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.09215 ↗

Let $\mathcal{G}$ be a graph equipped with random conductance. We give sufficient conditions for the Markov chain on $\mathcal{G}$ to exhibit large scale fluctuations in its on-diagonal heat kernel and in exit times. The conditions also imply non-tightness of the height process w.r.t. the quenched measure, while it is tight w.r.t. the annealed measure. As an application of the general theory, we prove large scale fluctuations for the simple random walk on $1$-dimensional critical long-range percolation.

comments
38 pages, 3 figures
fields
Probability
pdf ↗ page arXiv:2611.09427 ↗

For the Kostlan-Shub-Smale field $X$ of degree $k\ge3$ on the sphere $\mathbb{S}^{d-1}$, we prove the two-sided bound $(1-\varepsilon(u))\,δ_{*}(u)\le\mathbb{P}\{\sup X>u\}\leδ_{*}(u)$ at every finite $(k,d)$, where $δ_{*}(u)$ is the expected number of critical points above $u$, halved when $k$ is even, and $\varepsilon(u)$ is explicit for $ρu\ge\min\{d-1,\frac32\sqrt{2(d-1)}\}$. The gap is therefore at most of order $e^{-(1+ρ^{2})u^{2}/2}$ with $ρ^{2}=k/(2(k-1))$. We also give $δ_{*}$ itself in closed form, as a finite sum of Hermite polynomials, together with a two-term envelope that is asymptotically sharp and a single-monomial relaxation of the form $Cu^{d-2}e^{-u^{2}/2}$. As an application we bracket the annealed complexity of the spherical $k$-spin Hamiltonian at every finite $(k,d)$: the upper bound holds at every energy, a lower bound of the same form at every energy above $9/4$ times the spectral edge $\sqrt{2(d-1)}/ρ$, above twice the edge when $d\ge10$, and is consistent with the Auffinger-Ben Arous-Černý complexity function as $d\to\infty$.

comments
36 pages, 2 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.09459 ↗

We determine sharp universality thresholds for quotients of the free profinite group $\widehat F_n$ on $n$ generators by $n+u$ independent random relations, where $u$ is a fixed nonnegative integer. For products of mutually independent uniformly coset-balanced factors, convergence to the Liu–Wood measure $μ_u$ holds when the minimum number of factors grows faster than $\log n$, which is a uniformly sharp condition. For random words of fixed length $\ell_n$, convergence holds exactly when $\ell_n$ is eventually odd and $\ell_n-\log n\to\infty$. We also prove universality for randomly ordered products of independent integer powers under the balance condition $nα_{n,p}/\log n\to\infty$ at each fixed prime, recovering finite-prime cokernel laws by abelianization.

comments
21 pages
fields
Probability, Group Theory
pdf ↗ page arXiv:2611.09477 ↗

We study a system of interacting agents in which a backward stochastic equation is coupled to the forward evolution of a probability-valued strategy distribution. The agents interact through their empirical state–strategy law and are exposed to a common Brownian noise. Under Lipschitz, mass-conservation, and positivity assumptions, we establish well-posedness of the finite-agent system on a sufficiently short time interval. We then identify its large-population limit as a conditional mean-field backward–forward system and prove conditional propagation of chaos. When agent characteristics take finitely many values, we obtain order $N^{-1}$ bounds for the expected squared particle–copy error and the expected squared Wasserstein distance of order one between the empirical law and the conditional limiting law. An adaptive-strategy model with replicator dynamics illustrates the theory, accompanied by a numerical comparison of the two errors.

fields
Probability
pdf ↗ page arXiv:2611.09487 ↗

We study the probability that a branching random walk in ${\bf Z}^d$ driven by a Galton-Watson tree conditioned to have $n$ vertices does not hit a fixed point. For $d\in\{1,2,3\}$ this probability behaves like $n^{-α/4}$ in logarithmic scale, where $α=4$ when $d=1$, $α=2\sqrt{2}$ when $d=2$, and $α=(\sqrt{17}-1)/2$ when $d=3$.

comments
14 pages
fields
Probability
pdf ↗ page arXiv:2611.09503 ↗

We prove a large deviation estimate for singular current observables of the two-dimensional symmetric simple exclusion process. In particular, the observable has a non-standard large deviation scaling $N^2(\log N)^{-1}$ due to the presence of singular vortices, whereby trajectories rotating near the origin point yield an enhanced contribution to the current observable. The proof combines the heuristics of Bodineau-Derrida-Lebowitz 2008, the averaging method of Jara-Menezes 2018, and novel cancellation and multi-scale renormalization arguments developed by this paper.

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

We study the variance of the reference-centered discrete total variation $d_{\mathbf p}=\sum_{j=1}^{n-1}|X_{j+1}-X_j-N(p_{j+1}-p_j)|$ of $X\sim\mathrm{Mult}(N;\mathbf p)$ for fixed $n\ge3$ and fixed $\mathbf p$ with all $p_i>0$, as $N\to\infty$. We prove $\mathrm{Var}(d_{\mathbf p})=N\,v(\mathbf p)+O(1)$, where $v(\mathbf p)$, the variance of the sum of absolute values of the limiting Gaussian edge vector, is expressed through the exact multinomial edge variances and correlations and Nabeya's covariance formula for folded bivariate normal variables. Unlike in the uniform case, non-adjacent edge pairs generally contribute to $v(\mathbf p)$. The $O(1)$ remainder is controlled by a lattice Edgeworth expansion and Poisson summation; it oscillates with the lattice phases $\{N(p_{j+1}-p_j)\}$, and for $n=3,4$, where a pair of edges exhausts the bins, the summation runs over a sublattice coset. The formula reduces to the known uniform result (the classical Hoel–Kamat variance), gives a closed form when the reference law is a symmetric comb, and has a shape-independent large-bin limit for positive $C^1$ profiles. For the statistic $d_{\mathbf r}$ centered at a reference law $\mathbf r\ne\mathbf p$ the absolute values linearize: when every edge is mismatched the variance is that of a linear form in the counts up to an exponentially small error, and in mixed (triangular-array) regimes it is given to $o(N)$ by bivariate folded-normal covariances. The two-bin formulas are recorded from the companion preprints, and exact finite-$N$ reductions for $n\le4$ are used for validation.

comments
45 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.09592 ↗

We prove sharp dimension-free $L^1$-Poincaré inequalities on Hamming cubes, a sharp quadratic $L^1$-Poincaré inequality on product Poisson spaces, and a sharp pseudo-Poincaré inequality on finite abelian Cayley graphs. These inequalities use a generalization of the Beckmann boundary introduced by Ivanisvili, Xie, and Zhang. In particular, we prove that the optimal dimension-free constant in the classical $L^1$-Poincaré inequality on the Hamming cube is $\sqrt{π/2}$, answering a question of Ivanisvili et al. Semigroup duality and explicit Malliavin weights reduce these estimates to integrals of first absolute moments of centered Bernoulli and Poisson sums. The key ingredient is a Fourier positivity principle, which shows that replacing the coefficients by their absolute values can only increase these integrals. For the underlying Bernoulli functional at subquadratic exponents, we also characterize the maximizers and determine their exact phase transitions.

comments
27 pages
fields
Probability, Functional Analysis
pdf ↗ page arXiv:2611.09620 ↗

Let $R_n$ denote the radius of the smallest ball containing an i.i.d.\ sample of spherically symmetric random vectors in $\mathbb R^d$, and let $D_n$ be the sample diameter. While the asymptotic behaviour of $D_n$ is well understood, much less is known about $R_n$. Starting from a classical result of Daniels for planar Gaussian samples, we develop a point-process approach to the asymptotic behaviour of $R_n$ in the three classical extreme-value regimes. We obtain limit theorems in the Gumbel, Fr'echet and Weibull cases, with the limiting laws described by geometric functionals of Poisson point processes. In dimension two, the Gumbel limit can be identified explicitly and is universal within the corresponding max-domain of attraction. We also study the asymptotic relationship between $R_n$ and $D_n$ and the supporting configurations of the smallest enclosing ball.

comments
46 pages, 5 tables
fields
Probability
pdf ↗ page arXiv:2611.09726 ↗

We investigate the following: do existence bounds obtained by interlacing methods describe the spectra of typical random graphs? Depending on the model, we provide both positive and negative answers. We establish a Friedman-type theorem for zig-zag products of random regular graphs $G$ with a fixed vertex-transitive gadget $H$, where $G$ is sampled from independent permutations or matchings. We prove that the new spectrum converges in Hausdorff distance to that of the zig-zag product of the infinite regular tree with $H$. In particular, the new spectral radius converges to the sharp threshold established by Cohen, Cohen, and Maor. We establish the spectral limit using strong convergence and, drawing on quantitative estimates of Chen, Garza-Vargas, Tropp, and van Handel, obtain an $O(1/n)$ upper-tail bound in the permutation model. For the irregular configuration model, we show that the interlacing bound of Cohen and Maor, asymptotically $2\sqrt{μ-1}/μ$ for limiting average degree $μ$, is atypical: for uniformly bounded degree sequences with a nonconstant limiting degree law of minimum $δ\ge 2$, a random graph exceeds the interlacing bound by a positive constant with high probability. This gap is explained by the limiting spectral distribution, whose support edge is $2\sqrt{δ-1}/δ$. Strikingly, unlike the familiar behavior of random regular graphs, our experiments reveal second eigenvalues that remain far below this limiting edge even for the largest graphs tested. For $δ\ge3$, we propose that the scarcity of minimum-degree trees explains this behavior; estimates for their size suggest spectral witnesses within $O\left((\log\log n)^{-2}\right)$ of the limiting edge, which is consistent with our numerical observations.

comments
31 pages, submitted
fields
Probability, Group Theory, Operator Algebras
pdf ↗ page arXiv:2611.09732 ↗

We consider Bernoulli bond percolation on the grandparent graph of a Bienaymé tree, obtained by adding to the tree an edge between every vertex and its grandparent. We show that the critical parameter $p_c$ is the unique solution of an explicit equation involving the generating function of the offspring distribution, and we study how $p_c$ depends on this distribution beyond its mean $m$. When $m\geq 1.569$, the offspring distribution concentrated on the (one or two) integers closest to $m$ is the unique maximiser of $p_c$ among all offspring distributions with mean $m$, and its critical parameter is $\frac1{m^2}-\frac1{m^3}+O\left(\frac1{m^4}\right)$ as $m\to\infty$; more generally, for two distributions that are comparable in the convex order, $p_c$ is larger for the smaller of the two distributions under the condition that its support bounded some explicit $N(m)$ of order $m^4$. These restrictions cannot be removed: the convex order alone does not determine the order of the critical parameters, even among distributions with support bounded by $O(m^4)$, and the extremal property fails for $m$ close to $1$. Finally, for every $m>1$, the critical parameter $p_c$ can be arbitrarily close to $0$ for general offspring distributions with mean $m$. If we only consider offspring distributions that do not charge $0$, so that the obtained tree is almost surely infinite, this remains true if and only if $m\geq 2$.

fields
Probability
pdf ↗ page arXiv:2611.09762 ↗

The friendship paradox says that, on average, the neighbours of a vertex have more neighbours than the vertex itself. We study the size of this effect, the average over all vertices of the mean degree of the neighbours minus the degree of the vertex, in the random geometric graph on the torus with the maximum-norm distance. We determine its limit law in every regime of the connection radius and quantify the approximation by non-asymptotic error bounds in the Kolmogorov distance or the total variation distance. We also give its exact mean for every $n$ and every radius below one half. For a fixed radius the limit is not Gaussian but a weighted sum of centred exponential variables; when the radius shrinks and the expected degree grows, the statistic is asymptotically Gaussian, with a Berry–Esseen bound; for bounded expected degree it is Gaussian at the classical rate; and when the expected degree tends to zero it is asymptotically Gaussian, Poisson or identically zero, depending on how fast the radius shrinks. When the expected degree is large, the proofs rest on the vanishing of the first Hoeffding projection, which makes a degenerate $U$-statistic of pairs of points the source of the fluctuations; it is analysed by Fourier series for a fixed radius and by Stein's method of exchangeable pairs for a shrinking radius. For bounded expected degree we use normal approximation for local functionals, and for vanishing expected degree the Chen–Stein method.

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

We consider a countable family of random variables which are conditionally independent given a latent random variable $Z$. Given $Z$, the random variables are independent. Hence the Malliavin calculus for independent random variables applies for each value of $Z$. We show that these constructions fit together. We obtain the chaos decomposition, the domains of the Malliavin operators, the Mehler formula and the carré du champ operator, with conditional expectations given $Z$ in place of ordinary expectations. For normal approximation, conditioning on $Z$ and the infinite de Jong theorem of Döbler give mixed normal approximations of degenerate U-statistics, in Wasserstein and Kolmogorov distances. Working under the unconditional probability, we obtain a de Jong type bound for U-statistics whose kernels are products. In both cases, the fluctuations of the conditional variance appear as an additional term, which cannot be removed. As an application, we consider subhypergraph counts in a random $3$-uniform hypergraph built on a latent random graph. For the count centred at its conditional mean, we obtain an explicit rate in Wasserstein distance. It reduces to the known rate for the Erdős–Rényi hypergraph when the latent graph is complete. The count centred at its mean is a pattern count in a non-uniform hypergraph with independent edges, which gives a necessary and sufficient condition for its asymptotic normality.

comments
New version: the Malliavin structure follows Döbler (arXiv:2609.15725); errors of v1 corrected; complete proof of the rate for the conditionally centred count
fields
Probability
pdf ↗ page arXiv:2611.09772 ↗

We study the one-dimensional block Anderson model with independent $W\times W$ Gaussian unitary ensemble potentials and deterministic nearest-neighbor hopping, with hopping-to-disorder ratio $g$. The system consists of $L$ blocks, with total dimension $N=WL$. As $W\to\infty$, we identify the bulk localization length, up to an arbitrarily small power of $W$, with $\min\{N,\max\{W,W^2g^2\}\}$, uniformly for deterministic couplings $g\ge0$ and cycle lengths $L\ge3$. For every fixed $D>0$ and all sufficiently large $W$, the expected fraction of eigenvectors in the selected energy interval satisfying these bounds is at least $1-W^{-D}$. In polynomial volume the bounds hold simultaneously for all eigenvectors in that interval with probability at least $1-W^{-D}$. The localization length is the number of coordinates in the shortest cyclic interval containing at least half of an eigenvector's mass.

code
github.com/JYin80/Lean-LSBA1d ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 6faccdc, checked 2026-11-09 build details
comments
189 pages, 4 figures. Lean formalization repository: https://github.com/JYin80/Lean-LSBA1d
fields
Probability, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.09776 ↗

In this paper, we provide a new set of tools for establishing the number rigidity of point processes which are particularly well suited for the spectral processes of stochastic operators. These tools allow one to prove the number rigidity of a wide class of stochastic operators that had been previously inaccessible to the standard methods in the area, such as the variance of linear statistics, which require being able to precisely analyze correlations between individual points. We propose an alternative mechanism which uses a pathwise comparison between the growth rate of the unperturbed eigenvalues and the cumulative random noise which allows one to convert the probabilistic problem into a more tractable perturbation theory problem. This new approach allows us to prove the rigidity of previously inaccessible operators including those with heavy tailed perturbations or complex correlation structures. As a demonstration, we use these tools to prove the number rigidity of new classes of stochastic Schrödinger and Sturm-Liouville Operators which are resistant to analysis using the standard rigidity toolkit.

comments
12 pages
fields
Probability
pdf ↗ page arXiv:2611.09811 ↗

We study time-fractional diffusion on real hyperbolic space $\mathbb H^n$, $n\ge2$, with Caputo order $0<α<1$. We establish global two-sided pointwise estimates for the homogeneous fundamental kernel $Z_{\mathbb H}(t,r)$ and the inhomogeneous (Duhamel) kernel $Y_{\mathbb H}(t,r)$, uniformly over all $t>0$ and positive geodesic distances $r$. By combining inverse-stable subordination with global bounds for the hyperbolic heat kernel, we distinguish a short-time local regime, a large-time interior region, and an exterior region governed by a saddle-point problem with parameter $r/t$. Both kernels have the same exterior exponential rate, while their amplitudes are related by an explicit saddle-point factor. The estimates are uniformly comparable on the interfaces between regimes, recover the Euclidean time-fractional singularities at small scales, and identify the influence of hyperbolic geometry on large-scale decay. The kernel $Z_{\mathbb H}$ also describes the one-time marginal density of hyperbolic Brownian motion under an independent inverse stable clock. This representation yields a radial limit law, moment and quantile asymptotics, and a change in the mean square displacement from order $t^α$ at small times to order $t^{2α}$ at large times.

comments
35 pages
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.09890 ↗

Combinatorics25

We prove a degree-sequence resilience theorem for Hamilton Berge cycles in random uniform hypergraphs. For every fixed integer $k\ge3$ and every $γ>0$, there exists $C=C(k,γ)>0$ such that if $C\log n/n^{k-1}\le p\le1$, then asymptotically almost surely every spanning subhypergraph of $H^{(k)}(n,p)$ with increasing vertex-degree sequence $g_1\le\cdots\le g_n$ satisfying \[ g_i\ge\left(\left(\frac{i}{n}\right)^{k-1}+γ\right) \binom{n-1}{k-1}p \qquad(1\le i<n/2) \] contains a Hamilton Berge cycle. The term $(i/n)^{k-1}$ agrees with the normalized asymptotic degree bound in Salia's deterministic Pósa-type theorem. Our result gives a hypergraph analogue of the random-graph theorem of Condon et al. and strengthens the sharp Dirac-type resilience theorem of Chen and Zhang at the same logarithmic probability order. The deletion-resilience formulation has optimal probability order up to constant factors. The coefficient $1$ of $(i/n)^{k-1}$ cannot be replaced by a smaller constant. The proof controls adaptive rotations and representative-edge incidences uniformly. It also gives an endpoint-growth estimate under nonuniform deletion bounds.

fields
Combinatorics
pdf ↗ page arXiv:2611.08525 ↗

A proper conflict-free coloring is a proper coloring in which each nonisolated vertex has a neighbor whose color occurs exactly once in its open neighborhood. We prove that deciding whether the clique number of colors suffices is NP-complete on undirected path graphs, even with a supplied representation by paths in a star. One extra color suffices on every instance in the reduction. We also prove NP-completeness on chordal bipartite graphs for every fixed palette size $k\ge4$. For strongly chordal graphs, reverse simple elimination gives a constructive upper bound of one more than the clique number. We obtain exact polynomial-time algorithms under several conditions on the maximum cliques, including when they induce a connected subtree of a clique tree. For strictly chordal graphs we characterize the optimum and construct an optimal coloring in $O(n+m)$ time, where $n$ and $m$ count the vertices and edges. For strongly chordal graphs with clique-tree separators of size at most $s$, we give an exact algorithm in $n^{2^{O(s+1)}}$ time, with no bound on the clique number.

fields
Combinatorics
pdf ↗ page arXiv:2611.08534 ↗

A graph $G$ is said to be $H$-free if it contains no copy of $H$. The generalized Turán number $\mathrm{ex}(G, H)$, a natural extension of the classical Turán number, is defined as the maximum number of edges in an $H$-free spanning subgraph of $G$. Although $\mathrm{ex}(G, H)$ has been extensively studied for various specific graphs $G$, such as hypercubes, complete transposition graphs, and doubled Johnson graphs, very few results are known for general graphs. For a graph $G$ of girth $g$, let $C_{g}$ denote the cycle of length $g$. In this paper, we investigate the generalized Turán number $\mathrm{ex}(G, C_{g})$ for graphs $G$ in which every edge is contained in a fixed number of $g$-cycles, and establish a general upper bound on it. This bound generalizes the classical results on hypercubes and provides a unified approach for general graphs. Furthermore, we apply this bound to derive explicit upper bounds for several specific graphs, including $K_{n,n,\ldots,n}$, $K_{n}\times K_{n}$, $C_{m}\times C_{n}$, $S_{n}$, $AG_{n}$, $CT_{n}$ and $J(n;k,k+1)$.

fields
Combinatorics
pdf ↗ page arXiv:2611.08547 ↗

A graph is word-representable if it can be represented using alternation of letters in words. The class of word-representable graphs generalizes several important graph families and admits a characterization via semi-transitive orientations. Recognizing word-representability is an NP-complete problem, and a major bottleneck in the theory of word-representable graphs is providing efficient justifications of non-word-representability of graphs, rather than merely referring to software verification. Recently, Kitaev and Sun initiated the development of methods for the automatic generation of human-verifiable proofs of non-word-representability. They introduced three algorithms and evaluated their performance on the 25 connected non-word-representable graphs on seven vertices, which constitute a fairly small sample set. In this paper, we confirm their ranking of the algorithms by testing them on all non-word-representable graphs on eight and nine vertices. We further introduce three new algorithms, one of which significantly outperforms the previously best method on graphs with at most nine vertices, producing substantially shorter proofs. We apply this algorithm to shorten a known proof of non-word-representability of the Shrikhande graph and to produce a proof of non-word-representability of a certain subgraph of the Kneser graph $K(8,3)$. This subgraph is the first known example of a triangle-free non-word-representable graph, presented in the literature with reference only to a computational proof. As a by-product of our study, we correct an error in the repeatedly published list of the 25 connected non-word-representable graphs on seven vertices.

fields
Combinatorics
pdf ↗ page arXiv:2611.08553 ↗

We extend the auxiliary-field method for scattered subspaces to evasive subspaces and subspace designs. For $1\le h\le k<hn$ and coprime $h,k+1$ with $n(k-h+1)\ge k+1$, we construct spanning $(h,k)$-evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^n}^r$ of dimension $rn(k-h+1)/(k+1)$ in every sufficiently large admissible ambient dimension, with a threshold independent of $q$. When $k<n$, this dimension is maximum. The proof combines an intersection lemma, a rank-support density inequality, scalar orbit counting, and a profile preserved by direct sums. The coding consequences include, for every fixed odd extension degree $m\ge3$ and every sufficiently large $K$, minimal rank-metric codes of optimal length $2K$ with first two generalized weights $(m+1)/2$ and $m+1$. For these codes the stable profile is equivalent to minimality with the largest possible minimum distance; for even $m$ the analogous class consists of minimal MRD codes. More generally, for $1\leτ\le m-2$ and $\gcd(m,τ+1)=1$, we obtain nondegenerate $τ$-minimal codes of length $(τ+1)K$ for every sufficiently large $K$, uniformly in $q$. We also construct maximum $h$-designs whose number of members grows exponentially with the ambient dimension at fixed $q,n,h$, and the associated maximum sum-rank distance (MSRD) codes with a growing number of equal long blocks. In extension degree five, the ordinary and $2$-minimal constructions hold for every $q$ and every $K\ge32$ and $K\ge59$, respectively.

comments
33 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.08627 ↗

We count solutions of composition identities for maps on finite sets, first for three identities in which both maps vary and then for commutation with a prescribed arithmetic map. For $f\circ g=f\circ g\circ g$, drawing an arrow from each element to its image reduces the enumeration to rooted trees attached to directed cycles. For $f\circ f=f\circ g\circ f$, grouping elements with the same $f$-value leads instead to a partition-based enumeration. A classical rooted-forest enumeration leads in both problems to $\mathcal T(x)$, the exponential generating function for rooted labeled trees. For $f=g\circ f\circ g$, the values on the cycles of $g$ determine all remaining values. The exponential generating function $\mathcal D$ for these ordered pairs and the ordinary generating function $\mathcal A$ for endofunctions up to relabeling satisfy $\mathcal D(x)=\mathcal A(\mathcal T(x))$. Finally, we count functions on $\mathbb Z/n\mathbb Z$ satisfying $f(ax)=af(x)$, first for prime multipliers $a$ and then for a broader class of composite multipliers. In each problem, fixing one map exposes independent choices for the other through its functional digraph or its fibers.

fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.08674 ↗

Reflexive polytopes are lattice polytopes containing the origin in their interior such that also the dual polytope is a lattice polytope. On the basis of low-dimensional observations and of bounds known for special classes of reflexive polytopes, the second author conjectured in 2004 that the number of vertices of $d$-dimensional reflexive polytopes is bounded from above by $6^{d/2}$. In this note, we present counterexamples showing that this conjecture is false in every dimension $d \ge 8$. In fact, rather surprisingly, in sufficiently large dimensions $d$ the number of vertices (equivalently, by duality, the number of facets) can be as large as theoretically possible, namely doubly exponential in $d$. These results were found using GPT-6.1 Sol.

comments
12 pages, 1 figure
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.08819 ↗

Let $P$ be a set of $n$ points in the plane, and let $C$ be a compact, convex subset of the plane that contains the origin in its interior. We study the problem of finding two points $p$ and $q$ of $P$ with the property that any homothet of $C$ that contains $p$ and $q$ must contain at least a constant fraction of the points of $P$. We give proofs for several cases. When $C$ is strictly convex we achieve a fraction of $1/5$, and when $C$ is a general convex region we achieve a fraction of $1/6e$. We show how the ideas of this second bound can be used to prove a lower bound for a version of the problem in $\mathbb{R}^d$ when $C$ is a $d$-ball. We also consider a few special cases. When $C$ is a triangle we get a lower bound of $1/12$, and when we allow that triangle to be rotated by $π$ radians in addition to being scaled and translated we get a lower bound of $1/768$. In proving this last result, we improve the state of the art on the version of this problem in three dimensions, where $C$ is a parallelepiped. We also consider the algorithmic aspects of finding such a pair of points.

fields
Combinatorics
pdf ↗ page arXiv:2611.08835 ↗

We prove that every signed planar graph $\widehat G$ of negative girth at least $\ell\geq 3$ satisfies $χ_c(\widehat G)<\frac{2\ell}{\ell-2}$. As a consequence, for every integer $k\geq 1$, every planar graph $G$ of odd girth at least $4k+3$ satisfies $χ_c(G)<\frac{2k+1}{k}$ and hence admits a homomorphism to $C_{2k+1}$. Our proofs build on recent results of Jafari on circular flows. In particular, Jafari proved that every $(4k+2)$-edge-connected graph has circular flow number strictly less than $2+\frac{1}{k}$. We revisit his theorem, providing an alternative proof that emphasizes the underlying graph-theoretic ideas. We also extend the result to signed graphs and weaken the connectivity assumption by imposing a lower bound only on the size of negative cuts. The key step is a small-correction lemma associated with a distribution on spanning trees. A splitting argument first gives the required correction in an even-degree graph; doubling the edges removes the degree-parity assumption. Plane duality then gives the coloring theorem. We discuss tightness of bounds in the end.

fields
Combinatorics
pdf ↗ page arXiv:2611.08862 ↗

The smallest known trivalent graph of girth 14 is constructed. The graph has 372 vertices, improving the old upper bound of 384 \cite{exoo14}. The construction uses methods that may be new to this problem.

comments
6 pages and 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.09000 ↗

For every $δ>0$, we construct infinitely many pairwise combinatorially distinct convex three-dimensional polytopes whose dihedral angles are all less than $π/2+δ$.

comments
6 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.09021 ↗

Let $σ_r(\mathcal{H})$ be the minimum sum of vertex degrees over all nonedges of an $r$-uniform hypergraph $\mathcal{H}$ on $n$ vertices. Balogh, Palmer and Raeisi conjectured that $n>2rs$ and $σ_r(\mathcal{H})>r[\binom{n-1}{r-1}-\binom{n-s}{r-1}]$ imply the existence of a matching of size $s$ in $\mathcal{H}$. We prove that, for every fixed $r\ge3$ and all sufficiently large $s$, $σ_r(\mathcal{H})>r[\binom{n-1}{r-1}-\binom{n-s}{r-1}]$ forces an $s$-matching whenever $n\ge rs+\lfloor(r-1)^{r-1}/r^{r-2}\rfloor$. A complete $r$-graph on $rs-1$ vertices together with $\lfloor(r-1)^{r-1}/r^{r-2}\rfloor$ isolated vertices shows that the vertex bound is sharp for all sufficiently large $s$. By adding new vertices to $\mathcal{H}$, retaining all its edges, and adding every $r$-set containing at least one new vertex as an edge, we also deduce that $n\ge rs+C$ suffices under the same degree condition for every $s\ge1$, where $C$ is a finite constant depending only on $r$. For $r=3$, we provide the explicit sufficient order $n\ge\lceil(7s+11)/2\rceil$ for $s\ge6$, together with bounds for $2\le s\le5$, establishing the conjecture in this uniformity. For $s=2$, we improve the known sufficient order $2r+2$ to $2r+1$ for every $r\ge3$ and show that this order is best possible.

comments
30 pages, no figures
fields
Combinatorics
pdf ↗ page arXiv:2611.09064 ↗

A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every subset $S\subseteq V(G)$ with $|S|=k$, and is minimal if $G-e$ is not $k$-factor-critical for every edge $e$ of $G$. The cases $k=1$ and $k=2$ correspond to factor-critical and bicritical graphs, respectively. In this paper, we obtain complete structural characterizations of claw-free minimal factor-critical graphs and claw-free minimal bicritical graphs. The former is characterized by ear decompositions. For the latter, we first characterize the $3$-connected case using the theory of line graphs and then extend the characterization to the general case by a suitable $2$-sum operation.

comments
14 pages, 1 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.09072 ↗

We study adaptive quantitative group testing with one defective item in each of two disjoint sets. When one set has fixed size, we determine the leading term of the difference between the binary bound and the largest searchable opposite set size. The result extends to fixed unions of complete bipartite graphs and to positive weighted sums of the opposite set sizes. We determine exact eventual formulas when the fixed set has six, seven or eight items. The eight-item formula has a period-three correction. We explain this correction by optimizing the sizes of shared test pieces within fixed decision-tree prefixes. For each fixed finite family of such prefixes ending in star forests, the optimal deficit is eventually a rational polynomial plus a bounded periodic function. The asymptotic proofs are analytic; the exact formulas also use integer constructions and rational exclusion certificates.

comments
28 pages. Reproducibility materials: https://doi.org/10.5281/zenodo.23996093
fields
Combinatorics
pdf ↗ page arXiv:2611.09076 ↗

For a graph $G$, let $q(G)$ be the minimum number of distinct eigenvalues of a real symmetric matrix whose off-diagonal zero–nonzero pattern is $G$. We prove that $q(G)=2$ whenever the complement $H=\overline G$ of a graph of order $n\ge3$ has at most $n-3$ edges, resolving the sparse-complement conjecture of Fallat and Mojallal. If $H$ contains a cycle, the proof constructs a nontrivial orthogonal projector with the strong spectral property and rank at most $|E(F)|-|V(F)|+4$, where $F$ is the union of the cyclic components of $H$. The construction combines faithful stress-free Gram representations, a one-coordinate lift for each excess core edge, exact orthogonal-frame completion, and a Stiefel-manifold pendant-extension argument.

comments
12 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.09111 ↗

We prove that every IC-planar graph has weak-strict degeneracy at most $6$. Weak-strict degeneracy is the weak degeneracy of Bernshteyn and Lee plus one, so it bounds the coloring parameters controlled by weak degeneracy. In particular, every IC-planar graph is $6$-choosable, $6$-DP-colorable and $6$-paintable, which strengthens the theorem of Yang, Wang, Wang and Lih that IC-planar graphs are $6$-choosable. An IC-planar graph is a subgraph of a plane graph in which a set of pairwise vertex-disjoint inner $4$-faces, called marked faces, receive both diagonals. Our main tool is a Thomassen-type statement for such graphs: vertices of marked faces get one extra unit, except those in a prescribed independent set of boundary vertices. With no marked faces, this statement is exactly the theorem of Bernshteyn, Lee and Smith-Roberge that gives weak-strict degeneracy at most $5$ for planar graphs, so it contains both results. We prove it by a minimal-counterexample argument following Bernshteyn, Lee and Smith-Roberge. The new ingredients are a deletion rule that turns destroyed marked faces into ordinary edges, a pseudo-$2$-chord lemma for paths that use one diagonal, and a choice of orientation of the outer cycle that avoids a vertex of the independent set joined to two vertices of the prescribed boundary path.

comments
19 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.09125 ↗

In this note, we investigate the diagonal Ramsey number of the Petersen graph, denoted by \(R(\mathcal{P}, \mathcal{P})\). To the best of our knowledge, the dynamic survey \textit{Small Ramsey Numbers} (Revision \#18, 2026) records the lower bound as 19, established by Harborth and Krause. We construct a novel 2-coloring on the complete graph \(K_{20}\) that avoids any monochromatic Petersen graph. By defining the blue graph as the complement of the red graph, we utilize a specific join graph structure \(K_{9,9} \vee \overline{K_2}\). We rigorously prove its Petersen-free property, thereby improving the previously documented lower bound to \(R(\mathcal{P}, \mathcal{P}) \ge 21\). Furthermore, we demonstrate the limit of this structural family by showing that the natural extension \(K_{9,9} \vee \overline{K_3}\) contains a Petersen subgraph.

fields
Combinatorics
pdf ↗ page arXiv:2611.09347 ↗

In this paper, we establish a Motzkin-Straus type equality for k-uniform hypergraphs under certain conditions, which extends the classical Motzkin–Straus theorem for graphs. Using this equality, we present several spectral bounds for the clique number of k-uniform hypergraphs in terms of the spectral radii of the adjacency, signless Laplacian, and Laplacian tensors. When k=2, the bounds coincide with the corresponding known results for graphs.

fields
Combinatorics
pdf ↗ page arXiv:2611.09357 ↗

The Wiener index $W(G)$ of a connected graph $G$ is the sum of distances between all unordered pairs of its vertices. A vertex $v$ is called a Šoltés vertex if $G-v$ is connected and $W(G-v)=W(G)$. Since the cycle $C_{11}$ is the only known graph in which every vertex is a Šoltés vertex, a natural problem is to construct other graphs with as large a proportion of such vertices as possible. We construct a $4$-regular graph with Šoltés fraction $4/5$, improving the previous value of $2/3$.

fields
Combinatorics
pdf ↗ page arXiv:2611.09416 ↗

The author investigates mutual visibility in regular graphs of girth at least 5, with particular emphasis on graphs with excess. A general upper bound on the mutual-visibility number is established in terms of the degree and order. More significantly, an algebraic inequality is derived that restricts the mutual-visibility number of $(d,5,+δ)$-graphs. As applications, the mutual-visibility number of the Robertson graph is shown to be 9, and upper bounds are obtained for the $(5,5)$-cages and the $(6,5)$-cage.

comments
6 pages, 1 figure, i table
fields
Combinatorics
pdf ↗ page arXiv:2611.09513 ↗

Dallard, Milanič, and Štorgel, and independently Gartland and Lokshtanov, conjectured that for every planar graph $H$, Maximum Weight Independent Set and List $3$-Coloring are polynomial-time solvable in $H$-induced-minor-free graphs. As a structural explanation, Gartland and Lokshtanov further conjectured that such graphs admit balanced separators dominated by a constant number of vertices. Bonnet and Chang recently refuted the independent-set part of the algorithmic conjecture, by showing that Maximum Independent Set is $\mathsf{NP}$-hard in graphs excluding the $5\times5$ grid as an induced minor. We revisit both conjectures. We show that the graphs used by Bonnet and Chang exclude much simpler planar graphs, including several $16$-vertex trees, and we introduce a second, independent family of hard instances. We also prove that $3$-Coloring is $\mathsf{NP}$-hard in both settings, thus refuting the algorithmic conjecture in full, even in its quasipolynomial version, unless $\mathsf{NP}\subseteq\mathsf{QP}$. On the structural side, we identify planar graphs $H$ for which the structural conjecture holds, while the algorithmic one fails. Thus, constantly dominated balanced separators cannot by themselves explain the tractability of Maximum Weight Independent Set and List $3$-Coloring.

comments
26 pages, 7 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.09627 ↗

Characteristic imset polytopes are convex hulls of a collection of characteristic imset vectors, which are 0/1 vectors that encode the Markov equivalence class of a directed acyclic graph. These polytopes are the feasible region of linear programs which correspond to causal discovery problems. We introduce a new family of these polytopes whose vertices correspond to directed acyclic graphs with in-degree bounded by $k$. This yields a polytope whose dimension is only polynomial in the number of nodes of the underlying graphs instead of exponential. We show that when $k = 1$, this polytope is a matroid independence polytope. For $k = 2$ we provide several large families of facet-defining inequalities, which give a complete $\mathcal{H}$-representation of the polytope on four nodes.

fields
Combinatorics, Statistics Theory
pdf ↗ page arXiv:2611.09633 ↗

We prove the Frobenius characteristic formula for the intersection of Garsia–Haiman modules predicted in the Science Fiction of Bergeron and Garsia. As a consequence, we resolve the $N!/k$ conjecture. The proof uses the geometry of the Hilbert scheme of points on the plane developed by Haiman.

comments
26 pages, comments are welcome
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.09638 ↗

In this paper, we show that for every positive integer $n \ge 24$, the maximum size of a family $\mathcal{F}$ of vectors from $\{-1,1\}^n$ with at most three distinct Hamming distances is equal to $\binom{n}{3}+n$. The threshold $n=24$ is best possible.

fields
Combinatorics
pdf ↗ page arXiv:2611.09675 ↗

Let $\mathcal{P}$ be a partition of $\mathbb{Z}^d$ into translates of the discrete unit cube $\{0,1\}^d$. For a uniformly chosen $\varepsilon\in\{0,1\}^d$, we count the cubes of $\mathcal{P}$ entirely contained in the observation window $[0,3]^d+\varepsilon$. The resulting score has mean $(3/2)^d$ for every partition, while its distribution reflects the geometry of the tiling. Comparing two such scores, with the shifts chosen independently, defines a game in which the larger score wins. In dimension $d=4$, we construct a geometric realization of the Steinhaus–Trybuła paradox: three periodic partitions form a cycle in which each beats the next with probability strictly greater than $1/2$. We describe local configurations by finite cube tiling codes and prove that every resulting list of counts is majorized by that of the simple code $C_d=\{0,2\}^d$. Nevertheless, every non-simple code differing from $C_d$ in only two coordinate directions beats it, with a sharp lower bound on the winning margin. We also show that the ratio of wins to losses of $C_d$ has limit superior at most $1$ as the dimension tends to infinity, uniformly over opposing codes. For $4\mathbb{Z}^d$-periodic tilings, changing the window size can repeatedly reverse the winner, but the winning margin eventually stabilizes separately for side lengths $4m+1$ and $4m+3$.

comments
30 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.09844 ↗

Mathematical Physics21

Many non-equilibrium systems, such as expanding plasmas, evolve by equations that depend explicitly on time and interpolate between autonomous early-time (UV) and late-time (IR) limits. After time is compactified, fixed points lie on invariant boundary fibers, where the Conley index is one-sided and blind to the UV. For time dependence that admits a $C^1$ compactification, we reflect the extended phase space across these fibers. Both sheets of the double run from the UV to the IR, and the UV index reappears, suspended by one degree. Extending one sheet slightly beyond both fibers gives an explicit UV-to-IR transport map between the Conley indices of the limit systems, and its non-vanishing forces connecting solutions. If one block with a fixed strict entrance/exit decomposition serves every frozen system, this map is an isomorphism at every admissible rate. If the block also has nonzero relative homology, the isolated invariant sets of the two limits are connected at every rate. In the Gubser flow of Israel-Stewart theory, the separatrix between two classes of initial data is a transversal connection at every finite relaxation scale $c$, with splitting $Δ(c)\propto1/c$. In the Bjorken flow at the lowest moment truncation, we prove existence and uniqueness of the attractor solution without regularization. For the three-dimensional Gubser system we construct the global Morse decomposition. In the one-loop flow of the $(4+ε)$-dimensional $O(N)$ model with cubic anisotropy, a shift of $N$ through $N=4$ has vanishing transport map, but a driven connection and a nonzero connecting homomorphism detect it at every rate.

code
github.com/stacks-ai/papers/tree/main/conley-index-dynamical-systems ∎ Lean project (conley-index-dynamical-systems/lakefile.toml, conley-index-dynamical-systems/lean-toolchain) builds, no sorry at 6af6d3d, checked 2026-11-09 build details
comments
65 pages, 6 figures. Lean 4 formalization is available at https://github.com/stacks-ai/papers/tree/main/conley-index-dynamical-systems
fields
Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2611.08591 ↗

This is a preview of an upcoming monograph on standard subspaces and modular theory. At the moment, it consists of the first chapter. This starts with a gentle introduction to the subject, and then describes the modular theory of standard subspaces, the characterization of their modular data by the KMS condition and reflection positivity, and various constructions of standard subspaces. Further topics in Chapter 1 include the connection of standard subspaces to complexifications and symplectic structures, including their polarizers, and operations with standard subspaces, namely direct sums, direct integrals, and tensor products. Many examples and classification results are included as well. This first chapter also contains a description of the free U(1)-current and some other applications to quantum field theory, such as KMS states of type I factors, the local subspaces of the free Klein–Gordon field, and the entropy operator defined by a standard subspace.

comments
Work in progress, comments are welcome. 143 pages
fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.08668 ↗

We study the focusing vector nonlinear Schrödinger equation, or Manakov system, for a pair of coupled initial conditions with compactly supported, concave parabolic density profiles and phases depending quadratically on the spatial coordinate. We focus on the natural class of self-similar solutions generated by such profiles, whose dispersionless evolution we refer to as Talanov dynamics. We extend the criterion for blow-up in finite time, first established for a single field, to the Manakov case. For arbitrary initial chirps in the two fields, we provide closed-form expressions for their evolution, and an explicit expression for the time of the gradient catastrophe, if it occurs, and we classify the effect of the coupling on the catastrophe. Depending on the initial chirps, the two fields may catastrophise, or relax, as each would if decoupled. However, coupling can also force the catastrophe in fields that would otherwise relax if decoupled. For identical initial supports, and in the presence of dispersion, we numerically show that the same dispersionless criterion determines, in the semiclassical regime, whether the fully dispersive solution relaxes or develops a rogue wave in each field, whose onset time is accurately predicted by the corresponding dispersionless catastrophe time, in direct analogy with the scalar case. As chirp and amplitude are relatively easy to control experimentally, we expect these results to be relevant to experiments in nonlinear optics and Bose-Einstein condensates, extending to coupled systems observations made for the scalar equation.

comments
26 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.08786 ↗

We explore the quantum reflection equation in the case of a full-dimensional $n\times n$ matrix $\mathbb A$. Using the technique of $q$-determinants, we find closed expressions for the quantum Pfaffian (in the case of even $n$) and for new quantum Casimirs that are ratios of special quantum (Sklyanin) minors of $\mathbb A$. Special attention is paid to the self-adjointness property of the newly constructed Casimirs. We put forward a conjecture that, adopting a natural ansatz for a quantum deformation of a Casimir of a classical algebra, self-adjointness implies commutativity. We also explore the relationship to networks of quantum cluster variables.

comments
53 pages, many figures
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2611.08796 ↗

Following a proposal that the thermodynamic aspects of general relativity can be found in the evolution of the past light cones of arbitrary worldlines, we generalize the Bondi-Sachs formalism to these surfaces. The observer may accelerate and rotate their tetrad, the spacetime may contain matter and a cosmological constant, and no symmetry is assumed. We impose regularity conditions at the vertex of each light cone and along the polar axis, including a general axial condition that allows for shear. Given a suitable prescription for the stresses of matter, the Einstein field equations can then be integrated hierarchically from data on a single light cone, and the regularity at the vertex fixes all constants of integration. The solution reveals a universal property: to first order in the observer's proper time, the evolution of the metric and of the four-momentum crossing the light cones is independent of the specific behavior of matter. As an application, we derive, for an observer immersed in matter, an analogue of the integral mass formula of black hole mechanics.

comments
42 pages, 2 figures. Presents part of the results of arXiv:2609.25477, with an improved treatment of the regularity conditions and of the field equations
fields
Mathematical Physics
pdf ↗ page arXiv:2611.08958 ↗

Perfect wave transfer (PWT) reproduces spatial reflection at a common finite time under a fixed Hamiltonian. We classify this process for open compact bosons and inhomogeneous Tomonaga–Luttinger liquids, distinguishing transfer of oscillator and neutral observables from transfer on the charged field algebra. In the single-charge model, the first two notions coincide. Global transfer additionally requires rephasing of the compact zero mode. For regular reflection-symmetric channels, exact oscillator transfer forces an odd multiple of the optical crossing time and a strictly ordered, parity-compatible spectrum differing from the conformal ladder at only finitely many levels. This spectral condition is also sufficient when the Robin boundary data induced by the physical profile are included. Requiring Neumann conditions after the Liouville transformation instead forces conformality. We construct an explicit, regular one-defect family for every $r>1/2$. Its transfer parameters are precisely the reduced fractions $r=p/q$ with odd numerator and denominator, with shortest transfer time $pL/v_0$. At the delay $3L/v_0$, the $r=3/5$ profile has numerical contrast $K_{\max}/K_{\min}\simeq 12.913$, compared with $81$ for $r=3$. Two independent conservative discretizations show second-order convergence on fixed mode bands. Occupation- and charge-constrained error estimates quantify robustness, while an exact homogeneous-chain calculation explains the $J^{2/3}$ resolved-band scale also observed in the engineered channels. These results provide a spectral design method and finite-device benchmarks for quadratic quantum channels. An interacting microscopic realization remains open.

comments
39 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09018 ↗

The main result of this paper is a construction of an inductive process that can replace Feynman diagrams. Combining this result with the notion of the L-functional, one can give an exposition of QED that does not suffer from infrared divergences

comments
11 pages+16 pages of Appendices written by ChatGPT
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09032 ↗

We study the planar circular restricted three-body problem (PCR3BP) for sufficiently small mass ratios, from low energies to slightly above the second Lagrange value. We show that retrograde orbits around the primaries and Lyapunov orbits at the necks form the binding of a finite energy foliation. We construct these foliations using the theory of pseudoholomorphic curves in symplectizations developed by Hofer, Wysocki and Zehnder. Slightly above the second Lagrange value, the dynamics is transverse to families of disks bounded by the retrograde orbits, and cylinders connecting the retrograde orbits to the Lyapunov orbits, forming a $3-2-3-2$ foliation. The proof uses the rotating Kepler problem and Hill's lunar problem to control the singular limit as the mass ratio $μ\to 0$. As a consequence of the foliation, both Lyapunov orbits have infinitely many homoclinic orbits.

comments
41 pages, 4 figures
fields
Mathematical Physics, Dynamical Systems, Symplectic Geometry
pdf ↗ page arXiv:2611.09034 ↗

The magnetic Aharonov–Bohm (AB) effect is often introduced through the idealised infinite solenoid and a complex scalar phase. We give a geometric-algebra formulation based on the compact toroidal magnets shielded by a superconductor employed in the electron-holography experiments of Tonomura and collaborators. Working in the real Euclidean Clifford algebra $ \mathrm{Cl}(3,0)$, we distinguish the unit volume pseudoscalar $I$ (grade 3), coordinate angles (scalars, grade 0), tangent vectors (grade 1), and directed surface bivectors (grade 2). The magnetic field is represented by the dual bivector $\mathcal{B}= I \mathbf B$, while the electromagnetic $U(1)$ phase is represented by the central unit multivector $e^{Iα}$ generated by the pseudoscalar $I$, rather than by a spatial rotor with a bivector generator. We establish the linked toroidal geometry, formulate magnetic flux and Stokes' theorem intrinsically in geometric algebra, and derive the holonomy element $U_Γ=\exp(IqΦ_B/\hbar)$ from $U(1)$ gauge covariance, with every sign fixed explicitly. We then express superconducting fluxoid quantization in the same notation and obtain the binary electron holonomy $U_Γ= (-1)^N$ in the ideal limit where the linked magnetic flux equals $N h/(2e)$. Finally, a short conditional-state description of the quantum source and field shows how a backreaction can introduce an additional phase and reduce interference visibility. The conditional-state overlap is represented by a central scalar–pseudoscalar element; preservation of the fluxoid sector alone does not guarantee unit coherence.

comments
18 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09311 ↗

The topological properties of the Bloch bands of a one-dimensional periodic medium are described either by the Berry–Zak phase or by the poles and zeros of the surface impedance. We show that both can be read from one geometric object: the line spanned by the field and its flux (the Cauchy data) at an inversion centre. For each band, this line turns as the quasi-momentum runs over the Brillouin zone. Its number of turns, the Maslov index, is fixed by the parities (even or odd) of the Bloch functions at the two band edges, and its parity is the Zak phase. In a gap, the Cauchy line of the solution decaying on one side rotates monotonically with the energy, and an interface state between two crystals is a crossing of two such lines. This gives the known criterion of at most one state per gap in terms of the same lines. Examples with a stratified medium show that the choice of inversion centre changes the interface spectrum. The last section discusses what is missing to extend the construction to higher dimension.

comments
12 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09419 ↗

A discrete analogue of the acoustic equation with a spectral parameter is studied on graphs with several cylindrical outlets to infinity. At infinity in each cylindrical outlet the coefficients of this equation converge exponentially fast to periodic functions. It is assumed that the spectral parameter is fixed and distinct from thresholds and flat bands. We construct a special basis of the continuous spectrum eigenfunctions (bounded solutions of the homogeneous equation that do not belong to l2), introduce the scattering matrix, and establish the radiation principle (a well-posed statement of the problem with radiation conditions at infinity).

fields
Mathematical Physics
pdf ↗ page arXiv:2611.09535 ↗

We carry out a numerical investigation of the Oberbeck–Boussinesq equations in a fluid layer inclined against gravity. Equilibria containing different numbers of co-rotating rolls are computed. Mixed-mode branches connect branches containing states with four and six identical co-rotating rolls. These branches display two contrasting routes to reducing (or increasing) the number of rolls, one in which rolls disappear (or appear) and another route in which rolls merge (or split). These results are interpreted in light of the $(2,3)$ mode interaction scenario.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.09545 ↗

We study the discrete spectrum of the three-dimensional Fröhlich polaron at weak coupling and fixed total momentum. We prove that, for sufficiently small coupling and every total momentum $0<|ξ|\le 1/4$, the ground-state eigenvalue is the only eigenvalue below the essential spectrum. Our proof builds on the analogous zero-momentum result of Seiringer (2023). Combined with that result and the work of Dahlbaek (2017), this implies that, at sufficiently weak coupling, no fiber Hamiltonian has a discrete excited eigenvalue.

comments
20 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09586 ↗

We develop a finite-strain theory of second-gradient elasticity for solids with a material surface endowed with its own constitutive energy. The bulk second gradient plays two complementary roles. First, under suitable coercivity assumptions and convexity with respect to the second gradient, we prove the existence of minimizers for nonnegative, lower semicontinuous surface energy densities, without requiring convexity, polyconvexity, positive one-homogeneity, or an upper growth bound on the surface energy. Second, it introduces an intrinsic bulk length scale that affects the onset of instability and wavelength selection. To investigate these effects, we derive an incremental small-on-large formulation in the finitely deformed configuration and apply it to the elastocapillary beading of an axially stretched soft cylinder. For an infinite cylinder and the parameters considered, increasing the second-gradient modulus delays bifurcation and shifts the critical mode towards longer wavelengths. Above a finite threshold of this modulus, the critical stretch saturates in the long-wave limit. The model is implemented in the open-source finite element code OOFEM using C1-continuous isogeometric analysis. Finite-cylinder simulations yield onset stretches in close agreement with the analytical predictions. Selected post-bifurcation branches traced by arc-length continuation exhibit beaded states and supercritical bifurcation at small second-gradient moduli, whereas larger moduli are associated with subcritical bifurcation and the formation of distinct thick and thin segments.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.09587 ↗

We introduce a direct method for reconstructing the temporal evolution of a medium from electromagnetic field measurements. A sequence of temporal refractive-index changes splits an incident wave into forward- and backward-propagating components, producing a \emph{spatial} response of finite extent. We show that this finite support, together with causality, enables sequential reconstruction of the temporal interfaces through a time-domain extension of layer peeling. For continuously varying media, we introduce a time-adjusted Goupillaud medium and, through space-time duality, establish the corresponding momentum-conservation and admissibility conditions. The method remains robust under incomplete and noisy measurements, providing a general framework for the metrology, characterization, and design of time-varying electromagnetic systems.

comments
9 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09630 ↗

In this paper we study residual solutions of open bosonic string field theory in the $KBc$ algebra with the auxiliary identities $(\partial^mc)^2=0$ of the ghost field. These solutions are not covered by the classification based on the defining relations alone. We show that the operator which controls the cohomology on the residual family depends only on $s=γ_1+γ_2$. At positive level $n$, cohomology can appear only on the lines $s=\pm n$. We compute it through level four and find one class at every point of each line $s=-3$ and $s=-4$. These classes give exact polynomial deformations of the residual family. At level six on $s=-6$, the cohomology instead vanishes generically and has dimension two at $(-1,-5)$ and $(-5,-1)$. We also compute the failure of the standard generator redefinition to preserve the auxiliary identities, and discuss the regularization of an explicit residual solution.

comments
11 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09761 ↗

We study the $p \rightarrow 0$ limit of four-dimensional $\mathcal N=1$ superconformal indices and its relation to half-indices of three-dimensional $\mathcal N=2$ theories. At the level of special functions, this limit reduces elliptic hypergeometric integrals to basic hypergeometric integrals. The scaling of the flavor fugacities determines the Neumann and Dirichlet boundary conditions of the chiral multiplets. The gauge multiplet has Neumann boundary conditions. We apply this prescription to s-confining theories with gauge groups $SU(2)$, $USp(2N)$, $G_2$, and $SU(N)$, and recover the half-index identities of several boundary confining dualities, expressed through the Nassrallah-Rahman and Gustafson integrals. For $SU(N)$ with a rank-two antisymmetric chiral, four fundamentals and $N$ antifundamentals, we obtain an analytic proof of the half-index identities proposed by Okazaki and Smith for all $N \geq 5$.

comments
18 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09820 ↗

Transport, reaction and wave propagation on physical networks depend on dynamics along edges and interactions at junctions. We present a flexible framework for modeling physical networks at scale. A network calculus expresses edge dynamics and vertex contributions as fields over the whole network. Differential operators satisfy integration by parts-identities that connect local dynamics to global conservation laws, and explicit vertex constraints allow a variety of physical junction conditions. We implement this formalism using the open-source Dedalus spectral framework. This accommodates heterogeneous edge lengths, material properties and spectral resolutions. Initial-value, boundary-value and eigenvalue problems share a parallel solution method that eliminates internal unknowns independently on subgraphs and couples their solutions through shared boundary vertex interfaces. We verify numerical convergence and demonstrate strong and weak scaling on networks with millions of edges. We present applications to localized optical resonances in photonic networks, preferential channel formation during mineral replacement in evolving pore networks, and nonlinear dispersive waves for KdV on a periodic network.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.09833 ↗

We solve for the ground-state wavefunction of the SU(2) BFSS matrix model by applying the Rayleigh-Ritz method to an auxiliary operator $H_{\mathrm{aux}}$. We show that this operator agrees with the Hamiltonian on the ground-state subspace and has a spectral gap. For SU(2) specifically, the representation theory of the singlet sector gives an astronomical reduction in the number of degrees of freedom. This allows us to construct an efficient variational basis whose inner products we compute exactly. We demonstrate the method by computing a state that satisfies rigorous bounds on its energy $E\,g_{\mathrm{YM}}^{-2/3}\leq 4.18\times10^{-8}$ and ground-subspace overlap $\|P_{\ker H}ψ\|^2\geq 0.999997$. We compute ground-state moments with high precision, finding values consistent with the bounds from our matrix bootstrap. Additionally, the state accurately reproduces both the exponent and coefficient of the asymptotic radial probability density predicted by the three-graviton amplitude.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.09837 ↗

The natural environments habitable to life are inseparable from dissipative and entropic forces, which mandate active matter to operate on constant fluxes of energy and momentum to survive and propagate through spacetime. In contrast to fundamental particles which are characterized by energy and momentum, we postulate that energy expenditure rate and momentum generation rate are the fundamental dynamical quantities driving this evolution of swimming active matter and accordingly construct the corresponding Lagrangian and Hamiltonian of motion of the active matter. Furthermore, living systems broadly employ periodic, non-repeating motion for both locomotion and various biological functions, with meaningful information stored in the periods of these functions. Consequently, analyzing these dynamics in the Fourier space lands us at the familiar tools of the operator based, quantum mechanics. This is accomplished by introducing a complex field to describe the evolving probability distribution of a single unit, as well as the population density of mutually non-interacting active particles under the constraint of scarce resources. The resulting single-unit wavefunction evolves analogously to the Dirac equation with minimal coupling, wherein gauge symmetry reflects the generality of the governing equations across arbitrary resource landscapes. Additionally, we present a Schrödinger-like equation where the effective potential term represents the environmentally mandated, non-motile base metabolic rate. Finally, we formalize the bidirectional coupling between active swimmers and the surrounding fluid via a multipole expansion of the active force with an emphasis on force monopoles and dipoles, where each pole corresponds to a distinct mode of active motility.

comments
11 pg., 3 figs
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09861 ↗

Extremal solutions and functionals play an important role in the conformal bootstrap. These are the solutions that saturate unitarity bounds, and the dual functionals that encode the optimal bounds. While they have fundamental theoretical implications, their existence has not been rigorously established. This is particularly subtle in the setting of the full infinite-dimensional bootstrap, i.e. the limit of zero numerical truncation. In this article, we prove that extremal solutions exist for OPE maximisation problems in 1d CFT. These are a large class of generically interacting, unitary, exact solutions of the crossing equation that maximise an OPE coefficient. We also prove that these problems have 'zero duality gap', meaning there exist functionals arbitrarily close to extremality. Our approach is to formulate the bootstrap as a convex optimisation problem in a Hilbert space and apply the Fenchel-Rockafellar theorem.

comments
34 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.09867 ↗

Algebraic Geometry18

We formulate a generalized Saito criterion for complex projective plane curves, building on a recent generalized Saito criterion for plus-one generated arrangements of hyperplanes due to Junyan Chu.

comments
Minor corrections
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2609.29824 ↗

Let $N$ denote the closed non-orientable surface of Euler characteristic $-1$, i.e. the connected sum of three real projective planes $N = \mathbb{RP}^2 \# \mathbb{RP}^2 \# \mathbb{RP}^2$, with fundamental group presented as $\langle A,B,C \mid A^2 B^2 C^2 = I \rangle$ via the standard symmetric cross-cap model. Building on the classical trace-coordinate methods of Fricke, Vogt, and Goldman for free groups, and on the qualitative study of representation varieties of non-orientable surfaces by Benyash-Krivets and Chernousov, we give an explicit affine equation for a dense open piece of the $\mathrm{SL}_2(\mathbb{C})$ GIT character variety $X(N)$. We prove that the trace coordinates $a = \mathrm{tr}(A)$, $b = \mathrm{tr}(B)$, $c = \mathrm{tr}(C)$, $p = \mathrm{tr}(AB)$ satisfy the polynomial relation $c^2 = abp - a^2 - b^2 + 4$, that this hypersurface is smooth and irreducible, and that on the open locus $c \neq 0$ it is isomorphic to the image of $X(N)$ under the trace map, with the remaining trace coordinates $\mathrm{tr}(BC)$, $\mathrm{tr}(CA)$, $\mathrm{tr}(ABC)$ recovered as regular functions on this locus. We further identify the boundary locus $c = 0$ with representations satisfying the matrix identity $A^2 B^2 = -I$, and describe its representation-theoretic structure, while leaving a complete global classification along this locus as an open problem. All key trace identities are proved from Cayley-Hamilton first principles and independently checked numerically against explicit matrices.

comments
8 pages; submitted to Proceedings of the American Mathematical Society
fields
Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:2611.08513 ↗

One can associate a pair of vector bundles $(E, F)$ on $\mathbb{P}^1$ to every tetragonal curve: $E$ is the Tschirnhausen bundle and $F$ records numerical data of the ideal for the curve under its relative canonical embedding. In this note, we show that a Hurwitz–Brill–Noether general tetragonal curve must have balanced $E$, $F$ bundles, and provide counterexamples for the converse when $g = 8$ or $g \geq 10$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.08679 ↗

The multi-monopole equations are a generalisation of the Seiberg–Witten equations where the spinor is coupled to an auxiliary vector bundle. The signed count of multi-monopoles on a 3-manifold can vary according to a new type of wall-crossing phenomenon. For products $S^1\times C$, where $C$ is a closed Riemann surface, we relate the wall and chamber structure to loops in the complement of the wobbly divisor of $C$. Such a loop induces a monodromy map on the multi-vortex moduli space, and the count of its fixed points is expected to agree with the count of multi-monopoles on $S^1\times C$ in the given chamber. By studying singularities of framed multi-vortex moduli spaces, we are able to understand these monodromy maps for various loops. Counting fixed points suggests that product 3-manifolds display incredibly rich wall-crossing behaviour.

comments
29 pages, comments welcome!
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.08760 ↗

We determine all Galois lines for the embedding of the maximal curve with the second largest genus in characteristic two into $\mathbb{P}^{3}$ induced by its Frobenius linear series. We also determine the associated Galois groups.

comments
11 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.08810 ↗

We give an example of a smooth rational threefold over a number field with a big anticanonical divisor that does not satisfy the thin set version of Manin's Conjecture. In particular, Manin's Conjecture does not hold for rationally connected almost Fano varieties.

comments
13 pages, any comment is welcome!!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.08890 ↗

Given a vector bundle $\mathcal{E}$ on a smooth variety X, one can associate to it its jet bundles, or bundles of principal parts. These bundles encode the Taylor expansions of local sections of $\mathcal{E}$ and arise naturally in the study of differential operators. When $X=\mathbb{P}^1$ is the projective line, jet bundles decompose as direct sums of line bundles, making it natural to study their splitting types. The splitting type is well understood in characteristic zero, but exhibits subtler behavior in positive characteristic. Our goal is to give a complete answer in every positive characteristic, and in particular to provide a characterization of semistability for jet bundles on $\mathbb{P}^1$. We also determine their extremal summands and give applications to differential operators and formulas for cohomology of line bundles on infinitesimal thickenings of the diagonal.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.08979 ↗

We define cuspidal sections for varieties of arbitrary dimension over fields of characteristic zero, extending the definition for curves by Grothendieck. Our notion of cuspidal sections is defined relative to a normal crossings compactification. We prove that the closure of the resulting set is independent of the choice of a compactification. For varieties iteratively constructed from fibrations, we compare our definition to an inductive notion of cuspidal sections, and discuss connections to the section conjecture of Grothendieck.

comments
Comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.09080 ↗

Let $A_{\rm{con}}$ be the contraction algebra of a $3$-fold flop of an irreducible curve, with genus-zero Gopakumar-Vafa invariants $n_1, \dots, n_l$. We show that $\prod_j M_j(\mathbb{C})^{n_j}$ is the only semisimple algebra to which $A_{\rm{con}}$ deforms. Hence $A_{\rm{con}}$ encodes its Gopakumar-Vafa invariants intrinsically, answering a question of Wemyss. Hua and Toda showed that this deformation exists, and Jelisiejew and Smoktunowicz proved its uniqueness in types A and D. The key step in our proof is that the centre of $A_{\rm{con}}$ has dimension $n_1 + \dots + n_l$. To prove this, we lift the contraction algebra of the universal flop to the Cartan subalgebra, where it becomes a corner of a deformed preprojective algebra. We show that the universal contraction algebra and its zeroth Hochschild homology are free over a polynomial ring, with presentations whose determinants are products of roots. Pulling these presentations back along the arc that classifies the flop gives the count, and recovers Toda's formula for $\dim A_{\rm{con}}$. We also prove Hua and Toda's flatness conjecture, and determine which Gopakumar-Vafa invariants occur in lengths 3 to 6.

comments
54 pages, 3 figures, 4 tables
fields
Algebraic Geometry, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.09220 ↗

We prove the Woo-Yong conjecture: the non-Gorenstein locus of a type A Schubert variety is the union of its generically non-Gorenstein maximal singular components. More strongly, at every scheme point, local Weil divisor classes are detected at the generic points of the maximal singular components containing that point. For arbitrary finite crystallographic type, the analogous localization map is injective on the torsion subgroup of the source local class group. This determines Cartier indices of locally $\mathbb{Q}$-Cartier divisors and gives the Woo-Yong criterion on the $\mathbb{Q}$-Gorenstein locus. A type D family shows the necessity of this hypothesis: the ambient variety is generically Gorenstein along its singular locus but not $\mathbb{Q}$-Gorenstein along a deeper nonempty locus. The type A proof and the counterexamples are geometric; the general torsion proof also uses bounded finite inputs with explicit certificates and reproducible reconstruction programs.

comments
46 pages; ancillary verification programs, exact certificates, and execution records included
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.09237 ↗

We show that for root-subgroup multiplication maps, dominance does not imply birationality. This gives a negative answer to a question of Fang, Fourier and Littelmann. More precisely, for every integer $r\geq 2$, we construct a sequence of positive roots in type $A_{3r-1}$; the associated multiplication map is dominant of generic degree $r$, hence not birational. In our construction, a key observation is that Lusztig's flag incidence projection for a triangle quiver is, up to birational equivalence and identity factors, simultaneously a root-subgroup multiplication map and a multiplicative partial Grothendieck–Springer map. Moreover, we extend these examples to types $B$, $C$ and $D$ in every generic degree $r\geq 2$, and to types $E_6$, $E_7$ and $E_8$ in generic degree $2$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.09284 ↗

We prove that an arithmetic adelic line bundle on a smooth quasi-projective variety over a number field has nef geometric part if its prescribed continuous metric at one complex embedding has semipositive first Chern current. The proof constructs semiample approximations to every positive rational ample perturbation by boundary extension, multiplier ideals, and Nadel vanishing, followed by specialization and Galois descent. This gives geometric nefness of Gao–Zhang's canonical Gross–Schoen adelic line bundle.

comments
19 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.09319 ↗

This paper addresses the birational geometry of three-dimensional algebraic varieties admitting a conic bundle structure. The central focus is on tetragonal transformations -- a special class of birational maps between standard conic bundles that are not fiberwise and play a key role in the birational geometry of such varieties.

comments
92 pages, LaTeX
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.09365 ↗

Let $\mathcal{E}$ be a vector bundle of rank $n\geq 2$ over a smooth projective curve $C$ over $\mathbb{C}$. We prove that $K_{\mathbb{P}_C(\mathcal{E})}+\mathcal{L}_1+\dots+\mathcal{L}_k$ is very ample for arbitrary ample line bundles $\mathcal{L}_i$ when $k\geq n+2$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.09532 ↗

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
pdf ↗ page arXiv:2611.09603 ↗

Every complex projective surface is birational to a singular surface $S \subseteq \mathbf{P}^3$, but it is unclear whether one can ask that $S$ have only isolated singularities. In particular, it was a folk question as to whether an abelian surface could admit such a model. We present examples to show that there do exist normal abelian surfaces in $\mathbf{P}^3$. One of these examples deforms in a one-parameter family.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.09613 ↗

Let $B$ be the Borel Subgroup of $\mathrm{SL}_2(\mathbb{C})$, and let $G_m=\langle x,y,z\mid x^2y^3=z^{2m+1}\rangle$, $m\geq2$. The $G_m$ are parafree of rank two and deviation one. We compute the integral homology of the regular and singular loci of $X_m=\mathrm{Hom}(G_m,B)$. Each $X_m$ is a four-dimensional irreducible affine variety with the homotopy type of a two-dimensional torus. Its singular locus is a disjoint union of $16m$ affine lines. The regular locus has Betti numbers $b_0=1$, $b_1=2$, $b_2=16m+1$, and $b_3=b_5=16m$, with all other Betti numbers zero. Thus, although each $X_m$ has the homotopy type of a torus and its singular locus is a disjoint union of contractible lines, removing the singular locus creates $16m$ additional independent homology classes in each of degrees $2$, $3$, and $5$, arising from the transverse link $S^2\times S^3$. We also establish that the regular loci are not affine.

comments
9 pages
fields
Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2611.09774 ↗

We give an explicit formula recovering the Zariski invariant of a plane branch with one Puiseux pair from its Bernstein-Sato polynomial. Thus the Bernstein-Sato stratification refines the Zariski-invariant stratification. We determine the generic roots in each stratum from the value semigroup and the Zariski invariant, refining Yano's description for a fixed topological class. We also compute the maximal spectral-exponent discrepancy and relate it to the dimension of the generic Bernstein-Sato locus and the minimum Tjurina number.

comments
15 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.09883 ↗

Functional Analysis18

Several useful concepts of almost frames or Riesz bases of Hilbert spaces gave us the motivation to review the theory of C*-module frames and C*-module Riesz bases for Hilbert C*-modules, searching for similar useful structures. We give a survey of the background in C*-module frame theory, summarizing and particularly extending or correcting earlier results. The concepts of near-Riesz bases, pseudo-frames, pseudo-Riesz sequences, and pseudo Riesz bases of Hilbert C*-modules are introduced and equivalently related to (semi-)C*-Fredholm properties of their synthesis operators. The notion of the excess of a C*-module frame is introduced, taking values in related C* algebras. Indicators for possible erasures of frame elements are described with the aim to preserve robustness of frames. Introducing a new notion of pseudo-Riesz-Weyl sequences in the standard Hilbert C*-module $l_2(A)$ we reverse the found correspondence by assuming the associated synthesis operator of a Bessel sequence to be (upper semi-)C*-Weyl. Furthermore, we deduce from the invariance of (upper semi-)C*-Fredholm and C*-Riesz-Weyl properties of synthesis operators with respect to ''compact'' perturbations the perturbation invariance of the respective classes of module Bessel sequences.

comments
We joined two further sections from the first version and worked on the presentation of the content, adding explanations, historical remarks and references. [The first two versions are still available on the arxiv.]
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2606.16597 ↗

We establish an operator-valued Fejer-Riesz factorization theorem for the algebraic free product A of C[F], the group algebra on the free group F on finitely many generators, with finitely many finite dimensional C-star algebras. With respect to a natural reduced-word length, called extent, we show that every linear combination F of elements of A with coefficients from the algebra of operators on a Hilbert space of extent at most 2d that is positive under all finite-dimensional unital *-representations of A admits a factorization F=B^*B with B of extent at most d. This sharp half-extent bound holds without strict positivity. The proof combines a new finite-dimensional realization theorem for positive truncated kernels with operator-system methods. We also establish factorization results for tensor products with group algebras of arbitrary discrete groups under strict positivity in the maximal C-star-tensor product; for amenable groups, strict positivity in the minimal tensor product suffices.

fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.08554 ↗

We prove analogues of several classical theorems about operators between vector lattices in the context of directed Archimedean ordered vector spaces. In particular, we show that every order continuous operator between pervasive Archimedean ordered vector spaces can be extended to an order continuous operator between their Dedekind completions. Additionally, we introduce the universal completion of a directed Archimedean ordered vector space, and show that every supremum-preserving operator between directed Archimedean ordered vector spaces can be extended to an order continuous homomorphism between their universal completions. We also establish some universal properties for the relative uniform completion.

comments
52 pages, preliminary version
fields
Functional Analysis
pdf ↗ page arXiv:2611.08735 ↗

For $p>2$ and an $N$-dimensional subspace $X\subset L_\infty(μ)$ satisfying \[ \|f\|_\infty\le (KN)^{1/p}\|f\|_{L_p(μ)} \quad\forall f\in X, \] we show that $m\ge C(p)KN \bigl(\varepsilon^{-p} +\varepsilon^{-2}\log_2(2N)\bigr)$ independent samples $ξ^1,\ldots,ξ^m$ with distribution $μ$ satisfy \[ (1-\varepsilon)\|f\|_{L_p(μ)}^p \le\frac1m\sum_{j=1}^m|f(ξ^j)|^p \le(1+\varepsilon)\|f\|_{L_p(μ)}^p \quad\forall f\in X \] with probability at least $1-\exp(-c(p)\frac{m\varepsilon^2}{KN})$. This gives the optimal sample-size order $N\log_2 N$ for independent random sampling with fixed $K$, $p$, and $\varepsilon$. This result follows from a more general empirical moment estimate over unit balls of $p$-convex norms.

comments
14 pages
fields
Functional Analysis, Probability
pdf ↗ page arXiv:2611.08896 ↗

A well-known result of Abramovich says that if $E$, $F$ are rearrangement invariant Banach spaces on a finite atomless measure space such that $E$ has an absolutely continuous norm and $E\not\subseteq F$, then there are no nonzero disjointness preserving bounded linear operators $T \colon E\to F$. We obtain an analogue of this result in the setting of general Köthe-Banach spaces. Specifically, we identify a sufficient condition on Köthe-Banach spaces $E$, $F$ on finite atomless measure spaces that implies that there are no nonzero disjointness preserving bounded linear operators $T \colon E\to F$. Consequently, by a representation theorem for regular operators due to O.~Maslyuchenko, Mykhaylyuk and the second named author, this condition implies that every regular linear operator $T \colon E\to F$ is narrow. As an application, we obtain that if $1\le \max\{p_1,p_2\}< \min\{ r_1, r_2\}\le \infty$, then every regular linear operator $T \colon L_{p_1}(L_{p_2}) \to L_{r_1}(L_{r_2})$ is narrow. The latter may be seen as an analogue of the classical Pitt compactness theorem.

fields
Functional Analysis
pdf ↗ page arXiv:2611.08960 ↗

We study weighted power, Karcher, and log-Euclidean means on the Lie group CP_n of real upper triangular matrices with a constant positive diagonal. Building on the general triangular-group theory, we use the central decomposition CP_n \cong \mathbb R_+ -by-UP_n to separate the scalar power mean from a unipotent mean with reweighted coefficients. We prove that the power mean extends real-analytically through order zero, where it equals the Karcher mean. We establish exterior-power covariance for the Karcher and log-Euclidean means, and tensor-product identities for all three means, distinguishing product weights from paired inputs. Finite nilpotent functional calculus yields concise formulas on CP_2 and CP_3, where the Karcher and log-Euclidean means coincide. In dimension four, their difference is exactly a central cubic commutator, giving a necessary and sufficient equality criterion and an explicit counterexample. In every dimension, the same commutator is the leading term of their small-dispersion difference.

fields
Functional Analysis
pdf ↗ page arXiv:2611.08981 ↗

We completely characterize finite-rank commutators of Toeplitz operators with bounded harmonic symbols on the harmonic Bergman space of the unit disk. Apart from affine dependence, finite rank occurs precisely when both symbols are analytic with rational primitives, or both are coanalytic and their complex conjugates have rational primitives. Our approach combines a block-matrix decomposition with Luecking's theorem, which rules out nonzero finite-rank Toeplitz operators with bounded symbols on the Bergman space. In particular, every such finite-rank commutator has square zero.

comments
14 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.08988 ↗

The V-line transform (V-LT), a generalized Radon transform (RT), is widely used in Compton scattering imaging (CSI). The central mathematical problem of CSI is to reconstruct a function from its V-LT. Unlike V-LT, the attenuated V-line transform (AV-LT) accounts for the medium-induced loss of intensity, and has been demonstrated to improve image quality. The present paper makes two main contributions. (1) We establish the fundamental characterizations for AV-LT including operator properties ($L^2$-boundedness, operator norm etc.), a necessary and sufficient condition for the preservation of compact support, and sharp estimation of Sobolev smoothness. These characterizations remain unexplored, and they reveal essential differences among AV-LT, RT and V-LT. (2) We develop a direct reconstruction method based on AV-LT samples that does not require solving any equation. Our sampling formula gives exact reconstruction for band-limited functions. We also provide approximate reconstruction for functions in $H^s(\mathbb{R}^2)$ with $s>2$.

fields
Functional Analysis
pdf ↗ page arXiv:2611.09073 ↗

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 ↗

For $0<ρ<1$ and a set of $N\ge2$ distinct real digits $\mathscr D=\{d_0,\ldots,d_{N-1}\}\subset\mathbb{R}$, let \[ μ_{ρ,\mathscr D}=\frac1N\sum_{i=0}^{N-1}μ_{ρ,\mathscr D}\circ S_i^{-1}, \qquad S_i(x)=ρ(x+d_i). \] Write $X=\sum_{j\ge1}ρ^j d_{ω_j}$, where the symbols $ω_j$ are independent and uniform on $\{0,\ldots,N-1\}$. We prove that $μ_{ρ,\mathscr D}$ admits no frame measure if the conditional entropy $H(ω_1\mid X)>0$. In particular, this holds for all $ρ>1/N$, without any absolute-continuity assumption or arithmetic restriction on the digits or the contraction. At $ρ=1/N$, for commensurable digits, a frame measure exists if and only if $μ_{ρ,\mathscr D}$ is normalized Lebesgue measure on its attractor. For $\mathscr D=\{0,\ldots,N-1\}$ and $ρ<1/N$, we also prove nonexistence whenever $ρ^{-m}=a/b$ for some $m\in\N$, with $a/b$ in lowest terms, $b\mid N$ and $N/b\nmid a$, extending the integer-power obstruction. The extension compares mask quotients using finite families of target pole classes in place of one target class.

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

The classical location problem posed by Weber [Über den Standort der Industrien,Tübingen: J. C. B. Mohr, 1909] has motivated various geometric characterizations of inner-product spaces. Benítez, Fernández and Soriano [Trans. Amer. Math. Soc. \textbf{354} (2002), 5027–5038] characterized real inner-product spaces through the convex-hull property of Fermat–Torricelli medians.Pakhrou [J. Funct. Anal. \textbf{285} (2023), 110078] further established a characterization using $γ$-centers and equilateral triangles. Building on these results, we show that the Fermat–Torricelli convex-hull criterion remains valid when restricted to triples satisfying a one-sided Birkhoff–James orthogonality condition.The proof combines norming functionals, radial rescaling,Alexandrov differentiability, and the area formula.No completeness, smoothness, or strict convexity assumptions are required.

fields
Functional Analysis
pdf ↗ page arXiv:2611.09226 ↗

Necessary and sufficient conditions are obtained for two Toeplitz operators and for a Toeplitz operator and a little Hankel operator to commute on the pluriharmonic Hardy space of the bidisk.

fields
Functional Analysis
pdf ↗ page arXiv:2611.09328 ↗

Let $d \geq 3$ be odd. On hyperbolic space $\mathbb{H}^d$, we consider Callias-type operators, i.e. Dirac-Schrödinger operators of the form $D = ic \nabla + A$, where $c \nabla$ is the Dirac operator and $A$ a function with values in the self-adjoint operators, and provide an explicit formula for the iterated trace $\text{tr}_{L^2(\mathbb{H}^d,H)} \text{tr}_{S}( e^{-tD^*D} - e^{-tDD^*})$, $t>0$, that appears in the formulation of the Witten index. Thereby, the operator $D$ is not assumed to be Fredholm.

comments
66 pages
fields
Functional Analysis, Analysis of PDEs
pdf ↗ page arXiv:2611.09438 ↗

Step-isometries are maps preserving the integer part of pairwise distances on metric spaces. They arise naturally in the study of infinite random geometric graphs, where graph isomorphisms between LARG-type random graphs reduce to step-isometries on the underlying vertex sets. Several fundamental open problems concerning the rigidity, extendability, and continuity of step-isometries were raised in recent literature, notably by Šemrl, and by Balogh, Walters, and Zsák. In the present paper we resolve a number of these long-standing open questions. We establish rigidity results for step-isometries defined on norm-dense subsets of both real and complex Banach spaces. For complex Banach spaces, we prove that every almost-surjective step-isometry on a norm-dense subset admits a unique extension to a surjective real-affine isometry of the whole space. In the real setting, we investigate three key properties $A$, $B$, $C$ formulated by Šemrl, which ask whether certain classes of step-isometries extend to surjective affine isometries. We verify these properties for uniformly non-square Banach spaces, for spaces with a dense set of Fréchet-smooth points, and for strictly convex Banach spaces with separable dual. In particular, we confirm Conjecture 2 due to Balogh, Walters, and Zsák without countability assumptions on the dense domain set. We further show that every bijective step-isometry defined on the entire Banach space is a homeomorphism, answering their Question 3 affirmatively. Specializing to $\ell_1^n$, we obtain that $\ell_1^n$ satisfies Property $A$ for all integers $n\ge 3$, settling an open problem posed by Šemrl.

fields
Functional Analysis
pdf ↗ page arXiv:2611.09463 ↗

We settle the uniform small deviation conjecture for the Brownian sheet in every dimension $d\ge2$, namely, that the logarithmic exponent is $2d-1$. Our proof proceeds through sharp entropy and Kolmogorov estimates for the associated anchored mixed Sobolev embedding in the uniform norm. Their connection to small deviations is known from the Kuelbs–Li theorem. To establish the entropy estimates, the key is a probabilistic small ball inequality for smooth tensor product atoms whose exceptional set has Gaussian measure exponentially small in the number of atoms. Its proof combines a count of dyadic rectangles with tools from probability, in particular Ehrhard's Gaussian Brunn–Minkowski inequality. This also yields sharp entropy and Kolmogorov number estimates for embeddings of periodic mixed Sobolev, Besov and Nikol'skii classes with smoothness $r>1/2$ in $L_\infty$. Finally, we extend our results to fractional and integrated Brownian sheets.

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

We show that the norm obtained by summing the $L^1$ norms of all weak derivatives through order $k$, including the function itself, determines both $n$ and $k$ on the real Sobolev space $W^{k,1}(\R^n)$. Every surjective linear isometry for this norm is given by a translation, a signed permutation of the coordinates and multiplication by a fixed sign $c\in\{-1,1\}$.

fields
Functional Analysis
pdf ↗ page arXiv:2611.09577 ↗

In this article, we consider weighted Bergman spaces over open unit disk corresponding to nonnegative integrable radial functions with positive mass arbitrarily close to the unit circle. Then we show that Toeplitz operators with bounded harmonic symbols on the weighted Bergman space are the fixed points of a normal unital completely positive map. This result generalizes the classical characterization of Toeplitz operators on the Hardy space due to Brown and Halmos. Moreover, we prove that there is no compact Toeplitz operators with bounded harmonic symbols on weighted Bergman space.

comments
This is a preliminary draft of the article, 18 pages, Comments are welcome
fields
Functional Analysis, Complex Variables, Operator Algebras
pdf ↗ page arXiv:2611.09731 ↗

A positive $M_n$-valued measure on a locally compact group need not have positive convolution products: matrix multiplication preserves neither self-adjointness nor positivity. We prove that this obstruction disappears completely at an idempotent. If $μ\in M(G,M_n)$ is positive and $μ*μ=μ$, then all its matrix values commute and there is a unique finite decomposition \[ μ=\sum_{j=1}^r m_{K_j}\otimes E_j, \] where the $K_j$ are distinct compact subgroups and the $E_j$ are pairwise orthogonal nonzero projections. The result holds for arbitrary locally compact groups, without countability assumptions or a priori commutativity. The proof combines projection-valued dilations, rigidity of contractive idempotent Fourier coefficients, and faithfulness of the regular representation on finite measures over $G\times G$. For normalized positive matrix convolution semigroups, we further identify the Cesàro harmonic projection with convolution by such an idempotent, even if mass escapes to infinity. Its surviving matrix directions are exactly those uniformly confined to a compact subset of the group, yielding an explicit direct Haar-channel decomposition for all $1<p<\infty$ (orthogonal in $L^2$). A bounded Zeno product formula and independent density, atomic, and subgroup-support classifications illustrate the rigidity.

fields
Functional Analysis
pdf ↗ page arXiv:2611.09755 ↗

Differential Geometry16

We study Tang's conjecture on compact Hermitian manifolds. We prove that this conjecture holds for two special classes of unimodular Lie groups: their associated Lie algebras are either almost abelian, or contain a J-invariant abelian ideal of codimension two.

comments
13 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.08515 ↗

In this paper, we prove that, for suitable values of $δ$, every complete connected $δ$-Simons stable special Lagrangian immersion in ${\mathbb C}^n$, $n\ge3$, is flat. We also prove that a $δ$-Simons stable special Lagrangian cone $C\subset{\mathbb C}^n$ with $C\cap{\mathbb S}^{2n-1}$ smooth and compact is a finite union of planes if $δ>(n-2)^2/(4n)$, and that this coefficient is optimal. At equality, we characterize the $δ$-Simons stable cones. We further establish regularity and compactness for sequences of proper $δ$-Simons stable special Lagrangian immersions when $n\ge3$ and $δ>(n-2)/(n+1)$, under suitable restrictions on the initial singular sets, assuming integral current extensions $T_j$ with $\partial T_j=0$ and uniformly bounded mass on compact subsets. In dimension three, we allow initial singular sets $S_j$ satisfying $\mathcal H^1(S_j)=0$. For suitable values of $δ$, we also prove properness, Euclidean volume growth, and finite total curvature for complete connected immersions of finite $δ$-index.

fields
Differential Geometry
pdf ↗ page arXiv:2611.08562 ↗

We prove the Gibbons–Penrose inequality for smooth closed spacelike codimension-two submanifolds of Minkowski spacetime whose past null second fundamental form is non-negative. The proof is motivated by the Alexandrov–Bakelman–Pucci technique.

comments
10 pages
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.08609 ↗

In this paper, we study cylindrically symmetric projectively flat Finsler metrics \(F=|\bar y|φ(x^0,r,s,z)\). We reformulate the conditions for projective flatness and strong convexity in terms of \(Ω=φ-sφ_s-zφ_z\), isolating the compatibility condition missing in earlier work. Using the method of characteristics, we give an integral formula for all smooth local solutions near points with \(r>0\) and \(s=z=0\). These solutions are determined by a characteristic potential up to the addition of an invariant exact one-form. In the reversible case, the equation for the potential reduces to a \((2+1)\)-dimensional wave equation on a half-space. We illustrate the reconstruction with a polynomial potential and compute the potentials of a known family of spherically symmetric metrics and their linear pullbacks. The convexity conditions also admit decreasing profiles and recover the spherical Beltrami metric as a particular case. Finally, suitable positive sums of linear pullbacks yield smooth reversible projectively flat Finsler metrics on \(\mathbb R^{n+1}\) whose tangent norm at the origin is non-Riemannian. Consequently, these metrics are not linear pullbacks of spherically symmetric metrics

fields
Differential Geometry
pdf ↗ page arXiv:2611.08747 ↗

We provide an elementary proof of Hersch's inequality and Cheng's theorem, both characterizing the sphere. We revisit these classical results in connection with the geodesic monotonicity of heat kernels on two-dimensional spheres, which provides a third characterization.

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

We determine the kernel of the Hodge–de Rham operator on left-invariant differential forms for the seven customary families of three-dimensional Lorentzian metric Lie algebras. Every parameter stratum is treated, including zero structure constants, singular bracket matrices, and null modular directions. If $θ(X)=\mathrm{tr}\,\mathrm{ad}_X$ is the modular character, the full kernel is the direct sum of constants, the space $K=\mathrm{Ann}([\mathfrak{g},\mathfrak{g}])\capθ^\perp$, its Hodge dual, and the volume forms. We give explicit real bases in all seven families and compute the exterior differential and geometric codifferential on every basis form. The non-unimodular calculation remains valid without the customary extra normalization conditions, and hence also covers metric representatives omitted by those conditions. The resulting dimensions are $2,4,6$, or $8$; the two middle-degree dimensions agree. Explicit examples distinguish the kernel of the first-order operator from the kernel of its square. All assertions concern smooth left-invariant forms, with no square-integrability condition.

fields
Differential Geometry
pdf ↗ page arXiv:2611.08815 ↗

Tepui groupoids are a generalization of Lie groupoids which allow the arrow space to be singular, as is the case for holonomy groupoids of singular foliations. We construct a Lie differentiation functor for a large class of tepui groupoids. When restricted to effective and source-connected tepui groupoids, this differentiation recovers the correspondence between holonomy groupoids and their underlying singular foliations.

comments
32 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.08825 ↗

Alexandrov conjectured that every closed convex surface of area $A$ and intrinsic diameter $D$ satisfies $A/D^2\leqπ/2$. Using an averaging argument over the curvature measure, we prove that every closed convex surface satisfies $A/D^2\leq2π/3$, improving the best previously known bound.

fields
Differential Geometry
pdf ↗ page arXiv:2611.08829 ↗

Schoen conjectured that the Yamabe invariant of every lens space is achieved by the round metric. A proof of this conjecture is presented for all lens spaces, together with rigidity: equality is only achieved for the round class. The key step is to show that every $\mathbb Z_p$-invariant Yamabe-positive conformal class on $S^3$ admits a $\mathbb Z_p$-equivariant Poincaré-Einstein filling. The distance function from a fixed point of the filling then gives an invariant test function with Yamabe quotient at most $σ(S^3)$, which descends to the lens space. The proof of the main theorem was generated by AI (ChatGPT Astra, September 2026); this is mainly a learning note of the AI generated proof.

comments
42 pages, comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2611.08957 ↗

We prove that every negative-Einstein manifold with cocompact symmetries splits isometrically as a Riemannian product $H \times K$ with $H$ homogeneous and $K$ compact. This confirms a conjecture due to Böhm and Lafuente. As a consequence, we obtain a new proof of the 1975 Alekseevskii conjecture.

comments
48 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.09257 ↗

We prove the existence of a Riemann–Hilbert $A_\infty$-functor from the curved dg-category of $\mathscr{A}$-connections on graded vector bundles, where $\mathscr{A}$ is a higher Lie algebroid, to the curved dg-category of $Π_\infty(\mathscr{A})$-connections on graded vector bundles, where $Π_\infty(\mathscr{A})$ is the homotopy groupoid of $\mathscr{A}$. When restricted to the sub dg-categories of flat objects, it induces an $A_\infty$-functor from the dg-category of representations up to homotopy of $\mathscr{A}$ to the dg-category of representations up to homotopy of $Π_\infty(\mathscr{A})$, which recovers the one from arXiv:1011.4693 and arXiv:0908.2843 when $\mathscr{A}$ is a Lie algebroid. The key ingredient for defining such functors is a non-abelian Stokes's theorem for endomorphism-valued differential forms. Furthermore, for a graded vector bundle $E$, we introduce the notion of its higher general linear groupoid in such a way that $G$-connections on $E$, for a higher Lie groupoid $G$, become smooth functors from $G$ to the higher general linear groupoid of $E$. We combine this with the Riemann–Hilbert functor to define higher parallel transport functors for $\mathscr{A}$-connections. Finally, we use these functors to define the higher holonomy groups of $\mathscr{A}$-connections and endow them with the structure of augmented simplicial Lie groups.

comments
92 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.09300 ↗

Let $N$ be a natural tensor which vanishes at a metric $g\_0$. By diffeomorphism invariance, $DN(g\_0)^*$ takes values in divergence-free symmetric $2$-tensors, and in TT tensors if moreover $DN(g\_0)$ kills conformal directions. Such operators are local potentials, which we call machines: they produce smooth compactly supported tensors with the required property and, on closed manifolds, all of them up to a finite-dimensional space when their symbol is injective. On Einstein manifolds of every dimension, the linearised Bach tensor gives the operator $P$ of an earlier paper, which factorises on TT tensors into the massless and partially massless spin-$2$ operators; we also construct machines on Bach-flat, conformally flat and Ricci-parallel metrics. Replacing the diffeomorphisms of $M$ by those of the vacuum development, we obtain potentials, with a Fredholm property, for the linearised Einstein constraint equations on arbitrary spacelike hypersurfaces of Minkowski, de Sitter and anti-de Sitter spacetimes.

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

Donaldson and Thomas proposed a Floer-type theory on a Calabi-Yau threefold $M$, generated by the complex curves, and whose boundary operator is given by counting appropriate associative submanifolds in $M\times \mathbb{R}$. We consider a similar setting, in which the Calabi-Yau manifold is replaced by the twistor space $Z$ of an oriented hyperbolic 4-manifold $X$ and the $J$-holomorphic curves in $Z$ project to minimal surfaces in $X$. We give a formula for the virtual dimension of (a subset of) the moduli space of associatives asymptotic to a pair of $J$-holomorphic curves in $Z$, proving it equals the difference of the Morse indices of the corresponding minimal surfaces in $X$.

comments
50 pages, 2 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.09689 ↗

We give a generalization of the Gauss Lemma for normal exponential maps and a covering criterion as a consequence.

comments
6 pages
fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2611.09784 ↗

It is shown that every quadruple of real numbers with two positive and two negative entries is the Ricci spectrum of some left-invariant Riemannian metric on a Lie group of dimension four. Consequently, for eight out of the fifteen possible Ricci signatures of four-dimensional homogeneous Riemannian manifolds, one can determine precisely which spectra in each given signature actually occur. We also describe the Ricci spectra realized by left-invariant metrics on a certain class of 2-step solvable Lie groups of all dimensions $n>2$.

comments
12 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.09824 ↗

We study nonlinear elliptic equations of variable exponent type, \[ -Δ_{q(x)}u+|u|^{q(x)-2}u=f(x,u), \] on non-compact Riemannian manifolds with symmetry. We consider complete warped products \[ M=\mathcal R\times_φY,\qquad g_φ=dr^2\oplusφ(r)^2g_Y, \] where $\mathcal R$ is a non-compact interval, possibly with boundary, and $Y$ is a compact homogeneous manifold. We establish sufficient conditions on the warping function ensuring a Ricci lower bound, a uniform non-collapsing volume condition, and the orbit-growth hypothesis of the abstract existence theorem proved in \cite{JFA}. We also obtain comparison bounds for the admissible warping functions. We analyze the corresponding radial equations for the admissible exponential and linear models $φ(r)=e^{ar}$ and $φ(r)=ar$, with $r\geq r_0>0$. For a constant diffusion exponent $q=k$, we consider explicit decaying profiles $u=φ^{-σ}$, which belong to $L_1^k(M)$ provided $σk>\dim Y$ in the exponential case and $σk>\dim Y+1$ in the linear case. Under additional explicit parameter restrictions, these profiles solve a resonant equation with a positive bounded coefficient, a construction distinct from the superlinear regime of the abstract existence theorem. Finally, we establish logarithmic reductions for constant and variable radial exponents, and justify the passage from radial identities to weak formulations against arbitrary compactly supported interior test functions.

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

Information Theory16

Finding exact solutions for the statistics of definite noncentral complex Gaussian quadratic forms (CGQFs) has long been a challenging problem. Among existing exact approaches, Raphaeli's formulation [1] remains the most computationally efficient. However, its analytical tractability is hindered by the dependence of its series coefficients on the evaluation variable, which confines their statistics to the probability density function (PDF) and cumulative distribution function (CDF). This paper overcomes this limitation by deriving novel Gamma-mixture representations for the PDF and CDF of positive- and negative-definite noncentral CGQFs. The resulting structure broadens Raphaeli's statistical framework beyond the PDF and CDF to a wider class of CGQF functionals and a substantial range of practical applications. In particular, expectations of integrable functions of definite noncentral CGQFs are expressed as weighted sums of the corresponding expectations over Gamma random variables, enabling the direct derivation of moments, transforms, and performance measures. Moreover, the proposed formulation reduces the single-point complexity from \(O\!\left(n^2K+nK^2\right)\) for Raphaeli's method to \(O\!\left(nK+K^2\right)\), where \(n\) denotes the quadratic-form dimension and \(K\) the truncation order. The proposed Gamma-mixture structure also enables closed-form approximations that, by construction, remain valid probability distributions for any truncation order. In addition, uniform PDF and CDF truncation-error bounds are derived, allowing prescribed-accuracy truncation. As a sample application, we derive the first reported exact average bit error rate expression for maximal-ratio combining receivers with an arbitrary number of branches under an arbitrary positive-definite Rician correlation structure.

fields
Information Theory
pdf ↗ page arXiv:2611.08689 ↗

We develop a Levenshtein-type linear programming framework (for maximal $s$-codes and for minimal energy) for $(a,b)$-avoiding spherical codes, that is, codes whose inner products between distinct points avoid $(a,b)$. We introduce and investigate signed measures that are positive definite up to an appropriate degree and yield stationary auxiliary linear programming polynomials and exact quadrature formulas. We give explicit conditions for positivity of the quadrature weights and sufficient Krein-type conditions for nonnegative Gegenbauer coefficients (positive definiteness of the candidate optimal linear programming polynomials). Under these hypotheses and suitable node-location assumptions, the resulting cardinality bounds are optimal within the corresponding degree restriction and unique under natural nondegeneracy conditions. Under proper conditions on the quadrature nodes, we obtain universal lower energy bounds by utilizing Hermite interpolants as polynomial solutions of the respective linear program. Common test functions characterize optimality in the full polynomial linear programs under mild additional assumptions.

comments
29 pages
fields
Information Theory, Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.08709 ↗

This paper considers uplink communication design for training multiple independent machine learning models via wireless federated learning. To reduce communication delay, we utilize multi-antenna beamforming and propose a multi-model over-the-air (M-OTA) uplink transmission and aggregation method for simultaneous training of multiple models. Devices are formed into groups for local model training based on the model assignments per communication round and simultaneously perform OTA aggregation over a multi-access channel. Based on the M-OTA transmission and reception process, we formulate a joint optimization of transmit and receive beamforming and device grouping over $T$ communication rounds to maximize the training convergence rates of all models. We analyze the per-model optimality gap, which captures the impact of noisy aggregation and inter-model interference on the learning performance. We further show that the $T$-round joint optimization problem can be decomposed into per-round online optimization to devise solutions. Following this, we propose a device grouping strategy that explores channel correlation among devices to maximize OTA aggregation performance. Furthermore, we present a low-complexity iterative algorithm for joint transmit-receive beamforming with closed-form updates. Simulation shows that our proposed M-OTA approach substantially outperforms the conventional single-model sequential OTA approach and other commonly used beamforming schemes.

comments
16 pages, 6 figures. Accepted by IEEE Transactions on Wireless Communications, 2026
fields
Information Theory
pdf ↗ page arXiv:2611.08783 ↗

While integrating uplink without disrupting the primary downlink remains a critical challenge for existing reflective communication systems, this paper proposes a non-orthogonal passive integrated sensing and communication (ISAC) mechanism termed Sensing-based Communication. Originating from and validated within an optical retro-reflective system, this mechanism possesses an underlying wave-agnostic architecture with the potential to be generalized across other physical modalities. It leverages incident downlink signals for parasitic modulation via passive tags. By relying solely on fundamental on-off keying (OOK) reflection, the tag unifies the reflective sensing channel and the uplink communication channel, and simultaneously achieves both sensing and duplex communication. Consequently, our approach introduces uplink capability without sacrificing the downlink data rate or consuming additional spectrum resources. At the receiver, we design a joint decoding architecture combining cross-correlation computation and successive interference cancelation (SIC) to fully exploit the degrees of freedom in broadband signals for multi-user interference suppression. We derive closed-form expressions for the interference and bit error rate (BER) assuming zero-mean Gaussian signals. Using an experimental testbed, we validate the pivotal theoretical finding, the scaling relationship of SINR with signal bandwidth and cross-correlation time–where linear regression yields a strong goodness-of-fit with $R^2 = 0.9688$. Furthermore, evaluations under noise-like orthogonal frequency division multiplexing (OFDM) waveforms exhibit high consistency between theoretical derivations and simulation data ($R^2 = 0.9372$, mean absolute percentage error, $\text{MAPE} = 14\%$), confirming the model's accuracy and waveform generalizability.

fields
Information Theory
pdf ↗ page arXiv:2611.08809 ↗

In recent years, the Schur products of linear codes have been extensively studied due to their favorable applications in cryptography. In this paper, we aim to study the parameters of the Schur products of some nonbinary narrow-sense antiprimitive BCH codes. Let $\mathcal{C}_1$ and $\mathcal{C}_2$ be two narrow-sense antiprimitive BCH codes with designed distances $δ_{1}$ and $δ_{2}$, respectively, where $2\le δ_{1},δ_{2}\le n$. Let $\mathcal{C}_1\star\mathcal{C}_2$ be the Schur product of $\mathcal{C}_1$ and $\mathcal{C}_2$. We present some necessary and sufficient conditions for $\mathcal{C}_1\star\mathcal{C}_2\ne\mathbb{F}_q^n$ by applying some constraints to $δ_{1}$ and $δ_{2}$. Furthermore, we determine the dimensions of these products and lower bounds on their minimum distance. Several linear codes with best known parameters are found.

fields
Information Theory
pdf ↗ page arXiv:2611.08945 ↗

Vector approximate message passing (VAMP) often fails to converge on ill-conditioned matrices, and its damping factor is tuned either manually or adaptively. Using the fact that VAMP iterations are the discretization of an electric circuit, we show that the denoiser and the likelihood act as nonlinear resistors, the Onsager correction is a mirror resistor and damping is a lag filter. This circuit gives a closed-form loop gain whose spectrum can predict when VAMP fails. Because a lag filter cannot isolate the oscillating modes, we add a lead capacitor whose design often results in a negative capacitance. Across a wide range of condition numbers, our proposed damping strategy achieves a higher convergence rate than adaptive damping and Anderson acceleration at a lower mean iteration cost. On ill-conditioned multipath channels, across ranks and sparsity levels, it also converges more reliably than existing damping baselines.

fields
Information Theory
pdf ↗ page arXiv:2611.08982 ↗

We investigate the derandomized version of the classical line-point low-degree test in the high-error regime in the bivariate setting and reveal some unexpected behavior. The classical line-point low-degree test takes an $m$-variate function $f$ over a finite field $\mathbb{F}_q$, queries it along a random line and accepts if the restriction of the function to this line is a low-degree polynomial. The high-error version of (the analysis of) this test asserts that if $f$ has at least $ε$ expected local agreement with a degree-$k$ univariate polynomial on a random line, then in fact $f$ is non-trivially close to some degree-$k$ $m$-variate polynomial even as $ε$ approaches $0$ (provided $q$ is sufficiently large compared to $k$ and $1/ε$). The derandomized version of the problem asks if the same holds when the line is not chosen uniformly over all possible lines but rather from a small set.In this paper we explore the bivariate case ($m=2$). We show, somewhat surprisingly, that there exists a function $f\colon \mathbb{F}_q^2 \to \mathbb{F}_q$ and a set of lines $\mathcal{L}$ in $\mathbb{F}_q^2$ of size nearly $q^{3/2}$ such that on every line in $\mathcal{L}$, $f$ has agreement $\approx 1/2$ on average with some univariate polynomial of degree $k=\sqrt{q}/2$ and yet $f$ is $1 - O(q^{-1/2})$ far from every polynomial of degree $O(k)$. On the positive side, we show that once the field size $q$ is at least $k^2/(ε)^{O(1)}$ such examples disappear and we can get sets of lines of size $O(q/ε^{O(1)})$ on which the low-degree test has a high-error analysis. On the way to our positive result, we show a new high-degree version of the classical two-direction Polishchuk–Spielman divisibility lemma.

comments
Abstract shortened due to arxiv requirements
fields
Information Theory
pdf ↗ page arXiv:2611.09183 ↗

We present an enhanced informed dynamic scheduling (IDS) strategy to avoid propagations of unreliable messages in the residual belief-propagation (RBP) algorithm for decoding low-density parity-check (LDPC) codes. To reduce the resource needed for updating the degree-one variable nodes (VNs) in an RBP-based algorithm for decoding 5G New Radio (NR) LDPC codes, we further introduce a process consisting of several simple procedures for managing the resource consumption. Simulation results demonstrate that our RBP algorithm based on the Proposed IDS strategy outperforms existing RBP-based algorithms at the early decoding iterations. By using our degree-one VN resource managing approach, the performance of both the proposed and the existing decoders is significantly improved in decoding the 5G NR codes.

comments
7 pages, 5 figures, 2022 IEEE 96th Vehicular Technology Conference
fields
Information Theory
pdf ↗ page arXiv:2611.09184 ↗

We present a decoding algorithm for a Reed–Solomon product code targeted at the demanding reliability requirements of modern magnetic tape storage. For a code $RS(256, 224)\times RS(175, 173)$ in a BSC we achieve post-decoding bit error rate (BER) of $10^{-20}$ at $\approx 5.3\times 10^{-3}$ raw BER while maintaining the common requirement to detect and correct 4 out of 32 dead tracks. We resolve two common problems of miscorrections and stall patterns that arise under such a high raw BER via simplified versions of anchor decoding and binary image analysis. The highest efficiency is achieved by performing an unlimited iterative decoder, which performs decoding iterations until no changes are made. We give an empirical analysis of the average number of iterations: below the raw BER of $5\times 10^{-3}$, four half-iterations are performed on average while improving substantially over a decoder that always performs 4 half-iterations. We provide a CPU implementation achieving 100-200 megabytes/s single-core throughput on a regular laptop and a design of a potential hybrid FPGA-CPU implementation of our decoder.

fields
Information Theory
pdf ↗ page arXiv:2611.09366 ↗

We construct a universal decoder for cyclic Gaussian multiple-input multiple-output channels with intersymbol interference and unknown channel taps and spatial noise covariance. Codewords are drawn independently and uniformly from a sphere of fixed total energy. Under stated bounds on frequency variation, the decoder attains the ensemble-average error exponent of informed maximum-likelihood decoding for fixed channels and channels with growing memory. We approximate the frequency response by a constant matrix within each frequency block. For this auxiliary channel, every matched log-likelihood is affine in a common sufficient statistic. At fixed received output, we compute the statistic density of an independent competitor. The decoder selects the candidate with the smallest statistic density, equivalently minimizing a weighted sum of residual log-determinants. The density and its support volume give an upper bound on the universal competitor probability. Affinity ensures that at least half of a suitable symmetric neighborhood of the transmitted statistic has matched likelihood no smaller than that of the transmitted word. Integrating a density lower bound over this half gives the matched competitor bound. These bounds establish equality of error exponents, which a Gaussian channel comparison transfers to the original channel. The same decoder attains the matched exponent for independent frequency blocks with prescribed energies satisfying the stated conditions. For energies proportional to block length, an additional gain condition ensures that this exponent is at least that of the total-energy spherical ensemble.

comments
24 pages, 1 figure
fields
Information Theory
pdf ↗ page arXiv:2611.09383 ↗

Identical users running the same algorithm must often break their symmetry and agree on distinct roles, as in leader election, naming, and resource allocation. We study anonymous symmetry breaking over a discrete memoryless multiway channel invariant under permutations of its $J$ users: each user observes only a private output and must choose a number in $\{1,\dots,J\}$, and the symmetry is broken if the $J$ numbers are distinct. Using a Rényi change of measure, we derive a finite-blocklength converse on the error probability of every symmetric causal protocol, including adaptive and randomized ones. For achievability, block coding with random names reduces the problem to all-source multicast, for which we derive a Gallager random-coding exponent for every fixed $J$, and a cut-set bound that limits the exponent of the probability that two names coincide or are decoded wrongly. Interactive role controllers instead let the users contend for identifiers directly: we give their exact error probability, an achievable exponent given by a spectral radius when some outputs certify a role, and a floor for finite-state controllers when every output has positive probability, and we introduce generalized musical chairs. On a noisy bandit channel motivated by multiplayer multi-armed bandits, with noiseless collisions and arms of a common mean below one, interactive schemes provably exceed the limit of name decoding, and numerical estimates suggest the same with noisy collisions. For two users, noiseless collisions, one informative arm and a silent arm, the optimal error probability is determined up to a factor of two.

comments
Submitted to TIT
fields
Information Theory
pdf ↗ page arXiv:2611.09466 ↗

In distributed linear computation, $K$ users observe linear functions of common finite-field data and send separate messages to a server that wants another linear function. We characterize the generic capacity $C$, the minimum total number of field symbols sent per computed instance, when all observations and the demand have dimension $ν$, the data have dimension $μ$, and the coefficients of these linear functions are drawn independently and uniformly from the field and stay fixed during coding, with the field size growing through arbitrary prime powers. For fixed $K$, $C/ν$ depends only on $τ=μ/ν$: the curve has finitely many linear pieces for at most three users, infinitely many pieces approaching one value of $τ$ for four users, and a rational part between two sequences of linear pieces for five or more users. The geometry of the relation space, formed by the linear relations among the observations and the demand, determines three things: the shape of the curve, which relations the coding scheme aligns, and the entropy inequalities used in the converse. Generically, the user subspaces of this space are either balanced, where the capacity lies on a single rational curve, or split into two balanced components, a sparse and a dense one, which produces the linear pieces. Achievability uses asymptotic set alignment, in which monomial precoders confine the combined observation differences to a small set. The converse uses the same geometry to lower-bound the sum of the users' remaining observation entropies in terms of the remaining data entropy.

fields
Information Theory
pdf ↗ page arXiv:2611.09636 ↗

We study planning for finite-horizon partially observable Markov decision processes (POMDPs) with finite state, action, and observation spaces. Both exact and approximate planning are known to be computationally hard in this setting, so prior work has explored natural assumptions that make planning easier. Recent work [Golowich et al., 2022] gave quasipolynomial-time approximate planning algorithms for observable POMDPs. These are POMDPs whose observation channels satisfy an $\ell_1$-observability condition, but notably, no assumptions are required on the transition dynamics. In a similar vein, for every fixed $ρ>0$, we give quasipolynomial-time approximate planning algorithms for $ρ$-decodable POMDPs. We show that decodability is implied by both $\ell_1$- and $\ell_2$-observability and is strictly weaker than observability. Moreover, we show that the optimal decodability constant can be computed in polynomial time, whereas computing the optimal $\ell_1$-observability constant is NP-hard in the worst case. We also show that the fast filter-forgetting guarantee underlying the approach of [Golowich et al., 2022] does not extend directly from $\ell_1$-observability to constant $\ell_2$-observability. Thus, decodability is an easy-to-check, unifying assumption under which quasipolynomial-time approximate planning for POMDPs is possible.

comments
32 pages
fields
Information Theory, Optimization and Control
pdf ↗ page arXiv:2611.09778 ↗

We study the problem of synchronizing two players in a \emph{distributed multi-armed bandit} setting. The probability of \emph{synchronization error} is analyzed by recasting synchronization as a \emph{communication problem}. Using a well-designed random coding ensemble, we derive error exponents for the maximum-likelihood decoder. We then introduce a \emph{universal decoder} that achieves the same error exponents as the optimal decoder. Finally, applying these results to distributed multi-armed bandits, we show an upper bound on the regret of our synchronization scheme.

comments
Accepted at IEEE ISIT2026. 3 Figures, 6 pages. Theorem 7 redrawn
fields
Information Theory
pdf ↗ page arXiv:2611.09806 ↗

Data deduplication has become increasingly important in large-scale storage systems, driven by the rapid growth of digital data. By identifying and removing repeats in the data stream, deduplication saves storage space more efficiently than traditional compression methods. In this paper, we study the performance of variable-length deduplication and multi-chunk deduplication algorithms from an information-theoretic perspective, focusing on data streams where repeats are approximate rather than exact. We consider two probabilistic source models in which source strings consist of repeated blocks that are modified by either a constant number of substitution edits or burst-insertion edits per block, the latter capturing the localized edit patterns commonly observed in real-world data. For both models, we show that variable-length deduplication achieves asymptotically arbitrarily large compression ratios, and that multi-chunk deduplication achieves compression within a constant factor of the source entropy under mild conditions.

fields
Information Theory
pdf ↗ page arXiv:2611.09842 ↗

Can a sender that only computes hashes, with a language model only at the receiver, transmit short human text more cheaply than a classical sender trained on the same domain? We answer with one pre-registered run on 1,000 English user utterances from Taskmaster-1. The primary endpoint is the cost per message to deliver 100% of the messages (hash bits, plus a 2-byte negative acknowledgement and the raw text when the first attempt fails), paired against an in-domain PPM order-1 sender. The hash-only sender delivered 857 of 1,000 messages on the first attempt and cost 192.8 bits per message, 18.4 bits more than PPM order 1 (95% bootstrap interval 10.9 to 26.3); by the pre-registered rule it spends more and is not equivalent within one byte. As secondary results we map measured sender memory against bits. The hash-only sender (8,190 B on a host build, keyed BLAKE2b tag included, as in every method) was the cheapest point in bits from 8,190 B up to, but excluding, PPM order 1 at 24,844 B, 45 to 46 bits below smaz2 and Unishox2; from PPM order 1 upwards, in-domain senders spend fewer bits, except order 2 pruned to 16 KiB. In airtime it loses to PPM order 1 on all five links priced, to Unishox2 on four, and to raw text with a tag on two, because each failure costs an acknowledgement frame and a fallback frame. A wider receiver search recovers half of the failures and makes the cost 7.7 bits lower than PPM order 1, at about three minutes of receiver time per failure, and still loses in airtime on four of five links. We report the measurement as a delimitation, with every deviation of the run.

comments
10 pages, 1 figure, 2 tables. Code, data and per-message results: https://github.com/msamoilenko/hash-sender-llm-receiver
fields
Information Theory
pdf ↗ page arXiv:2611.09848 ↗

Number Theory16

For the Erdős–Straus equation $4/n=1/x+1/y+1/z$, Vaughan's unconditional bound on the exceptional set $E(N)$ has stood at $|E(N)|\ll N\exp(-c(\log N)^{2/3})$ since 1970. We harness composite divisor witnesses at growing depth to cross this $2/3$ barrier unconditionally. On the full exceptional set $E(N)$, we prove the unconditional bound $|E(N)|\ll N\exp(-c'(\log N)^{5/7}/(\log\log N)^{2/7})$, improving the exponent to $5/7$ (with an intermediate stage at $7/10$). On the structured component $E_2^{\mathrm{small}}(N;J(N))$, an algebraic and spectral container hierarchy combined with a generating-polynomial large sieve reaches the exponent $1-o(1)$: $|E_2^{\mathrm{small}}(N;J(N))|\ll_κN\exp(-(\frac{1}{40960}+o(1))\frac{\log N}{(\log\log N)(\log\log\log N)^κ})$, matching the CRT capacity scale. These results resolve the obstructions to composite-witness sieving at growing depth. First, we replace subgroup generation by Kneser's stabilizer $K(M)$, which embeds into a $2$-primary character kernel, reducing container counts from $2^{Θ(J^{4})}$ to $\exp(\mathcal{O}(J^{2}\log\log J))$. Coupling this with a generating-polynomial large sieve, Markov $1/2$-popular symmetry containers, and Pontryagin–Plancherel character containers yields the exponent $1-o(1)$ on $E_2^{\mathrm{small}}$. Second, to bypass unlocalized diffuse divisor sheets without subset enumeration, we construct a semi-composite congruence sieve $s=pq\equiv-1\pmod{12ua}$ ($p\in(Z^{9/10},Z]$, $q\le Q$ rough). Conditioning on $n\bmod M_{\mathrm{small}}$ yields CRT mutual independence while decoupling the modulus $12ua\le 12Z^{1/4}$ from $q$; a Bonferroni majorant and the Bombieri–Vinogradov theorem then yield the unconditional $5/7$ exponent on all of $E(N)$. Finally, we study bilinear dispersion on $4uavw-4u^{2}v-w=n$ and difference sets $D(K_c)$.

fields
Number Theory
pdf ↗ page arXiv:2611.08717 ↗

Let $S_χ(N)= \sum_{n\leq N} χ(n)$, where $χ$ is a Dirichlet character modulo a prime $p$. For integral $r\geq 2$, Burgess gave bounds of the shape $S_χ(N) \ll N^{1-1/r} p^{(r+1)/(4r^{2})} \log p$. The factor of $\log p$ was reduced by several authors. We show that it can be removed completely.

comments
6 pages
fields
Number Theory
pdf ↗ page arXiv:2611.08816 ↗

For the integer metric defined by the square denominators of two distinct primes, we prove simultaneous approximation to zero in one prime metric and to any prescribed integer in the other. A normalized convolution argument gives a uniform central spectral bound. Random relative translations of smooth weights produce an exact positive cas cade; Fourier positivity places every normalized finer convolution below its value at zero. A far-field recursion, the growth of merged square powers, and a two-term logarithmic-form estimate give summable fac tor bounds. Consequently, for every fixed pair of distinct primes p,q, the mixed continuous character group is Z[1/(pq)]/Z: no irrational pa rameter is continuous. The mixed completion is the product of the one-prime completions. For each fixed pair this also gives a compati ble rational join and a strictly finer compatible join of the associated real TVG topologies, with the same prescribed real character group. Exact witness search terminates at every strict precision and integer target. We retain the structural, density, divisibility, sequence and finite-certificate results leading to this proof. The existence argument does not give practical witness-size or runtime bounds, and it does not assume independence or equidistribution of the two digit systems. Se lected abstract components have been checked using Lean and Mathlib; the complete analytic argument has not been formalized. The corre sponding problem for three or more primes remains separate.

fields
Number Theory, General Topology
pdf ↗ page arXiv:2611.08964 ↗

We establish the binary Goldbach conjecture which asserts that every even positive integer greater than four can be expressed as a sum of two odd primes. This goal is achieved by proving that the number of ordered Goldbach pairs that add up to $2n$ is an $\mathcal{O}\left(\frac{n}{\ln^{2} n}\right)$ function. As an application, we provide a simpler verification of the ternary Goldbach conjecture that was first established in [6,7].

comments
9 pages, 2 figures, 1 code
fields
Number Theory
pdf ↗ page arXiv:2611.09007 ↗

We prove that every number field of odd degree $n\geq 3$ and absolute discriminant $D$ has an integral defining polynomial whose coefficients are $O_n(D^{(n-1)/(2n-1)})$ in size. This strengthens, in odd-degree cases, the recently established bound of $O_n(D^{1/2})$ for all degrees $n$, which was conjectured in 1998 by Ruppert and is now known to be optimal in even degrees. More generally, we prove that this strengthened bound holds for all degree-$n$ fields having a real embedding and no subfield of index two. The proof makes use of the lattice shapes of the ring of integers and its trace dual, the inverse different. Assuming the quasi-Riemann hypothesis for Dedekind zeta functions, as recently announced by Cureton and Thorner, we obtain an exponent smaller than $1/2$ for every field with no index-two subfield, of any signature. In the case of primitive fields, we obtain the exponent $(n-1)/(2n)$. In particular, we prove that the optimal exponent for cubic fields is $1/3$.

comments
17 pages
fields
Number Theory
pdf ↗ page arXiv:2611.09031 ↗

Let $Q\subset\mathbf P^{d+1}_k$ be a smooth quadric of dimension $d\ge2$ over a number field, and let $H_i=Q\capΠ_i$ be hyperplane sections for $1\le i\le d$. For every integer $m\ge2$, we prove Campana strong approximation for the pair $\bigl(Q,(1-1/m)(H_1+\cdots+H_d)_{\mathrm{red}}\bigr)$.

comments
14 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.09148 ↗

Let $E\colon y^2=x^3-Dx$ have rank two and let $p\equiv1\pmod4$ be a prime of good reduction. We study the conjecture that the $p$-adic quotient $q_p$, the leading coefficient of the cyclotomic $p$-adic $L$-function divided by the Euler factor and the $p$-adic regulator, equals the complex quotient $q_\infty=L''(E,1)/(2Ω_E\mathrm{Reg}_\infty)$, and that the latter is rational. In rank one the analogous statement is a theorem of Perrin-Riou and Rubin, because a Heegner point computes both sides; in rank two there is no such point. We show that $q_p$ is the constant of the quadratic term of the two-variable Katz measure; this is how the conjecture arises, and it computes $q_p$ modulo any power of $p$ from critical Hecke $L$-values. We then show that $q_p$ is the coordinate of two global classes: Rubin's rank-two elliptic-unit class, whose position in $E(\mathbb{Q})\otimes\mathbb{Q}_p$ is $q_p$ times an explicit vector, and the derived Heegner class over an auxiliary imaginary quadratic field $F$, for which we prove an exact identity. As consequences, whenever such a field $F$ satisfying our hypotheses exists, $q_p$ is a square in $\mathbb{Q}_p$ times the product of the Tamagawa numbers of $E$, so that the unit $q_p/A_E$ of the $p$-adic Birch and Swinnerton-Dyer formula is a square when Sha is finite; if moreover the derived Heegner class has non-zero formal logarithm, the conjecture of Agboola and Castella for $E/F$ holds up to a $p$-adic unit, and with a theorem of Burungale, Castella and Skinner the anticyclotomic main conjecture holds integrally; and our conjecture is equivalent to the analytic form of theirs, with the products of anticyclotomic heights read sesquilinearly, which differs by a sign from its literal formulation. The conjecture is verified modulo $p^3$ for 5520 pairs $(E,p)$ with conductors up to $3.9\cdot10^{12}$, including curves with analytic Sha of order 4 and 9.

comments
38 pages. Code and data: https://doi.org/10.5281/zenodo.23982770
fields
Number Theory
pdf ↗ page arXiv:2611.09192 ↗

We solve Problems 1, 2, and 3 posed by Marnat, Moshchevitin, and Schleischitz (arXiv:2505.15964). We consider totally irrational real n-by-m matrices and two conditions on their sequences of best approximations: (B) bounded successive height ratios and (C) bounded successive error ratios. Under (C), we prove that the ordinary Diophantine exponent is at most m and, when both dimensions are at least two, that the uniform exponent is at most m^2/(m+1). Combining these bounds with known results, we determine the individual spectra of both exponents under (C), with and without the additional assumption (B). When both dimensions are at least two, imposing (B) changes neither spectrum. A key ingredient is a block lemma for consecutive best approximations lying in a fixed rational subspace.

fields
Number Theory
pdf ↗ page arXiv:2611.09206 ↗

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
pdf ↗ page arXiv:2611.09312 ↗

Let $φ$ be a fixed polynomial with integer coefficients, positive leading coefficient and degree $k\geq2$. We prove that the values $2φ(n)$, $1\leq n\leq N$, can be written as the sum of two primes, apart from at most $N^{α_k+o(1)}$ exceptional indices, where $α_k<1$. For quadratic polynomials the exponent is $1/2$, for cubic polynomials $5/8$, for quartic polynomials $3/4$, and for $k>4$ it is $1-1/(k+1)$. The proof combines a fourth-moment estimate over primes with mean-value estimates over arbitrary subsets of polynomial sequences.

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

Over every number field, curves whose Jacobians have absolutely irreducible $\ell$-adic Tate modules exist in every positive genus and can be chosen hyperelliptic. Over $p$-adic fields, however, inertia and Frobenius can exclude entire genera. We classify the genera that occur for $\ell\ne p$ in terms of the residue characteristic and the cardinality of the residue field. For odd $p$, we also classify the genera occurring for hyperelliptic curves. These genera have relative density zero among those occurring for arbitrary curves, yielding Jacobians whose isogeny classes contain no hyperelliptic Jacobian. For odd $p$ and even residue degree, we obtain further restrictions on the genus when the curve itself is required to have potentially good reduction. Over number fields, we obtain uniform bounds from absolute irreducibility of the Tate module at two finite places of distinct residue characteristics different from $\ell$. The dimension of the abelian variety alone bounds the number of isomorphism classes in its isogeny class and the least degrees of isogenies between them.

comments
31 pages
fields
Number Theory
pdf ↗ page arXiv:2611.09393 ↗

We investigate a family of permutation polynomials of finite fields using the theory of quadratic and linear forms. For an odd prime power $q$, consider polynomials over $\mathbb F_{q^n}$ of the form $\sum_{0\le i\le j<n}a_{ij}x^{q^i+q^j}+L(x)$, where $a_{ij}\in\mathbb F_{q^n}$ and $L$ serves as an $\mathbb F_q$-linear endomorphism of $\mathbb F_{q^n}$. In this paper, we begin with a general treatment over arbitrary fields of characteristic not $2$, and then provide explicit characterizations for several classes of such permutation polynomials.

fields
Number Theory
pdf ↗ page arXiv:2611.09629 ↗

Congruence families occur throughout the theory of modular forms. These families superficially resemble one another, though they can vary substantially in their overall difficulty. One major complication resides in the topology of the modular curve associated with a given congruence family. All previously studied families are associated with curves of genus 0 or 1. The existence of a family associated with a curve of genus 2 (and the associated difficulties of a proof thereof) was first speculated upon by Gordon and Hughes. We give the first explicit congruence family associated with $\mathrm{X}_0(22)$, a modular curve of genus 2, and prove it. We also propose two families of conjectures associated with the same modular curve.

fields
Number Theory
pdf ↗ page arXiv:2611.09681 ↗

Let $K$ be a finite extension of $\QQ_p$ with uniformizer $π$ and residue field $\FF_q$. For each $r\ge1$, we determine the largest integer $E_r$ such that $\Tr(A^{q^r})\equiv\Tr(A^{q^{r-1}})\pmod{π^{E_r}}$ for every integral matrix $A$ with a prescribed residual similarity class. We give formulas for both nilpotent and nonnilpotent residual classes and construct integral lifts attaining the resulting exponents. We also exhibit local fields with the same ramification index and residue field for which the optimal exponents differ, even when $r$ and the residual similarity class are fixed.

fields
Number Theory
pdf ↗ page arXiv:2611.09711 ↗

For a Haar unitary matrix $U_N$ of size $N$, we prove that the first absolute moment of $\operatorname{tr}(\operatorname{Sym}^k U_N)$ tends to zero as $\min(N,k)\to\infty$. This settles the random matrix version of Harper's beyond square-root conjecture formulated by Wang and Xu, with no restriction on $k/N$. The proof is elementary and self-contained, combining exact weighted trace moments with a Gaussian change of measure. It also connects the result to the critical chaos model studied by Soundararajan and Zaman, also known as holomorphic multiplicative chaos.

comments
7 pages
fields
Number Theory, Probability
pdf ↗ page arXiv:2611.09753 ↗

In the present paper, we provide formulas for the special values of dual Goss $L$-functions of Drinfeld modules at any non-negative integer in terms of the determinant of the values of a motivic map, extensively studied by both authors in 2026, for a large class of Anderson modules. Our result may be seen as a function field analogue of conjectural formulas for special values of motivic $L$-functions in terms of algebraic Mellin integrals.

comments
40 pages
fields
Number Theory
pdf ↗ page arXiv:2611.09821 ↗

Dynamical Systems15

We study singularities and collision criteria for a massless particle around a fixed finite straight segment with an arbitrary positive continuous density. We first show that every singularity forces the trajectory to approach the material segment. Using the axial symmetry of the potential, we prove that any trajectory approaching the segment is confined to an invariant plane containing it. Moreover, we show that every singularity is either a collision singularity or an ejection singularity. Finally, in the invariant plane, we introduce an angular-cone condition for positions and momenta directed toward the segment. We prove that if the initial position-momentum pair belongs to the angular cone, then the trajectory collides with the segment in finite time, and we derive an upper bound for the collision time. We further prove that the final arc of any collision satisfies the angular-cone condition.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.08625 ↗

Understanding the stability of large nonlinear dynamical systems is a fundamental problem in many fields, including biological, technological, and social networks. Traditional stability methods often rely on explicit eigenvalue calculations or the construction of Lyapunov functions, which become computationally difficult for large interconnected systems. In this work, we introduce a stability classifier that provides a computationally efficient way to determine the stability of complex systems without performing full spectral analysis. Our approach combines the Dynamical Jacobian Ensemble framework, which uses the network structure and the underlying dynamics to construct a Jacobian, with the Gershgorin disc theorem, which provides bounds on the eigenvalues of the system's Jacobian matrix. Using this combination, we derive an analytical classifier that predicts whether a dynamical system is asymptotically stable, unstable, or sensitively stable based on a small set of dynamical and network parameters. The analysis reveals that the stability of large dynamical systems is strongly influenced by highly connected hub nodes. This observation allows the stability condition to be simplified by focusing on the contribution of the hub-associated Gershgorin disc. Extensive numerical simulations on large ensembles of Jacobian matrices confirm that the proposed classifier accurately separates stable, unstable, and sensitively stable regimes across a wide range of dynamical parameters and network structures. The resulting framework provides a simple and scalable tool for predicting the stability of large dynamical networks while capturing the interplay between network topology and interaction dynamics.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.08692 ↗

For integers $d,m\ge2$ with $1/d+1/m<1$, we construct a uniformly quasiregular map of $\mathbb{S}^3$ of degree $d^2+m^2$ whose Julia set is a Cantor set of concentric round spheres. To our knowledge, this is the first example of a uniformly quasiregular map in dimension three with infinitely many Fatou components. The map is a three-dimensional analogue of McMullen's maps $z^d+λ/z^m$, built from two Zorich-type power maps glued across a single shell by a slit construction. Its Julia set has Hausdorff dimension $2+s$, where $d^{-s}+m^{-s}=1$, and the restriction of the map to its Julia set is a skew product over the shift on two symbols and has topological entropy $\log(d^2+m^2)$. We also prove that uniformly quasiregular maps that expand uniformly near their Julia set, possibly with branching there, have no wandering domains and only finitely many periodic Fatou components, all of them attracting basins. The map constructed here belongs to this class.

fields
Dynamical Systems, Complex Variables
pdf ↗ page arXiv:2611.08773 ↗

We extend the KAM theory for one dimensional Frenkel-Kontorova model to multidimensional case in quasi-periodic media. By using the quasi-Newton method, we reduce the linearized operator with quasi-periodic coefficient in the Nash-Moser iteration to the composition of two diagonal operators and a near-identity operator, such that the small divisor problem can be overcome by imposing the simultaneous Diophantine condition. In contrast, we also discuss the application of Craig-Wayne-Bourgain method to the quasi-periodic equilibrium problem.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.08885 ↗

We construct infinite words $w$ whose complexity functions are quadratically bounded, but whose discrete derivatives are not linearly bounded, resolving a question of Cassaigne. Moreover, we construct infinite words of polynomially bounded complexity, and subshifts of quasi-linear complexity, whose discrete derivatives do not decay compared to their complexity functions, thus exhibiting a typical exponentially-growing behavior. As an application, we give the first examples of subshifts of polynomial complexity whose Rauzy graphs do not have Benjamini-Schramm limits. Finally, we realize (up to an inevitable linear error factor) every function satisfying the necessary conditions, as the complexity function of a minimal, uniquely ergodic, cube-free subshift, strengthening previous realization results in this direction, and derive consequences for the growth of simple algebras and just-infinite semigroups satisfying nontrivial laws.

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

High-index saddle dynamics (HiSD) has been extensively adopted to compute saddle points of arbitrary index, with various applications such as constructing solution landscapes of complex systems. In this work, we prove the asymptotic stability of various HiSD methods, including the idealized, perturbed, and coupled HiSD methods, as well as their momentum-accelerated variants. The analysis is Jacobian-free and thus compensates for the linear stability analysis in the literature. The results not only provide specific characterizations for the convergence rate and the basin of attraction, but also reveal intrinsic correlations among dynamics in the coupled HiSD. Theoretical results are substantiated by numerical experiments.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.09049 ↗

We study the Hausdorff dimension of proximal planar self-affine sets whose defining maps have diagonal or anti-diagonal linear parts, with both types present. Such systems are irreducible but not strongly irreducible. Under a projective exponential separation condition, we show that the Hausdorff dimension equals the minimum of $2$ and the affinity dimension, thereby extending the dimension formula of Hochman–Rapaport to all proximal irreducible planar systems. When the affinity dimension is at most an explicit threshold determined by the Lyapunov exponents, the formula holds assuming only that there are no exact overlaps. Above the threshold, it holds under the strong open set condition. These dimension formulae are proved by approximation with finite diagonal subsystems. Assuming projective exponential separation, we also determine the pointwise dimensions of the coordinate projections of the equilibrium state. Below the threshold, the projections are not exact-dimensional: the pointwise dimension of each exists almost everywhere and takes exactly two values, each on a set of positive measure. At or above the threshold, both projections are exact-dimensional with dimension one.

comments
58 pages, 2 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.09066 ↗

We investigate the structural mechanisms governing $2$-nice and $k$-nice recurrence in measure-preserving dynamical systems. For weakly mixing systems, we establish a complete spectral characterization of two-sided $2$-nice recurrence via quadratic spectral functionals and Herglotz–Bochner duality, extending the theory to arbitrary integer polynomial configurations $\{0, p_1(n), p_2(n)\}$ with zero constant term and to actions of countable abelian groups. Using stationary Gaussian processes and Hermite mode decoupling, we construct explicit weakly mixing counterexamples separating one-sided and two-sided $2$-nice recurrence. Furthermore, we uncover a fundamental structural phase transition at $k=3$: while $k=2$ recurrence is rigidly controlled by a quadratic spectral functional whose two-sided symmetrization eliminates all higher-degree cumulants, at $k=3$ fourth-order centered correlations survive symmetrization and can drive a strict recurrence deficit even when the quadratic spectral functional remains strictly positive. Using lacunary and multi-frequency Riesz products alongside uniform Wiener lemmas, we analyze the upper Banach density obstructions of negative spectral sets, establish partial partition regularity on the spectral cone, resolve an inverse Furstenberg correspondence problem of Rodríguez Martín for countable groups via Bernoulli product extensions, and characterize spectral $2$-nice ultrafilters in the Stone–Čech compactification $β\N$.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.09143 ↗

In this work we extend the concept of Hecke algebras to a pair of a separable infinite profinite group and a closed core-free subgroup. Motivated by applications to minimal equicontinuous Cantor actions, which are characterized by such pairs, we characterize isometric *-algebra isomorphisms between such Hecke algebras by showing that they always arise as Koopman operators of homeomorphisms between the double coset spaces combined with the multiplication by some character. We then prove that two minimal equicontinuous Cantor actions with isometric isomorphic Hecke algebras have the same Steinitz order. We provide examples including the infinite dihedral group and the Grigorchuk group.

comments
42 pages, 0 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.09181 ↗

Let $Γ$ be a countable abelian group and $k\geq 1$. We establish that every minimal topological $Γ$-system of order $k$ is uniquely ergodic. This result, which was previously only known for finitely generated groups for arbitrary $k$, answers a question of Glasner, Gutman, and Ye and yields the answer to multiple questions by Candela, González-Sánchez, and Szegedy. As applications of our dynamical results, we obtain the following combinatorial theorems. Let $A\subseteq Γ$ be a set of positive upper Banach density. Then there are infinite sets $B_1,\ldots, B_k\subseteq Γ$ such that $B_1+\dots+B_k\subseteq A$. If $Γ$ satisfies a necessary divisibility assumption, then there are also $t\in Γ$ and an infinite set $B\subseteq Γ$ such that $A-t$ contains the set of all sums of $m$ pairwise distinct elements of $B$ for all $m\in\{1,\ldots,k\}$. For arbitrary $k$, these density finite sums theorems were only known in the integers previously.

comments
53 pages
fields
Dynamical Systems, Combinatorics
pdf ↗ page arXiv:2611.09333 ↗

For a connected Lie group $G$, we consider the action of Aut$(G)$ on Sub$_G$, the set of all closed subgroups of $G$ endowed with the Chabauty topology. We study the action of automorphisms of $G$ on Sub$^p_G$, the closure of the set of all closed one-parameter subgroups of $G$ in Sub$_G$, in terms of expansivity. We show that a nontrivial connected Lie group $G$ with dim$(G)\geq 2$ does not admit any automorphism which acts expansively on Sub$^p_G$. We also show that a certain class of subgroups of Aut$(G)$, which include all one-parameter groups of automorphisms in Aut$(G)$, do not act expansively on Sub$^p_G$. These results generalise a results of Chatterjee, Lekharu and Shah on tori and those of Prajapati and Shah on connected Lie groups of dimension greater than $1$.

fields
Dynamical Systems, Group Theory
pdf ↗ page arXiv:2611.09352 ↗

We prove that the standard map $f_k(x,y)=(x+y+k\sin2πx,\,y+k\sin2πx)$ of the two-torus satisfies $\log(2πk+4)-2^{430}\le h_m(f_k)\le\log(2πk+4)$ for every $k\ge\exp(2^{50000})$, where $h_m$ is the metric entropy with respect to area. Thus $h_m(f_k)=\log k+O(1)$, the order of growth observed numerically since Chirikov; in particular $h_m(f_k)>0$ for all large $k$ and $h_m(f_k)\to\infty$, as conjectured by Sinai. Moreover, for each fixed $c<1$ the points whose top Lyapunov exponent is below $c\log k$ fill an area $O(1/\log k)$. Positivity of $h_m(f_k)$ for all sufficiently large $k$, with a threshold that is not effective, was obtained in a recent preprint by OpenAI. We keep some of its architecture and follow it closely in about a third of the results. New here are an explicit covering argument for cancellations and a balance across scales at a fixed parameter, an inequality between mean shortfalls that replaces the compactness argument over limits of rescaled orbit geometries; together they yield the explicit constants and the entropy bound.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.09361 ↗

We prove that for every countable group $Γ$, in the space of nonsingular actions by $Γ$, there is an action whose orbit under conjugation is dense. This is the nonsingular analogue of the result of Glasner, Thouvenot, and Weiss that every countable group $Γ$ is weak Rokhlin, i.e., there is a dense orbit in the space of probability measure preserving $Γ$-actions.

comments
5 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.09453 ↗

In this work we study the discrete Smoluchowski equation with a multiplicative kernel and an additional term describing the spontaneous shattering of each particle into monomers at a constant rate $λ$. We show that the introduction of fragmentation suppresses gelation for $λ\ge 4$. We derive analytical expressions for the second moment and the monomer concentration $n_1(t)$. These expressions lead to a recurrence relation allowing the steady-state particle size distribution for $λ\ge 4$ to be calculated with machine precision. We validate our analytical and semi-analytical results via numerical simulations using a solver that employs the Fast Fourier Transform for computation of the right-hand side and a second-order Runge-Kutta method with adaptive time steps.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.09537 ↗

The Kuramoto model is a paradigmatic system for emergent synchronization phenomena, and significant efforts have been made to investigate its transition from incoherent to coherent dynamics. However, previous studies have almost exclusively assumed global coupling between the oscillators, even though many real-world systems are organized in specific network structures. Here, we fill this gap by examining finite-size effects in Kuramoto oscillator ensembles on networks with mixed-order interactions. Using numerical simulations, we show how parameters such as the size of the system, the average degree of the nodes and the strength of the interactions alter the behaviour of the transition to synchronization with respect to the known theoretical results that are derived for globally coupled infinite systems.

comments
12 pages, 6 figures
journal
A. Sharma, A. Suman, M. Anvari, M. Dev Shrimali, C. I. del Genio and S. Jalan, Eur. Phys. J. Spec. Top. 235, 7741 (2026)
fields
Dynamical Systems
pdf ↗ page arXiv:2611.09564 ↗

Statistics Theory14

We develop a design-based minimax theory for linear causal estimands under interference. We study the minimax risks of three problems: optimizing an estimator under a fixed design, optimizing an estimator and a design from a restricted class, or optimizing both over all designs. In each problem, we study the minimax risk over all estimators and over design-unbiased estimators separately. We allow any correctly specified exposure mapping, including the identity. Our theory represents causal inference under interference as a constrained sampling design on an expanded finite population of $\sum_i d_i$ potential outcomes, where $d_i$ is the number of exposure levels attainable by unit $i$. We describe the constrained sampling design by a weighted sampling hypergraph: its vertices are the potential outcomes, its hyperedges are the maximal sets of potential outcomes that can be jointly sampled under feasible treatment assignments, and its weights are induced by the randomization design. We show that the minimax risks of the fixed-design, restricted-design, and all-design problems depend, respectively, on the weighted hypergraph induced by the design, the collection of weighted hypergraphs attainable within the restricted class, and the unweighted hypergraph. Our Bayes lower bounds compare potential-outcome tables that differ on jointly missing sets of potential outcomes: joint-missingness probabilities govern the lower bounds over all estimators, whereas the corresponding odds govern the lower bounds over unbiased estimators. We illustrate the theory for average treatment effects without interference, saturation designs under partial interference, total, direct, and contagion effects under neighborhood interference, and bipartite dose-response contrasts. The upper and lower bounds match in several settings.

comments
36 pages, 1 figure, 97-page appendix
fields
Statistics Theory
pdf ↗ page arXiv:2611.08560 ↗

Many statistical estimators, including maximum likelihood and method of moments estimators, are defined as roots of estimating equations. In complex models, these equations often cannot be solved explicitly; although numerical methods can provide approximate solutions, closed-form approximations can reduce computation and facilitate theoretical analysis by making an estimator's dependence on the data more transparent. In this paper, we develop a general approach to constructing such approximations and a framework for quantifying their accuracy. Our theory accommodates sequences of parameters that approach the boundary of the parameter space or diverge to infinity, and provides conditions under which a closed-form approximate estimator has the same first-order asymptotic distribution as its exact counterpart. We focus on approximations to maximum likelihood estimators, although the theory applies to general estimating equations. We apply the framework to iid models from the gamma, zeta, von Mises, and generalized Pareto families, as well as to gamma regression. Together, these examples cover scalar and vector parameters, iid and non-iid settings, and normal and nonnormal asymptotic regimes. Each example is accompanied by a simulation study, and the gamma regression example also includes a real-world data application.

comments
97 pages, 12 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.08746 ↗

Low-rank approximation is a basic tool for inference from large and noisy data matrices. However, when noise variances differ across entries, a setting known as heteroskedasticity, the noise can distort the observed spectrum, producing spurious components and obscuring weak signals. To address these challenges, we develop BRINE (Blind Resolvent-based Iterative Noise Equalizer), a data-driven procedure that iteratively rescales rows and columns to equalize the average noise variance across both dimensions. Under suitable conditions, this procedure restores the Marchenko-Pastur law for the noise spectrum and can amplify signal components without prior knowledge of the signal or noise structure. A key idea underlying our approach is to equalize the diagonal entries of the data resolvent as a proxy for equalizing the unknown noise variances. At the population level, we identify a potential function that characterizes this equalization and motivates an iterative minimization procedure. We prove convergence of the iterations to the true equalizer for arbitrary positive variance profiles, with a geometric rate under mild conditions. The updates can be estimated directly from noisy data, and we establish probabilistic error bounds for the scaling factors. Simulations and experiments across diverse biological data modalities and preprocessing pipelines illustrate the effectiveness of our approach.

fields
Statistics Theory
pdf ↗ page arXiv:2611.08784 ↗

We prove that, for the pairwise-ordering model with at least three components, adding any run to an order-of-addition orthogonal array gives a $D$-optimal design among all exact designs of the enlarged size, allowing replication. We also establish the corresponding result for foldover designs: adding any reversal pair to a foldover order-of-addition orthogonal array gives a $D$-optimal design within the foldover class at the enlarged size. Both augmentations also minimise the average prediction variance and a covariance-scaled information discrepancy, and maximise the minimum relative efficiency. The key step represents the scaled discrepancy through signed comparisons of triples and derives a sharp integer lower bound; classical spectral inequalities then give the exact-size optima, and signed four-component relative-order counts characterise equality. Complete reversal pairs additionally protect the estimation of pairwise-ordering effects against arbitrary reversal-invariant nuisance means. At the smallest estimable five-component foldover size, exact enumeration identifies five determinant-optimal classes with different prediction and balance properties, and a seven-component example shows that deleting a reversal pair need not be optimal even when it minimises the discrepancy. Constructions through ten components illustrate the attained run sizes.

fields
Statistics Theory
pdf ↗ page arXiv:2611.08793 ↗

Reward models used for off-policy evaluation (OPE) are commonly selected using held-out data. When sample size and context dimension grow proportionally, the difference in test risk between models fitted on the full sample and on a fixed fraction of it need not vanish. Held-out evaluation can therefore consistently estimate the test risk of the model trained on the smaller sample, but because the relative ranking of candidate reward models can change after full-data refitting, held-out selection can be suboptimal. We develop an Onsager-corrected, target-policy-weighted criterion that estimates the full-data reward model's out-of-sample risk under the target policy using only its training observations. This enables early stopping along the full-data gradient-descent trajectory without sample splitting. For neural networks with fixed depth and hidden width under Gaussian contexts, single-index rewards, context-dependent multi-index target policies, and known context-independent logging, we prove uniform consistency of our criterion over a fixed finite set of gradient-descent iterates and a near-oracle guarantee for the selected reward model. The same correction yields a doubly robust estimator that consistently estimates the true policy value without sample splitting, even when reward-model prediction error does not vanish. Experiments show decreasing risk-estimation error as dimension grows at a fixed sample-to-dimension ratio, and improved reward-model selection relative to held-out baselines. Empirically, our correction also reduces the root mean squared error of doubly robust value estimates computed from the same data used to fit and select the reward models.

fields
Statistics Theory
pdf ↗ page arXiv:2611.08794 ↗

A source can make a training mixture easier to learn while making its accuracy less valuable for the target. We study how the training problem a source creates and the finite-sample error of learning it jointly determine target-risk guarantees under reweighting. For binary classification, for each pair of laws and each positive target weight, we derive the sharpest target excess hinge-risk bound implied by mixture excess alone, uniformly over clipped predictors. This exact conversion curve is determined by density-weighted local votes. A two-sample oracle inequality for weighted support vector machines supplies the mixture excess, and the composition becomes explicit for Gaussian kernels. On a tilted-boundary class, we establish the all-procedure minimax classification rate $[n+s_+^2/(m^{-1}+τ^2)]^{-1}$ in the transferable strength $s_+$ and the tilt $τ$, separating source sampling uncertainty ($m^{-1}$) from relation uncertainty ($τ^2$). A target-checked Gaussian-SVM selector adapts to unknown $s_+$ and $τ$ up to a logarithmic factor for fixed dimension, and retains the target-only rate up to the same factor against arbitrary independent sources under the stated target model. On a separate smooth opposition class, the minimax risk within the family of exact Gaussian SVMs fitted to the original labels with nonnegative weights is exponentially larger than the unrestricted minimax risk whenever the target sample is at most half the source sample, despite arbitrary data-dependent weighting and tuning. The value of a source thus depends on the training problem it creates, on what accuracy there means for the target, and on whether the permitted use of the source can implement the needed correction.

comments
87 pages, 5 figures. Main text (32 pages) followed by the Supplementary Material
fields
Statistics Theory
pdf ↗ page arXiv:2611.08876 ↗

We develop a supervised factor-augmented matrix regression framework for high-dimensional analysis with weak factors. When factor loadings are concentrated on unknown subsets of rows and columns, conventional full-matrix factor extraction may suffer substantial signal dilution, with weakness in one matrix dimension propagating to estimation in the other. We characterize this two-way weak-loading phenomenon for both \(α\)-PCA and projected estimators and show that their loading and factor estimates may deteriorate under weak signals. To address this problem, we propose a sequential response-guided screening procedure that identifies informative rows and columns prior to factor extraction. We establish exact support recovery and show that post-screening factor re-estimation converts the weak-loading problem into a pervasive one relative to the retained dimensions, yielding sharper convergence rates under substantially weaker dimensional growth conditions and consistent factor-number determination. We further establish asymptotic distributions for both unrestricted and bilinear regression estimators based on the estimated matrix factors. Simulations demonstrate substantial improvements in support recovery and factor estimation under weak signals. We illustrate the gains obtained by the response-guided factor construction with two empirical applications.

fields
Statistics Theory
pdf ↗ page arXiv:2611.08941 ↗

We study the group invariance of a parameterized statistical model that is closed under push-forward sample transformations given by a group action. We prove that the group action on the sample space induces an isometric action on the associated statistical manifold. Furthermore, it preserves the Fisher-Rao metric as well as the Amari-Chentsov tensor. Moreover, we establish that this isometric action is compatible with equivariant and sufficient statistics in the spirit of the Hall-Wijsman-Ghosh generalized Stein's theorem. This compatibility leads to a novel reduction of the original group-invariant model, where its Fisher information loss is explicitly quantified via conditional expectation. As an application, we apply this framework to a generalized cardioid distribution in circular data analysis, illustrating how the reduced model facilitates estimation and hypothesis testing for relative parameters.

comments
17 pages
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.09087 ↗

We study Byzantine-robust distributed sparse softmax regression in high-dimensional settings. We propose a communication-efficient distributed algorithm that employs robust aggregation methods—coordinate-wise trimmed mean and coordinate-wise median—to defend against Byzantine attacks. Under sub-Gaussian design assumptions with sparsity constraints, we establish that the distributed estimator achieves the convergence rate of $O_{P}(K^{\frac{5}{2}}\sqrt{s\log(Kd)/N})$ when the Byzantine fraction $α\asymp 1/\sqrt{m}$, matching the centralized oracle rate. Numerical experiments on synthetic data demonstrate the superior performance of the proposed method.

fields
Statistics Theory
pdf ↗ page arXiv:2611.09110 ↗

We consider the problem of estimating the distribution of a determinantal process (DP) on a measured space from the observation of $n$ independent copies of it. Our estimator is obtained by sampling from a $T$-posterior distribution associated with a suitable prior, and we establish non-asymptotic risk bounds for the Hellinger loss which hold with high probability. These bounds remain valid when the data are only independent rather than i.i.d., and when the model is misspecified, which makes the estimator robust, for instance, to the presence of a small fraction of outliers. For determinantal projection processes of rank $k$ whose kernels are associated with $k$-dimensional subspaces of a $D$-dimensional space, Haar priors on Grassmannians lead to a rate of order $\sqrt{k(D-k)\log n/n}$, and model selection extends this result to infinite-dimensional settings. For general DPs, we introduce priors based on the spectral decomposition of the kernel that combine uniform distributions on the eigenvalues with Haar measures on Stiefel manifolds. When the underlying space is finite with $N$ elements, we obtain a rate of order $N\sqrt{\log n/n}$, without any assumption on the kernel, and derive that the $2^{N}$ principal minors of the kernel can be estimated simultaneously. Finally, for translation-invariant DPs on the torus $\mathbb{T}^d$, we obtain rates that only depend on the smoothness of the kernel at the origin and that are adaptive with respect to it. Combined with a new lower bound on the Hellinger distance between such DPs, these rates also yield estimators of the kernel in $\mathbb{L}_2$.

fields
Statistics Theory
pdf ↗ page arXiv:2611.09426 ↗

This paper develops a general M-estimation framework for censored regression models under endogeneity. A two-stage estimation is proposed to address the issue of endogeneity in the first stage and the issue of censoring in linear regression models in the second stage. The issue of endogeneity is addressed via instrumental variables using the control function approach. The issue of censoring in linear regression models is addressed via M-estimation using a suitably defined class of loss functions yielding a class of estimators. Thus, the proposed general M-estimation framework nests several existing estimators as special cases for the respective loss functions. Moreover, this provides flexibility of accommodating a broad range of robust loss functions that have not previously been studied in the context of censored regression. We establish consistency and asymptotic normality for the proposed class of estimators. An empirical study based on simulated datasets is conducted to illustrate general M-estimation for various choices of loss functions and to examine the finite-sample performance of various resulting estimators.

comments
48
fields
Statistics Theory
pdf ↗ page arXiv:2611.09539 ↗

We study kernel-based learning of analytic operators from finite samples, with a focus on how the regularity of the target should determine the choice of the kernel. We establish embeddings of analytic operators into vector-valued reproducing kernel Hilbert spaces and derive finite-sample, high-probability guarantees that quantify the uncertainty due to random sampling: in the noiseless setting, suitable analytic kernels yield rates exponential in a fractional power of the sample size, while Sobolev-type kernels yield polynomial rates. We apply the theory to the solution operator of a parametric elliptic PDE, where the training data are themselves finite-element approximations, and obtain bounds that separate the sampling and discretization contributions to the error and prescribe how the mesh size should be coupled to the sample size. The results are illustrated numerically.

comments
43 pages, 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.09612 ↗

We consider Box-Cox transformations of correlation matrices, $Φ_α(C)=\mathrm{vecl}\{(C^α-I)/α\}$, with Jacobian $J_α$. The family nests the raw correlations at $α=1$, the generalised Fisher transformation (GFT), $C\mapsto\mathrm{vecl}(\log C)$, at $α=0$, and the negated off-diagonal concentration coordinates at $α=-1$. The inverse problem is a strictly convex program for every $α$, so every member is injective. The map is onto $\mathbb{R}^{d}$, $d=n(n-1)/2$, if and only if $α\le0$, such that $α=0$ defines the boundary for unrestricted parametrizations. For $α>0$ the image is bounded. The conditioning obeys the bound $κ(J_α)\leκ(C)^{|1-α|}$, where $κ(C)=λ_{\max}(C)/λ_{\min}(C)$, and on the surjective range the exponent is smallest at $α=0$. Under Gaussian sampling with $n\geq3$, the asymptotic covariance of the transformed sample correlations is the identity at independence for every member, but only $α=0$ retains the identity to first order in the correlations, whereas the leading joint third cumulant at independence vanishes only at $α=1/3$. Finally, applying the transformation to the diagonal rescaling of $C$ that makes the result hollow adds a new family to the existing correlation parametrizations. For every $α$ the rescaling solves a strictly convex problem and the inverse is explicit, and the scaled coordinates are unrestricted exactly when $α=0$, where they recover the known global normal coordinates, centred at independence, for the efficient information metric of the correlations.

comments
49 pages, 2 figures, 1 table
fields
Statistics Theory
pdf ↗ page arXiv:2611.09790 ↗

Differential privacy (DP) is a leading framework for privacy protection, yet privacy mechanisms tailored to functional data analysis (FDA) remain relatively underexplored. For functional mean estimation, we investigate a fundamental question regarding the ordering of privatization and estimation by comparing two canonical pipelines: Fit-Then-Protect (FTP), which smooths trajectories before privatization, and Protect-Then-Fit (PTF), which privatizes observations at discrete time points before smoothing. When data are observed without error, we prove that FTP achieves strictly smaller mean squared error than PTF asymptotically (as the sample size increases) under the same $μ$-Gaussian differential privacy ($μ$-GDP) budget in both finite-dimensional Hilbert spaces and infinite-dimensional reproducing kernel Hilbert spaces (RKHS). Simulation studies support our theory and explore settings with observation error and fitting constraints, demonstrating that FTP outperforms PTF under small observation noise, whereas PTF can become preferable in high-noise settings. In addition to this comparison, we establish a novel GDP guarantee for Gaussian perturbations taking values in a Banach space, extending existing results beyond the RKHS setting.

comments
45 pages, 6 figures, 1 table
fields
Statistics Theory
pdf ↗ page arXiv:2611.09799 ↗

Complex Variables11

We study the rate at which the $p$-Bergman metric approaches the Carathéodory metric on convex domains with measures comparable to $δ^αdV$, $α>-1$. On smooth convex domains of finite type the logarithmic coefficient is bounded above by the harmonic-measure average of the tangential multitype dimension plus $1+α$, with equality when almost every endpoint of the extremal disc is coercive. For a class of convex domains in $\mathbb{C}^2$ with $C^4$ boundary and rank-one real tangential contact along an axis disc, a winding number distinguishes the coefficient $2+α$ from an upper bound $7/4+α$; quartic contact makes the latter bound exact. The exact value holds along the entire axis of explicit real-algebraic strongly pseudoconvex domains, including perturbations without the weighted circle action, although their pointwise boundary models agree up to unitary equivalence with those of a domain having coefficient $2+α$. A $C^2$ example has negative winding but coefficient $2+α$, with a $-\frac12\log\log p$ correction, so boundary regularity is essential to the gap theorem.

comments
32 pages, 3 figures
fields
Complex Variables
pdf ↗ page arXiv:2611.08616 ↗

We combine McShane's identity for a once-punctured torus with the length-spectrum identity of Wang and Xue. An exact identity in each primitive homology class yields a finite limit for the difference of two divergent length-spectrum sums over self-intersecting hyperbolic geodesics. The limit is $\frac18$ and is equivalent to McShane's identity. We also derive higher-iteration identities governed by integer divisors.

comments
7 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.08687 ↗

Approximation theory in the complex plane is a well established area of mathematical research, with extensive contributions documented in the literature, notably through the classical results of Weierstrass, Runge, Mergelyan, and Vitushkin. Approximation theory in quaternionic settings, particularly rational approximation on compact sets, which studies when slice regular functions can be uniformly approximated by rational functions, is one of the recent areas of interest in quaternionic rational approximation theory (See [6,13]). In this paper, we discuss Vitushkin approximation theorem in the quaternionic setting by using the quaternionic analogue of analytic capacity and also we establish Davies modified Vitushkin scheme in quaternionic setting. We also discuss quaternionic analogue of $γ_{+}$- capacity and Cauchy capacity and the remarkable results of Tolsa [35] and Younsi [45] related to these capacities in complex plane setting.

comments
Preliminary Draft, 88 Pages
fields
Complex Variables
pdf ↗ page arXiv:2611.08893 ↗

We consider bounded Volterra-type operators $T_g$ from the weighted Bergman space $A^q_β$ to $A^p_α$. The holomorphic optimal domain $[T_{g},A^p_α]$ is introduced and shown to be a quasi-Banach space. We show that the intersection of the optimal domains is equal to $A^q_β$ if $p\le q$, while if $p>q$, it is strictly larger than $A^q_β$. Moreover, $A^q_β \subsetneq[T_{g},A^p_α]$ is established for $p\neq q$. If $p=q$, by contrast, $A^p_β$ may coincide with $[T_{g},A^p_α]$. The multiplier algebras and strict inclusions with respect to varying parameters are established. For example, we determine exactly when $[T_{g},A^s_γ] \subset [T_{g},A^p_α]$ for some $g\in \operatorname{Hol}(\mathbb{D})$. We further study the set $V_g^p$ and characterize the coincidence of the holomorphic optimal domains.

comments
23 pages, 0 figures
fields
Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.08915 ↗

Let $φ$ be an elliptic univalent self-map of the unit disc in the complex plane that is not an automorphism, with multiplier $0<|λ|<1$ at its Denjoy–Wolff point. The simultaneous Schröder linearization of maps commuting with $φ$ is classical. Using this linearization, we identify its univalent centralizer with the multiplicative semigroup of scalars that preserve the Koenigs domain, and investigate how the geometry of this semigroup controls continuous-time embeddings. We show that the identity is a non-isolated point of the centralizer precisely when the centralizer contains a non-trivial continuous one-parameter semigroup; such a semigroup need not contain $φ$. For each logarithmic branch $μ_k=-\mathrm{Log}λ+2πi k$, we establish a local sector alternative that characterizes the existence of an embedding with spectral value $μ_k$. We prove that the set of admissible branch indices is either empty, a finite interval of integers, or all of $\mathbb{Z}$, and give examples realizing all three possibilities. Finally, we describe the full holomorphic centralizer, including the constant map with value equal to the Denjoy–Wolff point.

comments
13 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.08944 ↗

On a bounded open subset of $\mathbb{C}^n$, we study the Dirichlet form induced by an admissible pair $(θ,μ)$, where $μ$ is a positive Radon measure and $$θ=dd^c u_1\wedge\cdots\wedge dd^c u_{m-1}\wedge(dd^c \lvert z\rvert^2)^{n-m}$$ for locally bounded $m$-subharmonic functions $u_1,\dots,u_{m-1}$. We prove that locally bounded $m$-subharmonic functions belong locally to the domains of these Dirichlet forms and are quasi-continuous with respect to the induced capacities. We establish a monotonicity property for Dirichlet forms, which motivates the introduction of $μ$-quasi-monotone convergence of $m$-subharmonic functions. The natural embeddings into these domains are continuous with respect to this convergence. These results yield new proofs of the commutativity and continuity of complex Hessian operators. Using this framework, we characterize quasi-continuity with respect to the induced capacity for an arbitrary $m$-subharmonic function in terms of its pole set having zero measure $μ$, or equivalently, zero induced capacity. On bounded strictly $m$-pseudoconvex domains, we prove that the Bedford–Taylor capacity for $m$-subharmonic functions and the capacities induced by the corresponding Dirichlet forms have the same null sets. We further characterize $m$-polar sets in terms of Dirichlet forms and stochastic processes, extending the corresponding characterization of pluripolar sets due to Fukushima and Okada to the $m$-subharmonic setting.

comments
50 pages. Comments are welcome
fields
Complex Variables, Functional Analysis, Probability
pdf ↗ page arXiv:2611.09152 ↗

The periods of holomorphic differentials give an explicit lower bound for the curvature of Bergman evaluation matrices. We prove this bound along the Green sublevels of a smooth plane domain. For scalar evaluation at the Green pole, equality at one regular level holds precisely when that sublevel is simply connected. For complete jets at the Green pole, the matrices have continuous first derivatives, including at critical levels, and their logarithmic determinant defects are integrals of nonnegative curvature densities. A further estimate bounds the accumulated period energy by the determinant defect, with a constant independent of the jet order. On a multiply connected domain, all these defects vanish up to the first critical Green value and become strictly positive above it.

fields
Complex Variables
pdf ↗ page arXiv:2611.09341 ↗

We prove that a bounded Jordan domain $Ω$ has Ahlfors $1$-regular boundary if and only if the following criterion holds for every positive Borel measure $μ$ on $Ω$: $μ$ is Carleson exactly when $\int_Ω|φ'(w)|\,dμ(w)<\infty$ for every conformal bijection $φ$ from $Ω$ onto a bounded domain with rectifiable boundary. The same characterization holds using only arclength measures on simple locally rectifiable curves, with the integral condition replaced by finite length of every such conformal image. These results extend Bishop's theorem on the unit disk. We also study analogous criteria for vanishing Carleson measures.

fields
Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.09467 ↗

We study the asymptotic behavior for forward and backward orbits of one-parameter semigroups of holomorphic self-maps of the unit disk. For both types of orbits, we determine the asymptotic growth rate of hyperbolic length and compare it with the total speed of the semigroup, obtaining sharp constants that depend on the intrinsic properties of the semigroup and on the starting point. In the process, we discover new characterizations for standard notions in the theory of semigroups. We further explore, from a potential theoretic scope, the rate by which compact sets in petals of semigroups degenerate to a boundary point in the backward dynamical setting.

comments
29 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.09686 ↗

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 ↗

Let $M\subset\mathbb{C}^n$ $(n\geq2)$ be a smooth pseudoconvex real hypersurface. We prove that, for every $1\leq s\leq n-1$, the regular $s$-contact type, the $s$-commutator type, and the $s$-Levi type coincide at every point of $M$, thereby resolving Bloom's conjecture in any dimension. The solution in dimension three was obtained in 2021 by the second and the third authors. Moreover, for any smooth rank $s$ subbundle $B\subset T^{1,0}M$, we establish the equality of the commutator type and the Levi type associated with $B$, giving an affirmative answer to the generalized D'Angelo conjecture.

comments
23 pages. Comments are welcome
fields
Complex Variables
pdf ↗ page arXiv:2611.09823 ↗

Rings and Algebras7

In this paper, we define a Drinfeld-type center for an associative crossed module and prove that it is canonically the internal category of an explicit crossed module constructed from Mac Lane's bimultiplications. The resulting center carries a canonical multiplicative lifting, which induces a natural strict braiding, establishing its correspondence to a braided crossed module. We also examine the relationship between this center and Huq's categorical center. Finally, we obtain a canonical comparison morphism with Pirashvili's center of Lie crossed modules via the (braided) Liezation functors, which preserves braidings under an injectivity condition.

fields
Rings and Algebras, Category Theory
pdf ↗ page arXiv:2611.09360 ↗

We study inclusions and intersections of products of verbally prime $T$-ideals over a field of characteristic zero. Our main tool is a Vandermonde-type construction of graded polynomials with a uniformly bounded number of variables. Together with a reduction to finite exterior algebras, this construction yields separating polynomials that work uniformly under bounds on Grassmann envelope representations. We prove that, under these bounds, an intersection of $T$-ideals is contained in such a product only if one member is. This proves Berele's Conjecture~3 and, consequently, his Conjecture~1 \cite{Berele2012}. We also characterize inclusions between ordered products by an explicit combinatorial criterion, proving his Conjecture~2 and answering his Question~2 \cite{Berele2012}. These results characterize inclusions between arbitrary intersections of products of nonzero proper verbally prime $T$-ideals and show that every nonzero such intersection has a unique finite irredundant representation. As an application, we characterize finite quivers whose path algebras have the same polynomial identities as some, equivalently every, positive power of their arrow ideals.

comments
30 pages. Substantially revised and expanded version of the part on polynomial identities in arXiv:2606.23024v2
fields
Rings and Algebras, Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.09415 ↗

In this paper, we introduce weighted $\mathcal{O}$-operators (also called weighted relative Rota-Baxter operators) on pre-Leibniz algebras. We construct a differential graded Lie algebra whose Maurer-Cartan elements are exactly these operators. This allows us to define their cohomology as that of the induced pre-Leibniz algebra with coefficients in a suitable representation. As an application, we study formal and finite order deformations of these operators. We show that this theory splits the corresponding theory for weighted $\mathcal{O}$-operators on Leibniz algebras. Finally, we introduce post-pre-Leibniz algebras as the algebraic structures underlying weighted $\mathcal{O}$-operators on pre-Leibniz algebras.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.09460 ↗

The definition of algebraic entropy presents a difficulty in the general setting of filtered algebras, which makes it necessary to distinguish between filtered algebras and finitely filtered algebras. While algebraic entropy is well defined in the finitely filtered case, extending this notion to arbitrary filtered algebras is not immediate. To address this issue, we realize a filtered algebra as the limit of a strict direct system of finitely filtered algebras and define its entropy as the supremum of the entropies of the algebras in the system. This extension is consistent with the original definition, when the algebra is finitely filtered, the extended entropy agrees with its algebraic entropy. This new setting allows us to extend the definition of the algebraic entropy to path and Leavitt path algebras of infinite graphs.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.09602 ↗

We establish a canonical topological lifting of Mundici equivalence, representing every topological MV-algebra as the unit interval of a topological $\ell$-group and extending the correspondence to a categorical adjunction. As applications, we give a direct group-theoretic proof of the equivalence of $T_0$ and $T_{3\frac12}$ and show that every topological MV-algebra is a retral space. We further extend the lifting to topological Riesz MV-algebras and identify the canonical topology with Wiweger's mixed topology under suitable assumptions, recovering the strict topology as a special case. Finally, we obtain a unit-interval formulation of Koopman representations for continuous-time dynamical systems.

comments
31 pages. An earlier version of this paper was posted on Zenodo: https://doi.org/10.5281/zenodo.23993183
fields
Rings and Algebras, Dynamical Systems, General Topology, Logic
pdf ↗ page arXiv:2611.09608 ↗

We construct a family of division ring extensions and compute their left and right dimensions. In characteristic zero, we obtain a counterexample to the pure semisimplicity conjecture: a hereditary right pure semisimple ring of infinite representation type. For each prime $p\ge3$, we construct in characteristic $p$ a hereditary artinian ring of finite representation type with Coxeter diagram $I_2(p+2)$.

comments
5 pages
fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.09749 ↗

In this paper, first we study the deformations, stability and rigidity of Lie triple system morphisms by means of higher derived brackets and augmented Yamaguti cohomology. The vanishing of the first cohomology gives formal and local inner rigidity. The vanishing of the second cohomology removes the formal extension obstructions and, in finite dimension over $\mathbb{R}$, gives local smoothness and stability under simultaneous perturbations of the two products. Next, we establish the relationship with Lie algebra homomorphisms in each part of the theory. The universal enveloping Lie algebra identifies a Lie triple morphism with a grading-preserving Lie homomorphism. We obtain the corresponding first cohomology isomorphism, the equivalence of formal and smooth deformations, and a stability result for graded Lie bracket perturbations. For Lie triple products induced by binary Lie brackets, we construct a comparison of differentials and obstruction classes. Under perfectness and a zero-centralizer condition, the local morphism spaces coincide. Finally, we relate triple subsystem graphs to graded Lie subalgebra graphs and compare their normal differentials.

comments
28 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.09849 ↗

Algebraic Topology6

In the lower-star filtration (LSF), simplices are assigned filtration values according to the maximum-vertex rule, with each simplex entering the filtration when its highest-valued vertex appears. A limitation of this construction is that some higher-dimensional simplices may enter simultaneously with their boundary faces, causing certain topological features to be filled immediately upon formation and thus not appear in the resulting persistence diagram. To address this limitation, we propose three alternative filtration methods: the \(\varepsilon\)-lower-star filtration (ELSF), the \(L_p\) filtration (LpF), and the softmax filtration (SMF). {ELSF introduces a dimension-dependent delay to the maximum-vertex rule,} allowing higher-dimensional simplices to enter the filtration after their boundary faces, whereas {LpF and SMF use aggregation functions that depend on all vertex values rather} than solely on their maximum. By modifying how filtration values are assigned, these methods allow simplices to enter the filtration more progressively, so that topological features such as loops and voids may persist over longer filtration intervals rather than being filled immediately. Consequently, the resulting persistence diagrams may include persistence features that are not observed under LSF, potentially providing useful information for distinguishing data populations. Experimental results on simulated and real-world datasets demonstrate that the proposed filtration methods are computationally efficient and can provide greater sensitivity to structural differences in the data than LSF.

comments
This is the published version of the article. Published in *International Journal of Topology*, MDPI, DOI: 10.3390/ijt3040025. Link to the official version: https://doi.org/10.3390/ijt3040025
journal
International Journal of Topology (2026)
fields
Algebraic Topology
pdf ↗ page arXiv:2611.08833 ↗

We introduce an $\infty$-categorical model of operad pairs and their associated bimonoidal categories. We study the related concepts such as cocartesian-cartesian operad pairs, algebra pairs and the Day convolution. Using the Day convolution for operad pairs, we can define distributive functors between a symmetric bimonoidal category and a cartesian closed monoidal category. As an application, we show that for a finite group $G$, the operadic distributive functors from $\mathrm{Span}(\mathsf{Fin}_G)$ to any cartesian closed monoidal category coincides with the distributive functors defined by the distributive diagram. Therefore, we show that the connective $G$-equivariant $\mathbb{E}_{\infty}$-ring spectra are equivalently the spectral $G$-Tambara functors.

fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2611.09115 ↗

We prove that the space of equivariant $h$-cobordisms on a smooth $G$-manifold $M$ has a tom Dieck style splitting, after stabilization. As an intermediate step, we introduce a space of isovariant $h$-cobordisms on $M$ and prove that this space also has a splitting, even before stabilizing. This completes the proof of the equivariant version of Waldhausen's stable parametrized $h$-cobordism theorem. Along the way, we establish several foundational results on equivariant smooth manifolds with corners.

comments
102 pages. Comments welcome!
fields
Algebraic Topology, Geometric Topology, K-Theory and Homology
pdf ↗ page arXiv:2611.09557 ↗

Persistent homology (PH) summarizes the topological features of data that persist across scales, but it is insensitive to many geometric properties. Persistent Laplacians (PLs) address this limitation: for a pair of simplicial complexes in a filtration, the kernel of the persistent Laplacian recovers the persistent Betti number, while its non-zero spectrum carries additional geometric information. However, PLs are defined for individual pairs of filtration values, so analysing a whole filtration requires evaluating many operators that largely contain the same information, and the result is hard to summarize and interpret. In this paper, we show that this redundancy has a precise structure. For each pair of filtration values, we decompose the space of chains underlying the persistent up-Laplacian into the contributions inherited from the neighboring pairs and a remaining part, which we call the new persistent chain space. We show that the new persistent chain spaces of all earlier pairs form a direct sum decomposition of this space, so that every persistent up-Laplacian in the filtration is determined by them. Moreover, the new persistent chain spaces are non-trivial only at pairs given by the persistence pairing in the same and in the next homological dimension, so that the persistence pairing determines exactly where the persistent up-Laplacian can change. Experiments on several types of point clouds show that evaluating persistent Laplacians only at these pairs reduces the computation time, both for our implementation and for existing software.

comments
34 pages, 12 figures
fields
Algebraic Topology, Combinatorics, Spectral Theory
pdf ↗ page arXiv:2611.09610 ↗

Every connected homotopy type is the classifying space of a small category, but this general result gives little control over the categories involved. We study finite acyclic categorical models and measure their complexity by the number of objects. Our main tool is the sink lemma, which describes the addition of a sink as the attachment of a cone along an explicit map. Using it, we determine the minimum number of objects required to model spheres, bouquets of spheres, Moore spaces of cyclic groups, real projective spaces, and lens spaces. We also exhibit infinitely many pairwise non-isomorphic rigid minimal models of the sphere. To include spaces admitting no finite model, we introduce a truncated invariant measuring the minimum number of objects required for a finite acyclic category to approximate a space through degree n. Spreading a finite monoid over n+1 objects produces such a category with an n-connected map to the monoid's classifying space. For every nontrivial finite group, this bound is optimal, although its classifying space admits no finite acyclic model.

comments
36 pages. Comments are welcome!
fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2611.09718 ↗

We prove that for any regular CW-complex $X$ there exists a quotient map $X\to Y$ that is a weak homotopy equivalence and which is minimal with that property, meaning that any quotient $Y\to Z$ that is a weak equivalence, must be a homeomorphism. The space $Y$ we obtain is an Alexandroff space: a space in which arbitrary intersections of open sets are open. The weak core $Y$ of $X$ is not unique in general. We study homotopy invariants preserved by filtered colimits of Alexandroff spaces. This can be seen as an analogous to Stong's theory of cores of finite topological spaces.

comments
21 pages, 6 figures
fields
Algebraic Topology
pdf ↗ page arXiv:2611.09886 ↗

Representation Theory6

The paper establishes a case of Howe duality for an exceptional theta correspondence using the ping-pong of types method. To that end, one needs to compute lifts of types of maximal compact subgroups. A brand new ingredient enters here: The graded module of the minimal representations is the coordinate ring of an affine cone whose projectivization is a Grassmannian. Via the filtered Nakayama lemma the problem of lifting types becomes a problem in algebraic geometry: compute certain linear sections of the Grassmannian.

fields
Representation Theory
pdf ↗ page arXiv:2611.08716 ↗

We develop canonical induction for Green categories associated with Mackey systems. We establish a change-of-rings framework in which the lower-plus and upper-plus constructions are realized by induction and coinduction of modules. The two plus adjunctions yield the mark morphism, and, when the relevant group orders are invertible in the coefficient ring, Möbius inversion gives an explicit inverse. Using the resulting linearization and tom Dieck maps, we construct a canonical induction map, give an explicit formula for it, and characterize when it is a right inverse of linearization. In the classical setting of Mackey functors, our construction and splitting criterion recover Boltje's results.

fields
Representation Theory
pdf ↗ page arXiv:2611.08852 ↗

Using annular webs and Kazhdan-Lusztig mu-coefficients, we disprove Guralnick's absolute boundedness conjecture for first cohomology.

comments
39 pages, many figures, Lean verification available, comments welcome
fields
Representation Theory, Combinatorics, Group Theory
pdf ↗ page arXiv:2611.09114 ↗

We first generalize the notion of $\mathrm{X}$-foliation on cluster complexes to the context of cluster algebras. This is a continuous generalization of Keller's green mutation, which was previously introduced in the prequel within a categorical setting. We show that the wall-crossing structure (of possibly higher co-dimension) is encoded by $\mathrm{X}$-supports, which form a partial version of Cao-Gyoda-Yurikusa's Bongartz (co-)completions for cluster algebras. Moreover, we prove that for any cell transversed nontrivially by a fixed $\mathrm{X}$-leaf, its rank is an invariant bounded below by the rank of $\mathrm{X}$. Finally, we prove the acyclicity conjecture for $\mathrm{X}$-foliation, which also implies the compactness conjecture for any $\mathrm{X}$-foliation in finite type cases.

fields
Representation Theory
pdf ↗ page arXiv:2611.09155 ↗

Let $\mathbf{G}$ be a connected reductive group over a non-archimedean local field $F$ of arbitrary characteristic, with residue field of cardinality $q$, and let $(K_n)$ be a tower of principal congruence subgroups attached to a lattice $\mathcal{L}$ in the Lie algebra. We show that the proportion of the Plancherel mass of the $K_n$-fixed vectors carried by supercuspidal representations is $δ_{\mathrm{ell}}(Λ)+O(q^{-n/4})$, where the elliptic density $δ_{\mathrm{ell}}(Λ)>0$ is the probability that a random element of the dual lattice $Λ$ is nonzero on the Lie algebra of the unipotent radical of every proper parabolic subgroup. For $\mathrm{GL}_d$ this limit was anticipated by Howe. The error improves to $O(q^{-τn/4})$ with an explicit $τ\in(1,2]$, except when $\mathrm{char}\,F=2$ and $\mathbf{G}$ has an isotropic direct factor which over $\bar F$ is a product of adjoint groups of type $\mathrm{B}_d$. We determine when $δ_{\mathrm{ell}}(Λ)=1$, give an explicit bound uniform in $F$ for reductive models, and deduce a bound uniform over the completions of a global field. The proof combines finite Fourier analysis on congruence quotients, a quantitative Sard theorem for parabolic incidence maps and a Jacquet-module argument; it uses neither a classification of supercuspidal representations nor the exponential map.

comments
46 pages
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.09555 ↗

We give an exposition of OpenAI's recent result that the exponent of matrix multiplication is at most 9/4 valid over every field. Our main tool is a fractional symmetrized variant of the tensor value introduced by Coppersmith and Winograd, used in place of spectral points (tensor characters) in the original proof. We prove a superadditivity inequality for a power of this value on partially direct sums, whose summands share one tensor factor and occupy independent subspaces in the other two. Together with the degenerations of polynomial multiplication tensors from the OpenAI proof, this inequality yields the bound.

fields
Representation Theory
pdf ↗ page arXiv:2611.09716 ↗

Commutative Algebra5

Let $\mathbb{F}_q$ be a finite field with $q = p^s$ elements. Let $S = \bigoplus_{n \geq 0} S_n$ be a non-negatively graded commutative, Noetherian $\mathbb{F}_q$-algebra. Assume $S$ has a structure of an unstable Steenrod algebra. Let $M$ be a finitely generated graded unstable $S$-module. Let $I$ be a homogeneous ideal in $S$. We prove that for $i \geq 0$ the local cohomology modules $H^i_I(M)$ has a structure of a Cartan $S$-module. As application we give a direct and considerably simpler proof of D. Bourguiba and S. Zarati's generalization of Landweber-Stong conjecture. We also give a necessary and sufficient condition for $S$ to have $S_r$-property of Serre in terms of Dickson polynomials.

comments
Comments welcome
fields
Commutative Algebra
pdf ↗ page arXiv:2611.08531 ↗

We study unital chain-map multiplications on minimal free resolutions of quotient rings. We prove that Katthän's example admits no associative multiplication over any field, without assuming graded commutativity or compatibility with an internal grading. The proof gives a relative obstruction in which associativity on a specified finite collection of triples forces failure at another triple. The argument extends to a family that includes nonmonomial ideals. We also give criteria for uniform non-associativity, where a fixed triple fails for every multiplication, by comparing either associators or their primitives under changes of multiplication. These criteria persist from monomial elimination ideals and give explicit obstructions for Avramov's example and the known eight-vertex Bier sphere over every field. As an application, we show that the edge ideal of the eight-cycle admits an injective Taylor comparison on five selected generators, while every selection of that size fails to admit a multiplicative comparison. Four generators admit a multiplicative embedding.

comments
32 pages; added Section 3.5 and Theorem 3.9 on vanishing of all regular-sequence Avramov obstructions for Katthan's example
fields
Commutative Algebra
pdf ↗ page arXiv:2611.08740 ↗

Given a free resolution $F_\bullet$ over a polynomial ring $R$ and a system of higher homotopies on it for a regular sequence $a_1,\dots,a_c$, we can use the Eisenbud-Shamash construction to build a free resolution over $\overline{R}=R/(a_1,\dots,a_c)$. We provide a combinatorial formula for the new system of higher homotopies on a pruned free resolution $F_{\bullet}^{\mathcal{M}}$ that corresponds to a pruning of the Eisenbud-Shamash resolution.

comments
34 pages, 14 figures
fields
Commutative Algebra
pdf ↗ page arXiv:2611.08764 ↗

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
pdf ↗ page arXiv:2611.08889 ↗

If $S$ is a numerical semigroup, then we denote by $m(S)$, $F(S)$ and $\mathrm{PF}(S)$ its multiplicity, its Frobenius number and its set of pseudo-Frobenius numbers, respectively. Let $\mathcal P$ be a finite nonempty set of positive integers. In this paper, we prove that $\mathcal C(\mathcal P)=\{S\mid F(S)=\max(\mathcal P),\ \mathcal P\subseteq\mathrm{PF}(S)\}$ is a covariety. The associated tree provides algorithms to compute $\mathcal C(\mathcal P)$, its elements with a prescribed type or genus, and the set of numerical semigroups $S$ satisfying $\mathrm{PF}(S)=\mathcal P$. We show that every element of $\mathcal C(\mathcal P)$ has a unique minimal system of generators relative to $\mathcal C(\mathcal P)$, and we call its cardinality the $\mathcal C(\mathcal P)$-rank. Finally, we characterize the elements of $\mathcal C(\mathcal P)$ with $\mathcal C(\mathcal P)$-rank one.

comments
In preparation for Journal Submission
fields
Commutative Algebra
pdf ↗ page arXiv:2611.09425 ↗

Geometric Topology5

We prove the Volume Conjecture and the Asymptotic Expansion Conjecture for closed oriented hyperbolic $3$-manifolds obtained by integral Dehn-fillings along a fundamental shadow link complement, provided that their volumes are sufficiently close to that of the complement. More generally, we show that the conjectured asymptotic expansions hold for pairs obtained by change-of-pair operations on a fundamental shadow link complement whenever the volume of the corresponding hyperbolic cone manifold is sufficiently close to that of the complement. A key ingredient in the proof is the introduction of extended quantum $6j$-symbols and a Weak Reflection Symmetry satisfied by them. The Weak Reflection Symmetry is established by relating the extended quantum $6j$-symbols to the $b$-$6j$ symbols through a real Gevrey-$1$ estimate and a truncated Borel-Laplace transform.

comments
62 pages, 6 figures
fields
Geometric Topology, Mathematical Physics
pdf ↗ page arXiv:2611.08517 ↗

We show that $\mathrm{SL}(4,\mathbb{Z})$ contains an infinite family of Zariski-dense subgroups isomorphic to the fundamental group of a fixed closed hyperbolic $3$-manifold, which are pairwise noncommensurable up to conjugacy.

comments
13 pages, 2 figures
fields
Geometric Topology, Group Theory, Number Theory
pdf ↗ page arXiv:2611.09051 ↗

Let $E$ be the figure-eight knot and let $V$ be the hyperbolic volume of its exterior. We study the reduced colored Jones polynomial at $q=e^{2πi/N}$ for the $(p,w)$-cable of the connected sum of $d\ge 2$ copies of $E$, where $w\ge 2$ and $p,w$ are coprime. The normalized logarithmic growth rate converges to the JSJ volume $dV$ along colors coprime to $2w$, and its upper limit along colors sharing a divisor with $w$ is at most $V$. Thus the $(1,2)$-cable of $E\#E$ violates the full-sequence volume limit for knots. The $(1,3)$-cable of the same companion shows that convergence can fail even along all odd colors. The separation comes from the multiples of $N$ in the exact cabling sum and a uniform first-derivative estimate for the other companion colors.

comments
5 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.09063 ↗

We introduce an extension of Khovanov and Rozansky's categorification of the HOMFLY polynomial to arbitrary oriented tangles. Unlike previous such extensions, ours is invariant under the full suite of oriented Reidemeister moves, including the "misoriented" Reidemeister IIb. For oriented links $\mathcal{L}$, our construction recovers Khovanov and Rozansky's construction while removing the preliminary step of presenting $\mathcal{L}$ as a braid closure.

comments
52 pages, many figures. Comments and suggestions welcome!
fields
Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2611.09367 ↗

We classify all the fixed points for the action of the pure mapping class group on $\mathrm{PU}(2,1)$ character varieties of surface groups. Up to trivial peripheral monodromies, we prove that the irreducible fixed points are either pair of pants representations, or restrictions of reduced Burau representations to a once-punctured torus and restrictions of reduced Gassner representations to a 4-punctured sphere. On the other hand, we prove that the only non-trivial reducible fixed points appear in genus 0 where they map all but at most three peripheral loops in the centralizer of the image, and in genus 1 where they are valued in the quaternion group $H_8$. As consequences, we deduce (i) that an irreducible representation in genus 0 with at least four non-trivial peripheral monodromies is rigid if and only if it is a fixed point, and (ii) a partial classification of irreducible representations of pure braid groups into $\mathrm{PU}(2,1)$.

comments
46 pages, 7 figures. Comments welcome!
fields
Geometric Topology, Dynamical Systems
pdf ↗ page arXiv:2611.09874 ↗

Group Theory5

We give a transparent development of the quaternionic reflection groups which have imprimitive complexifications, including a description of their reflections and the corresponding normal reflection subgroups. They are seen to be of rank one or rank two, and are obtained from minimal complex reflection groups by the addition of one quaternionic reflection and a complex scalar matrix of finite order. In the case of the rank two groups, we use our techniques to consider the broader question of what are the minimal irreducible subgroups of GL(2,C) with a given collineation group. This leads to a complete classification of the finite irreducible subgroups of GL(2,C) in terms of the minimal groups, with the groups giving rise to quaternionic reflection groups located within it.

comments
60 pages
fields
Group Theory, Rings and Algebras
pdf ↗ page arXiv:2611.08691 ↗

Let $F$ be a field, $K/F$ a field extension with $Γ_K:=\text{Gal}(K_\text{sep}/K)$, $G$ a finite group, $j:Γ_K\rightarrow G$ a continuous group homomorphism, and $M$ an abelian group. There is an induced map of profinite cohomology $j^*:H^n (G;M)\rightarrow H^n (K;M)=:H^n (Γ_K;M)$. An element $u\in H^n (G;M)$ is negligible over $F$ if $j^* (u)=0$ for all such $j$ and field extensions $K/F$. The subset of negligible elements forms a subgroup $H^n (G;M)_{\text{neg},F}\subseteq H^n (G;M)$. The negligible threshold $\text{nthres}^G_F (M)$ is the smallest $N\in\mathbb{N}_{\geq 0}\cup\{\infty\}$ such that $H^n (G;M)_{\text{neg},F}=H^n (G;M)$ for all $n\geq N$. In this paper, we first establish some general bounds for negligible thresholds of arbitrary triples $(G,M,F)$ consisting of a finite group $G$, trivial $G$-module $M$, and field $F$. We then compute the negligible thresholds of an arbitrary group when $F$ is a field of characteristic $p$ and $M=\mathbb{Z}/p^k\mathbb{Z}$. Continuing in the characteristic $p$ setting, we compute these thresholds for $G$ a $p$-group and $M=\mathbb{Z}$, and we compute the thresholds for $G=\mathbb{Z}/\ell\mathbb{Z},M=\mathbb{Z}/s\mathbb{Z}$ for integers $s,\ell\in\mathbb{N}_{>1}$ satisfying certain number theoretic conditions. For fields containing sufficiently many roots of unity, we show that the negligible threshold of odd exponent finitely-generated trivial $G$-modules is finite. For $G$-modules of the form $\mathbb{Z}/p\mathbb{Z}$, $p$ an odd prime, we compute an explicit upper bound for the negligible threshold in terms of $p$ and $|G|$. We conclude by providing explicit computations of the negligible thresholds of elementary abelian $p$-groups with mod-$p$ coefficients, negligible thresholds of cyclic groups, and bounds on mod-$p$ negligible thresholds of general finite abelian $p$-groups.

fields
Group Theory
pdf ↗ page arXiv:2611.08942 ↗

We introduce the slimness function, $\mathrm{Slim}_X(n)$, of a geodesic metric space, which records the maximal slimness of its geodesic polygons as a function of the number of sides. We study the large-scale behaviour of this function and its relation to hyperbolicity, growth function, and quasi-isometries. We first establish that the slimness function is a natural quasi-isometric invariant in the hyperbolic setting. We then obtain quantitative estimates for geodesic polygons in hyperbolic spaces and bounded-valency graphs. In particular, we show that sufficiently slow growth of the slimness function forces tree-like geometry. We also prove a decomposition result for hyperbolic groups admitting a finite graph of hyperbolic groups decomposition. Finally, we investigate the interaction between polygonal slimness and the growth of connected bounded-valency graphs. Combining the resulting estimates with large-scale dimension theory, we obtain criteria implying that an unbounded graph has asymptotic dimension one.

comments
19 pages, 2 figures
fields
Group Theory
pdf ↗ page arXiv:2611.09078 ↗

We formalize the group-theoretic definition of infinite and finite Artin braid groups in Lean. We implement a polynomial-time procedure for determining equivalence in the braid group known as Dehornoy's subword reversing algorithm. Termination and correctness of this algorithm are shown using rectangular grids, which are a specific form of van Kampen diagram. The literature only hints at a proof linking rectangular grids to braid equivalence. We present a novel, three-stage proof of this result, introducing partial grids and associated size metrics.

fields
Group Theory
pdf ↗ page arXiv:2611.09787 ↗

Commutator subgroups of infinite minimal subshifts provide the first examples of infinite, finitely generated, simple amenable groups. We prove that if $G$ is a finitely presented group which maps onto the commutator subgroup of the topological full group of an infinite minimal subshift, then $G$ contains a non-abelian free subgroup. This in particular implies that these groups are not finitely presented. We also show that the topological full group of an irreducible subshift of finite type contains non-abelian free subgroups.

fields
Group Theory
pdf ↗ page arXiv:2611.09862 ↗

Classical Analysis and ODEs4

We study weighted endpoint estimates for the centered fractional maximal operator on the infinite rooted $k$-ary tree, $T$. Our first result is a Fefferman–Stein type estimate \[ w\bigl(\{M_αf>λ\}\bigr) \lesssim_{α,s} \frac1λ\sum_{x\in T}|f(x)|M_{α,s}w(x), \qquad s>1, \] with a constant independent of the branching parameter $k$. Although the proof is inspired by the non-fractional argument of Ombrosi, Rivera-Ríos and Safe in \cite{ORRS}, the fractional normalization introduces a genuinely new scale interaction. At radius $r$, one must renormalize the function by $k^{rα}$ while keeping the dyadic cutoff at $k^r$; this leads to a new summation mechanism involving simultaneously $k^{rα}$ and $k^{r(1-α)}$. We then study sharpness and the geometry of admissible weights. We construct counterexamples showing that the estimate cannot in general be reduced to $s=1$ for any $0<α<1$. In the subcritical range $0<α<1/2$, we characterize power-type radial weights satisfying the natural fractional $A_1$ condition and prove that the failure persists after any fixed finite number of iterations of $M_α$. We also prove that $M_αw\lesssim w$ is necessary for the corresponding weighted weak type estimate but is not sufficient in the subcritical range. Finally, we identify a phase transition: for $1/2\leα<1$ no nonzero global weight can satisfy $M_αw\lesssim w$.

comments
19 pages
fields
Classical Analysis and ODEs, Combinatorics, Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2611.08653 ↗

Walsh analysis connects ordered Fourier convergence, summability, nonlinear approximation, and universal representation through a common character algebra. This survey examines developments from 2000-2026 against their classical foundations. Binary kernel geometry explains Hardy-space losses and summability thresholds; interval and packet methods control spectral selection; localized blocks produce correction and universal representations with distinct coefficient and exceptional-set requirements. Selected proofs and counterexamples compare these mechanisms and identify where an implication needs an additional hypothesis. The same distinctions organize digital integration, sparse measurements, Boolean spectra, and generalized Walsh bases. Quantitative thresholds, source conventions, and published theorem pointers are collected in comparative tables. The concluding problems separate source-listed questions, proposed refinements, and elementary obstructions. Supplementary derivations preserve normalization checks and finite covariance calculations while keeping the main exposition focused on the analytic mechanisms.

comments
125 pages, 2 figures, 200 references; survey article
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.09010 ↗

We determine the sharp constant in the weighted $L^2$ Bernstein inequality for coordinate derivatives on the unit ball with a Jacobi weight and the strengthened derivative factors introduced by Beberok and Xu. The constant is expressed in terms of the largest zeros of Jacobi polynomials, and all extremal polynomials are characterized explicitly. The proof uses an orthogonal polynomial decomposition that gives diagonal formulas for both the squared norm and the weighted derivative integral. We also obtain two-sided bounds for the sharp constant and determine its leading asymptotic behavior as the polynomial degree tends to infinity.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.09306 ↗

We prove that the set $\mathcal{N}_N$ of ReLU networks with one hidden layer and at most $N\in\mathbb N$ neurons is weakly closed in $W^{1,p}(Ω)$, for a bounded connected open set $Ω\subset\mathbb R^d$. Consequently, every coercive, weakly lower semicontinuous energy on this space attains its minimum over $\mathcal{N}_N$. This covers the Deep Ritz method with convex integrands, Sobolev training and Lipschitz learning. Moreover, as the weight decay parameter tends to zero, minimizers of the regularized problem converge, up to subsequences, to minimizers with minimal parameter norm. We also prove that the set of ReLU networks with two hidden layers of bounded widths is not closed in $W^{1,p}(Ω)$ or in $C(\overlineΩ)$. This disproves a conjecture of Petersen, Raslan and Voigtlaender.

comments
27 pages, 6 figures
fields
Classical Analysis and ODEs, Functional Analysis, Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.09887 ↗

Logic4

The Stone-Weierstrass theorem obtains every continuous function on a compact space as a uniform limit of functions built from a separating family by finitely many operations, and Reggio proved the theorem equivalent to the Beth definability property of an infinitary equational logic. We extend both results beyond compactness: on every separable metric space, and in particular on every Polish space, every bounded uniformly continuous function is a uniform limit of functions built from countably many bounded separating functions by the connectives of infinitary real-valued logic, and an approximate Beth property of this logic is equivalent to the new theorem. The extension rests on a rule of syntax, which admits a countable supremum when its terms share an a priori bound and thereby makes the sentences define exactly the bounded Lipschitz functions, and on a model existence game that does the work of compactness in the proof of interpolation.

fields
Logic, Functional Analysis, General Topology
pdf ↗ page arXiv:2611.08901 ↗

This paper presents a formalization for a theory of constructing real numbers using concepts related to filters. The formalization is implemented using the Coq proof assistant and is grounded in axiomatic set theory. The theory encompasses various notions such as filters, ultrafilters, principal ultrafilters, and arithmetical ultrafilters. A special filter, namely the non-principal arithmetical ultrafilter, whose existence requires the Continuum Hypothesis to be proven, is employed to establish several non-standard number sets: *N, *Z and *Q. The set of real numbers, R, is subsequently derived by equivalently classifying a specific subset of *Q. The entire theory is thoroughly formalized, with each detail verified to ensure rigor and precision. This work contributes a new selection of foundational materials for the formalization of mathematical theories.

fields
Logic
pdf ↗ page arXiv:2611.09134 ↗

In this paper we continue the work started in [Bonzio & Zamperlin 2025] by investigating the algebraic semantics for modal external weak Kleene logics. In order to do so we study the global modal logics associated with the three-valued Kripke models introduced in the previous article, showing how these systems are algebraizable. We proceed by defining their algebraic counterparts, obtaining the classes of modal Bochvar and modal Halldén algebras, whose structure theory we investigate via Płonka sum decomposition. Of particular interested is the interaction of the modal operator with the homorphisms of the Płonka decomposition. These results allow us to prove representation theorems for these expanded modal algebras in the style of the Jónsson-Tarski representation for Boolean algebras with operators. As a consequence, we also obtain algebraic semnatics for the local modal logics from which the work originated.

fields
Logic
pdf ↗ page arXiv:2611.09566 ↗

In this paper we focus on rigidity in descriptive set theory. Building on cocycle superrigidity results of Popa, Furman and Ioana, we prove rigidity in the purely Borel context for the orbit equivalence relations arising from the shift actions and translation actions of lattices in semisimple Lie groups with higher rank. Our results sharpen work of Adams and Kechris.

comments
Preprint, 14 pages
fields
Logic
pdf ↗ page arXiv:2611.09695 ↗

Metric Geometry4

We study the distortion of embedding a union of $k$ Euclidean sets into Euclidean space. We show that a union of $k$ Euclidean sets can be embedded with distortion at most $O(k^{1.128} \log k)$, independent of the number of points. This is an exponential improvement over the previous best known upper bound of $2^{O(k)}$ obtained by iterating the result of Makarychev and Makarychev (2016) for the special case $k = 2$. Surprisingly, with the additional assumption that each Euclidean set remains Euclidean when we adjoin any other two points, we can obtain an asymptotically tight distortion of $O(\log k)$, thus, providing a generalization of Bourgain's Theorem (1985). Along the way, we also show that the distortion of the union can be upper bounded by $O(\log k)$ times the maximum of the Lipschitz extension constants of individual Euclidean sets.

comments
33 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.08546 ↗

Given red and blue points in $\mathbb{R}^d$, connect every red point to every blue point and weigh each segment by its length under a fixed norm. What fraction of the total weight can always be captured by a single affine hyperplane separating the segments' endpoints? We study this question for finite point configurations in affine general position and, more generally, for pairs of probability measures. For dimension one, we show that choosing the best of three thresholds determined by the means of the two distributions captures at least one third of the total red-blue distance. We also give a matching upper bound. Embedding the line construction to higher dimensions shows that the guarantee of $1/3$ cannot be improved for arbitrary measures. Thus, we pivot to the family of measures whose atoms are in affine general position and whose non-atomic part places zero mass on all hyperplanes. Crucially, we establish that the worst-case guarantee is identical for finite configurations in affine general position and several natural classes of probability measures, thereby unifying the discrete and continuous formulations of the problem. For this family of measures and for higher dimensions, we extend our guarantee of $1/3$ for all norms. Our proofs combine the ham-sandwich theorem with a novel coupling argument and, in the planar case, an integral representation of norms. We also show that the optimal guarantee improves as the dimension grows, giving a lower bound of $1/2-\operatorname{O}\left(1/\sqrt{d}\right)$ as well as an asymptotically matching upper bound of $1/2$ for every $d$. For the Euclidean distance, we refine the lower bounds to $8/(8+5π)$ and $1/2-\operatorname{O}\left(1/d\right)$ and, for $d=2$, the upper bound to $5/11$. We also derive dimension-dependent guarantees for finite point configurations, including perfect separation of $n$ points of each color when $d\geq2n-1$.

comments
58 pages, 5 figures
fields
Metric Geometry
pdf ↗ page arXiv:2611.09166 ↗

We study weighted edge boundary and outer vertex boundary on Cayley graphs of polynomial growth of degree $Q>1$. For every finite symmetric generating set, we prove that each exact isoperimetric profile satisfies $I(n)=c n^{(Q-1)/Q}+O(n^{(Q-1)/Q-β})$, where $β=1/(8Q^2)$. We identify the leading constant with the isoperimetric constant of a horizontal perimeter on the limiting Carnot group, after accounting for the counting density. Its integrand is a norm with polyhedral unit ball, determined by a convex minimization with one real variable for each coset of a torsion-free nilpotent subgroup. For every asymptotically minimizing sequence, we translate its vertex sets so that the characteristic functions of the associated rescaled regions are precompact in $L^1$. The limiting regions minimize continuum perimeter at fixed volume. The exact-cardinality estimate requires no regularity assumption on these regions. For virtually abelian groups, we prove a quantitative stability estimate using a discrete approximation to the Euclidean Wulff body. The relative symmetric difference from a translate is bounded by the square root of the sum of the relative boundary deficit and a cardinality error. We also characterize when bounded additive changes of Cayley metric preserve the leading vertex constant. Failure occurs already in rank two; we construct pairs with the same measured asymptotic cone whose leading constants have an unbounded ratio as the rank grows.

comments
28 pages, split off from arXiv:2509.22260v1. Comments most welcome!
fields
Metric Geometry, Analysis of PDEs, Group Theory
pdf ↗ page arXiv:2611.09443 ↗

We introduce Multi-scale Closing Index (MCI), a new dissimilarity measure for evaluating the alignment of two 2D point sets. MCI is bounded between 0 and 1 and is based on multiscale mathematical morphology operations, with smaller values indicating greater structural agreement. The measure was motivated by the need to assess the quality of registration between point sets representing cell populations in biological images. To evaluate its behaviour under controlled conditions, we generated synthetic point clouds from Perlin-noise-based spatial structures, following established approaches for simulating biologically plausible spatial organization. We assessed MCI between those point clouds and different transformed versions, obtained by local perturbation, point removal, translation, rotation and addition of impulsive noise. Across these experiments, the dissimilarity MCI increased gradually and consistently with perturbation severity, while showing a clear discontinuity between clouds originating from the same underlying spatial structure and point clouds generated from different structures. We further compared MCI with commonly used point-set distances, including Hausdorff-based measures and Sliced Wasserstein distance. These experiments show the ability of MCI to capture structural agreement and quantify deviations between point sets, highlighting its potential as a complementary metric for evaluating two-dimensional point-set registration.

fields
Metric Geometry
pdf ↗ page arXiv:2611.09745 ↗

Quantum Algebra3

Let $\C$ be an essentially small abelian rigid braided monoidal category. We prove a reflection theorem for Nichols algebras in $\Ind(\C)$ and show that tuples admitting all reflections define connected semi-Cartan graphs. As applications, we prove that a finite Nichols algebra has a generating object of length at most one in $PSU(2)_k$ for odd $k\ge3$, in $SU(2)_{4m}$ for $m\ge1$, and in the representation categories of the Virasoro minimal models $\mathcal M(2,p)$ for odd $p\ge5$. In all three families, we prove that every finite pre-Nichols algebra is a Nichols algebra.

comments
33pages, comments welcome
fields
Quantum Algebra, Category Theory
pdf ↗ page arXiv:2611.08900 ↗

Let $V$ be a simple, rational, $C_2$-cofinite and self-dual vertex operator algebra of CFT type, and let $G$ be a finite cyclic automorphism group of $V$. We establish a twisted Verlinde formula for cyclic groups of arbitrary finite order, expressing fusion coefficients among twisted $V$-modules in terms of the $S$-matrix in the orbifold theory. As an application, we compute fusion rules among twisted modules for the permutation orbifold $\left(V^{\otimes k}\right)^{\langle g\rangle}$ associated with a $k$-cycle $g=(1\,2\,\cdots\,k)$.

fields
Quantum Algebra
pdf ↗ page arXiv:2611.09016 ↗

We classify, up to isomorphism, the coordinate algebras of the two-parameter braided quantum groups SL 2 .

fields
Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.09369 ↗

Spectral Theory3

We study Liouville transforms for the differential equation $Ju'+qu=wf$ on the real interval $(a,b)$ where $J$ is a constant, invertible, skew-hermitian matrix and $q$ and $w$ are matrices whose entries are distributions of order $0$ with $q$ Hermitian and $w$ non-negative. In particular, we examine their use in the treatment of quasi-regular endpoints and their impact on the Weyl-Titchmarsh $\mathbb M$-function associated with the differential equation.

fields
Spectral Theory, Mathematical Physics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.08661 ↗

Freezing the coefficients of a banded locally Toeplitz matrix gives a family of Toeplitz eigenvalue measures. Their average can fill a region of the complex plane even when the eigenvalues of the original matrices appear to follow curves. We conjecture that, when the above average has a sufficiently regular planar density, the limiting eigenvalue measure is its mother body. We prove it for a class of finite Dirichlet discrete Schrödinger operators with complex potential $V$ and a common real coefficient $α>0$ on the two adjacent diagonals. When $(\Im V)'>0$ and $V$ admits a suitable holomorphic extension, the limiting measure is supported on finitely many analytic arcs. Its logarithmic potential falls below that of the averaged measure by twice the least of four explicit actions. We obtain these actions from a four-term asymptotic expansion of the Dirichlet determinant. When $\Im V$ is not monotone, an exact transfer recursion gives a conditional extension. For a circular potential arc we verify the geometric switching condition, leaving non-resonance as the remaining hypothesis.

comments
40 pages, 5 figures
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2611.09301 ↗

Motivated by a question of Grigori Rozenblum, we study how the geometry of the boundary of a convex domain $Ω\subset\mathbb{R}^3$ affects whether the Neumann–Poincaré operator on $\partialΩ$ has negative eigenvalues. First, we show that a flat face on the boundary of a bounded, convex Lipschitz domain produces an infinite-dimensional negative spectral subspace. For convex domains with $C^{1,α}$ boundary, we bound the number of negative eigenvalues from below by the Dirichlet eigenvalue counting function of a projected patch over which the chords are sufficiently short. A Rellich identity gives a sufficient condition on a defining function to exclude negative eigenvalues. We also report numerical computations, which led us to the theoretical results.

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

General Topology2

Bani\v c and Kac, and later \v Crepnjak and Kac, constructed an uncountable family of continua with different types of rigidity. For every continuum $X$ with the mentioned property, the inverse limit $\varprojlim\{X,f_n\}$ is homeomorphic to $X$ for an arbitrary sequence of continuous surjective functions $f_n: X \to X$. We extend these results by proving that for any Peano continuum $X$ there exists an uncountable family ${\cal F}$ of rigid, for each positive integer $m$, $\frac{1}{m}$-rigid, and $0$-rigid continua such that each $Y \in {\cal F}$ contains a homeomorphic copy of $X$ and for each $Y \in {\cal F}$ it holds that the inverse limit $\varprojlim\{Y,f_n\}$ is homeomorphic to $Y$ for arbitrarily sequence of continuous surjective functions $f_n: Y \to Y$.

fields
General Topology
pdf ↗ page arXiv:2611.09480 ↗

In this paper, we construct an infinite-dimensional topological gyrogroup that fails to be strongly topological. We equip the countable direct sum of the complex unit disk with a carefully weighted infinite series of component seminorms. By dividing the infinite-dimensional operation into a finite core and a bounded infinite tail, we rigorously prove the joint continuity of the Möbius addition, confirming the space is a valid topological gyrogroup. Furthermore, we demonstrate that the gyroautomorphisms exhibit unbounded expansion under this real seminorm topology, explicitly preventing the existence of an invariant neighborhood basis at the identity. This provides a clear, analytic counterexample separating general topological gyrogroups from strongly topological ones. Moreover, we construct a topological gyrogroup which is not strongly topological but it contains a non-trivial strong subgyrogroup.

comments
10 pages
fields
General Topology
pdf ↗ page arXiv:2611.09486 ↗

Operator Algebras2

We initiate the study of von Neumann algebras of shift-similar and Houghton-like groups, introduced by Mallery and Zaremsky as analogs of self-similar and Röver-Nekrashevych groups, respectively. Given a shift-similar group $G$ of permutations of $\mathbb{N}$, one can form the Houghton-like group $H_n(G)$, a ``mashup" of the classical Houghton group $H_n$ with $G$, which acts on $X_n$, the disjoint union of $n$ copies of $\mathbb{N}$. One main result is that when $G$ and the canonical shift map $σ$ admit a joint Følner sequence for their action on $\mathbb{N}$, then both group von Neumann algebras $L(G)$ and $L(H_n(G))$ are II$_1$ factors with property Gamma and hence $G$ and $H_n(G)$ are inner amenable. More generally, let $Γ$ be an ICC group of permutations preserving the ends of $X_n$. We prove that if the natural near action on $\mathbb{N}$ of the germs of almost permutations arising from $Γ$ along some ray is amenable, then $L(Γ)$ has property Gamma; if this group of germs is itself amenable, then $L(Γ)$ is McDuff. Then we construct a shift-similar group $G$, using property (T) groups with certain actions, such that neither $G$ nor $H_n(G)$ is inner amenable. Finally, we produce extremely broad and diverse sources of shift-similar groups satisfying the joint amenability condition. These examples come from residually finite groups and from wobbling groups of a variety of metric spaces. In particular, we completely characterize all metrics $d$ on $\mathbb{N}$ for which the wobbling group $W(\mathbb{N},d)$ is shift-similar in terms of a coarse geometric property—namely, that $σ^{-1}$ is bornologous with respect to $d$. As a consequence, this gives us necessary and sufficient conditions for when the wobbling group of any countable metric space admits a shift-similar embedding.

comments
69 pages, no figures. Comments welcome
fields
Operator Algebras
pdf ↗ page arXiv:2611.09227 ↗

Let $V$ be a noncommutative (NC) variety in a NC operator ball. We study the dual operator algebra $H^\infty(V)$ of bounded NC functions on $V$, and the operator algebra $A(V)$ obtained as the closure of NC polynomials in $H^\infty(V)$. We identify the space of weak-$*$ continuous finite-dimensional representations of $H^\infty(V)$ as the similarity envelope $\widetilde{V}$ of $V$, and equip $\widetilde{V}$ with a metric which turns $\widetilde{V}$ into a complete invariant for $H^\infty(V)$, in the sense that $H^\infty(V)$ is weak-$*$ continuously isomorphic to $H^\infty(W)$ if and only if $\widetilde{V}$ and $\widetilde{W}$ are NC biholomorphic via a bi-Lipschitz map. Similar results are obtained in the completely bounded category as well as for the algebras $A(V)$ when $V$ is assumed homogeneous. In the case of homogeneous varieties $V$ and $W$, we obtain a sharper classification result, by which $H^\infty(V)$ is (completely) boundedly isomorphic to $H^\infty(W)$ if and only if there is a linear map which gives a bi-Lipschitz bijection between $\widetilde{W}$ and $\widetilde{V}$. The reduction to the linear case in the generality we work in depends on showing that the existence of maps implies the existence of origin-fixing maps, which we show using a novel ``two-circle trick" of independent interest. In the important case where the varieties are the full NC operator balls we find a striking rigidity phenomenon: if $A(B_E)$ and $A(B_F)$ are completely boundedly isomorphic then $E$ and $F$ are completely isometric. We also present a variety of examples illustrating the results and their sharpness, showing how several results from the literature fail to generalize to the setting studied here.

comments
44 pages
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2611.09389 ↗

Category Theory1

We characterise the two-step nilpotent varieties of algebras: the semi-abelian varieties in which all ternary cosmash products vanish. Just as abelian varieties are the categories of modules over a ring, two-step nilpotent varieties are exactly the categories of modules over a square ring in the sense of Baues, Hartl and Pirashvili. We construct the square ring explicitly from the full subcategory on the free algebras on one and two generators, and give complete proofs. As consequences we obtain a description of any two-step nilpotent variety by generators and relations, an intrinsic characterisation in terms of quadratic term operations, and an account of its abelian core and of the lower central series of its objects in terms of the square ring. Along the way, we associate with any commutative ring $R$ a square ring whose modules, the two-step nilpotent $R$-groups, extend Hall's nilpotent $R$-groups of class two from $2$-binomial rings to arbitrary rings of coefficients.

comments
35 pages
fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2611.09465 ↗

History and Overview1

Our house has been taken over. It is not completely destroyed, but many of its essential functions and facilities no longer work as they used to. Essentially, they are out of our control. Artificial intelligence, through its large language models (LLMs), has taken it. And we, the inhabitants of the house, without really noticing what was happening, and surprised by the effectiveness of LLMs, have handed over our most sacred belongings: the capacity to think about a problem, the joy of having an idea that solves it, the beautiful effort needed to consolidate an idea in our common language. And there is no turning back. We are mathematicians, and our whole world is in check. We wonder: is it checkmate? Can we take back control of our house, which will undoubtedly not work in the same way? Paradoxically, the weapons that attacked us are built on some of our own ideas. Of course, it is not entirely our work. The computer science knowledge needed to develop these large models evolved in both its theoretical and its material aspects. As technology evolved (infinitely small processors, infinitely large computing centers), turning quantity into quality, computer scientists encoded into software the ideas needed to produce these tools (let us not call them weapons). These notes look into the past and the future of the mathematical profession. What will inevitably happen? What will remain and what will disappear? And, in consequence, what is our line of action? To organize the ideas, after some introductory historical comments, we try to answer the questions: (1) Is mathematics necessary for the development of our society? (2) Will mathematicians be necessary in the near future? (3) How the profession will change, through a list of exercises: open questions and possible actions.

comments
9 pages. An essay about AI and mathematics
fields
History and Overview
pdf ↗ page arXiv:2611.09580 ↗

Symplectic Geometry1

On several families of flag varieties, we provide examples of degenerate Hamiltonian diffeomorphisms exhibiting significantly smaller numbers of fixed points than predicted by the strong Arnold conjecture.

comments
14 pages, comments welcome!
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.09694 ↗

Revised papers220

Let $Ω\subset\mathbb{R}^n$ be a bounded domain and let $δ$ be a continuous positive function on $Ω$ with $B(x,δ(x))\subseteqΩ$ for every $x\inΩ$. Let $σ(f)(x)$ denote the average of $f$ over the ball $B(x,δ(x))$. Restricted mean value theorems give conditions under which a fixed point of $σ$ must be harmonic. We study the dynamical counterpart of this question: the behavior of the iterates $σ^k(f)$. We show that for \emph{every} bounded domain and every bounded measurable $f$ that is continuous at the points of $\partialΩ$, the iterates $σ^k(f)$ converge locally uniformly in $Ω$ to the Perron–Wiener–Brelot solution of the Dirichlet problem with boundary values $f|_{\partialΩ}$, and that the convergence is uniform on $\overlineΩ$ for all continuous $f$ if and only if $Ω$ is regular for the Dirichlet problem. This contains and extends earlier results for $C^{2,α}$ domains with $C^{2,α}$ data and for strictly convex domains with continuous data. We also give explicit rates of convergence: an algebraic rate $O(1/k)$ on domains with a uniform exterior ball condition and a geometric rate on convex domains, when $δ$ is comparable to the distance to the boundary.

fields
Analysis of PDEs
pdf ↗ page arXiv:0709.3311 ↗

A $β$-biased monotonic random walk in the plane moves from $(x,y)$ to $(x+1,y)$ or $(x,y+1)$ with probabilities $1/(β+1)$ and $β/(β+1)$. We study $Φ_β(α,d)$, the probability that the walk started at the origin ever visits a lattice point strictly above the line $y=αx+d$, and $Ψ_β(α,d)$, the probability that it visits a lattice point \emph{on} the line after leaving the origin. For integer slopes $α=p$ we show $Φ_β(p,d)=ρ^{\lfloor d\rfloor+1}$, where $ρ$ is the smallest positive root of $y^{p+1}-(β+1)y+β=0$, give the Fuss–Catalan series for $ρ$, identify $ρ$ with the extinction probability of a Galton–Watson process, and compute the exact law and mean of the first crossing point. We prove that the return probability is $Ψ_β(p,0)=(p+1)(1-β/((β+1)ρ))$, which equals $(p+1)/(β+1)$ for $β\ge p$. For rational slopes $α=r/s$ we obtain $Φ_β$ in closed form from the $s$ large roots of the kernel $\tfracβ{β+1}z^{r+s}-z^r+\tfrac1{β+1}$, and $Ψ_β$ as a ratio of Green's functions. For arbitrary real $α$ we prove that the walk crosses every line $y=αx+d$ almost surely if and only if $β\geα$, and we establish the two-sided bound $e^{-θ(d+1)}\leΦ_β(α,d)<e^{-θd}$ with an explicit Lundberg exponent $θ$. Finally, $α\mapstoΦ_β(α,0)$ is a pure jump function: it is constant on $[0,β]$, continuous at every irrational point and has a jump at every rational $α>β$.

fields
Probability, Combinatorics
pdf ↗ page arXiv:0709.3316 ↗

A real symmetric matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic form is negative. Due to the scaling property, we can find such certificates in every neighborhood of the origin but their properties depend on the matrix of course and are hard to describe. If it is an integer matrix however, we are guaranteed certificates of a complexity that is at most a constant times the binary encoding length of the matrix raised to the power 3/2.

fields
Optimization and Control
pdf ↗ page arXiv:1306.3867 ↗

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, and let $T_n(\mathbb{K})$ be the semigroup of $n\times n$ lower triangular matrices with entries in $\mathbb{K}$. We show that $T_n(\mathbb{K})$ has dense subsemigroups generated by $n+1$ matrices, and that $n+1$ is the least possible number of generators; the same holds for dense subgroups of the group of invertible lower triangular matrices. The generators can be written down explicitly: $n$ of them are diagonal and one is a diagonal matrix plus a nilpotent perturbation. More precisely, let $D_0,\dots,D_m$ be diagonal matrices generating a dense subsemigroup of the diagonal matrices, where the diagonal entries of $D_0$ have strictly monotone moduli, and let $A$ be a lower triangular matrix with the same diagonal as $D_0$. We prove that the semigroup generated by $A,D_1,\dots,D_m$ is dense in $T_n(\mathbb{K})$ if and only if every subdiagonal entry of $A$ is nonzero.

fields
Dynamical Systems
pdf ↗ page arXiv:1707.06293 ↗

In the sequel, we extend our previous work on the Minkowski Curve to Sierpiński simplices (Gasket and Tetrahedron), in the case of the heat equation. First, we build the finite difference scheme. Then, we give a theoretical study of the error, compute the scheme error, give stability conditions, and prove the convergence of the scheme. Contrary to existing work, we do not call for approximations of the eigenvalues.

comments
arXiv admin note: text overlap with arXiv:1710.00358
fields
Numerical Analysis
pdf ↗ page arXiv:1802.09925 ↗

We study open-mapping, continuous-inverse and closed-graph properties for maps whose domain and range belong to the same class of Hausdorff topological vector spaces. Quotient and graph stability imply equivalence of these properties. In the locally convex setting, we characterize barrelled infra-Pták spaces and barrelled Pták spaces as largest classes determined by the closed-graph property, Banach test spaces and appropriate nearly-open image conditions.

fields
Functional Analysis
pdf ↗ page arXiv:1901.05899 ↗

We establish equivalent conditions for the convex subdifferential to be maximal monotone in general settings, expressed in terms of the associated upper envelopes.

fields
Functional Analysis
pdf ↗ page arXiv:1901.10649 ↗

Let G be a group acting on a tree with cyclic edge and vertex stabilizers. Then stable commutator length (scl) is rational in G. Furthermore, scl varies predictably and converges to rational limits in so-called "surgery" families. This is a homological analog of the phenomenon of geometric convergence in hyperbolic Dehn surgery.

comments
v3: Post-publication edit, pointed out the existence of extremal surfaces for relative scl in all free products (Theorem 5.14)
fields
Geometric Topology, Group Theory
pdf ↗ page arXiv:1904.08360 ↗

This paper studies stochastic comparisons of the highest and lowest order statistics arising from independent Exponentiated Gumbel Type-II distributed random variables. First, using vector majorization, we establish a comprehensive set of stochastic orderings for the lowest and highest order statistics with respect to the outer and inner shape parameters. In particular, for the lowest order statistic, we derive results on the usual stochastic order and likelihood ratio order, which further imply failure rate, mean residual life, and increasing convex orderings. Second, we show that the lowest order statistics satisfy a proportional failure rate structure. In addition, we also establish star and dispersive orderings. For the highest order statistic, we obtain results in the reversed failure rate order, and we show that, in general, a proportional failure rate structure does not hold. Moreover, unlike several classical exponentiated models, the highest order statistics are not necessarily comparable in the usual stochastic order under heterogeneity of the inner shape parameters. Finally, we extend the analysis using multivariate chain majorization to study the effect of simultaneous variation in scale and outer shape parameters. Under this framework, we establish usual stochastic ordering results for both the lowest and highest order statistics. It provides more general reliability comparisons under joint parameter heterogeneity.

fields
Statistics Theory
pdf ↗ page arXiv:1904.08730 ↗

This paper is devoted to the study of periodic solutions of Hamiltonian system $\dot z(t)=J \nabla H(z(t))$, where $H$ is symmetric under an action of a compact Lie group. We are looking for periodic solutions in a nearby of non-isolated critical points of $H$ which form orbits of the group action. We prove Lyapunov-type theorem for symmetric Hamiltonian systems.

comments
22 pages
fields
Classical Analysis and ODEs, Dynamical Systems
pdf ↗ page arXiv:1906.02463 ↗

We introduce holed cone structures on 3-manifolds to generalize cone structures. In the same way as a cone structure, a holed cone structure induces the holonomy representation. We consider the deformation space consisting of the holed cone structures on a 3-manifold whose holonomy representations are irreducible. This deformation space for positive cone angles is a covering space on a reasonable subspace of the character variety.

comments
27 pages, 4 figures, to appear in Osaka J. Math
fields
Geometric Topology
pdf ↗ page arXiv:2210.14765 ↗

We construct an $(\infty,1)$-functor that takes each smooth $G$-manifold with corners $M$ to the space of equivariant smooth $h$-cobordisms ${\mathcal H}_{\mathrm{Diff}}(M)$. We also give a stable analogue ${\mathcal H}^{\mathcal U}_{\mathrm{Diff}}(M)$ where the manifolds are stabilized with respect to representation discs. The functor structure is subtle to construct, and relies on several new ideas. In the non-equivariant case $G=e$, our $(\infty,1)$-functor agrees with previous constructions of the smooth $h$-cobordism space as a functor to the homotopy category.

comments
95 pages. Final version, to appear in Transactions of the AMS
fields
Algebraic Topology, Geometric Topology, K-Theory and Homology
pdf ↗ page arXiv:2303.14892 ↗

The partial information decomposition (PID) framework is concerned with decomposing the information that a set of random variables has with respect to a target variable into three types of components: redundant, synergistic, and unique. Classical information theory alone does not provide a unique way to decompose information in this manner and additional assumptions have to be made. Recently, Kolchinsky proposed a new general axiomatic approach to obtain measures of redundant information, based on choosing a preorder relation between information sources (equivalently, a preorder between communication channels). In this paper, we exploit this approach to introduce three new measures of redundant information (and the resulting decompositions) based on well-known preorders between channels, thus contributing to the enrichment of the PID landscape. We relate the new decompositions to existing ones, study some of their properties, and provide examples illustrating their novelty. As a side result, we prove that any preorder that satisfies Kolchinsky's axioms yields a decomposition that meets the axioms originally introduced by Williams and Beer when they first propose the PID.

comments
Corrected version of the article published in Entropy 2023, 25, 975 (https://doi.org/10.3390/e25070975). The corrections are described in a correction notice in Entropy. 13 pages, 1 figure, 4 tables
journal
Entropy 2023, 25(7), 975
fields
Information Theory
pdf ↗ page arXiv:2305.06021 ↗

We construct fundamental solutions of a class of factorized $q$-difference equations in terms of Jacobi theta functions and Zwegers' $μ$-functions. To obtain a formal series solution $f_0$ for a factorized $q$-difference equation, we present a $q$-analogue of the fundamental relation (often called the Wronski-type relation) between the elementary symmetric polynomials and the complete homogeneous symmetric polynomials. We also provide some formulas for the image of the $q$-Borel summation of the formal series solution $f_0$. As an application, we give another proof of the expressions due to S. Y. Kang and S. P. Zwegers of the universal mock theta functions and higher level Appell functions in terms of $μ$-functions.

comments
12 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2305.12754 ↗

The FMM is the leading approach for attaining linear complexity in the evaluation of long-range (e.g. Coulomb) many-body interactions. We demonstrate a new, hybrid symbolic-numerical method for the automatic synthesis of all families of translation operators required for the execution of the Fast Multipole Method (FMM). Our method is dimension-independent (demonstrated in 2D and 3D) and applicable to any translation-invariant kernel. Low complexity in translation operators for the FMM is usually achieved by algorithms specialized for a potential obeying a specific partial differential equation (PDE). Absent a PDE or specialized algorithms, Taylor series based FMMs or kernel-independent FMM have been used, at asymptotically higher expense. When symbolically provided with a constant-coefficient elliptic PDE obeyed by the potential, our algorithm can automatically synthesize translation operators requiring $\mathrm{O}(p^d)$ operations, where $p$ is the expansion order and $d$ is dimension, compared with $\mathrm{O}(p^{2d})$ operations in a naive approach carried out on (Cartesian) Taylor expansions. This is achieved by using a compression scheme that asymptotically reduces the number of terms in the Taylor expansion and then operating directly on this "compressed" representation. Judicious exploitation of shared subexpressions permits formation, translation, and evaluation of local and multipole expansions to be performed in $\mathrm{O}(p^d)$ operations, while an FFT-based scheme permits multipole-to-local translations in $\mathrm{O}(p^{d-1}\log(p))$ operations. We demonstrate computational scaling of code generation and evaluation as well as numerical accuracy through numerical experiments on a number of potentials from classical physics.

fields
Numerical Analysis
pdf ↗ page arXiv:2305.17867 ↗

We prove that the profinite completion of a pseudomanifold is the Artin-Mazur's etale homotopy type construction on its branched covers, which was implicitly conjectured by Sullivan in his MIT note (page 272) around 1970. This is a consequence of the existence of enough $K(π,1)$ open dense subspaces in a pseudomanifold.

fields
Algebraic Topology, Algebraic Geometry, Geometric Topology
pdf ↗ page arXiv:2309.05231 ↗

In his ``Mathematical Treatise in Nine Sections''(1247), Jiushao Qin introduced ``the Dayan method of deriving unity'' for computing modular inverses, an essential component of his treatment of the Chinese remainder theorem. A distinctive feature of Qin's algorithm is its use of a state consisting of four nonnegative integers arranged in a matrix. In this paper, we investigate the mathematical structure of these states and their connections with continued fractions and two-dimensional lattices. By introducing a signed version of the state, we obtain a natural matrix representation that reveals the convergents of continued fractions and gives direct derivations of several classical results. We then show that the signed states form bases of a family of two-dimensional lattices arising from modular congruences. In particular, we prove that a shortest lattice vector can be obtained from the rows of a signed state or their sum or difference. We also study the monotonicity of the inner products of the state vectors and discuss a subsequent result that locates a shortest vector in one of two consecutive states. It is surprising that a shortest lattice vector is found in a highly structure sequence of states. These results demonstrate that the state structure of Qin's algorithm provides a unified framework for understanding modular inversion, continued fractions, and shortest vectors in two-dimensional lattices.

fields
Number Theory
pdf ↗ page arXiv:2310.09103 ↗

In this paper, we show examples of local cohomology modules over ramified regular local ring, having finite set of associated primes. In doing so we consider our ramified regular local ring as Eisenstein extension of an unramified regular local ring sitting inside it. In ramified regular local ring for extended ideal (from the unramified one) set of associated primes of a local cohomology module is always finite. Using the Mayer-Vietoris spectral sequence, we construct examples of local cohomology of non extended ideal, whose set of associated primes is finite. In particular, we choose those non extended ideals whose minimal primes are extended ideals which are all cohomologically complete intersection.

comments
6 pages, errors fixed, results improved, reference modified
fields
Commutative Algebra
pdf ↗ page arXiv:2312.06489 ↗

We give a new proof of the converse theorem for Maass forms on ${\rm GL}(3)$ using a technique that is inspired by Langlands' philosophy of "beyond endoscopy", thereby implementing these ideas for the first time in a higher rank setting.

comments
corrected Lemma 2.6 and upgraded to an asymptotic formula, with corresponding updates in the rest of the paper
journal
Advances in Mathematics 485 (2026), p. 110716. ISSN: 0001-8708
fields
Number Theory
pdf ↗ page arXiv:2401.04037 ↗

In this paper, we generalize two results of H. Darmon and V. Rotger on triple product $p$-adic $L$-functions associated with Hida families to finite slope families. We first prove a $p$-adic Gross-Zagier formula, then demonstrate an application to a special case of the equivariant Birch and Swinnerton-Dyer conjecture for supersingular elliptic curves.

fields
Number Theory
pdf ↗ page arXiv:2403.18620 ↗

We study the commutation relation for 2-radial SLE in the unit disc starting from two distinct boundary points. We follow the framework introduced by Dubédat~[12]. Under an additional requirement of the interchangeability of the two curves, we classify all locally commuting 2-radial SLE$_κ$ for $κ\in (0,8)$: it is either two-sided radial SLE$_κ$ with spiral of constant spiraling rate or chordal SLE$_κ$ weighted by a power of the conformal radius of its complement. Namely, for fixed $κ$ and starting points, we have exactly two one-parameter families of locally commuting 2-radial SLE curves. We also discuss the semiclassical limit of the commutation relation as $κ\to 0$. In particular, we show that the limit for the second family with an appropriately chosen power of the conformal radius is a chord that minimizes a modified chordal Loewner energy, which is unique only when the endpoints are not antipodal.

comments
50 pages, 7 figures. Final version. To appear at Science China Mathematics
fields
Probability, Complex Variables
pdf ↗ page arXiv:2405.07082 ↗

The exceptional series is a finite list of points on a projective line with a simple Lie algebra attached to each point. This list of Lie algebras includes the five exceptional Lie algebras. We give a uniform trigonometric $R$-matrix for the exceptional series in the representation $L\oplus I$, where $L$ is the quantum deformation of the adjoint representation and $I$ is the trivial representation. We construct a sixteen dimensional algebra, $A^\square(\mathit2)$, which interpolates the algebras $\mathrm{End}(\otimes^2(L\oplus I))$ and a 287 dimensional algebra, $A^\square(\mathit3)$, which interpolates the algebras $\mathrm{End}(\otimes^3(L\oplus I))$. The $R$-matrix lives in $A^\square(\mathit2)$ and satisfies the Yang-Baxter equation in $A^\square(\mathit3)$; it interpolates the trigonometric $R$-matrices for the points in the exceptional series.

comments
v2: introduction rewritten
fields
Representation Theory, Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2406.01348 ↗

An extreme dimension reduction method is proposed, extending the Extreme-PLS approach to the discretized functional framework, where the covariate lies in the infinite-dimensional Hilbert space ($L^2([0,1])$) but is partially observed on a dense time grid. The ideas are partly borrowed from both Partial Least-Squares (PLS) and Sliced Inverse Regression (SIR) techniques. Accordingly, the method relies on the projection of the covariate onto a subspace and maximizes the covariance between its projection and the response conditionally on an extreme event capturing tail information. The covariate and the heavy-tailed response are supposed to be linked through a nonlinear inverse single-index model, and the objective is to infer the index in this regression framework. A new family of estimators is proposed, and its asymptotic consistency with convergence rates under the model is established. Assuming mild conditions on the noise, most of the assumptions are stated in terms of regular variation, unlike those commonly imposed for SIR and single-index regression. In addition, the theoretical analysis is expanded to include a model-free consistency result in probability for the empirical tail-moments in a general separable Hilbert space. Finally, the results are illustrated through a finite-sample study with synthetic functional data and high-frequency financial data, highlighting the effectiveness of the dimension reduction in capturing tail dependence and supporting extreme risk management.

comments
42 pages, 9 figures
fields
Statistics Theory
pdf ↗ page arXiv:2410.05517 ↗

This paper introduces the Best-Worst Disaggregation (BWD) method, a novel approach that integrates the principles of the Best-Worst Method (BWM) into the disaggregation framework to enhance the consistency and reliability of derived preference models. An optimization model is formulated to determine the most suitable additive value function that fits the preferences expressed by a decision-maker or expert. The method incorporates a consistency analysis to quantify and improve the reliability of the judgments and is extended to handle interval-valued preferences. We also developed an approach to identify a reference set, which is used for pairwise comparisons to elicit the value functions and weights. A case study in logistics performance evaluation demonstrates the practicality and effectiveness of BWD. By coupling a structured human-elicitation protocol with an inference engine and a consistency-feedback loop, BWD provides a human-centered building block for evidence-sensitive decision-support systems

comments
24 pages, 7 figures
journal
IEEE Transactions on Systems, Man and Cybernetics: Systems (2026), 56(11), 7308--7321
fields
Optimization and Control
pdf ↗ page arXiv:2410.12678 ↗

Stochastic differential equations (SDEs) are a fundamental tool for modelling dynamic processes, including gene regulatory networks (GRNs), contaminant transport, financial markets, and image generation. However, learning the underlying SDE from data is a challenging task, especially if individual trajectories are not observable. Motivated by burgeoning research in single-cell datasets, we present the first comprehensive approach for jointly identifying the drift and diffusion of an SDE from its temporal marginals. Assuming linear drift and additive diffusion, we show that non-identifiability can only arise if the initial distribution possesses generalized rotational symmetries. We further prove that even if this condition holds, the drift and diffusion can almost always be recovered from the marginals. Additionally, we show that the causal graph of any SDE with additive diffusion can be recovered from the identified SDE parameters. To complement this theory, we adapt entropy-regularized optimal transport to handle anisotropic diffusion and introduce APPEX (Alternating Projection Parameter Estimation from $X_0$), an iterative algorithm designed to estimate the drift, diffusion, and causal graph of an additive noise SDE, solely from temporal marginals, and demonstrate its effectiveness on simulated data from linear additive noise SDEs.

journal
Journal of Machine Learning Research (2026), 27(219), 1-56
fields
Statistics Theory
pdf ↗ page arXiv:2410.22729 ↗

The study of matroid products traces back to the 1970s, when Lovász and Mason studied the existence of various types of matroid products with different strengths. Among these, the tensor product is arguably the most important, which can be considered as an extension of the tensor product from linear algebra. However, Las Vergnas showed that the tensor product of two matroids does not always exist. Over the following four decades, matroid products remained surprisingly underexplored, regaining attention only in recent years due to applications in tropical geometry and the limit theory of matroids. In this paper, inspired by the concept of coupling in probability theory, we introduce the notion of coupling for matroids -- or, more generally, for submodular set functions. This operation can be viewed as a relaxation of the tensor product. Unlike the tensor product, however, we prove that a coupling always exists for any two submodular functions and can be chosen to be increasing if the original functions are increasing. As a corollary, we show that two matroids always admit a matroid coupling, leading to a novel operation on matroids. Our construction is algorithmic, providing an oracle for the coupling matroid through a polynomial number of oracle calls to the original matroids. We apply this construction to derive new necessary conditions for matroid representability and establish connection between tensor products and Ingleton's inequality. Additionally, we verify the existence of set functions that are universal with respect to a given property, meaning any set function over a finite domain with that property can be obtained as a quotient.

comments
34 pages
journal
K. Bérczi, B. Gehér, A. Imolay, L. Lovász, B. Maga, T. Schwarcz: Matroid products via submodular coupling, Advances in Combinatorics, 2026:11
fields
Combinatorics
pdf ↗ page arXiv:2411.02197 ↗

Mathematical diffraction theory has been developed since about 1995. Hof's initial approach relied on tempered distributions in euclidean space. Nowadays often the Fourier theory by Argabright and Gil de Lamadrid is used, which applies to appropriate measures on locally compact abelian groups. We review diffraction theory using Wiener amalgams as test function spaces. For translation bounded measures, this unifies and simplifies the former two approaches. We treat weighted versions of Meyer's model sets as examples.

comments
56 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2411.14987 ↗

Let M be a finitely generated submodule of a free module over a multivariate polynomial ring with coefficients in a discrete coherent ring. We prove that its module MLT(M) of leading terms is countably generated and give an algorithm for computing explicitly a generating set. This result is also useful when MLT(M) is not finitely generated. Suppose that the base ring is strongly discrete coherent. We provide a Buchberger-like algorithm and prove that it converges if and only if the module of leading terms is finitely generated. We also state a constructive version of Hilbert's syzygy theorem by following Schreyer's method.

journal
Journal of Symbolic Computation, 2026, 135, pp.102526
fields
Commutative Algebra
pdf ↗ page arXiv:2411.16460 ↗

We study the equivariant cohomology classes of torus-equivariant subvarieties of the space of matrices. For a large class of torus actions, we prove that the polynomials representing these classes (up to suitably changing signs) are covolume polynomials in the sense of Aluffi. We study the cohomology rings of complex varieties in terms of Macaulay inverse systems over $\mathbb{Z}$. As applications, we show that under certain conditions, the Macaulay dual generator is a denormalized Lorentzian polynomial in the sense of Brändén and Huh, and we give a characteristic-free extension (over $\mathbb{Z}$) of the result of Khovanskii and Pukhlikov describing the cohomology ring of toric varieties in terms of volume polynomials.

fields
Algebraic Geometry, Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2411.17572 ↗

Using the recently developed mathematical theory of tangles, we re-assess the mathematical foundations for applications of the five factor model in personality tests by a new, mathematically rigorous, quantitative method. Our findings broadly confirm the validity of current tests, but also show that more detailed information can be extracted from existing data. We found that the big five traits appear at different levels of scrutiny. Some already emerge at a coarse resolution of our tools at which others cannot yet be discerned, while at a resolution where these _can_ be discerned, and distinguished, some of the former traits are no longer visible but have split into more refined traits or disintegrated altogether. We also identified traits other than the five targeted in those tests. These include more general traits combining two or more of the big five, as well as more specific traits refining some of them. All our analysis is structural and quantitative, and thus rigorous in explicitly defined mathematical terms. Since tangles, once computed, can be described concisely in terms of very few explicit statements referring only to the test questions used, our findings are also directly open to interpretation by experts in psychology. Tangle analysis can be applied similarly to other topics in psychology. Our paper is intended to serve as a first indication of what may be possible.

comments
This ArXiv version differs from the journal version, published in 2025, only in its final two paragraphs of Section 4.3. It does not alter any of our results in substance, but improves their presentation
journal
Journal of Mathematical Psychology 125, 102920 (2025)
fields
Combinatorics
pdf ↗ page arXiv:2411.18670 ↗

Riehl and Shulman introduced simplicial type theory (STT), a variant of homotopy type theory which aimed to study not just homotopy theory, but its fusion with category theory: $(\infty,1)$-category theory. While notoriously technical, manipulating $\infty$-categories in simplicial type theory is often easier than working with ordinary categories, with the type theory handling infinite stacks of coherences in the background. We capitalize on recent work by Gratzer et al. defining the $(\infty,1)$-category of $\infty$-groupoids in STT to define presheaf categories within STT and systematically develop their theory. In particular, we construct the Yoneda embedding, prove the universal property of presheaf categories, refine the theory of adjunctions in STT, introduce the theory of Kan extensions, and prove Quillen's Theorem A.

comments
Submitted to LMCS. Revised according to first round of feedback
fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2501.13229 ↗

We study the relationship between virtual double categories and fibrations, or (hyper)doctrines, in the context of categorical logic. We present a construction that produces a virtual double category of relations internal to a fibration with finite products. We characterize the class of fibrations called elementary existential fibrations, a fibrational counterpart of regular logic, as those for which the induced virtual double category is a cartesian equipment. We also show that cartesian equipments arising in this manner are exactly those that satisfy the Frobenius axiom studied by Walters and Wood in the context of cartesian bicategories. Some logical principles, such as the comprehension axiom for predicates and the extensional equality predicate, are characterized as properties of the double categorical structure.

comments
53 pages. The original submission was a thesis, but the current version is a standalone paper
fields
Category Theory
pdf ↗ page arXiv:2501.17869 ↗

We study a stochastic extension of the n-species Shigesada-Kawasaki-Teramoto (SKT) cross-diffusion system, in which a multiplicative noise term accounts for fluctuation corrections to the mean-field dynamics arising from a finite underlying population. The noise we consider is motivated by, but not rigorously derived from, the particle-system approximation of Chen, Daus, Holzinger, and J"ungel; it only partially respects the entropy (gradient-flow) structure of the deterministic system, which is the main source of the technical difficulties addressed in this paper. For the resulting system of stochastic partial differential equations (SPDEs), we establish the existence of nonnegative, global, weak martingale solutions, under a detailed-balance condition on the diffusion coefficients and a smallness condition relating the noise intensity to these coefficients. This smallness condition amounts to a sufficiently large population size N (equivalently, small fluctuation strength 1/N): the existence theory thus operates in the perturbative regime around the deterministic mean-field limit, and for fixed coefficients it is always satisfiable once N is large enough.

comments
arXiv admin note: text overlap with arXiv:2202.12602 (same author) Derivation section split off, becomes companion paper
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2501.17953 ↗

We consider a Markov decision process with standard Borel spaces and an unknown transition kernel under the average cost criterion. We do not impose any parametrization on the set of possible kernels. To facilitate our analysis, we first develop implication relations between several topologies on kernels defined by pointwise, continuous, or uniform weak convergence; we then review robustness properties on the space of kernels, and finally we establish compactness conditions on the space of kernels. Building on this regularity analysis, we then present two data-driven identifiability results; the first one being Bayesian and the second one empirical. Our conditions for the Bayesian setting are significantly more relaxed compared with prior work which considered either finite or parametric models, though we do not obtain a rate of convergence. Our analysis is asymptotic and builds on measurability in terms of the tail $σ$-field of the available information. Identifiability results are then used to design near-optimal adaptive control policies which alternate between periods of exploration, where the controller acts according to a policy which is conducive to the identification of the true kernel, and periods of exploitation where the controller's information on the kernel is utilized. We will establish that such policies are near optimal. In summary, our contribution is with regard to the general standard Borel setup where there is no apriori parametric representation.

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

On the fiftieth anniversary of the Kuramoto model, synchronization remains a central paradigm for collective behavior in complex oscillator systems. While phase locking, frequency synchronization, and order-parameter coherence are widely used to characterize synchronization, their precise dynamical relationship has remained unclear, especially in finite-dimensional systems beyond mean-field limits. In this work, we show that, in the fully connected Kuramoto model, full phase locking, phase locking, frequency synchronization, and order-parameter synchronization are dynamically equivalent. Moreover, we demonstrate that the equivalence between phase locking and frequency synchronization is governed by a topology-independent mechanism and persists for generic symmetric coupling structures. These results provide a unified dynamical framework for synchronization and clarify the structural role of the Kuramoto order parameter.

comments
32 pages, 9 figures. Title and abstract updated to match the published version
journal
J. Phys. Complex. 7 (2026) 025010
fields
Dynamical Systems
pdf ↗ page arXiv:2503.19781 ↗

We study the regularity of entropy solutions for quasilinear parabolic equations with anisotropic degeneracy and stochastic forcing. Building on previous works, we establish space-time regularity under a non-degeneracy condition that does not require an assumption on the derivative of the symbol of the corresponding kinetic equation, a restriction imposed in earlier studies. This allows us to obtain regularity results for certain equations not accounted for by prior theory, albeit with reduced regularity exponents. Our approach uses a kinetic formulation with two transport equations, one of second order and one of first order, leveraging a form of "parabolic regularity" inherent in these equations that was not utilized in previous studies.

fields
Analysis of PDEs
pdf ↗ page arXiv:2504.01794 ↗

In this work, we propose a new numerical method for the Vlasov-Poisson system that is both asymptotically consistent and stable in the quasineutral regime, i.e. when the Debye length $λ$ is small compared to the characteristic spatial scale of the physical domain. Our approach consists in reformulating the Vlasov-Poisson system as a hyperbolic problem by applying a spectral expansion in the basis of Hermite functions in the velocity space and in designing a structure-preserving scheme for the time and spatial variables. Through this Hermite formulation, we establish a convergence result for the electric field toward its quasineutral limit together with explicit error estimates in $λ$. Following this path, we then propose a fully discrete numerical method for the Vlasov-Poisson system, inspired by the approach in arXiv:2306.14605, and rigorously prove that it is uniformly consistent in the quasineutral limit regime. Finally, we present several numerical simulations to illustrate the behavior of the proposed scheme. These results demonstrate the capability of our method to describe quasineutral plasmas, illustrate its stability and confirm its asymptotic preserving property.

comments
34 pages, 12 figures
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2504.04826 ↗

This paper studies the phase diagram of a fixed Pomeau–Manneville, or intermittent, map under a varying Hölder continuous potential of fixed exponent. Depending on the exponent, there are either one or two thermodynamic phases. The \emph{intermittent} phase is characterized by a unique Gibbs state whose typical orbits alternate irregularly between time intervals spent near the neutral fixed point and chaotic excursions away from it. The stationary phase is characterized by the Dirac mass at the neutral fixed point being the unique Gibbs state. Above a threshold exponent, every potential belongs to the intermittent phase, so the phase diagram is trivial. At or below the threshold, the phase transition locus is a co-dimension 1 topological submanifold separating the two phases, and it coincides with the set of potentials at which the pressure function fails to be real-analytic. This paper also investigates the relationships between the phase transition locus, (persistent) phase transitions in temperature, and ground states. It highlights a connection between phase transitions in temperature and ergodic optimization.

comments
Revised version. The introduction has been substantially rewritten, and the main results have been reorganized and strengthened, with a new emphasis on the global phase diagram and the geometry of the phase transition locus. Comments are welcome
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2504.07864 ↗

The efficient computation of parametric solution sensitivities is a key challenge in the integration of learning-enhanced methods with nonlinear model predictive control, as their availability is crucial for many learning algorithms. This paper discusses the computation of solution sensitivities of general nonlinear programs using the implicit function theorem and smoothed optimality conditions treated in interior-point methods (IPM). We introduce sequential barrier quadratic programming (SBQP), which generalizes SQP with an IPM quadratic programming (QP) solver by allowing the barrier parameter to approach a prescribed nonnegative target value, recovering classical SQP when this target is zero. Previous works are limited to convex or unconstrained formulations, or lack an implementation for efficient sensitivity evaluation. The publication is accompanied by an efficient open-source implementation within the `acados` framework, providing both forward and adjoint sensitivities for general optimal control problems, achieving speedups exceeding 3x over the state-of-the-art solvers `mpc.pytorch` and `cvxpygen`.

comments
accepted for Neurips 2026
fields
Optimization and Control
pdf ↗ page arXiv:2505.01353 ↗

We introduce smooth atlas stratified spaces. We show that this class is closed under cartesian products; consequently, it is possible to define fiber bundles of smooth atlas stratified spaces. We describe the resolution of such a space to a manifold with fibered corners and use this result in order to prove that the class of smooth atlas stratified spaces coincides with that of Thom-Mather stratified spaces. We then consider Witt pseudomanifolds (such as singular complex algebraic varieties) where it is well-known that a bordism invariant signature is available and equal to the Fredholm index of a realization of the signature operator. To each oriented fiber bundle of stratified spaces, with Witt fibers, we assign a class in bivariant KK-theory (with 2 inverted). Kasparov multiplication by this element defines a Gysin map in analytic K-homology and one of our main results is that this Gysin map preserves the analytic signature class of Witt spaces. We prove in fact a more general result: functoriality for fiber bundles in the sense that if one fiber bundle is the composition of two others then the KK-class of the former is the Kasparov product of the classes of the latter. We also discuss this result for other Dirac-type operators satisfying an analytic Witt condition, for example the spin-Dirac operator on a fibration of psc-Witt spin pseudomanifolds. We next define the analytic Gysin map associated to an oriented normally non-singular inclusion of Witt spaces and prove that it also preserves the signature class. Finally, we relate the analytic signature class of a Witt space with the topological Siegel-Sullivan orientation. Specifically we show that if one applies the inverse of the second Adams operation to the Sullivan orientation and complexifies then one obtains our analytic signature class under the natural identification between analytic and topological K-homology.

comments
This is Part 1 of 2
fields
Differential Geometry, Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2505.14952 ↗

This work deals with embeddings, of any integer order, for generalized Lorentz-Zygmund-Sobolev spaces on Euclidean domains satisfying minimal regularity assumptions. Explicit rearrangement-invariant, Hölder, Morrey and Campanato optimal target spaces are exhibited.

comments
46 pages
fields
Functional Analysis
pdf ↗ page arXiv:2508.14777 ↗

The monodromy group of a family of algebraic varieties is the group of isometries of the homology of a generic fibre, induced by parallel transport along a loop in the base space. We present a method to compute the monodromy group of families of generically smooth projective hypersurfaces using certified numerical algebraic geometry. This leads us to develop efficient algorithms for computing the discriminants of these families, which is of independent interest. Our flagship example is the case of families of symmetric cubic surfaces. The monodromy group is the Galois group of the 27 lines. We find that, when imposing symmetry, this Galois group is often a small subgroup of the Weyl group $W(E_6)$. We also include computational results for symmetric quartic surfaces.

comments
36 pages, 2 figures, 8 tables To appear in Foundations of Computational Mathematics
fields
Algebraic Geometry
pdf ↗ page arXiv:2509.06785 ↗

This paper studies the landscape of the simultaneous blind deconvolution and phase retrieval (BDPR) problem via a structured low-rank tensor recovery framework. Since the complicated sensing structure makes direct landscape analysis technically challenging, we introduce a tractable tensor sensing surrogate that preserves the essential low-rank structure. We first analyze its population risk, characterize the global landscape on the unit sphere, and establish local linear convergence of Riemannian gradient descent (RGD) under mild conditions. We then extend the analysis to tensor sensing under a tensor restricted isometry property (TRIP), establishing local geometric and RGD convergence guarantees, and quantify robustness to measurement noise. Our theoretical results are further supported by extensive numerical experiments. These findings offer insights into the optimization landscape of the surrogate tensor sensing problem, thereby providing guidance for studying and solving the original BDPR problem.

comments
Revised version; 33 pages, 6 figures;
fields
Information Theory
pdf ↗ page arXiv:2509.10834 ↗

We improve the status of the problem of determining minimum-sized percolating sets in $a \times b \times c$ grids under the $3$-neighbour process. Using several new constructions, we show that optimal percolating sets exist whenever $\min(a,b,c) \ge 7$. As an important step toward this, we also show that all grids with $\min(a,b,c) \ge 4$ have a percolating set whose size exactly achieves the lower bound $(ab+ac+bc)/3$ whenever this value is an integer.

comments
7 pages, plus appendix with several figures
fields
Combinatorics
pdf ↗ page arXiv:2509.13589 ↗

In this paper, the decentralized estimation and linear quadratic (LQ) control problem for a leader-follower networked system (LFNS) is studied from the perspective of asymmetric information. Specifically, for a leader-follower network, the follower agent will be affected by the leader agent, while the follower agent will not affect the leader agent. Hence, the information sets accessed by the control variables of the leader agent and the follower agent are asymmetric, which will bring essential difficulties in finding the optimal control strategy. To this end, the orthogonal decomposition method is adopted to achieve the main results. The main contributions of this paper can be summarized as follows: Firstly, the optimal iterative estimation is derived using the conditional independence property established in this paper. Secondly, the optimal decentralized control strategy is derived by decoupling the forward-backward stochastic difference equations (FBSDEs), based on the derived optimal iterative estimation. Thirdly, the necessary and sufficient conditions for the feedback stabilization of the LFNS in infinite-horizon are derived. Finally, the proposed theoretical results are applied to solve the decentralized control problem of a leader-follower autonomous underwater vehicle (LF-AUV) system. The optimal control inputs for the AUVs are provided, and simulation results verify the effectiveness of the obtained results.

comments
14pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2509.15467 ↗

One considers quasihomogeneous isolated singularities of hypersurfaces in arbitrary dimensions through the lenses of three apparently quite apart themes: syzygies, singularity invariants, and foliations. In the first of these, one adds to the well-known result of Saito a syzygy-theoretic characterization of a quasihomogeneous singularity affording an effective computational criterion. In the second theme, one explores the Milnor-Tjurina difference number from a commutative algebra viewpoint. Building on the Briancon-Skoda theorem and exponent, we extend previously known inequalities by Dimca and Greuel to arbitrary dimension and provide algebraic formulas involving the syzygy-theoretic part and reduction exponents. In the last theme, one recovers and brings to algebraic light a result of Camacho and Movasati by establishing a couple of characterizations of quasihomogeneous isolated singularities in terms of the generators of the module of invariant vector fields.

comments
Comments are welcome
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2509.16933 ↗

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.

journal
Transactions on Machine Learning Research 2025, 19 p
fields
Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2510.09034 ↗

We introduce a stochastic optimal transport for the Langevin dynamics with positive mass and study its zero–mass limit. The new aspect of this paper is that we only fix the initial and terminal probability distributions of the positions of particles under consideration, but not those of their velocities, with Heisenberg's uncertainty principle in mind. In the zero–mass limit, we show that the minimizers of our stochastic optimal transport is tight if and only if the initial momentum (=(mass)$\times$(velocity)) of a particle converges to zero. We also prove that the limit of minimizers of our stochastic optimal transport is a minimizer of a standard stochastic optimal transport for continuous semimartingales.

comments
51 pages, to appear in Ann. Appl. Probably
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2510.13238 ↗

In finite dimension, the long-time and metastable behavior of a gradient flow perturbated by a small Brownian noise is well understood. A similar situation arises when a Wasserstein gradient flow over a space of probability measure is approximated by a system of mean-field interacting particles, but classical results do not apply in these infinite-dimensional settings. We are concerned with the situation where the objective function of the optimization problem contains an entropic penalization, so that the particle system is a Langevin diffusion process. The work has two parts: the first and main one is devoted to the general study of a very simple class of models, for which the infinite-dimensional behavior is fully characterized by an autonomous diffusion process at fixed finite dimension. On the one hand, we prove the equivalence between fast convergence for the mean-field gradient flow and for the particle system in terms of functional inequalities (log-Sobolev, Polyak-Łojasiewicz, Talagrand and variants thereof) including the degenerate polynomial case occurring at phase transitions, and on the other hand we characterise the metastable behavior in terms of transition time between local minimiser -- establishing an Eyring-Kramers formula -- and of exit time from unstable critical points. In a second part, motivated by and building on the systematic study of the toy models, we consider the continuous Curie-Weiss model in a symmetric double-well potential, exactly at the critical temperature. We show that, although the $N$-particle Gibbs measure does not satisfy a uniform-in-$N$ standard log-Sobolev inequality (the optimal constant growing like $\sqrt{N}$), it does satisfy a more general Łojasiewicz inequality uniformly in $N$, inducing uniform polynomial long-time convergence rates, propagation of chaos at stationarity and uniformly in time, and creation of chaos.

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

We study in-context learning problems where a Transformer is pretrained on tasks drawn from a mixture distribution $π=\sum_{α\in\mathcal{A}} λ_α π_α$, called the pretraining prior, in which each mixture component $π_α$ is a distribution on tasks of a specific difficulty level indexed by $α$. Our goal is to understand the performance of the pretrained Transformer when evaluated on a different test distribution $μ$, consisting of tasks of fixed difficulty $β\in\mathcal{A}$, and with potential distribution shift relative to $π_β$, subject to the chi-squared divergence $χ^2(μ,π_β)$ being at most $κ$. In particular, we consider nonparametric regression problems with random smoothness, and multi-index models with both random smoothness and random effective dimension. We prove that a large Transformer pretrained on sufficient data achieves the optimal rate of convergence corresponding to the difficulty level $β$, uniformly over test distributions $μ$ in the chi-squared divergence ball. Thus, the pretrained Transformer is able to achieve faster rates of convergence on easier tasks and is robust to distribution shift at test time. Finally, we prove that even if an estimator had access to the test distribution $μ$, the convergence rate of its expected risk over $μ$ could not be faster than that of our pretrained Transformers, thereby providing a more appropriate optimality guarantee than minimax lower bounds.

comments
45 pages, 6 figures. Accepted at NeurIPS 2026
fields
Statistics Theory
pdf ↗ page arXiv:2510.23254 ↗

We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of a transition matrix, extending the classical spectral inequality to the non-symmetric setting. This formulation works with the complex spectrum of the transition matrix and incorporates the conditioning of its eigenbasis through a condition number. For connected, non-bipartite, undirected regular graphs, the result reduces to the classical Expander Mixing Lemma. More generally, the theorem provides a framework for studying structural properties of directed graphs through the spectra of non-normal matrices.

comments
7 pages. Replacement: An earlier version of this paper contained an application to the toughness of directed graphs; that application has been withdrawn because its proof contained errors
fields
Combinatorics
pdf ↗ page arXiv:2511.01738 ↗

For $d\geq 1$, we define semibricks and wide subcategories in the $d$-extended hearts of bounded $t$-structures on a triangulated category. We show that these semibricks are in bijection with finite-length wide subcategories. When the $d$-extended heart is the $d$-extended module category $d\mbox{-}\mathrm{mod}Λ$ of a finite-dimensional algebra $Λ$ over a field, we define left/right-finite semibricks and left/right-finite wide subcategories in $d\mbox{-}\mathrm{mod}Λ$ and show bijections with $(d+1)$-term simple-minded collections, generalising the bijections between $2$-term simple-minded collections, left/right-finite wide subcategories and left/right-finite semibricks in $\mathrm{mod}Λ$. We use a relation between semibricks and silting complexes to characterise which mutations of $(d+1)$-term silting complexes are again $(d+1)$-term.

comments
Added Example 3.22 of a d-FAE closed subcategory which is not a positive torsion class
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2511.08157 ↗

Multitarget direction of arrival (DoA) estimation is challenging when fluctuating targets are closely spaced: local Cramér–Rao bounds (CRBs) miss global errors, while direct vector Ziv–Zakai bound (ZZB) evaluation is computationally demanding. For colocated multiple-input multiple-output (MIMO) radar with Swerling-II fluctuations and an ordered angular prior, we derive a rigorous two-term Bayesian mean squared error lower bound. A finite separation contribution addresses nonlocal discrimination, while a correction based on the prior averaged Fisher information matrix (FIM) retains target coupling and virtual array geometry. We show that the prior averaged pointwise CRB diverges under unrestricted target spacing when the FIM is nonsingular almost everywhere, although the proposed bound remains finite. Once the averaged FIM is obtained, evaluation avoids displacement optimization and multidimensional binary error integration. The bound supports analysis of snapshot diversity, target spacing, and transmit and receive allocation. Numerical comparison with the vector ZZB shows close agreement at low SNR but greater conservatism at high SNR, quantifying the tradeoff in tightness.

comments
6 pages, 3 figures
fields
Information Theory
pdf ↗ page arXiv:2511.08326 ↗

Motivated by recent high-dimensional reliability algorithms, we study a random matrix model corresponding to the estimation by importance sampling of $Σ_A$, the covariance matrix of a Gaussian vector conditioned by a rare event $A$. For such models, we show that, in contrast to most random matrix models, the minimal sample size to ensure an accurate estimation of $Σ_A$ needs to grow superlinearly in the dimension. More precisely, if $n$ is the sample size and $d$ the dimension, we show that the estimation of $Σ_A$ is accurate if $n/d \gg L$ and not accurate if $n/d \ll L$ where $L$ is the maximum likelihood ratio. Moreover, we relate the asymptotic behavior of $L$ to $λ_1$, the smallest eigenvalue of the auxiliary covariance matrix, which suggests that $L$ (and thus the minimal sample size) will be larger for small values of $λ_1$. Numerical experiments confirm that this insight carries over to recent cross-entropy algorithms, with the best performing algorithms being also the ones with the largest smallest eigenvalue. Although backed up by our theoretical result, this result is surprising as these algorithms were not designed to act on the spectrum.

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

Consider the Dirichlet-to-Neumann map $Λ_β$ associated with the Schrödinger operator $(D+β\A)^2$ with a magnetic potential in a bounded Lipschitz domain $Ω$, where $β>1$ is the field strength parameter. Assume that the magnetic field $\B=\nabla \times \A$ is of finite type. We show that if $β>β_0$, the ground state for $Λ_β$ decays exponentially away from a neighborhood of the subset of $\partialΩ$, on which $\B$ vanishes to the maximal order.

comments
15 pages. Minor revision. Accepted for publication in Proc. Amer. Math. Soc
fields
Analysis of PDEs
pdf ↗ page arXiv:2511.14054 ↗

We revisit the HED Method for the Mullins-Sekerka evolution in the plane. We identify a natural notion of distance, intrinsic to the interface itself. Using this distance, the energy, and the dissipation, we develop natural assumptions on the flow and, assuming existence of a solution satisfying these conditions, obtain not just the algebraic rate (already previously derived by Chugreeva, Otto, and M.G. Westdickenberg) but also the sharp leading order constant for the convergence to the flat limiting interface. To carry this out, we introduce a lemma that obtains optimal algebraic decay behavior (rate and prefactor) from given variational information.

comments
Added Lemma 1.4, which yields the sharp leading order constant in the decay estimate
fields
Analysis of PDEs
pdf ↗ page arXiv:2511.23270 ↗

In this paper, we investigate dead-core problems for fully nonlinear degenerate parabolic equations with strong absorption, \begin{equation*} |Du|^{p} F(D^{2}u) - u_{t} = λ_{0}(x,t)\, u^μ\, χ_{\{u>0\}}(x,t) \qquad \text{in } \quad Ω_{T} := Ω\times (0,T), \end{equation*} where $0\le p<\infty$, $0<μ<1$ and $u \geq 0 $ is a bounded viscosity solution satisfying $0\le u_t\le A_0u^μ$ in the viscosity sense for some $0\le A_0<\infty$. We establish a sharp and improved parabolic $C^α$-regularity estimate along the free boundary $\partial \{ u > 0 \}$, where \[ α:= \frac{2+p}{1+p-μ} > 1 + \frac{1}{1+p}. \] Moreover, we establish weak geometric properties of solutions, such as non-degeneracy and uniform positive density. As an application, we obtain a Liouville-type theorem for entire solutions and gradient bounds. Finally, as a byproduct of our approach, we derive a new formulation of the gradient decay property and establish a Harnack-type inequality on time slices. It is worth noting that the results presented here extend those in da Silva {\em et al.}(Pacific J. Math., \textbf{300} (2019), 179–213) and (J. Differential Equations., \textbf{264} (2018), 7270–7293) to the degenerate setting, and can be viewed as a parabolic analogue of da Silva {\em et al.} (Math. Nachr., \textbf{294} (2021), 38–55) and Teixeira (Math. Ann., \textbf{364} (2016), 1121–1134).

comments
We have corrected several errors
fields
Analysis of PDEs
pdf ↗ page arXiv:2512.08196 ↗

We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of absolute incidence theorems, which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from tilings of an orientable surface; they call this result the master theorem. Instances of the master theorem are always absolute incidence theorems. As most classically known incidence theorems are instances of the master theorem, they are absolute incidence theorems. We give an explicit example of an incidence theorem involving 13 points that is not an absolute incidence theorem, and therefore is not an instance of the master theorem.

comments
12 pages, 4 figures. To appear in the Journal of Combinatorial Algebra
fields
Combinatorics
pdf ↗ page arXiv:2512.14316 ↗

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $δ$ are considered, for a fixed $δ$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

comments
58 pages, 13 figures
fields
Combinatorics
pdf ↗ page arXiv:2512.18656 ↗

Berry and Tabor conjectured in 1977 that spectra of generic integrable quantum systems have the same local statistics as a Poisson point process. We verify their conjecture in the case of the two-point spectral density for a quantum particle in a three-dimensional box, subject to a Diophantine condition on the domain's proportions. A permissible choice of width, height and depth is for example $1,2^{1/3},2^{-1/3}$. This extends previous work of Eskin, Margulis and Mozes (Annals of Math., 2005) in dimension two, where the problem reduces to the quantitative Oppenheim conjecture for quadratic forms of signature $(2,2)$. The difficulty in three and higher dimensions is that we need to consider the distribution of indefinite forms in shrinking rather than fixed intervals, which we are able to resolve for special diagonal forms of signature $(3,3)$ in various scalings, including a rate of convergence. A key step of our approach is to represent the relevant counting problem as an average of a theta function on $\mathrm{SL}(2,\mathbb{Z})^3\backslash\mathrm{SL}(2,\mathbb{R})^3$ over an expanding family of one-parameter unipotent orbits. The asymptotic behaviour of these unipotent averages follows from Ratner's measure classification theorem and subtle escape of mass estimates.

comments
33 pages, to appear in Inventiones Mathematicae
fields
Number Theory, Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2601.03209 ↗

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the family of monitorable sets is $Π^0_3$ and determine the exact complexities it can have. In contrast, we show that if $X$ is not second countable then the family of monitorable sets can be much more complex, giving an example where it is $ Π^1_1$-complete.

fields
Logic
pdf ↗ page arXiv:2601.04256 ↗

Community detection is a fundamental task in data analysis, and block models provide an approach for identifying diverse community structures. The degree-corrected block model (DCBM) is an established model that captures node degree heterogeneity. However, inference methods are computationally costly and sensitive to initialization, while cheaper alternatives, such as spectral or modularity-based approaches, may be less effective at recovering certain non-assortative structures. In this work, we show that DCBM inference can be reformulated as a constrained nonnegative matrix trifactorization problem. Leveraging this insight, we propose a scalable community detection method with a theoretically grounded initialization providing an initial partition for inference algorithms. Our approach is agnostic to network structure and applies to any graph representable by a DCBM. Experiments on synthetic and real-world benchmark networks show that our method achieves community recovery comparable to, and sometimes better than, that achieved by the DCBM inference methods, while being faster: it processes a graph with 100,000 nodes and 500,000 edges in about 30 seconds. Moreover, the initialization significantly improves solution quality. Overall, this work provides a scalable and robust framework for community detection and highlights the benefits of a matrix-factorization perspective for the DCBM.

comments
19 pages, 7 figures, code and data available from https://github.com/Alexia1305/OtrisymNMF_DCBM
fields
Optimization and Control
pdf ↗ page arXiv:2601.06262 ↗

Global optimization of large-scale, complex systems such as multi-physics black-box simulations and real-world industrial systems is important but challenging. This work presents a novel Surrogate-Based Optimization framework based on Clustering, SBOC for global optimization of such systems, which can be used with any surrogate modeling technique. At each iteration, it uses a single surrogate model for the entire domain, employs k-means clustering to identify unexplored domain, and exploits a local region around the surrogate optimum to potentially add three new sample points in the domain. SBOC has been tested against sixteen promising benchmarking algorithms using 52 analytical test functions of varying input dimensionalities and shape profiles. It successfully identified a global minimum for most test functions with substantially lower computational effort than other algorithms. It worked especially well on test functions with four or more input variables. It was also among the top six algorithms in approaching a global minimum closely. Overall, SBOC is a robust, reliable, and efficient algorithm for global optimization of box-constrained systems.

comments
34 pages, 4 Figures, 8 Tables
journal
Computers and Chemical Engineering 207 (2026), 109559
fields
Optimization and Control
pdf ↗ page arXiv:2601.07442 ↗

Flow-based generative models have emerged as an efficient alternative to diffusion models. We study the sample complexity of learning a target distribution in Wasserstein distance via flow matching, which learns a velocity field transporting a base distribution to the target. Under exact empirical risk minimization over a fixed network class and standard assumptions on the architecture and data distribution, we show that any squared-loss flow-matching variant including rectified flow with bounded derivatives achieves $\widetilde{O}(\varepsilon^{-2})$ sample complexity for the statistical term with the Wasserstein guarantee taking the form $W_2 \le K(\varepsilon + C\varepsilon_{app})$, where $\varepsilon_{app}$ is the approximation error of the network class. This improves upon existing $\widetilde{O}(\varepsilon^{-4})$ guarantees and does not require the Polyak–Lojasiewicz condition in the statistical analysis. Instead, we exploit a structural property of the squared-loss objective - it induces an approximate Bernstein condition that directly ties the variance of the excess loss to the excess risk up to additive approximation-error. This condition enables a localized Rademacher complexity analysis yielding fast $O(1/n)$ rates. The flow-matching schedule enters the leading statistical prefactor through the Lipschitz constant of the pointwise loss, which we characterize explicitly for standard schedules.

fields
Information Theory
pdf ↗ page arXiv:2601.20250 ↗

In service system design, it is often the case that the main evidence of system performance appears in textual form, such as customer support transcripts, complaint narratives, and compliance review reports. With the increasing use of large language models (LLMs), these textual trajectories can be converted into low-cost proxy scores that support comparison and optimization of candidate service configurations. However, LLM-based evaluations can exhibit systematic bias and require human audits for correction. To this end, this research studies how to identify the best service configuration with high confidence while minimizing the use of expensive human audits. We formulate the problem as fixed-confidence best arm identification with an always-observed, potentially biased proxy and selectively acquired human-verified outcomes. Moreover, several configurations can run on one case. A human audit can provide a case label that scores all their outputs. We show that sharing this reference and deciding whether to audit after observing proxy scores can each strictly reduce asymptotic identification cost. The selected configurations determine the available proxy scores and verified outcomes, so the proposed algorithm allocates configuration evaluations and subsequent audits jointly. For a specified finite family of data-generating models containing the true law and distinguishing different best configurations, its expected cost asymptotically attains the information-theoretic lower bound. For audits of individual outputs, we develop prediction-powered confidence sequences valid under adaptive auditing and delayed feedback. Numerical experiments on synthetic examples and service datasets show that the proposed algorithms require substantially less human review while maintaining reliable selection.

comments
Substantially revised and expanded version of arXiv:2601.21471 prepared for journal resubmission, with a new title and the complete Electronic Companion
fields
Optimization and Control
pdf ↗ page arXiv:2601.21471 ↗

We review quantitative results on the convergence to equilibrium of the stochastic $p$-Laplace equation, $p>1$, on a bounded domain in $\mathbb{R}^d$ with additive, possibly degenerate Wiener noise. From these results we derive upper bounds on $\varepsilon$-mixing times in different distances, depending on the initial data. We show that the Wasserstein distance to equilibrium is non-increasing in time and that, for $p>\frac{2d}{d+2}$, the invariant measure has moments of all orders. For $1<p<2$ with $p>\frac{2d}{d+2}$ and possibly degenerate noise, the $\varepsilon$-mixing times in every Wasserstein distance $\mathcal{W}_r$, $r\ge1$, are $O(\varepsilon^{-δ})$ as $\varepsilon\downarrow 0$ for every $δ>0$. Two tables collect the convergence rates and the mixing-time bounds.

comments
36 pages, 50 references
fields
Probability, Analysis of PDEs, Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2602.00853 ↗

In this paper, we give explicit expressions for $q$-harmonic sums on $1-\cdots-1,A,1-\cdots-1$ indices. The case $A=1$ has been extensively studied, and a variety of identities, explicit evaluations, and structural properties are known. Likewise, numerous explicit evaluations are available for $q$-multiple zeta values and $q$-harmonic sums with uniform indices $A-\cdots-A$. Although several methods are available for treating non-uniform indices, explicit evaluations for the pattern $1-\cdots-1,A,1-\cdots-1$ remain comparatively scarce. The case $A=2$ was settled only recently. In this paper, we extend this framework to the general case $A\ge3$ as the total sum with the theory of the elementary symmetric functions, though we do not generally evaluate each summand at a prescribed position of $A$. We obtain explicit formulas in terms of binomial coefficients and degenerate Bernoulli numbers. Some expressions about $2-\cdots-2,A,2-\cdots-2$ are also shown.

fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2602.02480 ↗

In this paper, we investigate the time-averaged phase space arclength of a trajectory, expressed through a normalized Lagrangian descriptor, as a trajectory-based diagnostic for distinguishing regular and chaotic dynamics. The proposed indicator, $Ω$, is computed by integrating the equations of motion together with a single scalar arclength-accumulation equation and therefore does not require variational equations, neighboring trajectories, or spatial derivatives of a Lagrangian descriptor field. Using Birkhoff's ergodic theorem together with estimates for quasiperiodic motion and correlation-based arguments for chaotic ergodic dynamics, we show that regular and chaotic trajectories exhibit different finite-time behavior despite the convergence of $Ω$ in both regimes. For quasiperiodic trajectories with Diophantine frequency vectors, deviations from the limiting average decay as $\mathcal{O}(τ^{-1})$, whereas sufficiently mixing chaotic dynamics exhibit root-mean-square fluctuations of order $τ^{-1/2}$ under suitable correlation assumptions. This difference in finite-time convergence and fluctuation scaling provides the theoretical basis for using $Ω$ to discriminate between the two dynamical regimes. We validate the proposed approach in the Hénon–Heiles and Fermi–Pasta–Ulam systems, comparing the resulting classification of initial conditions with SALI as a reference chaos indicator. The results support $Ω$ as a complementary single-trajectory diagnostic for chaos detection and as a practical source of scalar features for the analysis of trajectory ensembles, particularly in settings involving large numbers of trajectories or high-dimensional systems.

fields
Dynamical Systems
pdf ↗ page arXiv:2602.07660 ↗

The celebrated Antezana-Pujals-Stojanoff Theorem states that the iterated Aluthge transforms of an arbitrary matrix converge to a normal matrix. We introduce a family of matrix flows that share this convergence property by defining them through ordinary differential equations. The family includes a continuous analogue of the Aluthge transform, as well as a differential equation discussed by Haagerup in the context of II$_1$ factors. We also examine the same type of flows in the setting of Hilbert space operators equipped with unitarily invariant norms.

comments
v2:minor revision, typos corrected, to appear in Reviews in Mathematical Physics
fields
Functional Analysis, Dynamical Systems, Operator Algebras, Spectral Theory
pdf ↗ page arXiv:2602.11837 ↗

The Wintner-Wielandt theorem exposes a fundamental incompatibility between the canonical commutation relation (CCR) and the Hilbert-space formulation of quantum mechanics. While the conventional approach preserves the CCR by extending the Hilbert-space framework to a rigged Hilbert space, this work develops the complementary alternative. Retaining the Hilbert space, the unavoidable trace obstruction requires a boundary modification of the CCR, consistently realizable only in a space of finite, albeit arbitrarily large, dimension. In this setting, the eigenvalue problems of position and momentum admit explicit solutions within the Hilbert space. We show that the highest-energy components of the position eigenvectors retain a non-vanishing uniform weight, implying that the full spectrum remains relevant. The resulting autonomous matrix algebra also yields a new physical observable, the action difference. In the position basis, this observable gives rise to a momentum matrix with a discrete Cauchy kernel. After an alternating phase transformation, this matrix acts on plane waves in the infinite equidistant lattice model as the Schroedinger momentum operator, revealing a structural connection between the algebraic and analytic approaches. This framework retains the standard Hilbert-space spectral theory and remains closely connected to the familiar analytical structure of quantum mechanics, including the momentum operator and the uncertainty principle.

comments
17 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2602.14126 ↗

The computation of the Log-determinant of large, sparse, symmetric positive definite (SPD) matrices is essential in many scientific computational fields such as numerical linear algebra and machine learning. In low dimensions, Cholesky is preferred, but in high dimensions, its computation may be prohibitive due to memory limitation. To circumvent this, Krylov subspace techniques have proven to be efficient but may be computationally expensive due to the required orthogonalization processes. In this paper, we introduce a Newton-Léja interpolation based approach for estimating log-determinants, where the implementation is only based on matrix multiplications and a rough estimation of eigenvalue bounds of the matrix. The method employs an adaptive stopping criterion to select the degree of interpolation according to the data and introduces a centered, scaled-based formulation for computing the logarithmic divided differences. By combining Newton-Léja interpolation with a randomized algorithm called Hutch++, we obtain a matrix-free log-determinant estimation framework that avoids explicit matrix factorization and Krylov basis orthogonalization. We establish approximation error bounds for the Newton-Léja interpolation and derive an inexact oracle error bound that separates stochastic trace estimation from the approximation errors in the projected and residual components. Numerical experiments on both large sparse synthetic matrices (Gaussian Markov Random fields) and large-scale real-world matrices demonstrate that our method substantially reduces computational time while retaining competitive accuracy, thereby confirming its effectiveness, scalability, and favorable accuracy-cost trade-off for large-scale log-determinant estimation compared with stochastic Lanczos quadrature (SLQ) and related stochastic trace-estimation methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.02207 ↗

Let $H$ be a monoid and let $G$ denote its quotient groupoid. We introduce the Riemann-Zariski space $\textup{Zar}(G| H)$ associated with $H$ and prove that it is a spectral space. We then show that, if $H$ is an $s$-Prüfer monoid, the space $\textup{Zar}(G| H)$ is homeomorphic to the prime $s$-spectrum of $H$ endowed with the Zariski topology. Next, given a finitary ideal system $r$ on $H$, we prove that the space of $r$-ideals $\mathcal{I}_r(H)$, endowed with the Zariski topology, is spectral, and that the prime $r$-spectrum of $H$ is proconstructible in $\mathcal{I}_r(H)$. We also introduce a new topology on the set $\mathcal{X}$ of all generalized $H$-module systems and study its properties. In particular, we show that $\mathcal{X}$ and its subspace $\mathcal{X}_{\textup{fin}}$ of finitary generalized $H$-module systems are spectral spaces. Finally, we provide a characterization of those subsets of the set of overmonoids of $H$ that are quasi-compact.

comments
23 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2603.08103 ↗

In this article, we introduce a nonconvex two-parameter penalty function $P_{a,p}$, parameterized by $a\in(0,\infty)$ and $p\in(0,1]$, and the relaxation degree RD$_P$ for a separable nonconvex penalty function $P$. Based on $P_{a,p}$, we further propose the $P_{a,p}$ minimization framework for sparse signal recovery. This framework generalizes the TL1 minimization model established by S. Zhang and J. Xin (corresponding to the special case $p=1$) and provides a unified family of nonconvex penalty functions for sparse signal recovery. Using the sparse convex-combination technique, we establish both exact and stable sparse signal recovery under the restricted isometry property (RIP). To efficiently solve the resulting nonconvex optimization problem, we apply a modified iteratively re-weighted least squares method and the difference of convex functions algorithm (DCA) to develop the IRLSTLp algorithm for unconstrained $P_{a,p}$ minimization and prove some convergence results. Finally, numerical experiments compare recovery and runtime against single- and double-loop baselines, examine sensitivity to $(a,p)$, and assess the empirical correlation between RD$_{P_{a,p}}$ and recovery within the proposed family.

fields
Functional Analysis, Information Theory, Classical Analysis and ODEs
pdf ↗ page arXiv:2603.09722 ↗

In a recent work of Matteo Mio on compact quantitative equational theories (here compact means that all its consequences are derivable by means of finite proofs) convex algebras on the carrier set [0,1] whose operations are monotone and satisfy certain semicontinuity properties occurred. We fully classify those algebraic structures by giving an explicit construction of all possible convex operations on [0,1] possessing the mentioned properties. Our result thus describes exactly the range of theories to which Mio's theorem applies.

fields
Logic
pdf ↗ page arXiv:2603.14955 ↗

In [18], we introduced discounted infinite-time mean field games. Subsequently, in [19], we studied the connection between infinite-time mean field FBSDEs and elliptic master equations. In this paper, we further investigate the regularity of the representative player's value function $V(x,μ)$. We first establish strong well-posedness and uniqueness in law for an extended class of infinite-time FBSDEs. In the weighted $L_r^2$ framework, we construct directional variations and obtain a bounded continuous representation of the Lions-derivative of $\partial_xV$. Under additional smoothness and quantitative stability assumptions, $L_r^p$ estimates for scalar linear FBSDEs allow us to establish the existence of higher-order derivatives of $\partial_xV$. Consequently, $\partial_xV$ is a classical solution of the elliptic master equation for the value function's derivative.

fields
Probability
pdf ↗ page arXiv:2603.15141 ↗

In this paper we study nearest-neighbour deformations of integrable models. After expanding in the deformation parameter, we identify four possible types of deformations. First there are deformations that simply break or preserve integrability. Then we find two different subtle cases. The first case is where the deformation is only integrable if all orders of the deformation parameter are taken into account. An example of these are the long-range deformations that appear in holographic models. The second case is when the deformation is perturbatively integrable to some order in the deformation parameter but can not be extended to an integrable model. In this paper we work this out for the XXZ spin chain and discuss the level statistics of each of these cases. We find numerical evidence that the onset of chaos occurs differently in each of these models. For the perturbatively integrable models, we find that the deformation strength at which chaos appears demonstrates a volume-scaling intermediate between strong and weak integrability breaking models.

comments
24 pages, 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2603.17018 ↗

We answer a question of P. Higgins on permutations and involutions in binary arrays, arising in the study of regular finite semigroups. For a binary rectangular matrix M, we prove that if there is a permutation pi(x, y) = (f(x, y), g(x, y)) of its cells satisfying M(x, g(x,y)) = 1 for every cell, then there is an involution with the same property. The elementary proof places coins in the nonzero cells, reduces their support to a forest, and assigns consecutive integer weights to the coins incident to each row and column. We also prove a multiplicativity formula for bipartite expansion and a perfect matching theorem for tensor products of supports of matrices with prescribed margins. We study a stronger conjecture of F. Petrov on disjoint swaps in biregular bipartite multigraphs. We prove this conjecture for k = mn + eps, |eps| <= 2, and for n = 6, k = 6m + 3, and give a group-theoretic reformulation.

fields
Combinatorics
pdf ↗ page arXiv:2603.18253 ↗

We develop and analyze a class of structure-preserving discontinuous Galerkin schemes for the nonlinear Vlasov-Poisson-Fokker-Planck model, reformulated as a hyperbolic system through a Hermite expansion in the velocity variable. We discretize the Vlasov-Fokker-Planck equation with the discontinuous Galerkin method, while the Poisson equation is approximated with either a discontinuous Galerkin method or a Raviart-Thomas mixed finite element method. We prove the exponential relaxation to equilibrium for suitable initial data, uniformly with respect to the discretization parameters thanks to discrete hypocoercivity arguments. Moreover, we check that the resulting semi-discrete schemes preserve the physical invariants along with the L 2 variational structure of the linearized model. Numerical simulations verify the accuracy and the long-time behavior of the scheme.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.26218 ↗

In this paper, we present a Koopman autoencoder-based least-squares policy iteration (KAE-LSPI) algorithm for reinforcement learning (RL). The KAE-LSPI algorithm is based on reformulating the so-called least-squares fixed-point approximation method in terms of extended dynamic mode decomposition (EDMD), thereby enabling automatic feature learning via the Koopman autoencoder (KAE) framework. The approach is motivated by the lack of a systematic procedure for selecting features or kernels in linear RL techniques. Unlike previous approaches, no features or kernels need to be fixed a priori in our method. We discuss the theoretical convergence of KAE-LSPI under suitable assumptions, similar to kernel-based least-squares policy iteration (KLSPI). We empirically compare our method with two existing algorithms: least-squares policy iteration (LSPI) and KLSPI. In particular, for the chainwalk problem, the resulting policies are either optimal or nearly optimal for both three approaches. For the cart-pole system, KAE-LSPI outperforms the other two approaches in terms of policy performance.

comments
15 pages, 4 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2603.26464 ↗

We prove injectively that the pattern-avoiding permutation classes $\mathrm{Av}(1324, 231)$ and $\mathrm{Av}(1324, 2314, 3214, 4213)$ are inversion monotone: for every $k$, the number of length-$n$ permutations with $k$ inversions in either class is weakly increasing in $n$. These are the first known nontrivial examples of the phenomenon. The latter is a special case of a general construction. We also characterize the finitely based permutation classes in which the number of length-$n$ members with a fixed number of inversions stabilizes as $n$ grows, and determine the limiting values for all classes $\mathrm{Av}(1324, p)$ with $p \in S_4$. Connections to several nice families of integer partitions are revealed. Lastly, we show that for asymptotically almost every pattern $p \in \mathrm{Av}(1324)$, the class $\mathrm{Av}(1324, p)$ is inversion monotone in the region $n \geq \frac{k+7}{2}$, expanding on the work of Linusson and Verkama. This work is motivated by the conjectures of Claesson, Jelínek and Steingrímsson that $\mathrm{Av}(1324)$, and more generally $\mathrm{Av}(p)$ for every nonidentity pattern $p$, is inversion monotone.

comments
39 pages
fields
Combinatorics
pdf ↗ page arXiv:2604.01143 ↗

Quasiparticles whose number is not conserved are generally considered not to condense in equilibrium, although a Bose–Einstein condensation can formally appear in particle–Bose field interacting systems. As a basis for examining this mathematically, we formulate the condensation of the free Bose gas with resolvent algebras and probability theory: above the critical density, the condensate state is a standard complex Gaussian mixture of disjoint factor states, which is its central decomposition and corresponds to the ergodic decomposition of a Gaussian measure for the real-time evolution.

comments
33 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2604.01424 ↗

We prove a quantitative universal approximation theorem for noisy quantum neural networks (QNNs), with explicit non-asymptotic error bounds in terms of the number of accuracy blocks, the qubit count, the number of two-qubit gates, and hardware noise parameters. Motivated by quantitative finance, where target functions are expectations of payoffs, we first extend existing noiseless bounds to expectation functions and derive explicit constants for exponential Levy models, covering the Black-Scholes price of (truncated) European Put options. We then formulate the noisy circuit via quantum channels, obtain a fidelity-based bound for general noise models, and specialise to depolarising noise with readout error, calibrated to real hardware. Finally, we provide a detailed numerical analysis for option pricing in the Black-Scholes model, testing our results on actual noisy quantum hardware.

comments
36 pages, 14 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2604.02064 ↗

Using motivic homotopy theory we produce several explicit polynomial representatives of the suspension of the Hopf map defined over the integers. We derive from this computation an explicit rank 2 vector bundle on the Jouanolou device of the projective space of dimension 3 over the integers.

comments
29 pages. Corrected some typos and inaccuracies. Comments still welcome!
fields
Algebraic Geometry, K-Theory and Homology
pdf ↗ page arXiv:2604.12541 ↗

Phase-field models are widely used to simulate microstructure evolution but their numerical solution remains computationally demanding. Neural operator surrogates provide a promising alternative, yet existing approaches are data-driven, requiring large datasets and exhibiting limited robustness when extrapolating to unseen configurations. We introduce DeepRitzSplit, an unsupervised neural operator framework for gradient-flow systems based on a variational formulation of energy-stable splitting schemes. It learns the time evolution semigroup associated with a convex-concave free-energy decomposition by minimizing the underlying variational problem at each time step. It is designed to inherit the dissipative structure of the underlying gradient flow without requiring trajectory datasets. We further introduce a Reaction-Diffusion Neural Operator (RDNO) architecture motivated by splitting schemes, with separate reaction and diffusion components to improve training efficiency and interpretability. We assess the approach on the Allen-Cahn equation and apply it to a phase-field model of anisotropic dendritic growth during solidification. In the Allen-Cahn benchmark, DeepRitzSplit shows better generalization than the supervised baseline on the out-of-distribution configurations tested, using 180 training configurations. In dendritic growth, the method captures the overall phase morphology and dendrite tip velocity well, while the tip radius is more sensitive to the training strategy. Refinement based on the residual of the splitting scheme markedly improves this second-order morphological quantity. The trained operators retain good predictive capabilities on configurations substantially different from the training set. These results demonstrate the potential of variationally trained neural operators as physically informed surrogates for accelerated microstructure simulations.

comments
36 pages
fields
Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2604.18261 ↗

Adversarial training of binary classifiers can be reformulated as regularized risk minimization involving a nonlocal total variation. Building on this perspective, we establish a characterization of the subdifferential of this total variation using duality techniques. To achieve this, we derive a dual representation of the nonlocal total variation and a related integration-by-parts formula, involving a nonlocal gradient and divergence. We provide such duality statements both in the space of continuous functions vanishing at infinity on proper metric spaces and for the space of essentially bounded functions on separable metric spaces. Furthermore, under some additional conditions we provide characterizations of the subdifferential in these settings.

comments
34 pages
fields
Analysis of PDEs, Functional Analysis, Optimization and Control
pdf ↗ page arXiv:2604.18540 ↗

Recovering latent structure from count data has received considerable attention in network inference, particularly when one seeks both cross-group interactions and within-group similarity patterns in bipartite networks, which are widely used in ecology research. Such networks are often sparse and prone to imperfect detection. Existing models mainly focus on interaction recovery, while the induced similarity graphs are much less studied. Moreover, existing models for under-counted data place sparsity, if at all, on the detection model rather than on these graphs. To address these issues, we propose a nonnegative low-rank factorization framework that jointly estimates detection probabilities and promotes sparse within- and cross-group graphs through $\ell_{1/2}$ regularization. For the resulting nonconvex, nonsmooth problem, we develop an ADMM-based algorithm with adaptive penalization, and establish asymptotic feasibility and KKT stationarity of cluster points under stated assumptions. We also give sufficient conditions for exact recovery of within- and cross-group graphs. On synthetic data with up to 20% missing entries, the method recovers the graphs and detection probabilities with competitive accuracy. Across three ecological datasets, it matches the baseline held-out predictions while estimating detection probabilities and within- and cross-group graphs.

comments
16 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2604.18820 ↗

We propose an adaptive refinement strategy for hierarchical B-splines that increases the approximation power of every marked cell by at least one. Here, the approximation power of a cell is the finest level $\ell$ such that all the B-splines of level $\ell$ that do not vanish on the cell belong to the hierarchical space. This increase can be achieved with the standard refinement of hierarchical meshes, in which each cell is subdivided at most once per step, provided that the regions formed at each level by the cells with this property are nested. We call the hierarchical meshes with this nesting property \emph{weakly admissible}, characterize them, and prove that the proposed refinement preserves weak admissibility. We also prove a complexity estimate: the number of cells created along the adaptive process is bounded by a constant times the total number of marked cells. Moreover, we extend known local $L^q$ estimates for a multilevel quasi-interpolant on these meshes to Sobolev norms, showing that the local error bound on each active cell is governed by its approximation power, which supports using this quantity to drive the refinement. Numerical experiments illustrate the local gain of resolution produced by the proposed strategy, as well as its robustness with respect to the marking criterion and the marking parameter.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.19555 ↗

We present a structure-preserving semi-implicit finite volume method on vertex-based staggered meshes for the compatible discretization of first-order systems of time-dependent partial differential equations (PDEs). The method preserves divergence-free and curl-free vector fields exactly thanks to the compatible vertex-staggered discretization of the state variables on unstructured grids consisting of primal Delaunay triangles and their dual polygons. For the weakly compressible Euler equations, the scheme is asymptotic preserving, yielding a consistent discretization of the incompressible limit as the Mach number goes to zero. The scheme applies to a broad spectrum of PDEs, including the weakly compressible and incompressible Euler and Navier-Stokes equations, the incompressible magnetohydrodynamics (MHD) system, and the incompressible version of the first-order hyperbolic Godunov-Peshkov-Romenski (GPR) model for continuum mechanics. The computational domain is covered by a primal triangular mesh and a dual tessellation made of star polygons. Scalar quantities (pressure, density, viscous stress) are defined at nodes, with pressure updated implicitly in a continuous finite element fashion, yielding a symmetric and positive definite pressure system. Instead, vector fields (velocity, momentum, magnetic and distortion fields) are stored at triangle barycenters and evolved explicitly using a compatible finite volume scheme. With the semi-implicit discretization, the CFL restriction is independent of the sound speed, allowing simulations at low Mach numbers. The compatible formulation ensures an exactly divergence-free velocity field in the incompressible limit, an exactly divergence-free magnetic field for MHD, and an exactly curl-free inverse deformation gradient in solid mechanics. The scheme has been extended to second-order accuracy. The method is validated through a set of test cases.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.21906 ↗

Via a new inequality à la Gagliardo–Nirenberg, we prove the existence and nonexistence of solutions to \begin{equation*} \begin{cases} (-Δ)^s u + \fracμ{|y|^{2s}} u + λu = f(u), \quad \mathbb{R}^N \ni x = (y,z) \in \mathbb{R}^K \times \mathbb{R}^{N-K}, \\ \int_{\mathbb{R}^N} u^2 \, \mathrm{d}x = ρ\end{cases} \end{equation*} in the mass-critical and mass-subcritical regimes, where $s>0$, $N \ge K \ge 2$, $μ\in \mathbb{R}$ belongs to a specific range, $ρ>0$ is given a priori, and $λ\in \mathbb{R}$ is unknown. Additionally, we obtain similar results for the problem above with $μ=0$ and $N \ge 1$ as well as a related curl-curl equation. Finally, we provide a thorough insight into the threshold for $ρ$ that divides the scenarios of negative and zero least energy.

comments
31 pages, to appear in Ann. Mat. Pura Appl.; comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2604.24381 ↗

We construct a block bootstrap max-test for detecting the presence of significant predictors in a high dimensional setting, allowing for weakly dependent and heterogeneous (possibly non-stationary) data. The number of covariates to be screened may be large $p$ $>>$ $n$, and growing at an exponential rate, provided $\ln (p)$ $=$ $o(n^{a})$ for some $a$ $>$ $0$ that depends on memory decay and the growth of higher moments. We study the problem of correlation screening in a high dimensional marginal regression setting, assuming so-called \textit{physical dependence} in a time series setting. We entirely sidestep covariance matrix estimation and adaptive re-sampling by working with a max-statistic over the many computed parameters. Thus we do not need endogenous selection of the most relevant predictor index yielding non-uniform asymptotics, nor do we need a post-estimation Bonferroni correction. The sequence of non-standard approximating distributions arising from the maximum of an increasing number of estimators is easily approximated by a multiplier (wild) block bootstrap. The max-test controls for size well, performs well against various deviations from the null, including very slight deviations with a weak or sparse signal. A numerical experiment is performed and an empirical example with the VIX volatility index is provided.

fields
Statistics Theory
pdf ↗ page arXiv:2604.27813 ↗

Behavioral system theory and reinforcement learning (RL) have independently developed data-driven approaches to the continuous-time LQR problem, yet their respective methods have largely evolved in separation. We connect these two adjacent lines of work by studying their data-driven parameterizations, namely a closed-loop (CL) parameterization from behavioral system theory and an integral RL (IRL) parameterization. The CL parameterization characterizes the closed-loop system via a matrix that satisfies equality constraints. While this parameterization has been extensively studied for discrete-time systems, we adapt key results to the continuous-time setting and develop a policy iteration (PI) scheme, derive an algebraic Riccati equation, and introduce an alternative convex program. The IRL parameterization utilizes off-policy data to perform policy evaluation, which is used for PI or value iteration. Within the IRL framework, we derive a policy gradient flow and propose convex programs for the LQR problem. Finally, we provide a unified treatment of these parameterizations that enables a systematic understanding of existing approaches, and clarifies their structural relationships.

comments
Submitted to IEEE TAC
fields
Optimization and Control
pdf ↗ page arXiv:2604.27922 ↗

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

comments
18 pages
fields
Information Theory
pdf ↗ page arXiv:2605.00020 ↗

Ensemble control specifies probability laws on admissible trajectories, including their temporal dependence. Starting from an arbitrary closed behavior, we organize its laws into a framework that connects standard probability-measure geometry, occupation-measure control, and data-driven trajectory parametrization. Classical convexity and extreme-point properties describe the feasible laws, while classical Bellman duality governs additive control objectives. On compact state and input spaces, full-path constrained duality for continuous trajectory functions gives primal attainment and zero gap whenever feasible. For controllable linear time-invariant systems, the noise-free Fundamental Lemma yields an equivalent law-level Hankel factorization, with a canonical pseudoinverse lift. The factorization transfers trajectory-law constraints exactly to coefficient space and connects them to covariance control. Explicit noisy-Hankel bounds quantify subspace approximation for second-moment-bounded laws under known rank and Gaussian output measurement noise. Numerical studies include a nonlinear reset problem whose nonadjacent correlation constraint requires temporal memory, covariance-constrained optimization, and noisy-data policy evaluation. Known transition kernels provide a further structural perspective through history-conditional consistency.

comments
44 pages, 4 figures. Single-column manuscript
fields
Optimization and Control
pdf ↗ page arXiv:2605.01558 ↗

We give a complete classification of Cayley graphs over dihedral groups that exhibit perfect state transfer between distinct vertex states in Grover walks. For $n\ge 3$, let $D_n:=\langle a,b : a^n=b^2=1,\ bab=a^{-1}\rangle$ be the dihedral group of order $2n$, and let $S\subseteq D_n\setminus\{1\}$ satisfying $S=S^{-1}$ and $\langle S\rangle =D_n$. We show that the Cayley graph $\mathrm{Cay}(D_n,S)$ exhibits perfect state transfer if and only if $(D_n,S)$ is equivalent to one of the following pairs: $(D_n,\{b,ba\})$; $(D_n,\{a,a^{-1},ba,ba^{-1}\})$, where $4$ does not divide $n$; or $(D_{2m},\{b,ba^{m},ba,ba^{m+1}\})$, where $m$ is odd. Our proof combines the representation theory of $D_n$ with tools from algebraic number theory.

fields
Combinatorics
pdf ↗ page arXiv:2605.02254 ↗

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 bias

fields
Algebraic Topology
pdf ↗ page arXiv:2605.06467 ↗

Mode separation, namely how sharply a distribution fragments into barrier-separated clusters, is a fundamental geometric property of densities, difficult to quantify in high dimensions. Modes are often the meaningful alternatives in the data, such as the conformations of a molecule or the distinct semantic types among a generative model's outputs. Mode separation is distinct from dispersion, which is what standard label-free tools capture: differential entropy rises with spread regardless of fragmentation, and PCA orders directions by variance regardless of barriers. Mutual information does capture it, but only given the latent component labels, which are usually unavailable. We measure mode separation through a single stochastic process intrinsic to the density, namely the unique reversible diffusion with $f$ as its stationary distribution and a constant scalar diffusion coefficient. From its autocovariance matrix we extract two readouts. The first, SSA (Sum of Squared Autocorrelations), is a scalar barrier-sensitive measure. The second, DA (Dominant Autocorrelation directions), gives linear projections ordered by metastability rather than variance. Under an isotropic-Gaussian null, we derive the limiting spectrum of the empirical autocovariance in closed form, generalizing the Marchenko–Pastur law. Its upper edge gives a noise floor that separates metastable directions from sampling noise. Both readouts use only samples and a score function, scaling to high dimensions through pretrained score-based generative models via Tweedie's identity. We apply our framework to three settings: (i) synthetic Gaussian mixtures, where SSA tracks mutual information; (ii) SDXL text-to-image generations, where SSA and DA capture structure that entropy and PCA miss; and (iii) molecular dynamics of alanine dipeptide, where DA recovers the known slow backbone dihedrals from static samples alone.

fields
Probability
pdf ↗ page arXiv:2605.08777 ↗

Self-distillation has emerged as a promising technique for improving model performance in modern machine learning systems. We develop the statistical foundations of self-distillation in high-dimensional linear regression by introducing and analyzing a broad class of estimators, namely spectral shrinkage estimators. We consider both spiked and general covariance matrices. For the former, we establish that when the covariance has $s$ distinct spikes, $s$-step self-distillation achieves optimal prediction among spectral shrinkage estimators, outperforming well-known estimators in statistics and machine learning. Moreover, we show that $s$ steps are necessary for optimality: any $(s-k)$-step distilled estimator is strictly suboptimal for $1 \leq k \leq s$. For general covariance matrices, we show that self-distillation approaches the optimal limiting prediction risk among continuous spectral shrinkage estimators as the number of distillation steps increases. We further develop a generalized cross-validation procedure for selecting the distillation parameters from data and establish an asymptotic oracle guarantee for the resulting estimator. We also study a federated approach where multiple data centers share spectral shrinkage estimators and a common server seeks to aggregate them to achieve optimal performance. In this case, we find that the best local rule again takes the form of self-distillation, though it differs from the optimal rule when data are hosted centrally on a single server. Together, our results explain why self-distillation improves predictive performance and provide a broader statistical framework that connects it to classical shrinkage-based methods.

comments
124 pages, 8 figures
fields
Statistics Theory
pdf ↗ page arXiv:2605.17778 ↗

Achieving a socially desirable operating point for a multimodal transportation system is challenging when Autonomous Mobility-on-Demand (AMoD) and Public Transit (PT) operators pursue selfish objectives alongside endogenous passenger choices. Existing equilibrium-based regulation models typically search over municipal policies to predict the induced operator equilibrium, creating strong behavioral assumptions, equilibrium-selection issues, and difficult bilevel optimization problems. This paper proposes an implementation-based alternative. Rather than asking which municipal action induces the best equilibrium, we ask: given a target operating profile, what minimum realized transfer makes unilateral deviation unattractive for each operator? Using k-implementation theory, this payment decomposes into two unilateral deviation gains: one for the AMoD operator and one for PT. Calculating this payment requires computing three distinct objects: the social target, the AMoD best response, and the PT best response. This is nontrivial because each represents a large-scale network optimization problem complicated by endogenous mode choice and congestion. To address this, we develop tailored mathematical formulations and algorithms for each oracle. For the social target, we derive a decomposition and entropy-regularized mixed-integer convex formulation balancing social optimality and implementability. For the AMoD oracle, we derive an exact reformulation, a convex relaxation providing a global upper bound, and a sequential convex approximation for feasible lower bounds. For the PT oracle, we develop a mixed-integer convex relaxation and characterize its exactness condition. A NYC case study shows the framework computes tight implementation-payment bounds and reveals how the dominant source of incentive misalignment shifts with congestion.

fields
Optimization and Control
pdf ↗ page arXiv:2605.18687 ↗

Neural operators have achieved strong performance in learning solution operators of partial differential equations (PDEs), but their inherently continuous representations struggle to capture discontinuities and sharp transitions. Existing approaches typically approximate such features within continuous function spaces, often requiring increased model capacity and high-resolution data. In this work, we propose Cut-DeepONet, a two-stage training framework that explicitly models discontinuities while reducing learning complexity. Our approach reformulates the problem via a lifting strategy, partitioning the domain into smooth subregions while representing discontinuities as boundaries in a higher-dimensional space. This separation aligns the operator learning task with the inductive bias of neural networks and avoids directly approximating discontinuities. An additional network predicts input-dependent discontinuity locations for unseen inputs, which are then used to guide the neural operator in generating smooth components within each region. Experiments on benchmark PDEs show that Cut-DeepONet outperforms state-of-the-art methods, even when trained on low-resolution datasets. The method excels on problems with discontinuities and sharp transitions, while using fewer trainable parameters. Our results highlight the benefits of changing the representation of operator learning rather than increasing model complexity.

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

Let $K$ be a totally real field of odd degree $m$ in which $2$ is inert. Let $l\geq5$ be a prime totally ramified in $K$ with $\gcd(m,l(l-1)/2)=1$ and $2^{l-1}\not\equiv1\pmod{l^2}$. We prove the asymptotic Fermat's Last Theorem over every layer $K_{n,l}$, $n\geq1$, of the cyclotomic $\mathbb{Z}_l$-extension of $K$. Using $S$-unit bounds, we also give criteria for the generalized Fermat equation $Ax^p+By^p=Cz^p$ to have no asymptotic solutions in $K_{n,l}^3$ when the coefficients $A,B,C$ are supported at the primes above $2$ or $2d$, with $d$ an odd prime. In particular, for every fixed integer $r\geq2$ other than $4$, the equation $x^p+y^p=2^rz^p$ has no asymptotic solutions in $K_{n,l}^3$ for each fixed $n\geq1$. Thorne's modularity theorem makes the resulting bounds effective in each layer $\mathbb{Q}_{n,l}$ to which our criteria apply.

comments
10 pages. Revised and expanded version; includes further generalized Fermat results for coefficients supported above $2d$ and examples in cyclotomic layers
fields
Number Theory
pdf ↗ page arXiv:2605.20860 ↗

Evaluating large language models increasingly relies on LLM-as-a-judge protocols, but such evaluations remain costly: different judges have different prices and reliabilities, and the difficulty of each prompt-response pair can vary substantially. This raises a basic allocation question: under a fixed budget, how should one distribute evaluation queries across heterogeneous judges and instances to obtain the most accurate score estimates? We formalize this question as budgeted heteroskedastic multi-judge estimation under independent, unbiased score observations. Given $K$ prompt-response pairs and $J$ judges with known costs but unknown query-judge variances, our goal is to estimate the bounded score vector while minimizing an $\ell_p$-error. Our first contribution is to analyze the inverse-variance weighted estimator (IVWE) and to derive the oracle allocation that minimizes its leading error bound. Since this allocation depends on the unknown variances, we then address the unknown-variance setting by proposing EST-IVWE, an adaptive algorithm that constructs and uses optimistic variance estimates to stabilize the empirical allocation. We prove that EST-IVWE matches the oracle IVWE rate up to lower-order terms in the budget. Our second and central theoretical contribution is a local minimax lower bound matching the leading allocation-dependent rate, establishing asymptotic instance-optimality up to logarithmic factors. An Assouad-type construction based on local, variance-preserving perturbations yields this bound both in expectation and with constant probability. A complementary Fano-type change-of-measure argument captures the logarithmic dependence on the confidence level with a different (suboptimal) allocation geometry. Finally, we numerically validate our approach on synthetic data and resampled HelpSteer2 evaluations, demonstrating improvements over naïve uniform allocation.

comments
55 pages, 4 figures; the first two authors contributed equally
fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2605.23362 ↗

We address observation noise misspecification in Bayesian filtering of dynamical systems via generalised Bayesian inference. Mismatch in tail decay between the true data generating process and an assumed observation model, often indicated via outliers, can strongly impact Bayesian updates in Kalman filters and their ensemble approximations. Adjusting information processing in the analysis step by employing diffusion score matching achieves robustness while maintaining closed-form Gaussian updates and good uncertainty quantification. We provide theoretical properties of this novel Kalman filter in linear Gaussian state space systems covering conjugacy of the analysis step, robustness, covariance stability, and tuning. We extend the approach to non-linear signal dynamics by adapting ensemble Kalman filter variants. Simulation studies on 2D target tracking and the Lorenz-63 and 40D Lorenz-96 systems highlight a critical trade-off between robustness and stability in filtering.

fields
Statistics Theory, Dynamical Systems
pdf ↗ page arXiv:2605.26881 ↗

We prove a lower bound on the Weil height, the so-called Bogomolov property, for the algebraic extensions of $\mathbb Q$ cut out by the adelic Galois representations attached to certain eigenforms whose local component at a prime $p$ is supercuspidal. To this end, we give a method for constructing metric inequalities over $p$-adic Lie extensions of fields over $\mathbb Q$ that are finitely ramified at $p$.

comments
26 pages. The Examples section has been reorganized. The "strong" Bogomolov property has been renamed to "stable" to avoid conflicts with the existing literature
fields
Number Theory
pdf ↗ page arXiv:2605.31403 ↗

We identify two constructions from different mathematical traditions. In linear logic and realisability, logical types are generated rather than fixed in advance: one begins with a universe of realisers equipped with execution, uses orthogonality to test their interactions, and takes types to be the biorthogonally closed subsets. In enriched Isbell duality, a quantitative relation induces an adjunction whose fixed points form a category, its nucleus. These constructions proceed by different means; we show that, in the present setting, they produce the same objects. The shared datum is minimal: an associative product, called execution, and a real-valued measurement, with no compatibility assumed between them. The failure of the measurement to be additive is at once the relation defining orthogonality and the quantitative relation whose Isbell nucleus we form, and the types cut out by orthogonality are exactly the fixed points of the associated adjunction. The identification pays off in both directions. The most natural product of types fails to be associative; repairing this failure forces a different notion of type, sensitive to both sides of a composite, on which the induced product is associative and, when execution has units, carries two residuals. What emerges is a noncommutative Lambek calculus, derived directly from execution and orthogonality rather than imposed. In the reverse direction, each such type, read on the categorical side, generates a quantitative relation of its own, and with it a derived adjunction and a further generation of types; these derived types are again types of the original situation, computed by the residuals of the Lambek calculus. We also prove a coherence theorem for the threefold arrangements of this construction and, in the finite-dimensional case, give explicit formulas for the product.

fields
Category Theory, Logic
pdf ↗ page arXiv:2606.03369 ↗

We study finite expected-signature information for mixed-fBm paths with Hurst indices above $1/4$. Up to level three, the only parameter-dependent expected features are the variance transform $q_θ$ and the time-ordered transform $R_θ$. We prove the scale tradeoff $2K$ level-two scales versus $K$ selected level-two/three scales, together with separation and local inverse bounds.

comments
There are some mistakes and the theory is not useful in practice
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2606.09121 ↗

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2606.11987 ↗

We study prophet inequalities for $n$ i.i.d. base rewards subject to multiplicative discounts across $S$ phases. For equal-length phases and a common discount factor $\widetildeγ$, we characterize the optimal competitive ratio of single-quantile policies as $n\to\infty$ with $S$ and $\widetildeγ$ fixed. The resulting sharp guarantee describes the dependence on the phase parameters: it recovers $1-1/e$ without discounting and approaches $1/2$ in the worst-case regime. We also establish a distribution-free comparison that bounds the discounted prophet by a fractional i.i.d. maximum with effective horizon $B$, the sum of the discount weights across all observations. The comparison yields acceptance probability $1/B$, determined only by the phase profile. This calibration attains the canonical optimum even among single-quantile policies that may choose their acceptance probability using the known base distribution. The comparison also gives guarantees for heterogeneous discounts and unequal phase lengths. A complementary optimal-stopping upper bound establishes the same limiting optimum of $1/2$ for arbitrary stopping rules in the canonical model. Finally, the same effective-horizon calibration sets acceptance probability $1-\widetildeγ$ under infinite-horizon geometric discounting. This explicit quantile rule attains Boshuizen's (1994) known optimal worst-case ratio $1/(1+\widetildeγ)$ without solving a Bellman equation.

fields
Optimization and Control
pdf ↗ page arXiv:2606.30118 ↗

We describe the Poisson bracket of a Lagrangian field theory expressed in the framework of $L_\infty$ algebras. If the symplectic structure on phase space is defined following recent work, we show that the Poisson bracket can be computed with the Peierls formula, confirming the well-known result of the covariant phase space formalism. Of particular interest is the Poisson bracket in nonlocal theories. In $p$-adic string theory we find that a straightforward construction of the Poisson bracket is obstructed by higher derivative instabilities. We also discuss the inverse relation between the Poisson bracket and symplectic structure in the language of homological algebra, extending some ideas in the mathematical physics literature.

comments
27 pages, 3 figures; v2: minor improvements; v3: journal version
journal
JHEP11(2026)049
fields
Mathematical Physics
pdf ↗ page arXiv:2606.30630 ↗

We present a theory of decaying turbulence in which the statistics of a classical flow becomes quantum mechanics in loop space. The loop functional, the average of $e^{\mathrm{i}Γ/ν}$ for the circulation $Γ$ around a loop, is the wave function, and the Navier-Stokes equation becomes the linear loop equation. An exact operator identity represents the functional as the loop-ordered exponential of the covariant derivative $\partial+\mathrm{i}v/ν$, with the loop parameter as time and viscosity as Planck's constant. The turbulent state is the equal-weight density matrix on a decaying trajectory, a quantum form of the ergodic hypothesis. As in quantum field theory, turbulence at infinite Reynolds number is defined by regularization and renormalization; the loop equation regularized on $N$-sided polygons has an exact manifold of decaying solutions, the Euler ensemble, labeled by rational angles and spins. As a fermionic trace, its partition function and conditional vorticity correlations become, in the local limit, Gibbs averages of two Mathieu quantum pendulums, an integrable system. The energy spectrum, given by explicit quadratures, falls as $k^{-1}\log(1/kL)$ at small $k$ and as $k^{-7/2}$ at large $k$, with $L=\sqrt{\tildeν(t+t_0)}$ and turbulent viscosity $\tildeν$. At $kL=\sqrt2$ its slope diverges as a double logarithm: the decay at fixed $k$ is singular at a finite time, and the vorticity correlation oscillates with period $\sqrt2\,πL$. The reduction to the pendulums, with the continuum and grand canonical limits at every nonzero separation, is formally verified in Lean 4 in forthcoming work by Y. Jiang, A. Migdal et al. The theory rests on stated physical hypotheses, as statistical mechanics rests on the Gibbs distribution; its comparison with simulations and experiment is so far qualitative.

comments
48 pages, 4 figures, radically revised paper, after exact solution in continuum limit was discovered, verified and investigated, with redefined vorticity correlation as conditional probability. The reeduction of the Euler ensemble to the quantum pendulum is rigorously proven in forthcoming paper with Google Reesearch, using Lean 4 language
fields
Number Theory
pdf ↗ page arXiv:2607.05745 ↗

We study binary classification when the two classes are elliptical with a shared radial generator $g$. The log-likelihood ratio is then an additive function of the two squared Mahalanobis radii, with radial link $\varphi=\log g$. For Gaussian classes $\varphi$ is affine and the rule reduces to quadratic discriminant analysis (QDA); otherwise the Bayes link is not the identity. Instead of fitting this link with a spline smoother, we derive its family from the within-class law of the radius and estimate a finite fractional-power projection. We prove that the link is identifiable from the radius law, that the plug-in estimator is $\sqrt{n}$-consistent and asymptotically normal under finite-moment conditions, and that the induced classifier is asymptotically Bayes-optimal in an iterated sieve limit. For $d\ge2$ and non-nested class parameters, the identity link suffices only for affine (Gaussian) generators. The bridge, GAM membership and the affine direction of this dichotomy are verified in Lean 4. We compare against the global Mahalanobis-GAM of Ghosh et al. (2025), re-implemented with mgcv REML splines at equal input budget. On two UCI benchmarks the derived link ties with the fitted GAM. On six financial series from three asset classes, with validation that respects temporal dependence, it is never significantly worse than the fitted GAM: better on CAD/USD and tied on the other five. It beats QDA on the three heaviest-tailed series (oil $[+0.023,+0.069]$, S&P 500 $[+0.039,+0.125]$, JPY/USD $[+0.009,+0.047]$) and ties elsewhere. A rate simulation with a closed-form ground truth reproduces the $\sqrt{n}$ rate and, under covariance heterogeneity, QDA's risk floor against the derived link's vanishing excess risk. The derived link thus matches a tuned GAM without smoothing-parameter selection and improves on QDA where the generator departs from the Gaussian.

comments
23 pages, 2 figures. v2: revised theory (CLT first-stage assumptions and two-step Jacobian, sieve theorem on class mixture, QDA risk-floor corollary, identity-link dichotomy proof for d>=2); abstract corrected to match tables; literature added; Lean list and reproducibility map in appendices. Code: https://github.com/SZabolotnii/DSGE-MV_Elliptical_LLR-code-supplement
fields
Statistics Theory
pdf ↗ page arXiv:2607.06089 ↗

In \cite{HH}, H. Huang-X.Huang introduced the generalized Reifenberg condition which describes the non-increasing property of numbers of almost Euclidean factors of geodesic balls and gave a transformation theorem under this condition. In this note, we study how almost Euclidean factors of concentric geodesic balls interact with harmonic splitting maps under a lower Ricci curvature bound and prove a dimension gap for harmonic functions of almost linear growth and then derive a transformation theorem under a non-decreasing property compared with the non-increasing property above. We also construct complete manifolds with nonnegative Ricci curvature whose balls are uniformly almost $1$-Euclidean at every scale, but for which no single harmonic function can be transformed into a splitting function at all smaller scales which give a negative answer to the existence question for all-scale splitting functions in \cite{HH}.

comments
Drop the results about fundamental groups for giving no new examples than Huang's results {Finite generation of fundamental groups for manifolds with nonnegative Ricci curvature whose universal cover is almost k-polar at infinite}. Fix some errors in the old version
fields
Differential Geometry
pdf ↗ page arXiv:2607.06277 ↗

This article revisits earlier work by the last author together with Kay Magaard. We correct mistakes in results about the Sylow 2- and 3-structure of groups that act with fixity 3 and one result about possible components, we improve some results and we add details.

comments
This is the revision that we produced along a referee's comments
fields
Group Theory
pdf ↗ page arXiv:2607.10710 ↗

Universes are central to dependent type theory, and they are notoriously difficult to handle in a way that is both correct and usable. We propose a new "fuss-free" generalised algebraic presentation for polymorphic cumulative universes that dispenses with the intricate theory of coherent universe coercions in favour of a simpler formulation, which we prove equivalent by means of a normalisation theorem for the former. We study the fuss-free formulation by means of (1) an abstract specification of its bidirectional elaboration algorithm, and (2) a concrete implementation in Haskell. We also describe and implement an extension of the fuss-free universe hierarchy with a judgemental notion of datatype description from which prior notions of cumulative inductive type may be derived.

comments
Extended version of a paper to appear in POPL 2027
fields
Logic
pdf ↗ page arXiv:2607.11329 ↗

In 2017, Keith defined and studied a multi-restricted partition function $RD^{l,t}(n)$, the number of integer partitions of n into parts that are simultaneously $l$-regular and $t$-distinct if none of the parts is divisible by $l$ and parts appear fewer than $t$ times. Thereafter, in a series of papers Buragohain et al. and Nadji et al. examined combinatorial and arithmetic properties of $RD^{l,t}(n)$. In this article, we focus on simultaneously $l$-regular and $t$-distinct partitions in 3-colors, $RD^{l,t}_3(n)$ and establish infinite families of congruences modulo powers of 3 for specific values of $(l,t)$. For instance, for positive integers $n$ and $k$, we have \begin{align*} \sum_{n=0}^{\infty}RD_3^{3,3}\left(3^kn+\frac{3^k+1}{2}\right)q^n\equiv0 \pmod{3^{k+1}}. \end{align*} Our approach involves Hirschhorn's H operator technique.

fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2607.11499 ↗

We study finite spin-$\tfrac12$ rings with nearest-neighbor Heisenberg exchange, Dzyaloshinsky-Moriya interaction, and an external magnetic field. We introduce a phenomenological interpolation parameter between the fully quantum Hamiltonian and a state-dependent mean-field description. Using dissipative Gisin-Schrödinger dynamics, we analyze the resulting quantum-classical crossover through local magnetization, connected spin correlations, single-site entropy, and the saturation field of the fully polarized state.

comments
22 pages, 4 figures. v2: additional references, clarification of the mean-field normalization and Lyapunov structure. v3: revised and extended version with expanded numerical and analytical checks
fields
Mathematical Physics
pdf ↗ page arXiv:2607.13572 ↗

The main theme of this paper is to study symplectic (un-)knottedness of Lagrangian submanifolds which are not tori. Our construction of such Lagrangians is inspired by the generalized Polterovich Lagrangians of Oakley–Usher and relies on an adaptation of symplectic reduction methods going back to Chekanov–Schlenk and McDuff's probes to the case of non-abelian group actions. We compare Oakley–Usher Lagrangians to their (un-)knotted cousins to find that, depending on the situation, they are: (1) not diffeomorphic, (2) diffeomorphic, but not Lagrangian isotopic, (3) Lagrangian isotopic, but not Hamiltonian isotopic, (4) Hamiltonian isotopic. This relationship between them frequently changes when the ambient space is compactified by a symplectic cut. In the companion paper "Lagrangian tori in the three-dimensional quadric and mirror symmetry", we focus on monotone tori in the three-dimensional quadric and compute their enumerative invariants and study their relationship to mirror symmetry.

comments
31 pages, 3 figures, major edits; the previous version was split into two separate papers. The second one "Lagrangian tori in the three-dimensional quadric and mirror symmetry" will be posted as a separate arxiv submission
fields
Symplectic Geometry
pdf ↗ page arXiv:2607.15136 ↗

We study higher moments of the divisor function evaluated at polynomial expressions in the Fourier coefficients of a non-CM newform. The logarithmic exponent appearing in our estimates depends only on the number of irreducible factors of the polynomial and remains unchanged under a Sato–Tate restriction. The proof combines an effective Chebotarev theorem, or an effective Chebotarev–Sato–Tate theorem, with the arithmetic of joint cycle types and a mean value estimation for multivariable multiplicative functions with Frobenian support.

comments
27 pages
fields
Number Theory
pdf ↗ page arXiv:2607.18832 ↗

We study the canonical skew-binary representation of nonnegative integers, whose positional weights are the Mersenne numbers \(2^{k}-1\), and its decomposition into the binary and nonbinary sides. The nonbinary values, arranged in increasing order, form the OEIS sequence A055938, and their successor structure gives a direct proof of the relation with the OEIS sequence A080578 that is recorded as conjectural in the OEIS entry for A080578. The resulting formulas show that the Conolly sequence describes both sides of the decomposition: a shifted Conolly sequence is the counting function of the binary side, while the same sequence gives the increasing enumeration of the nonbinary side. We then develop the parent map, truncation blocks, truncation remainders, and the Mersenne tau function associated with this representation. The parent map is conjugate to deletion of the lowest digit. Differences of the Mersenne tau rows recover the parent iterates and the counting function, and they give formulas for digit reconstruction and for a diagonal tau defect. Finally, we revisit a known finite-depth one-soliton family of the finite-field BBS. The Mersenne combinatorics is used directly to reconstruct a global integer-valued traveling-wave profile and to prove an integer window-counting theorem. Reduction modulo \(3\) yields the corresponding finite-field traveling-wave solutions. We also construct an integer-valued traveling-wave tau function whose front values are given by the Mersenne tau rows. The resulting construction shows how the combinatorics of a number representation can enter directly into the reconstruction of solutions of an integrable system.

comments
Expanded historical context and references on canonical skew-binary representations; clarified proofs and notation; corrected the displayed ffBBS evolution equation. 36 pages, 2 figures, 1 table
journal
RIMS Kokyuroku Bessatsu B103 (2026), 67-112
fields
Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2607.22202 ↗

We prove that a contractible $3$-manifold admitting a complete Riemannian metric of nonnegative scalar curvature is diffeomorphic to $\R^3$. We also prove that, if the interior of a compact handlebody of genus $γ$ admits such a metric, then $γ\leq1$. This answers two open questions posed by Wang and Gromov, respectively.

comments
37 Pages
fields
Differential Geometry
pdf ↗ page arXiv:2607.25015 ↗

We will show that the twelve families of minimally representation-infinite incidence algebras are brick-continuous and admit a generic brick, which will be explicitly constructed. After that, reversing the reduction process between posets, we will show that any representation-infinite incidence algebra is brick-continuous and admits a generic brick, which can be explicitly computed using what will be called ''extension functors''. Lastly, a method to apply these results to a broader class of algebras is given.

comments
20 pages, no AI used, v2: added some acknowledgments
fields
Representation Theory
pdf ↗ page arXiv:2607.25443 ↗

We study contact surgery numbers for contact structures on the 3-torus. We show that all contact structures obtained via contact surgery along a Legendrian Borromean ring are overtwisted, and that this construction yields infinitely many pairwise non-contactomorphic contact structures on $\mathbb{T}^3$. We prove an obstruction on the maximal Thurston-Bennequin invariant of 3-component links to produce $\mathbb{T}^3$ by Dehn surgery. We also compare Legendrian surgery presentations of the Stein-fillable contact structure on $\mathbb{T}^3$. In this setting, we exhibit a non-destabilizable Legendrian knot with no graded normal ruling whose associated Stein filling has nonzero full symplectic homology.

comments
22 Pages, 3 figures, 1 Table. Comments are welcome
fields
Symplectic Geometry, Geometric Topology
pdf ↗ page arXiv:2607.25772 ↗

We study the oracle complexity of finding $ε$-stationary points of $ρ$-weakly convex and $G$-Lipschitz functions, where stationarity is measured by the gradient of the Moreau envelope. We consider an exact first-order oracle that returns both the function value and the full subdifferential at every query point. In the principal parameter regime, we prove that every first-order algorithm, including randomized algorithms, requires $Ω(\tfrac{ρG^2Δ}{ε^4})$ oracle queries to succeed with any fixed positive probability, where $f(0)-\inf f\leΔ$. This lower bound matches the best known deterministic and stochastic first-order upper bounds, up to universal constants, and establishes the optimal randomized first-order oracle complexity. The result separates smooth nonconvex and weakly convex optimization: the additional $ε^{-2}$ factor is intrinsic to nonsmooth geometry rather than stochastic oracle noise.

comments
28 pages, 1 figure. This version extends the lower bound to randomized first-order algorithms and a substantially broader initial-gap regime, with revised proofs and exposition
fields
Optimization and Control
pdf ↗ page arXiv:2608.03246 ↗

A classical problem in convex and discrete geometry asks for the convex polyhedron of greatest volume whose vertices are chosen from the unit sphere $\mathbb{S}^2$. For a prescribed number $N$ of vertices, the problem is known only in a small number of cases, namely $4\leq N\leq 8$ and $N=12$. In the case $N=9$, Wimmer showed in his Ph.D. thesis that the volume maximizer must be combinatorially equivalent to a triaugmented triangular prism. In this note, we complete the proof by determining the volume maximizer among all inscribed polytopes which are combinatorially equivalent to a triaugmented triangular prism. Consequently, every convex polyhedron with at most nine vertices on $\mathbb{S}^2$ has volume at most $3\sqrt{2\sqrt{3}-3}$, with equality, up to rotation, precisely for the ``symmetric'' triaugmented triangular prism whose vertex coordinates we compute exactly.

comments
18 pages, 2 figures, version 2
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2608.04392 ↗

The Samuelson condition, a classical area-ratio condition for planar Lagrangian $2$-webs, is equivalent in local web coordinates $(u,v)$ to $\partial_u\partial_v\log|J_F(u,v)|=0$, where $F$ is the inverse web-coordinate map and $J_F$ is its Jacobian. For the tangent-line family $L_t: y=tx+h(t)$, with $h$ smooth on an open interval, let $Ψ(u,v)$, for $u\neq v$, be the intersection map of $L_u$ and $L_v$, write $J_Ψ$ for its Jacobian, and set $S_h(u,v) := \partial_u\partial_v\log|J_Ψ(u,v)|$ where $J_Ψ(u,v)\neq0$. Near each diagonal point $(t_0,t_0)$ with $h''(t_0)\neq0$, the obstruction admits the decomposition $S_h(u,v) = \frac{1}{(v-u)^2} + R_h(u,v)$, where $R_h$ extends smoothly across the diagonal near $(t_0,t_0)$. The universal pole yields $S_h(u,v)>0$ off the diagonal in a sufficiently small neighborhood of $(t_0,t_0)$, so the tangent web does not satisfy the Samuelson condition there. We call $R_h(t,t)$ the Schwarzian residue and show that $R_h(t,t) = \frac{1}{2}\{σ,t\} = -κ_{\mathrm{aff}}(σ) \left(\frac{dσ}{dt}\right)^2$. Here $σ$ is the equi-affine arclength parameter of the envelope $γ(t)=(-h'(t),h(t)-t h'(t))$, and $\{σ,t\}$ denotes the Schwarzian derivative of $σ$ with respect to $t$. The equi-affine curvature $κ_{\mathrm{aff}}$ is defined by $γ_{σσσ}+κ_{\mathrm{aff}}γ_σ=0$. We also derive the transformation law of the residue under reparametrization of the tangent-line family.

comments
Revised text and discussion of previous work
fields
Differential Geometry
pdf ↗ page arXiv:2608.09825 ↗

Varkonyi and Domokos proved that homogeneous convex bodies with any prescribed numbers $S\ge1$ of stable and $U\ge1$ of unstable static equilibria exist, the case $S=U=1$ being the mono-monostatic Gomboc. We give a complete constructive answer for the simplest nondegenerate shapes: a homogeneous body whose boundary is the unit sphere perturbed radially by a single real spherical harmonic $Y_\ell^m$ of degree $\ell\ge2$ and order $1\le m\le\ell$ has exactly $S=U=m(\ell-m+1)$ stable and unstable equilibria, for every amplitude in the convex range when $m\ge2$, and for small amplitude when $m=1$. The reduction to the critical points of the perturbing harmonic is an identity when $m\ge2$: the symmetry of a single tesseral harmonic pins the centroid at the origin exactly, so the centroid-to-surface distance is a strictly increasing function of the harmonic. We count the critical points of $Y_\ell^m$ from its separable structure and verify the Poincare-Hopf balance in index form. Three consequences follow. (i) A single harmonic populates only the diagonal $S=U$ of the equilibrium-class lattice; no single harmonic of degree $\ge2$ is mono-monostatic. (ii) Any centrally symmetric (even-degree) perturbation has even $S$ and $U$ and cannot be mono-monostatic, a parity obstruction. (iii) Mono-monostaticity is therefore intrinsically multi-harmonic. A predict-then-confirm numerical study on eight single-harmonic bodies matches the formula exactly. For the multi-harmonic regime we give a certified equilibrium counter (interval arithmetic with Krawczyk uniqueness and Hessian classification) that, given the centroid, provably neither under- nor over-counts. It certifies that a member of a known analytic family, at an amplitude of our own choosing inside the strictly convex sub-regime, is mono-monostatic. For that body the centroid is exactly the origin, so its certificate is unconditional.

comments
12 pages. v2 (hardened): situates the results in the octupolar and geopotential literature (Kuznetsov-Kholshevnikov 1992 parity), narrows claims, proves that the flagship body's centroid is exactly the origin, and notes the certified counts equal equilibrium counts only for strictly convex bodies. Companion to arXiv:2604.17120 and arXiv:2604.17095
fields
General Mathematics
pdf ↗ page arXiv:2608.11213 ↗

It is shown that, if an event $A$ has the same conditional probability in each trial in an infinite sequence of Bernoulli trials, then $A$ is independent of each trial. More general results are actually established.

comments
Version 1: 5 pages. To appear in The American Mathematical Monthly. Version 2: Added a counterexample due to Qiyuan Gu. Version 3: Minor style improvements in the appendix. Version 4: Added a counterexample due to ChatGPT. Minor improvements in presentation
fields
Probability
pdf ↗ page arXiv:2608.13559 ↗

Pavez-Signé [Combin. Probab. Comput. 33 (2024), 121–128] conjectured a Dirac-type condition for spanning $H$-subdivisions and asked whether the subdivision paths can additionally be required to have similar lengths. Lee [European J. Combin. 124 (2025), 104059] resolved the existence conjecture in the stronger setting of digraphs. We answer the length-control question in this stronger directed setting: for every $\varepsilon>0$, there exists a constant $C_0>0$ such that, for every digraph $H$ with $h$ arcs and no isolated vertices, every $n$-vertex digraph $D$ with $n\ge C_0h$ and $δ^0(D)\ge(1/2+\varepsilon)n$ contains a spanning $H$-subdivision whose subdivision paths have lengths differing by at most one.

comments
7 pages
fields
Combinatorics
pdf ↗ page arXiv:2608.14432 ↗

We study spanning $H$-subdivisions in dense graphs where the length of every subdivision path is prescribed in advance. This problem is motivated in part by a question of Pavez-Signé [Combin. Probab. Comput. 33 (2024), 121–128], who asked whether the subdivision paths in a spanning $H$-subdivision can be required to have similar lengths. Let $h\ge3$ be an integer and let $0<β\llα\ll1/h$. We prove that, for all sufficiently large $n$, every $n$-vertex graph $G$ with $δ(G)\ge n/2+\lfloor h/3\rfloor$ has the following property. For every graph $H$ with $h$ edges and no isolated vertices, write $E(H)=\{e_1,\ldots,e_h\}$, and every choice of integers $\ell_1,\ldots,\ell_h\ge4$ satisfying $\sum_{i=1}^h\ell_i=n-|V(H)|+h$ and $\sum_{\ell_i<αn}\ell_i\leβn$, the graph $G$ contains a spanning $H$-subdivision in which the $i$th edge of $H$ is replaced by a path of length exactly $\ell_i$. We also give a family of examples showing that a linear additive term in $h$ is necessary in general.

comments
28 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2608.15786 ↗

For primes $n\equiv1\pmod{24}$, we study the depth of explicit, factorization-free searches for a decomposition of $4/n$ into three positive unit fractions. Let $E_2(N;J)$ be the set of such primes $n\le N$ for which no coprime pair $1\le u,a\le J$ admits a divisor $s\mid an+u$ with $s\equiv-1\pmod{4ua}$. For every fixed $J$, we prove $|E_2(N;J)|\ll_J N/(\log N)^{1+A(J)/2}$, where $A(J)$ counts the coprime pairs in $[1,J]^2$. The proof uses a fixed-point-free involution and identifies the exact dimension of the covering. We also establish a dual Type I divisor criterion and an unconditional obstruction: at the fixed shift $c=7$, both branches of the cofactor criterion fail for $\asymp N/(\log N)^{3/2}$ primes. At growing depth, an exact reciprocal-totient asymptotic with leading constant $9/(2π^2)$ improves the explicit large-sieve bounds to $O(N\exp(-0.0942(\log N)^{2/3}))$ at cutoff $p>J^5$, and to $O_\varepsilon(N\exp(-(0.1093-\varepsilon)(\log N)^{2/3}))$ at cutoff $p>J^{4+\varepsilon}$ for fixed sufficiently small $\varepsilon>0$. Finally, combining a truncated Type I pass with a sparse residual search yields a complete, factorization-free batch decision procedure for all primes in $[N,2N]$, using $O(N^2(\log N)^2\exp(-c_0(\log N)^{2/3}))=o(N^2)$ arithmetic operations for some $c_0>0$. The conjecture itself remains open.

comments
v2: Substantially revised and expanded. Added a dual Type I criterion, improved explicit sieve constants, and a subquadratic factorization-free batch algorithm. Proofs corrected and clarified
fields
Number Theory
pdf ↗ page arXiv:2608.24035 ↗

We study sequential prediction of binary marks whose log-odds are a linear function of all past inputs. The inputs are independent uniform signs. The coefficient of the input observed $j$ steps earlier is unknown, but its absolute value is at most a known number $r_j$, and $\sum_j r_j\le B$. A learner is judged by its expected cumulative log loss in excess of the loss of the true conditional probabilities. We show that for every such sequence $r$ and every horizon $T$, the minimax value of this regret lies between $c\,Γ_T(r)/\max\{1,B^2\}$ and $\frac12Γ_T(r)$, where $Γ_T(r)=\sum_{j\le T}\log(1+(T-j+1)r_j^2)$ and $c$ is an absolute constant. The term for lag $j$ combines the size bound $r_j$ with the number $T-j+1$ of rounds in which that lag influences a prediction, and no monotonicity or other regularity of $r$ is needed. The upper bound is attained by a Bayesian mixture with independent Gaussian priors. For the lower bound, we apply the van Trees inequality at each prediction step and then bound the expected log-determinant of the random matrix whose rows are the lagged input vectors. We also characterize when $\frac12$ is the exact leading constant: for envelopes with a common bound $B$, possibly changing with $T$, the regret is asymptotic to $\frac12Γ_T(r)$ if and only if $\sum_{j\le T}\min\{1,(T-j+1)r_j^2\}=o(Γ_T(r))$. This gives, for example, $\log^2(A^2T)/(8α)$ for $r_j=Ae^{-αj}$, whereas for $r_j=Aj^{-s}$ with $s>1$ the regret is of order $T^{1/(2s)}$ and its ratio to $Γ_T(r)$ stays below $\frac12$. Finally, for a known horizon, an online Newton predictor with features scaled by $r_j$ attains regret of order $Γ_T(r)$ with polynomial computation per round.

fields
Information Theory
pdf ↗ page arXiv:2608.26515 ↗

We prove that the reduced crossed product arising from an almost periodic action of an infinite countable discrete group on a unital, separable $C^*$-algebra is selfless whenever the crossed product is simple and monotracial and the group admits a topologically free extreme boundary action. We also give an alternative proof of a special case of a result of Gao, Junge, Kunnawalkam Elayavalli, Patchell, and Robert: the direct product of an exact $C^*$-simple group and a $C^*$-selfless group is $C^*$-selfless.

comments
20 pages; main theorem generalized and proof revised (v3)
fields
Operator Algebras
pdf ↗ page arXiv:2608.26987 ↗

We propose a dithered differential step-down thresholding (DSDT) algorithm for robust model order selection in stationary noise. Evaluating only exceedance counts over a decreasing threshold grid, the proposed algorithm stops when detecting noise extrema value clustering. We prove that deterministic threshold grids are inconsistent under lowered floor detection thresholds due to threshold grid misalignment error. We bound this error using randomized grid dithering. For arbitrary deterministic shifts, any joint noise distribution, and data-dependent thresholds, we obtain non-asymptotic bounds on the estimation risk and family-wise error rate, establishing DSDT as a universal false alarm suppressor for any single-threshold algorithm. When the scale sequence tends to zero or extremes cluster along the search grid, DSDT achieves asymptotic exact order recovery of separated deterministic components exceeding the noise maximum plus the grid step, even below the minimax threshold or without a detection threshold. Using multiple independent dithers reduces error bounds. We provide convergence and consistency analysis for an arbitrary number of dithers. This analysis establishes asymptotic bounds under extreme value laws and non-asymptotic bounds under nondecreasing hazard rates. The results extend to unseparated deterministic shifts, random shifts, unknown noise scales, and multi-dimensional search grids. We show that DSDT is robust to data quantization.

comments
major rev3
fields
Statistics Theory
pdf ↗ page arXiv:2608.29868 ↗

We study the convergence of multiple ergodic averages involving several commuting multiplicative actions. We prove that for finitely generated systems, the averages $$\frac{1}{N}\sum_{n=1}^N S_{1,n}F_1\cdot\ldots\cdot S_{\ell,n}F_\ell$$ converge in norm, settling a conjecture of Frantzikinakis. Our proofs feature tools from ergodic theory and probabilistic number theory. We exploit some stability properties of additive functions to establish a novel variant of \Katai's orthogonality criterion, which leads to box seminorm control for our averages. Using the theory of magic extensions introduced by Host and a delicate complexity reduction argument, we eventually reduce our problem to known convergence results.

comments
39 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2609.00405 ↗

We introduce the multiorbital bivariate chromatic polynomial F_Γ(G;x,y) = \sum_{H\leq G}\frac{1}{|H|}\sum_{h\in H}P_{Γ/h}(x,y), which aggregates the orbital bivariate chromatic polynomials associated with all subgroups of a finite group acting on a graph. We derive the equivalent element-wise representation F_Γ(G;x,y) = \sum_{g\in G}c_G(g)P_{Γ/g}(x,y), where c_G(g) = \sum_{\langle g\rangle\leq H\leq G}\frac{1}{|H|}. The coefficient function depends only on the cyclic subgroup generated by the element and is constant on conjugacy classes. This yields decompositions by cyclic subgroups and conjugacy classes and an interpretation in terms of the incidence algebra of the subgroup lattice. After normalization, the coefficients define a probability distribution obtained by choosing a subgroup uniformly and then an element uniformly from that subgroup. We also establish diagonal multiplicativity for disjoint unions and a weighted cycle-index expression for edgeless graphs. A further contribution concerns the distinguishing power of the orbital bivariate chromatic polynomial. We answer a question of Dohmen and Lange-Geisler affirmatively by exhibiting two non-isomorphic graphs, P_3 and K_2 \mathbin{\dot\cup} K_1 under C_2-actions, with identical orbital bivariate chromatic polynomials. The two actions nevertheless have different multiorbital bivariate chromatic polynomials. Thus the multiorbital polynomial is not determined by the orbital bivariate polynomial, whereas the converse question remains open.

comments
26 pages
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2609.01866 ↗

By refining the approach developed in \cite{AGH-2015, GS2026a}, we establish resolvent estimates in $L^p_σ(Ω)$ for the Stokes operator in a bounded Lipschitz domain $Ω$ in $\R^3$ for $(3/2)-\e< p\le \infty$, where $\e>0$ depends on $Ω$. As a consequence, the Stokes operator generates a uniformly bounded analytic semigroup in $L^p_σ(Ω)$. The range for $p$ is sharp. The results are particularly surprising, as it is long believed that the $L^p$ resolvent estimates in three-dimensional Lipschitz domains may fail for large $p$. In the appendices we prove an interpolation theorem between $L^2_σ(Ω)$ and $L^\infty_σ(Ω)$. We also show that for $1< p< \infty$ and a bounded Lipschitz domain $Ω$ in $\R^d, d\ge 2$, the resolvent estimate in $L^p(Ω; \C^d)$ can hold only if the Helmholtz projection is bounded on this space. This explains the counter-example constructed in \cite{Deuring-2001}. Finally, we prove that the resolvent estimate may fail in $L^p_σ(Ω)$ for $1< p< (3/2)$ and $d\ge 3$ as a consequence of failure of the Helmholtz decomposition of $L^p(Ω; \C^d)$.

comments
30 pages. Appendix C is added. It shows that the range $(3/2)-\e< p\le \infty$ is sharp for $d=3$ and the range $(4/3)-\e< p\le \infty$ is sharp for $d=2$. Comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.02552 ↗

We study vertex evaluation on the full space of continuously differentiable piecewise cubic polynomials on a fixed planar triangulation. A complete dual description turns failure of interpolation into balanced edge weights with nonzero vertex loading. It leads to exact counterexamples with 17, 25, 31 and 41 vertices, each with one relation and the classical lower-bound dimension. The 31- and 41-vertex examples have interior graphs that are trees. We give a geometric construction criterion for a sector-completion family and a certified implicit construction outside that family. With all boundary vertices fixed, the nearby bad configurations form a four-dimensional smooth locus in the 17-vertex case, two intersecting components of dimensions six and five in the 25-vertex case, and isolated transverse points in the two tree examples. A common Schur-complement estimate explains their different interpolation costs. We first realize arbitrary defect by decomposable chains of the 41-vertex example. We then construct obstructions from individually interpolatory blocks, prove that the capacity of one complete edge is exactly five, and build a fixed-square family with arbitrarily large strongly indecomposable defect. The latter excludes two triangle-disjoint connected normal bad submeshes even when those submeshes may have holes.

comments
38 pages, 10 figures. Substantially expanded and retitled version, including new counterexamples, geometric stability analysis, and strongly indecomposable constructions. Ancillary data and verification code included
fields
Numerical Analysis
pdf ↗ page arXiv:2609.06364 ↗

Water distribution networks (WDNs) are susceptible to various failures, including but not limited to human errors, cyber-attacks, and network modifications, necessitating the vulnerability analysis of WDNs. Graph-theoretic centrality measures—as a main class of centrality measures—aim to rank the network components solely based on their influence (i.e., criticality) on the WDN topology in the case of input changes, while overlooking the WDN dynamics. To overcome such a limitation, this paper uses a control-theoretic centrality measure to identify the network's most and least influential pipes in WDNs, by simultaneously incorporating the dynamics and topology of the WDN. First, given a WDN modeled by nonlinear differential-algebraic equations (NDAEs) consisting of transient flow dynamics as differential equation (DE) and conservation of water mass as algebraic equation (AE) and considering the pipe flow rates as states of the state-space (SS) representation, we extract a linearized system modeled by linear ordinary differential equations (LODEs) around the equilibrium (i.e., steady) flow rate vector. Second, treating pipe flow rates as SS nodes (states), we introduce a node centrality-based measure, namely \textit{vulnerability vector (VV)}, to rank the network pipes based on their influence on the dynamics and topology of the WDN in the case of input changes. In particular, the network's most and least influential pipes can be identified through such a centrality-based approach. This enables water engineers to understand the WDN's vulnerability better and effectively prioritize the maintenance and operational efforts on the most influential pipes within the WDN.

fields
Optimization and Control
pdf ↗ page arXiv:2609.10800 ↗

Gray, Payne, Swisher, and Watson conjectured that, for fixed integers $j \geq 0$ and $k \geq 2$, the number $FD_{j,k}(n)$ of partitions of perimeter $n$ having exactly $j$ part sizes of multiplicity at least $k$ is eventually at least the number $FO_{j,k}(n)$ having exactly $j$ distinct occurring part sizes divisible by $k$. We derive bivariate generating functions for both statistics using the profile-word encoding of a partition. For $k \geq 3$, coefficient extraction shows that fixing $j$ changes the order of the dominant pole but not its location. The corresponding dominant singularities are positive real numbers $ρ_k$ and $σ_k$, where $ρ_k$ satisfies $ρ_k+ρ_k^2+\cdots+ρ_k^k=1$ and $σ_k$ satisfies $σ_k^k=(1-σ_k)^{k-1}$. We prove that $ρ_k<σ_k$ for every $k \geq 3$. Consequently, $FD_{j,k}(n)/FO_{j,k}(n) \to \infty$ as $n \to \infty$, proving the conjecture and yielding a strict eventual inequality for $k \geq 3$. The case $k=2$ recovers the known exact identity.

comments
14 pages. v2: Expanded literature review and references, strengthened the coefficient-estimate lemma, and added a new conjecture on the linear-density crossover of fixed-perimeter Franklin statistics. Main theorem unchanged
fields
Combinatorics
pdf ↗ page arXiv:2609.12005 ↗

This work characterizes a Gaussian multiuser-channel capacity-region using receiver-subset message atoms, Gaussian single-user equivalents, and successive decoding. A memoryless multiuser-channel model specifies both the channel conditional distribution and the independent-use input distribution. For all linear Gaussian channels, independent Gaussian user signaling and receiver-local worst-case-noise/MMSE-GDFE transformations provide a single-user-equivalent basis for the complete capacity-region construction. Each user distributes its input autocorrelation among a finite set of receiver-subset atoms, whose rate sums satisfy the applicable receiver constraints. Minimum-energy and weighted-rate-sum designs optimize these allocations, while fixed-allocation linear programs determine feasible atomic rates and synchronized time-shared successive-decoding implementations. The resulting framework includes Gaussian multiple-access, broadcast, and interference channels, with numerical examples illustrating their rate regions and receiver designs.

comments
20 pages, 4 figures. Revised Gaussian specialization of the original preprint. Invited submission to IEEE Transactions on Communications
fields
Information Theory
pdf ↗ page arXiv:2609.17212 ↗

We study Kähler immersions of Ricci-flat metrics into finite- or infinite-dimensional complex projective space. Let $L^{\otimes k}\simeq K_X$ over a real-analytic Kähler manifold $X$. Let $φ$ be a base potential and $s$ the canonical squared fibre norm on $L^{\oplus k}$. Consider Ricci-flat potentials $φ+h(s)$ near the zero section, with $h$ independent of the base point. We prove that local projective inducibility forces the base to be Ricci-flat and the metric to split locally as $X\times\mathbb C^k$. In that case projective inducibility is equivalent to that of the base. The proof combines Calabi's criterion, positivity of the homogeneous fibre-degree blocks, and the singularities of the radial profile. A related obstruction along holomorphic curves excludes every positive multiple of the Taub–NUT metric and Calabi's hyperkähler metrics on $T^{*1,0}\mathbb{CP}^n$. Applications also include the resolved conifold, canonical-bundle metrics in non-Einstein classes, and Cifarelli's rank-two Type-2 metric.

comments
v2: expanded into a paper on projective rigidity of Ricci-flat Kahler metrics, with a new title; the v1 theorem is now Theorem 5.1, proved along a holomorphic curve. 17 pages, no figures
fields
Differential Geometry
pdf ↗ page arXiv:2609.21950 ↗

We study the proper geometric dimension of {\it full} mapping class groups of non-orientable surfaces with punctures. Building on the computation for closed non-orientable surfaces, we prove that the proper geometric dimension agrees with the virtual cohomological dimension in all but a finite collection of low-complexity cases, for which we obtain explicit bounds. Our results provide the non-orientable counterpart of the corresponding computations for mapping class groups of closed and punctured orientable surfaces.

comments
21 pages. Main results slightly improved, new appendix added, corrections made throughout the paper
fields
Geometric Topology
pdf ↗ page arXiv:2609.22505 ↗

We prove that learning an unknown mixed fermionic Gaussian state on $m$ modes to trace distance $ε$ requires $Ω(m^3/ε^2)$ copies when measurements act on one copy at a time, even with arbitrary POVMs, fresh ancillas and classical adaptivity, but without quantum memory between copies. The bound holds for $0<ε\le1/3600$ and separates this model from the known collective rate $Θ(m^2/ε^2)$. It follows from a uniform single-copy Fisher-information budget and a dimension-independent comparison between trace distance and Gaussian parameters. On covariance matrices of operator norm at most $1-c$, we prove a Frobenius-to-trace-norm continuity bound with constant $[2c(2-c)]^{-1/2}$; matchgate shadows then attain $O(m^3/(cε^2))$ copies. This also gives explicit error certificates for thermal free-fermion states. For a class of mixed passive bosonic Gaussian states with total mean photon number at most one, a reduction to bounded-block qudit tomography gives a single-copy lower bound $Ω(m^3/(ε^2\sqrt{\log(m/ε)}))$, versus collective complexity $Θ(m^2/ε^2)$. These separations answer the mixed-state measurement-resource question posed by Chen et al. A two-mode example has optimal two-copy Fisher trace $5$, versus the separable ceiling $4$. An IBM replication gave a pre-registered witness lower bound $4.12$ at one-sided $95\%$ shot-noise confidence; its interpretation assumes the prescribed preparations and a common measurement channel and does not bound preparation systematics.

comments
39 pages, 1 figure. v2: note added and references to the concurrent work arXiv:2609.26705 (Chen, Mele, Mele, Preskill), whose Lemma 1 makes Remark 9.6 unconditional, and to the follow-up arXiv:2611.07271; no change to results. Ancillary files: IBM pilot and replication data, circuits, and offline recount code
fields
Mathematical Physics
pdf ↗ page arXiv:2609.23189 ↗

All smooth local conservation laws, symmetries and adjoint symmetries of three-dimensional homogeneous incompressible Euler flow are classified in the primitive velocity–pressure variables. Explicit dependence on time and position and arbitrary finite orders of mixed time and spatial derivatives are allowed. Up to trivial currents, the conservation laws consist of incompressibility, linear and angular momentum, kinetic energy, helicity and generalised time-dependent momentum. Every local adjoint symmetry is represented by a multiplier of these currents. Every finite-order local symmetry is equivalent on solutions to a classical point symmetry, resolving a conjecture of Olver. An explicit local first-order Hamiltonian structure of the primitive system is also established in the geometric theory of partial differential equations. It maps the energy multiplier to time translation; its kernel on local adjoint symmetries is spanned by the helicity and incompressibility multipliers. The proof first excludes higher-order symmetries by comparing their responses to transverse and harmonic characteristic directions in compatible derivative data. The Hamiltonian map and its kernel then determine all local adjoint symmetries from the symmetry classification. Exact multiplier identities and the correspondence between multipliers and current classes complete the conservation-law classification.

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

We prove a geometric detection theorem for log crystalline local systems in the smooth proper setting with a normal crossings boundary. The associated special-fiber log $F$-isocrystal detects geometric absolute irreducibility and, modulo constant rank-one twists, determines the pullback to the geometric generic fiber. The main ingredient is a determinant argument combining a finite-order rank-one reduction, logarithmic period comparison, and the Plücker embedding. As an application, using Abe–Esnault's finiteness theorem and finiteness of stable lattices, we prove finiteness, up to geometrically constant rank-one twists, of geometrically absolutely irreducible log crystalline local systems of fixed rank. Coefficients may lie in any fixed finite extension of $\mathbb Q_p$, and no bound on the Hodge–Tate weights is imposed.

comments
13pages; v2 generalizes the results of v1 to the logarithmic setting
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.26318 ↗

We introduce a magnetic coherent–state frame over the Landau levels of the two–dimensional Landau Hamiltonian, indexed by a discrete metric space combining spatial and energy degrees of freedom. Although overcomplete, the frame is almost–orthogonal, and we use it to endow the CAR $C^*$--algebra over the one–particle Hilbert space with an \emph{asymptotic quasi–local} (AQL) structure, in which graded commutators of observables localized on disjoint index sets decay exponentially rather than vanish exactly. By means of a family of conditional expectations onto the resulting local subalgebras, we construct a Fréchet $*$--subalgebra of almost–local observables, invariant under the discrete group of lattice translations, which act on it by continuous automorphisms. For the full continuous group of magnetic translations we establish a quantitative control on how local observables spread through this almost–local algebra, and we show that this control suffices to extend graded asymptotic abelianness from the lattice to the entire continuous translation group. The results provide a discrete–continuum dictionary intended as the starting point for extending Lieb–Robinson–type techniques from lattice systems to interacting continuum electrons in a magnetic field.

comments
65 pages. Keywords: Landau Hamiltonian, magnetic frame, CAR $C^*$--algebra, asymptotic quasi--locality, asymptotic abelianness. (v2) contains minor corrections
fields
Mathematical Physics
pdf ↗ page arXiv:2609.26987 ↗

We study the Abelian maximal pattern complexity $p_{α}^{\ast \mathrm{ab}}(k)$ of infinite words over finite alphabets. For recurrent aperiodic words using exactly $\ell\geq 2$ letters, we prove the sharp lower bound $p_{α}^{\ast \mathrm{ab}}(k)\geq k+\ell-1$ and give a structural characterization of those words attaining equality for every $k\geq 1$. Without assuming recurrence, we prove that an infinite word $α$ is aperiodic if and only if $\binom{p_{α}^{\ast \mathrm{ab}}(k)}{2}\geq k$ for every positive integer $k$. For aperiodic words over $\ell\geq 2$ letters, each occurring infinitely often, we further prove that $p_α^{\ast \mathrm{ab}}(k)\geq m$ whenever $\binom{m}{2}\leq(\ell-1)(k-\ell+2)$, for all positive integers $m,k$. Together with a matching construction, this shows that the minimum Abelian maximal pattern complexity in this class is $\sqrt{2(\ell-1)k}+O_{\ell}(1)$. We call a word an Abelian pattern Sturmian word if, for every positive integer $k$, its Abelian maximal pattern complexity is the least positive integer $m$ satisfying $\binom{m}{2}\geq k$. We show that a word is Abelian pattern Sturmian if and only if, after relabeling its alphabet, it is the characteristic word of an infinite set $E\subset\mathbb{N}_0$ whose bipartite incidence graph is a forest. This graph has two disjoint copies of $\mathbb{N}_0$ as its vertex classes, with a left vertex $r$ adjacent to a right vertex $s$ exactly when $r+s\in E$.

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

While the Jacobian of a planar harmonic mapping keeps a constant sign, the signed and the unsigned area elements agree up to that sign, and the two natural moment hierarchies coincide. Once the Jacobian changes sign the critical circle acquires a caustic as its image, part of the plane is covered several times with opposite orientations, and the hierarchies part company: integrating a radial weight against $J_F$ lets overlapping sheets cancel, giving the degree-weighted moments $J_n$, while integrating against $|J_F|$ lets every sheet count positively, giving the multiplicity-weighted moments $J_n^{\pm}$. These are the classical degree and area formulas for the same map, the second weighted by the multiplicity function (Banach indicatrix). It is the second family, the one the caustic threatens, for which a closed form is no longer automatic. For the two-monomial map $F(w)=w+iC\bar w^{k}$ on an annulus we show that it has one anyway: $J_n^{\pm}$ is the total variation of the very same explicit primitive whose endpoint difference gives $J_n$. Crossing the caustic therefore costs exactly one extra evaluation point, the critical radius $r_*=(k|C|)^{-1/(k-1)}$, and it is the same point for every order $n$: the weight $|F|^{2n}$ is nonnegative and so contributes no sign change of its own. On the degree-weighted side $J_n$ has a boundary-only closed form for every $n\ge0$, the zeroth being the signed area of the image counted with degree, and the complex-weighted moments vanish unless $(k+1)\mid(m-\ell)$. Neither weighted integral is a new object, and the caustic of this family has been located before in the literature on harmonic trinomials; what is new is the closed evaluation of the multiplicity-weighted hierarchy across it.

comments
Multiplicity-Weighted Moments of a Two-Monomial Harmonic Map Beyond the Caustic
fields
Complex Variables, Classical Analysis and ODEs
pdf ↗ page arXiv:2609.28370 ↗

Multi-objective Bayesian optimization (MOBO) is commonly approached through specialized acquisition functions or scalarization schemes designed to explicitly account for trade-offs among non-preferential objectives. In this work, we show that such complexity might be unnecessary. We propose a framework that extends standard single-objective acquisition functions directly to the multi-objective setting through a hypervolume-based methodology. We further extend hedge strategies for acquisition functions, which are typically used only in single-objective optimization, to the multi-objective regime. Our approach requires minimal modification to existing Bayesian optimization pipelines and avoids the need for bespoke multi-objective formulations. We demonstrate how a broad class of commonly used single-objective acquisition functions and hedge strategies can be adapted in a principled manner to handle multiple objectives, while preserving their intuitive interpretation and computational efficiency. Empirically, we evaluate the proposed methods across a range of synthetic and real-world multi-objective benchmarks. Despite their simplicity, our extensions consistently match or outperform more complex state-of-the-art MOBO methods in terms of optimization performance and sample efficiency. These results suggest that effective multi-objective Bayesian optimization can be achieved by reusing and carefully extending well-established single-objective acquisition strategies, offering a simpler and more flexible alternative to existing approaches.

comments
40th Conference on Neural Information Processing Systems (NeurIPS 2026)
fields
Optimization and Control
pdf ↗ page arXiv:2609.31940 ↗

In this article, we study derived Hecke algebras with coefficients in torsion-free profinite rings regarded as discrete rings. We compare each such algebra with the degreewise inverse limit of the derived Hecke algebras with coefficients in finite rings and with its subalgebra consisting of elements with uniformly finite double-coset support. Under cohomological comparison hypotheses, the natural map to this subalgebra has image given by its degree-zero part and its positive-degree torsion. We describe the kernel in terms of continuous cohomology and prove that it is a divisible square-zero ideal annihilated by every positive-degree element. These comparisons are compatible with Yoneda products, and the action on torsion Ext classes factors through the image. We compute the resulting algebras for the additive group $\mathbb{Q}_p$ and determine the underlying graded abelian groups for $(\operatorname{GL}_2(\mathbb{Q}_p),\operatorname{GL}_2(\mathbb{Z}_p))$ with coefficients in $\mathbb{Z}_p$, for $p>3$. The examples exhibit distinct effects of the coefficient topology and the support condition.

comments
51 pages. Revised introduction and exposition; clarified hypotheses and arguments; corrected typographical errors
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2609.34589 ↗

We refute Aigner's majorization conjecture for star forests in adaptive quantitative group testing with two defective items. Each test counts the defectives in a chosen subset; the possible defective pairs form the edges of a star forest. Aigner's necessary majorization condition is sufficient through five tests but is not sufficient at any budget from six onward. Nevertheless, for every fixed number of stars, it becomes sufficient once the test budget is large enough. We prove that majorization is sufficient for all forests with at most twenty-nine stars, and that this bound is sharp. We also construct counterexamples that pass arbitrarily many successive compatibility checks based on majorization. The five-test converse, counterexamples, eventual sufficiency theorem and unbounded-delay construction have analytic proofs. The sharp finite support bounds also use exact integer-inequality certificates.

comments
32 pages. Substantially expanded revision: analytic five-test converse, eventual sufficiency, sharp support bounds and delayed obstructions. Evidence: https://doi.org/10.5281/zenodo.23996063
fields
Combinatorics
pdf ↗ page arXiv:2609.38284 ↗

In the present paper, we extend the results in the sequence of works \cite{KS-GCM1} \cite{KS-GCM2} \cite{KS:Kerr} by Sergiu Klainerman and the author, \cite{GKS22} by Elena Giorgi, Sergiu Klainerman and the author, and \cite{Shen} by Dawei Shen from the slowly rotating regime $|a|\ll m$ to the full subextremal range $|a|<m$, thereby completing the proof of the Kerr stability conjecture. The restriction $|a|\ll m$ enters in fact only through the estimates for wave equations and for the Bianchi system established in \cite{GKS22}. To remove this restriction, we crucially rely on the two companion papers \cite{MaSz24} \cite{MaSz26} by Siyuan Ma and the author, in which we prove energy-Morawetz estimates respectively for the inhomogeneous scalar wave equation and for inhomogeneous Teukolsky equations on perturbations of Kerr with $|a|<m$. Additionally, some of the results of the present paper are proved in our companion paper \cite{Sze}.

comments
166 pages, 2 figures. v2: fixed typos and updated introduction
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2609.40068 ↗

The Kerr stability conjecture has been proved in the slowly rotating case, i.e., $|a|\ll m$, in the sequence of works \cite{KS-GCM1} \cite{KS-GCM2} \cite{KS:Kerr} by Sergiu Klainerman and the author, \cite{GKS22} by Elena Giorgi, Sergiu Klainerman and the author, and \cite{Shen} by Dawei Shen, and extended in \cite{Sze}, by the author, to the full subextremal range $|a|<m$, thereby completing the proof of the Kerr stability conjecture. The proof in \cite{Sze} crucially relies on the two companion papers \cite{MaSz24} \cite{MaSz26} by Siyuan Ma and the author, in which we prove energy-Morawetz estimates respectively for the scalar wave equation and for Teukolsky equations on perturbations of Kerr with $|a|<m$. In addition, two results in \cite{Sze}, concerning the derivation of the Teukolsky wave-transport system in perturbations of Kerr and energy-Morawetz estimates for Teukolsky in the setting of \cite{Sze}, are stated without proofs. The goal of the present paper companion paper to \cite{Sze} is to provide the proof of these two results.

comments
154 pages, 2 figures. v2: fixed typos
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2609.40315 ↗

We construct solutions to the two-dimensional stationary Prandtl system under a constant adverse pressure gradient exhibiting a family of distinct separation laws. More precisely, for every integer $\ell\ge1$, we construct smooth initial data for which separation occurs at a finite location $x=x^\ast$, with \[ \partial_y u(x,0) =\mathbf C_\ell(x^\ast-x)^{\ell/2}\bigl(1+o(1)\bigr), \qquad x\uparrow x^\ast, \] where $\mathbf C_\ell>0$ depends on the initial data. We determine the local asymptotic structure of the solution near separation through matched inner and outer expansions based on linearization around the ground state in von Mises variables. This description addresses Open Problem~5 proposed by Oleinik and Samokhin~\cite{OleinikSamok-book-99}. We prove the nonlinear stability of the square-root separation law ($\ell=1$) under small admissible perturbations of the initial data in a suitable topology.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.01689 ↗

We construct degree-three isogenies of Hesse elliptic curves over an arbitrary field of characteristic different from three, which correspond to a step of the cubic arithmetic-geometric mean. As an application, we describe the Serre-Tate canonical lift of an ordinary elliptic curve in characteristic three by the 3-adic cubic arithmetic-geometric mean. We also discuss the relations of the Hesse curves with complex and finite hypergeometric functions.

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

We compute the singular cohomology groups of odd biisotropic symplectic Grassmannians $\operatorname{S_2Gr}(k, 2n+1)$ by presenting an explicit dimension-preserving combinatorial bijection between the Bialynicki-Birula cells in $\operatorname{S_2Gr}(k, 2n+1)$ and the Schubert cells in $\operatorname{Gr}(k, 2n+2-k)$.

comments
10 pages; v2: references updated
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2610.03309 ↗

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 ↗

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

fields
Logic
pdf ↗ page arXiv:2610.03845 ↗

We develop an amortized, grid-free implementation of continuous Langevin dynamics based policy-value iteration for entropy-regularized, infinite-horizon relaxed stochastic control problems. The improvement rate of the exact iteration is a discounted aggregate of relative Fisher information between the policy and the Gibbs law of its Hamiltonian. The associated score residual is the velocity with which the control's Langevin dynamics transport its law. We project this velocity onto a conditional sampler shared across states, instead of one Langevin dynamics per state, and the value dynamics onto a parametric critic, estimating both projections at sampled states to obtain coupled actor–critic flows. The score loss measures the actor's agreement with the current critic, while the policy-evaluation residual measures the critic's agreement with the actor. We also derive gradient and Hessian residuals, including a Feynman–Kac representation for the gradient equation, to control errors not detected by the projected value iteration. An exact decomposition of the HJB residual combines these errors into a policy-suboptimality bound under verification and logarithmic Sobolev assumptions. In the linear-quadratic class, both projections are exact and recover the pointwise iteration, and we provide numerical experiments on general models to demonstrate the coupled actor–critic learning in high-dimensions.

comments
25 pages, 5 figures, 3 tables
fields
Optimization and Control
pdf ↗ page arXiv:2610.04285 ↗

We study the Cauchy problem $u_t=Δ_{\Z^d}u+F(x,u)$ on $\Z^d$ ($d\geq2$) with a spatially periodic Fisher–KPP reaction $F$ and a nonzero, finitely supported initial datum $u_0:\Z^d\to[0,1]$. We establish a logarithmic upper bound on the front position that holds uniformly in the observation direction, with a logarithmic delay coefficient governed by the outward normal to the asymptotic spreading body. When the linearized growth rate $F_s(x,0)$ is independent of the longitudinal coordinate, we prove the matching axial Bramson correction and show that the solution converges uniformly on fixed-width half-tubes to a critical pulsating front up to a bounded, slowly varying phase shift. For critical pulsating profiles $Φ(s,x)$ satisfying $Φ(s,x)\leq C(1+s)\ee^{-λs}$ for $s\geq0$ and $x\in\Z^d$, where $λ>0$ is the critical spatial decay rate, we derive the precise leading-edge asymptotic expansion and prove uniqueness up to translation. As a consequence, in the axial regime we obtain sharp asymptotics for the arrival times $T_θ(x)=\inf\{t\geq0:u(t,x)\geqθ\}$ ($0<θ<1$), including the asymptotic time lag between distinct level sets at a remote site and the period-to-period passage time along the axis. For general periodic linearized growth rates, we introduce a nonlinear subsolution built from a positive quotient of linear Dirichlet evolutions on a retreating domain and formulate sufficient kernel estimates for a matching directional lower bound.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.06381 ↗

We construct magnetohydrostatic equilibria in rotationally symmetric toroidal domains whose magnetic lines define an $(m,n)$ Seifert fibration for arbitrary coprime integers $m,n$.

comments
12 pages. The existence result was upgraded to smooth solutions
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.08519 ↗

We prove that strong dominability, the LAP, and the Oka property are equivalent for complex manifolds. The proof turns approximation across an attached disc in one complex variable, uniformly in holomorphic parameters, into convex approximation in arbitrary dimension. We also characterize Oka manifolds by the LEP, formulated in terms of centered holomorphic families of discs. In dimension $n\geq1$, LEP propagates across sets of zero $(2n-1)$-dimensional Hausdorff measure. The Oka property is local in the Euclidean topology, and it descends under surjective holomorphic maps between connected complex manifolds. Deformations of very free rational curves give the Oka property for every smooth connected complex projective rationally connected manifold $X$, and for $X\setminus A$ whenever $A\subset X$ is a closed algebraic subset of codimension at least two. Compact Kähler manifolds admitting a Kähler metric with nonnegative holomorphic sectional curvature, or having nef tangent bundle, are also Oka. For $n\geq1$, the complement of a smooth hypersurface $D\subset\mathbb{P}^n$ of degree $d$ is Oka if and only if $d\leq n+1$.

comments
47 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.10475 ↗

Given an integer $k \geq 2$, there are integers $M_k$ and $P_k$ so that for all $A \subseteq \mathbb F^n_p$ does not contain a restricted polynomial progression of the form \begin{align*} x, x+\begin{pmatrix} y_1 \\ y_2 \\ \vdots \\ y_n \end{pmatrix}, x+\begin{pmatrix} y_1^2 \\ y_2^2 \\ \vdots \\ y_n^2 \end{pmatrix}, \ldots, x+\begin{pmatrix} y_1^{k-1} \\ y_2^{k-1} \\ \vdots \\ y_n^{k-1} \end{pmatrix}, \end{align*} where $x \in \mathbb F^n_p$, with $p>P_k$, and $y \in \{0,2, 3, \ldots, M_k\}^n \backslash \{\vec{0} \}$, for some fixed $M_k$, then $A$ must have density bounded above by $\frac{C}{(\log^{(k^{O(k)})} n)^c}$, where $C, c>0$ only depend on $k$ and $p$. For $k\geq 4$, the best previously known bound came from the density Hales–Jewett theorem and was of inverse Ackermann type. The proof uses a recent inverse theorem for noise stability of Bhangale, Khot, Liu and Minzer, which arose in the study of constraint satisfaction problems. The main new ingredient is a proof that the underlying distribution counting restricted polynomial progressions does not admit a nontrivial abelian embedding, by way of an involved algebraic argument. Reasonable bounds are provided for $P_k$ and $M_k$.

comments
35 pages. The only change for V3 is that the paper is formalized and registered at Palomar: https://palomar-registry.org/entry?id=PALOMAR-2026-11-06-000014&version=1
fields
Number Theory, Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.12831 ↗

In this paper, we study adaptive stochastic non-convex optimization under unknown smoothness and noise conditions. Our algorithms require no smoothness constant, noise bound, initial function gap, or oracle-regime label. We first propose a fixed-budget method that combines normalized momentum, recursive variance reduction, and a fresh gradient stage, followed by fresh validation of the candidates. We prove that the same output has expected gradient norm $O(T^{-1/4})$ under objective smoothness and bounded noise variance, $O(T^{-1/3})$ under average smoothness, and $O(T^{-1/2})$ for noiseless gradients, where $T$ counts individual gradient evaluations. We then develop an anytime algorithm whose three optimization paths preserve their endpoints across reporting and budget-extension boundaries. The same three rates hold at every deterministic query budget, although the algorithm receives no information about the budget $T$. The analysis combines a scale potential, a uniform second-moment bound, and accounting for candidates retained through unfinished blocks. An optional sample-mean selector further reduces cumulative validation work from $O(T)$ to $O(T^{2/3})$ while preserving these rates.

fields
Optimization and Control
pdf ↗ page arXiv:2610.13799 ↗

We study the Euler-Maruyama approximation of the degenerate stochastic differential equation $dX_t = |X_t|^α\,dW_t$, $0 < α< 1/2$, $X_0 = 0$, for which uniqueness in law fails. The Euler scheme started exactly from zero is trapped by the absorbing solution, whereas a nonzero initialization $x_h \to 0$ can select a different weak solution. We identify the initialization-dependent limiting regimes. The critical spatial scale is $r_h = h^{1/[2(1-α)]}$, and the relevant depth parameter is $Θ_h = h\log(1+\log^+(r_h/|x_h|))$. If $Θ_h \to 0$, the scheme converges to the non-sticky weak solution. If $Θ_h \to θ\in (0,\infty)$, it converges to the solution that stays at zero for the deterministic time $θ/|\logα|$ and then evolves as the non-sticky solution. If $Θ_h \to \infty$, the scheme converges to the absorbing solution. The proof is based on an exact scale-invariant Euler chain, a logarithmic exit-time law of large numbers, a discrete Tanaka occupation estimate, and a compact-uniform restart argument. Every finite deterministic delay can be obtained by a suitable vanishing initialization, while oscillating depth parameters yield process-level nonconvergence. Thus a vanishing initialization can survive in the limit as a macroscopic deterministic delay and thereby act as a solution selector for the Euler-Maruyama approximation.

comments
24 pages. Revised for submission to Electronic Journal of Probability; editorial and disclosure updates
fields
Probability
pdf ↗ page arXiv:2610.13800 ↗

Based on earlier work by Wiegerinck and Huang-Li, Hayashida-Kamimoto constructed unbounded non-smooth Reinhardt domains in \({\mathbb C}^n\), \(n\geq 3\), whose Bergman spaces are finite-dimensional and whose Bergman metrics have constant positive holomorphic sectional curvature \(2\). In this note, we prove a Sandwich Principle for the Hayashida-Kamimoto domains that allows us to construct, inside every prescribed sandwich, uncountably many pairwise biholomorphically inequivalent smooth non-Reinhardt domains whose Bergman metrics also have constant positive holomorphic sectional curvature \(2\). We also classify biholomorphisms between domains sandwiched by the domains of Hayashida-Kamimoto with the help of an affine rigidity theorem in the spirit of Cartan rigidity, which should be of independent interest. For explicit angular perturbation families, we determine the full automorphism group and obtain, in particular, an abundance of examples with trivial automorphism group.

comments
An attribution in the introduction has been clarified
fields
Complex Variables, Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2610.13831 ↗

This article surveys the main results on the representability of internal actions in varieties of non-associative algebras over a field. We begin by recalling the general framework of internal actions and split extensions in semi-abelian categories, before specialising to Orzech categories of interest and varieties of non-associative algebras. We discuss action representability, weak action representability, and action accessibility, with emphasis on the relationship between the latter two notions. We then describe the constructions of the universal strict general actor in Orzech categories of interest and the external weak actor in action accessible, operadic varieties of non-associative algebras over a field, as well as their role in the study of weak action representability. We also give a tensor-domain formulation of partial algebras and adapt the construction of the external weak actor to this setting. These notions are illustrated by examples arising from associative, Lie, Leibniz, Jacobi-Jordan, anti-commutative anti-associative, alternative, and $2$-nilpotent algebras. We conclude with a summary of the known results and some open questions for future research.

comments
Revised and expanded version: commutative associative algebras added to the summary table (not weakly action representable, see arXiv:2306.02812v4); algebraic coherence and the property of being a 2-variety added to the characterisation of action accessibility; further references added
fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2610.18302 ↗

We prove that the Becker-Gottlieb transfer is not functorial, even on rational cohomology. More precisely, for any even $n \ge 4$, we construct a fibration $f \colon X \to S^{n+1}$ with fiber $S^2 \vee S^n$, and an oriented $S^1$-bundle $g \colon Y \to X$ such that the transfer of $f \circ g$ is non-trivial on rational cohomology. Since the transfer of an oriented $S^1$-bundle vanishes, this implies that the transfer of $f \circ g$ and the composite of the transfers of $f$ and $g$ induce different maps on rational cohomology and are thus not homotopic. The proof that the transfer of $f \circ g$ is non-trivial uses the rational models for the Becker–Gottlieb and THH transfers obtained in previous work of the authors. In the appendix, we provide a second, more involved proof that relies on constructing explicit $C_\infty$-algebra models for odd spherical fibrations (including circle bundles), which might be of independent interest. Concurrently, another counterexample (of a very different flavor) was found by Georg Lehner, Cary Malkiewich, and the first author.

comments
10 pages + 12 pages of appendix and references. v2: Improved introduction and fixed inaccuracy
fields
Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2610.18718 ↗

For convex $(L_0,L_1)$-smooth functions, the curvature may grow together with the gradient norm. Therefore, even when $\|x^0-x^*\|\le R$, the gradient and the optimality gap at the starting point may be exponentially large in $L_1R$, and the bound $\sqrt{L_0R^2/\varepsilon}$, known for the accelerated method on functions with Lipschitz gradient, no longer describes the complexity of the problem. We determine the oracle complexity of this class for arbitrary deterministic first-order methods: for $L_0R^2/\varepsilon\ge1$, the optimal number of oracle calls $N$ satisfies $1+N=\widetildeΘ(\sqrt{L_0R^2/\varepsilon}+L_1R)$. The upper bound reads $O(\sqrt{L_0R^2/\varepsilon}+(1+L_1R)\log(2+L_1R))$: the method first passes through the large-gradient regime in $O(1+L_1R)$ iterations with an inexact line search, and then the standard accelerated method with a constant stepsize takes over. The lower bound is obtained by means of chains and the orthogonal invariance principle on functions conjugate to strongly convex functions on a polytope. If the initial optimality gap is at most $4\varepsilon$, the optimal bound becomes $1+N=\widetildeΘ(\sqrt{L_0R^2/\varepsilon}+(L_1R)^{2/3})$.

comments
43 pages, 4 algorithms, 2 tables. A Russian version of the paper is available at https://github.com/chitoraphelion/descending-everest-with-first-order-oracles
fields
Optimization and Control
pdf ↗ page arXiv:2610.21461 ↗

We initiate a theory of ``operator spaces" (in other words subspaces of $C^*$-algebras) with an emphasis on the maximal tensor product. The natural morphisms become the maximally bounded maps instead of the completely bounded ones. With this new looking glass we first examine various issues : lifting and extension properties, local reflexivity, inner derivations, similarity problems.This first part is semi-expository while the second one focuses on the class of von Neumann algebras $M$ such that any completely bounded unital homomorphism on a $C^*$-algebra with values in $M$ is maximally bounded (or equivalently is similar to a $*$-homomorphism via a similarity belonging to $M$). We show that this holds if and only if $M$ is the direct sum of a finite von Neumann algebra and an injective one. This also characterizes the $M$'s such that all completely bounded derivations into $M$ are inner. Our main tool for this is a new characterization of injective von Neumann algebras.

comments
Minor changes
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.21929 ↗

Robust estimation of unknown system dynamics from partial observations under attack is a core challenge in learning for control, increasingly critical in multi-agent networks subject to adversarial data poisoning. Existing methods either require highly restrictive assumptions on the adversary or yield weak error bounds. In this paper, we consider identifying partially observed linear dynamical systems subject to adversarial attacks with an attack probability $p < 0.5$ at each time. We propose a defense-filtering framework leveraging knowledge of the observation matrix to construct a defense filter satisfying full column rank and subspace separability conditions, which enables the evaluation of a single-attack scenario against observed data. Using this framework, we analyze the constrained $\ell_2$-norm estimator and establish finite-sample error bounds for recovering the Markov parameter matrix up to a linear transformation. This is the first approach to provide provable system identification guarantees via a defense filter for partially observed systems subject to harsh environments where the attack probability approaches $0.5$.

comments
8 pages, 1 figure
fields
Optimization and Control
pdf ↗ page arXiv:2610.21935 ↗

For networked systems, we propose a polynomial-time algorithm for solving the minimal input/output node cardinality disturbance decoupling problem via output feedback. The algorithm computes an optimal solution, namely, a pair of minimum-cardinality sets of control input and measurement output nodes that achieve disturbance decoupling, by solving a min-cut/max-flow problem on an extended network.

comments
MATLAB functions implementing the results presented in this article are available in the GitLab repository: https://gitlab.liu.se/lucle71/node-based-ddp or in Zenodo: https://doi.org/10.5281/zenodo.23476722
fields
Optimization and Control
pdf ↗ page arXiv:2610.22735 ↗

We prove that a complete connected scalar-flat Euclidean hypersurface of dimension $n\geq3$ is an affine hyperplane if its normalized mean curvature has sufficiently small $L^n$ norm. We also compute the total mean curvature energy of a classical rotational scalar-flat family to show that finiteness cannot replace smallness in dimensions $n\geq3$.

comments
14pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.24653 ↗

It is a famous result of Narkiewicz that there are at most two real quadratic and at most one totally real cubic Galois extensions $K/\mathbb Q$, whose ring of integers $\mathcal O_K$ is a unique factorization domain (UFD), but not Euclidean. As predicted by another famous result due to Weinberger, these exceptions should in fact not exist, as their existence would contradict a generalized version of the Riemann hypothesis. Building on recent spectacular progress on the Quasi-Riemann hypothesis for Hecke characters, in this short note we close the above final gap provided by Narkiewicz's result, and show, more generally, that the ring of integers $\mathcal O_K$ of any totally real abelian number field $K$ is a UFD, if and only if it is Euclidean. By referring to an additional announced uniform zero-free half-plane for general Dedekind zeta functions, we also establish the corresponding result for certain explicit new families of non-Galois cubic, quartic and quintic fields of unit rank one or two.

comments
Added further applications to certain families of non-Galois cubic, quartic and quintic fields, which are not necessarily totally real
fields
Number Theory, Rings and Algebras
pdf ↗ page arXiv:2610.24900 ↗

Recent advances in artificial intelligence have contributed to several information-theoretic results through genuinely different modes: a language model may suggest a proof, participate in an extended mathematical dialogue, coordinate computation, or operate as one component of a search harness. Treating all of these as "AI-discovered mathematics" obscures distinctions that matter for scientific reliability, attribution, and reproducibility. This article examines a set of recent cases through a four-stage pipeline: how the problem was formulated; how AI participated in finding a solution; how the resulting analytical and computational claims were verified; and how machine-generated outputs were translated into mathematical exposition for human understanding. Based on these cases, we recommend that research publications (1) disclose the nature and extent of AI assistance at each stage, (2) report verification of analytical reasoning separately from certification of numerical computations, and (3) place more emphasis on articulating the underlying ideas, techniques, and interpretations.

fields
Information Theory
pdf ↗ page arXiv:2610.25490 ↗

We propose and study a multi-labeling generalization of the $k$-radio labeling problem of graphs: given a graph $G$ and integers $k$ and $m$, assign to each vertex of $G$ a set of $m$ integer labels such that distinct labels assigned to a vertex differ by at least $k+1$, and the labels of any two distinct vertices $x$ and $y$ pairwise differ by at least $k+1-d(x,y)$, with $d(x,y)$ being the distance between vertices $x$ and $y$. We prove general bounds on the minimum span of such a labeling and more refined results for the case $k=1$. For paths and cycles, we derive sharp bounds on the minimum span when $k$ is small. We finally propose a conjecture for the minimum span on the path and for an almost-tight bound on the cycle.

comments
14 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.25863 ↗

We consider the nonlinear Schrödinger equation on $\mathbb{R}^{3,1}$, with a class of `mixed' nonlinearities that admit soliton solutions. We are interested in the long-time behaviour of solutions with finite, but possibly large, mass and/or energy. By a spacetime cone, we mean an open set in $\mathbb{R}^{3,1}_{x,t}$ that is invariant under dilation $(x, t) \mapsto (αx, αt)$ for all $α> 0$. Our main result is as follows: let $u(x, t)$ be the solution with initial condition in $H^2(\mathbb{R}^3)$. Let $\mathscr{M}, \mathscr{E}$ be the mass and energy of $u$, and let $η= η(\mathscr{M}, \mathscr{E}) > 0$ be sufficiently small. Let $C_ε$ be the complement of $N \geq 1$ of sufficiently thin spacetime cones $\{ (x, t) \mid |x-v_jt| \leq εt \}$, where $v_1, \dots, v_N$ are fixed velocities and $ε$ is sufficiently small. If the $L^\infty$ norm of $u$ in $C_ε$ is $\leq η$, we prove that $u$ scatters in $C_{2ε} \subset C_ε$.

comments
36 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.29265 ↗

In this article, we use the PBNF-transform, or Polynomial Boolean Normal Form, described in the two earlier articles and now extended to higher arity, to solve Boolean satisfiability problems (SAT), which are part of the P versus NP problem. SAT consists of a conjunction of clauses, and in our SAT-solving models, we dualize the logical equations by inverting the problem: we multiply letters (literals) in the transferred clauses and use a binary iterated composition based on adding polynomials for the conjunctions in our solution formula. We obtain Polynomial Boolean Equations, PBE=0, by also renaming the truth value T=0. With reversed literal repetition, we get the CNF as the sum of the transformed clauses. In fact, we can always reduce to multiplication in and addition out of clauses, as we do not look for the entire kernel of PBE for a YES instance for SAT.

fields
Logic
pdf ↗ page arXiv:2610.30523 ↗

The inviscid generalized surface quasi-geostrophic (gSQG) equations are a family of active scalar equations parametrized by a scalar $α$ that includes the two-dimensional Euler equations ($α= 0)$ and the SQG equation $(α= 1)$. We prove that, for every $α\in (\frac{7}{4}, 2)$ and every $T > 0$, there exists a self-similar patch solution whose boundary is a smooth, unbounded graph for $0 \leq t < T$ and develops a corner singularity at time $T$. The proof has been formally verified in Lean 4.

comments
81 pages, added a Lean 4 formalization of the main theorem
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.32857 ↗

We study the question of existence and multiplicity of homogeneous Markov Gibbs measures on Cayley trees with spin space $\mathbb{Z}$. We prove that, under a natural summability assumption on the interaction function, there are always at least two homogeneous Markov Gibbs measures satisfying two natural symmetry conditions. Moreover, any two homogeneous Markov Gibbs measures satisfying a suitable non-degeneracy assumption can be superimposed and produce infinitely many other homogeneous Markov Gibbs measures. When the interaction function $Q$ has bounded support in $\mathbb{Z}$, there is a one-to-one correspondence between homogeneous Markov Gibbs measures and suitable homoclinic orbits of a symplectomorphism of $\mathbb{R}^{2n}$, where $n$ is the smallest natural number such that $Q(i)=0$ for every $i>n$. For $n=1$, results from symbolic dynamics and horseshoes imply the existence of homogeneous Markov Gibbs measures whose single-site marginal is concentrated near an arbitrary finite subset of $N\mathbb{Z}$, where $N$ is a sufficiently large integer. In the case of interaction functions with infinite support, there is a one-to-one correspondence between homogeneous Markov Gibbs measures and suitable homoclinic orbits of a Lagrangian correspondence on the cotangent bundle of a Banach space.

comments
88 pages, 6 figures. v2: added institutional acknowledgment, corrected inaccurate sentence in the introduction
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2610.33287 ↗

In this paper, zeon matrix groups are discussed for the first time. Extending the concept of unitary complex matrices (i.e., matrices $A$ such that $A^\dagger A=\mI$) to matrices having entries in the complex zeon algebra $\CZ$, a ``zeon dagger'' operator $\zdag$ is defined and used to declare a zeon matrix $Ξ$ to be {\em unitary} if $Ξ^\zdagΞ=\mI$. The unitary zeon matrices of order $n$ form a subgroup $\U_n$ of all invertible order-$n$ zeon matrices. A more interesting notion is that of ``weak unitarity'' of a zeon matrix. In particular, a zeon matrix $Ξ$ will be said to be {\em weakly unitary} if $Ξ^\zdagΞ=\mI+Γ$, where $Γ$ is a diagonal nilpotent zeon matrix. The weakly unitary matrices of order $n$ form a group $\W_n$, of which $\U_n$ is a subgroup. It is further shown that the exponential of a graph's nilpotent adjacency matrix has a natural orthogonal decomposition into the sum of a weakly unitary zeon matrix and a nilpotent zeon matrix. Eigenvalues of the weakly unitary zeon matrix reveal information about the graph's cycles and paths.

comments
16 pages, 2 figures
fields
Rings and Algebras, Operator Algebras
pdf ↗ page arXiv:2610.33891 ↗

We present a Wilsonian framework, globally controlled across the holonomy space, for determining the perturbative data governing the vacua of chiral supersymmetric gauge theories on a circle. This allows lifting the Intriligator–Seiberg classification of semiclassical vacua in 3d $\mathcal{N}=2$ Chern–Simons-matter theories to $\mathbb{R}^3\times S^1$. The framework is showcased by finding a rich set of vacuum sectors in a simple U(1) model and by reproducing on flat space the R-twisted reduction (first diagnosed on $S^3\times S^1$) of an SU(2) Maruyoshi–Song theory to the Gang–Yamazaki theory.

comments
5 pages, 2 pages supplemental material, an ancillary Mathematica notebook; accompanying letter to arXiv:2604.27066 [hep-th]
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34240 ↗

We study a class of nonlinear degenerate parabolic equations with state-dependent coefficients admitting a scalar energy potential. The explicit–implicit–null (EIN) method avoids severe time step restrictions of explicit time stepping and costly Newton–Raphson iterations required by a fully implicit treatment of the nonlinearity. Using orthogonal projection of the Kirchhoff transform, we prove nonlinear energy stability for first- to third-order EIN time stepping coupled with a wide range of spatial discretizations that admit self-adjoint positive semidefinite discrete operators. Under an upper bound for the diffusion coefficient on relevant stage segments, two IMEX coefficient conditions yield sufficient stabilization bounds without any time step restriction. The estimates dissipate the original convex energy and allow degenerate diffusion. We also extend the analysis to diffusion systems with a scalar energy potential in a fixed positive definite metric, and to consistent positive-weight quadrature discretizations. Applications include porous-medium flow, nonlinear heat transfer in plasma, and multicomponent diffusion.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34539 ↗

A central limitation of modern machine learning systems is the lack of formal certificates guaranteeing their behavior beyond empirical, sample-based evaluation. Sum-of-squares (SOS) methods provide such guarantees by certifying polynomial inequalities over continuous domains via semidefinite programming (SDP). While prior work has introduced SDP layers as differentiable components in neural networks, repeated learning calls can lose the computational benefit of the forward program's sparse representation. We propose Sparse SOS Layers, differentiable value layers whose backward passes reuse the local coordinates of the forward solve. Under a fixed template and learned objective coefficients, each layer avoids building dense certificates and reuses its sparse structure across training steps. Compared with existing methods, our approach achieves up to 2.7 times speedup in total warm-call time, with nearly 100 times lower memory usage (1.7 vs. 160 GiB) for relatively large problem sizes for the tested dense parameterization. Experiments cover sparse polynomial certification, pendulum control, combinatorial relaxations, robotics projection, oscillator chains, and pose graph synchronization. A design study achieves zero certified violations across unseen problem instances and sizes, while requiring roughly 7 times fewer optimization solves than estimating gradients by perturbing the objective coefficients and re-solving the problem (finite differences). These results show that sparse certificate values can be effectively integrated into learning pipelines when the backward pass respects the verifier's structure.

comments
Accepted to NeurIPS 2026 - Main track
fields
Optimization and Control
pdf ↗ page arXiv:2610.34590 ↗

We solve an open problem on the multilinear Rubio de Francia extrapolation on Banach function spaces. The main result states that, under the assumption of the boundedness of the multisublinear Hardy-Littlewood maximal operator, the multivariable boundedness on Banach function spaces can be extrapolated from some weighted Lebesgue space, including the cases where some exponents may be infinite. Based on this result, we also establish multilinear extrapolation of boundedness on rearrangement invariant Banach function spaces, and multilinear extrapolation of compactness on general Banach function spaces. Beyond that, we give characterizations of the boundedness of the multisublinear Hardy-Littlewood maximal operator on both general Banach function spaces and certain specific function spaces. All results do not require any convexity or concavity conditions on Banach function spaces. The main ingredients in the proof are a multilinear version of the Rubio de Francia algorithm, a stopping-time argument, convex analysis, and a compactness criterion on Banach function spaces. As applications of extrapolation theorems, we obtain multilinear extrapolation for the boundedness and compactness of commutators on Banach function spaces. These results can be further applied to specific operators, which cover both the full range case including multilinear Calderón-Zygmund operators, multilinear pseudo-differential operators, and bilinear paraproducts, and the limited range case including the bilinear Hilbert transform, multilinear rough singular integrals, and bilinear oscillatory Fourier multipliers.

comments
The new version includes multilinear extrapolation on RIBFS and characterizations of the boundedness of the multisublinear Hardy-Littlewood maximal operator on BFS
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.35364 ↗

We prove the Modular Existential Closedness conjecture for the modular $j$-function extended from the upper half-plane to $\mathbb{C} \setminus \mathbb{R}$ by Schwarz reflection. Specifically, we show that any system of equations involving the field operations and $j$ has solutions in the complex numbers unless it is overdetermined. Such a system is overdetermined if, roughly, there are more independent equations than variables, possibly after applying the transformation rules of the $j$-function under the linear fractional action of $\rm{PGL}_2(\mathbb{Q})$ on $\mathbb{C} \setminus \mathbb{R}$. In general, we do not expect overdetermined systems of equations to have solutions due to the algebraic and transcendental properties of the $j$-function captured by the modular analogue of Schanuel's conjecture. In geometric terms, Modular Existential Closedness states that given a broad and free irreducible algebraic variety $V \subseteq \mathbb{C}^n \times \mathbb{C}^n$ -- where broadness and freeness are geometric conditions guaranteeing that the system is not overdetermined -- there is a point of the form $(τ_1, \ldots, τ_n, j(τ_1), \ldots, j(τ_n)) \in V$ with $τ_i \in \mathbb{C} \setminus \mathbb{R}$. The proof uses Ratner's theorems on the closure and equidistribution of the orbits of unipotent flows in powers of $\rm{PGL}_2(\mathbb{R})$ to describe the asymptotic behaviour of the orbits of certain analytic maps. This is then applied to approximate a relatively simple system of equations using the original system and the action of $\rm{PGL}_2(\mathbb{Z})$. The construction of the limiting system makes use of the Ax–Schanuel theorem and guarantees an isolated solution. Rouché's theorem then establishes the existence of solutions for the original system of equations.

comments
40 pages, 5 figures, 1 Table v2 changes: added a new result (Theorem 1.4); improved the presentation throughout the paper; clarified the constructions in sections 4.2--4.3 and added some details; added proof of Lemma 4.1 instead of referring to another paper; added Table 1 to improve readability
fields
Complex Variables, Dynamical Systems, Logic, Number Theory
pdf ↗ page arXiv:2610.35409 ↗

In this paper, we give a new proof of the Hopkins-Morel-Hoyois theorem for fields $k$ of characteristic unequal to $p$ containing all primitive $p$-power roots of unity for a fixed prime $p$. This new proof follows Quillen's proof for the structure of the homotopy groups of $\mathrm{MU}$ which utilizes topological power operations. To this end we define a motivic analog of the Steenrod power operations, using the theory of normed motivic spectra as developed by Bachmann–Hoyois and their application for the definition of motivic colimits as developed by Bachmann-Elmanto-Heller.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35903 ↗

We improve the upper bound on the classical Ramsey number $R(3,3,3,3)$ from 62 to 60. The proof is based on a global incidence count, classifications of small neighborhoods and exhaustive SAT computations. We formalize the mathematical reductions in Lean and refute every resulting formula with two SAT solvers.

comments
15 pages, 3 figures. This revision improves the upper bound from 61 to 60
fields
Combinatorics
pdf ↗ page arXiv:2610.36648 ↗

This monograph develops finite field theory through root sets, Frobenius orbits, trace duality, and cyclic modules, with applications to polynomial constructions and algebraic coding theory. Root-set descent and linearized polynomials connect field extensions, normal bases, invariant subspaces, and linear recurrences. Cyclotomic cosets link additive symmetries and local phase data with polynomial composition, factorization, and compatible lifting. Low-degree subfield representations and relative traces lead to root-block recovery, while return maps on root fibers organize constructions of irreducible polynomials. Coding applications include duality, distance bounds, Fourier support, and syndrome decoding. Character sums yield trace-norm distributions, the primitive normal basis theorem, and recurrences for extension-field sums and curve point counts. The final chapter constructs finite fields as residue fields of unramified p-adic extensions and relates Teichmuller representatives and Hensel lifting to cyclotomic orbits, periodic digit expansions, Witt carries, coefficient valuations, and Newton slopes. The emphasis throughout is on explicit proofs and reusable connections between field structure, orbit structure, and linear dependence.

fields
Number Theory, Information Theory
pdf ↗ page arXiv:2610.36727 ↗

Since its introduction in 2003, Wilking's Connectedness Lemma has become a powerful tool in the study of manifolds with positive sectional curvature. In recent work of the authors, this has been extended to orbifolds. The purpose of this note is to exhibit counterexamples in the class of Alexandrov spaces for the Connectedness Lemma in both its ordinary and dual formulation. This answers a 2007 question of Wilking.

comments
7 pages
fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2610.37476 ↗

Let $X$ be a Stein manifold, and let $K=\{h\le0\}$ be a compact sublevel set of a strictly plurisubharmonic function $h$ defined near $K$. It is known that $K$ is meromorphically convex in $X$ if and only if $dd^ch$ extends to a Hodge form on $X$. We show that if $H_2(X,\mathbb Z)$ is the direct sum of a free abelian group and a torsion group, for example if it is finitely generated or if $X$ is a Stein surface, then any extension of $dd^ch$ to a Kähler form on $X$ can be modified, after replacing $h$ by a positive multiple, into a Hodge form. Thus, meromorphic convexity of $K$ is equivalent to the extendability of $dd^ch$ as a Kähler form. We also show that the topological assumption cannot be dropped: we construct a Stein manifold $X$ of dimension $6$ with $H_2(X,\mathbb Z)\cong\mathbb Q$, a sublevel set $K$ as above that is not meromorphically convex although $dd^ch$ extends to a Kähler form, and a totally real torus in $K$ that is isotropic for a Kähler form but is not meromorphically convex. This shows that the Hodge condition in Guedj's characterization of meromorphically convex totally real submanifolds cannot be weakened to a Kähler condition, and gives counterexamples to two criteria stated by Cieliebak and Eliashberg.

fields
Complex Variables
pdf ↗ page arXiv:2610.38055 ↗

Many equivalence relations of mathematics (Green's relations on a semigroup, orbit relations of group actions, ``same value of an invariant'') are defined by allowed transformations, of a morphism on its two sides or of a point of a set. We put them in one framework. A comparison datum produces a category, the comparison category, whose arrows are the allowed transformations, and two morphisms are related when they can be compared in both directions. Its normal form is a Grothendieck construction, so every such relation is mutual reachability for an action; Green's relations, orbit relations and, more generally, relations defined by an invariant are worked out in detail from it. If the way morphisms are transported is an arbitrary function, every relation occurs, so the real constraint is the regularity of the transport. For completely functorial data we show that the relations obtained contain Green's relations and congruences, we study them at two opposite extremes: on finite groups (every morphism invertible) they are described through double cosets, and on nil monoids (only the unit invertible) we prove a collapse theorem. A short plain-language guide to the vocabulary (comparison categories and transport, Grothendieck construction and mutual reachability, functors, pseudofunctors and lax functors, enriched categories, colimits and stabilization) is included for readers who are not specialists.

comments
AI-generated from an initial draft and supervision by the author. 10 pages
fields
Category Theory
pdf ↗ page arXiv:2610.38143 ↗

A Bessel family is a collection of vectors of a Hilbert space whose coefficients are square summable; orthonormal bases and frames are examples. We compare two such families by asking when the size of the coefficients of one is controlled, up to constants, by that of the other after a change of variables taken from a fixed class $\mathcal O$ of operators. Each class (bounded, injective, bounded below, invertible, Fredholm, and others) gives an equivalence relation that ignores redundancy and treats frames and nonframes on the same footing. For every relation we determine the classes by explicit spectral data: the singular numbers of the analysis operator, its kernel, the closedness of its range, and the multiplicities of its spectrum at each dyadic scale. We also characterize the families equivalent to an orthonormal basis, compute an operator Banach–Mazur distance, and prove a Paley–Wiener stability result that needs no frame assumption. These relations are instances of the comparison categories of a companion article.

comments
AI-generated from an initial draft and supervision by the author. 30 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.39002 ↗

We construct generalized Frobenius structures on Hurwitz spaces of arbitrary genus using extended primary differentials. Through contour integrals involving the Cauchy kernel, we derive explicit dispersionless Lax representations for the principal hierarchies of these structures and their almost-dual counterparts. We also construct solutions to the open WDVV equations for both the original and almost-dual structures, and derive explicit principal hierarchies for the resulting rank-one extensions. Finally, we show that these constructions admit Shramchenko deformations.

comments
51 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39411 ↗

For an integer $k\ge2$, let $C(k,k)$ denote the oriented cycle formed by two internally vertex-disjoint directed paths of length $k$ with the same initial and terminal vertices. We extend a problem of Picasarri-Arrieta and Rambaud [European J. Combin. 122 (2024)] on subdivisions of $C(k,k)$ to digraphs with several vertices of out-degree one. Following the sharp result of Chen et al. [arXiv:2610.38574v1 (2026)] for at most one such vertex, we determine the exact digirth threshold when at most $r\ge4$ such vertices are permitted. Specifically, for all integers $k\ge2$ and $r\ge4$, every digraph of minimum out-degree at least one, with at most $r$ vertices of out-degree one and digirth at least $r(k-1)+1$, contains a subdivision of $C(k,k)$.

comments
14 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.00720 ↗

Chow associated with every finite multigraph $G$ a symplectic matroid $\GraphS{G}$ on the signed edge set $E\sqcup E^{*}$, whose restrictions to transversals are frame matroids of signed graphs, and Sarvepalli asked which of these matroids are representable. For a connected graph containing a cycle, we show that every isotropic representation of $S(G)$ admits an incidence-flow normal form. The remaining representation conditions are expressed through its admissible minors. Consequently, if $\GraphS{G}$ is $\F$-representable, then the bridgeless part of $G$ has a nowhere-zero $(\F,+)$-flow. In characteristic other than two, $\GraphS{G}$ is representable if and only if every non-loop edge on a cycle has a parallel mate. In characteristic two, we characterize the loopless graphs without two vertex-disjoint cycles by the existence of a nowhere-zero $(\F,+)$-flow, and we show that rigidly linked short cycles, and hence subdivisions of the prism, are obstructions. For $3$-connected simple graphs this gives a complete answer: $\GraphS{G}$ is $\F$-representable if and only if $\F$ has characteristic two, $G$ has no two vertex-disjoint cycles, and either $|\F|>2$ or $G\cong K_5$. In particular, the matroid of the Petersen graph is representable over no field. Finally, the admissible corank–nullity polynomial of an arbitrary symplectic matroid is intrinsic and satisfies a three-term contraction identity. For graphical symplectic matroids, this becomes a deletion-contraction recursion that closes up once marked vertices are allowed, and polynomials built from enveloping matroids agree with it exactly for sheltering envelopes.

fields
Combinatorics
pdf ↗ page arXiv:2611.01241 ↗

We present an alternating-chain argument intended to show that every lattice strictly singular operator from a real Banach lattice to a real Banach space is disjointly strictly singular. A hypothetical counterexample yields two LSS operators on a reflexive sequence lattice whose difference is bounded below. Quotienting by the range of that difference gives a common map bounded below on a positive tail cone. Finite chains of positive disjoint vectors with alternating small differences lead to incompatible length estimates. We record the resulting operator and sequence consequences and extend the construction to common postcompositions with DSS errors. Independently of the proposed equality, we prove simultaneous nuclear restriction results for norm-sigma-compact DSS families and uniform nuclear tails on each compact piece. For norm-compact families we also obtain common Hilbert-space factors and uniformly small nuclear corrections having a common infinite-dimensional kernel. Examples identify limits of these selection statements. We present the main argument as a candidate proof over the real field.

fields
Functional Analysis
pdf ↗ page arXiv:2611.01504 ↗

In this paper, we focus on well-filtered spaces. By using the Rudin sets and WD sets, we obtain the following results: (1) The product of arbitrarily many Scott well-filtered dcpos is still well-filtered with respect to the Scott topology. Thus we give positive answers for two questions proposed by Xu and Zhao; (2) Let $P$ be a dcpo with $ΣK(P)$ being well-filtered and $Q$ an RB-domain. Then $ΣK(P\times Q)$ is well-filtered if $K(P\times Q)$ is a dcpo; (3) An intrinsic characterization of the $WD$ sets is given in terms of Scott open filters.

fields
General Topology
pdf ↗ page arXiv:2611.01518 ↗

Evans and Gannon showed that a positive vertex operator algebra of central charge eight whose representation category is the Drinfeld center $Z(\cal H_3)$ of the Haagerup fusion category has one of two character vectors, with six or nineteen currents. Call such an algebra, if strongly rational, a Haagerup algebra. We prove that a Haagerup algebra $U$ has six currents, that $U_1 \cong \mathfrak{sl}_2 \oplus \mathfrak{sl}_2$ embeds into $V_{E_6 \oplus A_2}$ in one of two explicit ways, with levels $(1,39)$ or $(3,13)$, and we determine the lowest weight spaces of its modules and $U_2$ as $U_1$-modules. For the levels $(3,13)$, $U_2$ is one of four Galois conjugate subspaces. Together with $U_1$ it generates the unitary $C_2$-cofinite algebra $S$, which is isomorphic to the algebra constructed by Jiao. For the levels $(1,39)$, $U$ contains the explicit algebra of Riesen. The associated lattice of $U$ is that of the form $x^2+xy+10y^2$, resp.\ $3x^2+3xy+4y^2$, the two classes of the principal genus of discriminant $-39$. Exchanging them in the decomposition of $U$ over its Heisenberg commutant gives a Haagerup algebra $U^\natural$ of the other levels, and $U \mapsto U^\natural$ is a bijection between the isomorphism classes of the two cases. The classification gives exactly two isomorphism classes, forming a single hyperbolic genus, as soon as either explicit candidate is known to be a Haagerup algebra. This property is proved for $S$ in [ArhIII], where the twin $S^\natural$ is also identified, with the algebra of Huang and Riesen, using the results of Dong, Jiao and Xu [DJX26]. The explicit algebras of Jiao and Riesen have rational forms. The proofs combine exact trace relations given by vector-valued modular forms, exact computations in a model of $V_{E_6 \oplus A_2}$, and genera of vertex operator algebras.

comments
75 pages. Code and certificates will be available on https://github.com/cedricarhancet
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:2611.01618 ↗

In this paper we consider the problem of identifying the bottom-boundary of an ocean basin, particularly in the coastal region where shallow-water theory applies. Our main contribution is the development of an easy-to-implement observer-based approach of identifying the bottom-boundary profile from measurements of the free-surface. Furthermore, we prove that the true profile can be obtained by minimising the long-time observation-error as computed from the observer equations associated with a class of linear dispersive shallow water-wave models. Numerical simulations indicate the same optimisation problem can recover the true profile for the nonlinear versions of the same dispersive water-wave models.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01738 ↗

A perfect 1-factorisation (P1F) of $K_{2n}$ is a partition of its edges into $2n-1$ perfect matchings, any two of which form a Hamiltonian cycle. Exhaustive classification is known only up to $K_{16}$. We present a method for the exhaustive generation, up to isomorphism, of perfect 1-factorisations with a non-trivial automorphism group, which reduces the search tree far enough to make $K_{18}$ and beyond feasible. It combines two ideas. For automorphism groups of order greater than 2, classical results of Ihrig on the automorphisms of P1Fs are used as tools that reject almost all prescribed cycle types without search. For the order-2 case, which dominates, candidates are recalculated from inherited compatibility lists, in the spirit of Gill and Wanless, with an outer loop over two further rows that keeps those lists small, and Ihrig's results restrict the first factor. As the numerical proof of the method we compute all 10,710 P1Fs of $K_{18}$ with a non-trivial automorphism group; before, only six were known.

comments
4 pages. Submitted to the Australasian Journal of Combinatorics. Code: https://github.com/LeAndr-Graph/P1F-Census . Data: Zenodo DOI 10.5281/zenodo.22238984
fields
Combinatorics
pdf ↗ page arXiv:2611.01807 ↗

Castillo's dual equations for the alternating map reduce polynomial time-and-band limiting to two scalar problems. We determine the concentration multiplicities at a single cutoff, with sharp finite support and moment requirements. When the scalar problems admit irreducible tridiagonal commutants, we classify every real symmetric pentadiagonal commutant of the simple concentration matrix and construct one with simple spectrum. Its half-bandwidth is minimal for $N\ge3$ in polynomial degree order. Laguerre, Jacobi and Meixner input give applications; the constructions of Castro and Grünbaum follow by specialization. We give spectral-gap and rounding bounds, and certify small concentration values and deficits for noninteger Jacobi parameters.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.01839 ↗

We study orthonormal Strichartz estimates at the critical coefficient exponent $q/2$ for fractional Schrödinger propagators. The proof for $d\geq3$ combines annular Schatten estimates with a frequency summation argument based on potential duality and Littlewood–Paley theory. In dimension two, a trace computation supplies the annular estimate needed for the global estimate. We also construct a counterexample to the global estimate with spatial $L^\infty$ and coefficients in $\ell^{q/2}$, even with a weak time norm.

comments
Version 2 adds more background introductions in Section 1. Version 2 also fixes few notations in the final section. No changes for math contents
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.03527 ↗

A Haagerup algebra is a positive strongly rational vertex operator algebra $U$ of central charge eight with $\mathrm{Rep}(U)$ braided equivalent to the Drinfeld center $Z(\cal H_3)$ of the Haagerup fusion category. We prove that $U$ has exactly three holomorphic extensions, each isomorphic to $V_{E_8}$, and that the corresponding Lagrangian algebras have module categories $\cal H_1$, $\cal H_2$ and $\cal H_3$. The extensions attached to $\cal H_2$ and $\cal H_3$ are the two lattice extensions of $V_{E_6 \oplus A_2}$. We prove a recognition theorem for $\cal H_2$ and $\cal H_3$ among unitary fusion categories of rank six with three invertible objects, a noncommutative Grothendieck ring and trivial pointed associator. For simple regular unitary vertex operator algebras with bounded localized vertex operators, we construct the transport module of two ordinary unitary modules when the second integrates in Tener's annular sense. For a unitary conformal Haagerup subalgebra of $V_{E_6 \oplus A_2}$, these results give a completely rational net with representation category $Z(\cal H_3)$, a realization of the Haagerup subfactor and the generalized orbifold of Bischoff. In particular, they apply to the strongly local explicit algebra $S$ of levels $(3,13)$, whose Haagerup property is established in [ArhIII, Theorem 6.1]. In [ArhIII], the net of $S$ is recognized from strong rationality and lattice branching, and a diagonal extension of the net is then used to identify $\mathrm{Rep}(S)$. Here an exact construction of the compatible unitary structure on the diagonal lattice algebra $V_{E_8 \oplus E_8}$, followed by passage to the twin algebra, proves complete unitarity and Condition I+ for every Haagerup algebra. This also gives the VOA–net comparison through smeared vertex operators for unitary conformal embeddings in $V_{E_6 \oplus A_2}$.

comments
66 pages, the supplementary files will be available at https://github.com/cedricarhancet
fields
Quantum Algebra
pdf ↗ page arXiv:2611.03560 ↗

We investigate connections between operator spectra, complex dynamics, and determinants for wreath product groups. For a nontrivial finite abelian group $G$, the natural action of $G\wr\mathbb Z$ on a rooted tree produces a family of operators with a recursive structure. Applying Schur complements to this family yields a rational map on complex projective space. We determine the projective spectrum–the parameter values for which the operator pencil fails to be invertible–as the union of the Julia set of this map and an explicitly described subset of its Fatou set. We also prove that the associated Koopman representation and the left regular representation are weakly equivalent and therefore give the same projective spectrum. We then compute Fuglede–Kadison determinants for a family of operators on more general wreath products. These formulas yield injective operators with zero determinant for wreath products $K\wr\mathbb Z$, where $K$ is a discrete group admitting a nontrivial projection $e\in\mathbb C[K]$. This answers negatively a question of Li and Thom about whether injectivity implies positive determinant for operators defined by matrices over complex group rings of amenable groups. For $G_{tf}\rtimes_σ\mathbb Z$, where $G_{tf}$ is any countable torsion-free abelian group and $σ\in\operatorname{Aut}(G_{tf})$, we prove that injectivity does imply positive determinant in every matrix size.

comments
42 pages, 4 figures
fields
Dynamical Systems, Operator Algebras
pdf ↗ page arXiv:2611.03711 ↗

For every fixed odd $d\ge5$, we prove that the circular flow number of a uniformly random simple $d$-regular graph is asymptotically almost surely less than $2+4/(d-1)-\varepsilon_d$ for an explicit constant $\varepsilon_d>0$. At degree five the upper bound is $3-1/24006$. At degree seven it is $21/8$, answering a question of Li and Li. For every fixed $p\ge1$, we also obtain a strongly connected Jaeger orientation at degree $4p+1$, with outdegrees in $\{p,3p+1\}$. At large degrees we count dense bisections together with sets that violate their cut inequalities. This gives flow intervals of length $O(d^{-2})$ above the maximum-bisection lower bound of Li and Li. The finite-degree estimates, together with the large-degree transfer, also prove the conjecture of Greenhill, Isaev and Lewis that the threshold for orientations with outdegrees in $\{p,d-p\}$ exceeds the corresponding bisection threshold by at most one.

comments
55 pages, Conjecture 7.1 in version 1 (positive gaps for circular flow number of random 5- and 7-regular graphs)is now proved, and Conjecture 7.1 is replaced with a new conjecture
fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.03763 ↗

We study the minimization of the average of $n$ convex $(L_0,L_1)$-smooth functions: the Hessian norm of each function is bounded by an affine function of its gradient norm. We assume known upper bounds $R$ on the distance from the starting point to a minimizer and $δ$ on the difference between the minimum of the average and the average of the infima of the components. We derive upper and lower bounds on the oracle complexity of reaching accuracy $\varepsilon$ in function value in expectation. Up to logarithmic factors, both bounds are of order $n(1+(L_1R)^{2/3}) +\sqrt{\frac{n(L_0+L_1^2δ)R^2}{\varepsilon}+n(L_1R)^2}$. The upper bound is attained by the proposed method YETI. The method combines ideas of accelerated proximal methods and variance reduction methods with a heuristic for choosing additional points. The number of oracle calls made by the heuristic is bounded, which preserves the upper bound on the total number of queries needed to reach the target accuracy. In the experiments, YETI is compared with first-order methods on synthetic problems and Poisson regression problems. We also examine the stopping criterion and the effect of the heuristic separately. The lower bound is obtained by an explicit construction of families of instances that are hard for any first-order method.

comments
57 pages, 4 figures, 5 tables, 5 algorithms. Second paper in the Descending Everest series; Part I: arXiv:2610.21461
fields
Optimization and Control
pdf ↗ page arXiv:2611.04171 ↗

We prove a nearly optimal lower bound on the blocklength of general relaxed locally decodable codes (RLDCs), extending the result of [GGS26] to nonlinear encodings and adaptive decoders with two-sided error. Namely, we show that any $q$-query RLDC $C\colon \{0,1\}^k \to \{0,1\}^n$ must satisfy $n = k^{1+Ω(1/q)}$, closely matching the upper bound of $n = k^{1+O(1/q)}$ by Ben-Sasson, Goldreich, Harsha, Sudan, and Vadhan (STOC 2004). Our proof reduces showing RLDC lower bounds to estimating the output distribution of adaptive decoders. To this end, we introduce a capped Horvitz–Thompson estimator with uniformly bounded discrete derivatives on the $p$-biased cube. We establish its concentration of measure via self-bounding inequalities and control the downward bias induced by capping through a spreadness argument.

fields
Information Theory
pdf ↗ page arXiv:2611.04678 ↗

We prove that every finite simple graph $G$ with maximum degree at least $750$ satisfies $χ(G)\le\max\{ω(G),Δ(G)-1\}$. The proof starts with a random partial colouring and completes it on large cliques using a list-colouring condition that remains valid as the rest of the graph is coloured. Disjoint stars provide the required colours. We estimate the number of stars that can be chosen after the clique colours have been exposed, while keeping their endpoint set fixed. A common exponential-moment argument reduces intervals of packing sizes to endpoint comparisons. More detailed neighbourhood estimates handle the remaining vertices. The final probability inequalities are verified by directed rational and interval arithmetic.

comments
56 pages: 25 pages of main text, AI assistance statement, and references; 31 pages of appendices. Several definitions have been clarified throughout
fields
Combinatorics
pdf ↗ page arXiv:2611.05423 ↗

We give invariants of pairs $(M,Γ)$ consisting of a closed connected oriented three-manifold and an oriented framed ribbon graph embedded in $M$ colored by the Drinfeld center of a unimodular finite chromatic category $\mathcal C$. This invariant generalizes the chromatic spherical and renormalized Reshetikhin-Turaev invariants of three-manifolds. We use Heegaard-Graph diagrams which represent the pair $(M,Γ)$ and use the data of a unimodular chromatic category and objects of the Drinfeld center to construct the invariant. We define a ribbon graph associated to embedded framed links to obtain an invariant of pairs $(M,L)$. We show that if $L$ is the empty link, then the invariant recovers the chromatic spherical invariant, and if $M$ is the three-sphere, then the invariant recovers the renormalized Reshetikhin-Turaev invariant from the Drinfeld center. The relationship is proven by recovering a chromatic structure for the center induced by that from $\mathcal C$. The main theorem of the paper demonstrates that if the graph is a link $L$ colored by a generator in the Drinfeld center, then we recover the chromatic spherical invariant of the surgery manifold $M(L)$, contributing to a proof of the relationship between the chromatic spherical and renormalized Reshetikhin-Turaev invariants for unimodular chromatic categories, generalizing a recent result for unimodular Hopf algebras by Reina. To this end, we give a Heegaard diagram for $M(L)$ coming from the Heegaard-Link diagram representing the pair $(M,L)$.

comments
34 pages, comments welcome! Revised for typos and small errors
fields
Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2611.06708 ↗

Structural-response surrogates must capture moving resonances, phase changes, and unequal-amplitude transfer channels during optimization or health-state changes. Physics-embedded learning seeks FEA-level accuracy at lower cost by embedding physics in inputs, forward passes, losses, and backpropagation. We propose Modal Rational (MR), mapping structural features to modal quantities for analytical frequency-response reconstruction. The Physics-Guided Modal Operator Network (PGMON) adds bounded frequency, damping, and residual-flexibility corrections. Modal Operator with Structural GELU and Anchored-SIREN Correction (MOSAIC) denotes the bounded spectral-discrepancy framework used here; MOSAIC-MR and MOSAIC-PGMON add such discrepancies. They support finite-dimensional maps and physical decoders for future neural operators; evidence is fixed-topology, not a completed operator comparison. Two 20,000-design populations are studied: an 80 m steel truss tower with variable member areas and attached masses, and a tapered shell beam with ten variable station masses. Archived tests cover ten designs and seven acceleration histories per structure; they are benchmarks, not seismic-design assessments. With 5% reference modal damping, MR, PGMON, and MOSAIC give mean displacement-history errors of 0.73-0.76% for the tower and 0.029-0.116% for the beam, against declared band-limited modal references. Supplied modal frequencies are distinguished from design-only use; unequal parameter counts and training settings are explicit. Error analysis separates learned modal discrepancies, truncation, and excitation weighting, explaining acceleration and difficult-tower limits and risks of blind use. Results support physically structured prediction but limit claims about generalization, computational savings, and added corrections. Next is developing and validating neural operators around these architectures.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.07059 ↗

Let $ C_ω$ be the cone generated by a proper $C^2$ domain $ω\subset\mathbb S^{N-1}$. We study positive homogeneous solutions of the fractional $p$-Laplace equation in $C_ω$ with zero exterior values. For $p\ne2$, the operator is nonlinear and not uniformly elliptic. For every $p>1$, we identify two extremal homogeneities $β^+>0>β^-$, prove that every fundamental solution, if one exists, has one of these exponents, and construct homogeneous eigenfunctions whose eigenvalues have signs determined by the position of the homogeneity relative to $β^\pm$. As an application, we obtain the Lane-Emden threshold $q^*=p-1+sp/β^+$ for every $p>1$: nontrivial nonnegative supersolutions of $(-Δ_p)^s u\ge u^q$ in $C_ω$ do not exist for $0<q<q^*$, whereas homogeneous supersolutions exist for $q>q^*$. We also establish Hopf-type lower bounds at conical boundary points with the optimal exponent. When $p-1>sp$ , we construct both fundamental solutions, one singular at the vertex and the other vanishing there. For $p=2$, these solutions are known; our method recovers them for every $s\in(0,1)$. The homogeneous eigenfunctions also serve as barriers, yielding boundary decay and global Hölder regularity for $(-Δ_p)^s u=f$ in bounded Lipschitz domains, with zero exterior values and $f$ continuous up to the boundary. The admissible Hölder exponents are determined by the exterior cones. All results hold for every $N\ge2$; in particular, $N>sp$ is not needed.

comments
Corrected minor typographical and grammatical errors, and improved the organisation and clarity of the exposition. The main results and mathematical arguments remain unchanged
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.07157 ↗

In this paper, we give diagrammatic descriptions of the quantum subgroups coming from conformal embeddings of the form $\mathcal{V}(\mathfrak{g}, \check{h}) \subset \mathcal{V}(\mathfrak{so}_{\dim \mathfrak{g}}, 1)$ for $\mathfrak{g}\in \left\{\mathfrak{so}_N, \mathfrak{sp}_{2N}\right\}$, as well as the conformal embeddings of the form $\mathcal{V}(\mathfrak{sp}_{2r + 2}, 2r) \subset \mathcal{V}(\mathfrak{so}_{\dim \mathfrak{sp}_{2r + 2}}, 1)$, extending the techniques of Edie-Michell and Snyder which applied to conformal embeddings of the form $\mathcal{V}(\mathfrak{sl}_r, r) \subset \mathcal{V}(\mathfrak{so}_{\dim \mathfrak{sl}_r}, 1)$. Our main conceptual innovation is the use of fermion condensation to construct a continuous family of planar superalgebras, which we call the Clifford BMW supercategories. The tower of endomorphism algebras, $CW_n(σ, ε)$ is a combination of Birman Wenzl Murakami algebras and Clifford algebras, much in the spirit of the Hecke Clifford algebras. This tower of algebras appears to be new, and already yields some exciting combinatorics.

fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.07221 ↗

Let $\mathcal{L}$ generate a symmetric contraction semigroup. We prove a holomorphic Hörmander calculus on $L^p(X;\ell^q)$ at the optimal angle $\max\{\arcsin|1-2/p|,\arcsin|1-2/q|\}$, with boundary Sobolev order $s>3$.

comments
34pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.07430 ↗

How often does an element of the geometric iterated Galois group of a Lattès map fix a vertex of the tree? Let A/K be an abelian variety over a separably closed field of characteristic 0, G <= Aut(A,0) finite, and alpha an isogeny of degree at least 2 normalising G. The Lattès map on X=A/G has a preimage tree governed by alpha-power torsion; we determine the fixed-point proportion in every dimension. For zeta in G the weight is the reciprocal of the number of fixed points of zeta in alpha-power torsion (zero if infinite); equivalently, it is a product of p-adic absolute values of determinants on the alpha-active subspaces; for scalar alpha=m the proportion is (1/|G|) times the sum over 1 != zeta in G of the product over p dividing m of the p-adic absolute value of det(1 - zeta | H_1(A,Z)). We deduce positivity and vanishing criteria, prove the groups G_infinity are martingale groups, determine the limit law, and reduce groups with translations to the fixed-origin case. In dimension one we determine ten values for scalar multipliers and nontrivial G <= Aut(E,0), and for the eight quadratic Lattès classes the proportions are 1/8, 1/4 and 5/16. Bridy-Jones-Kelsey-Lodge exclude the Lattès case from their main theorem; their Theorem 2.5 periodic-point bound is attained, via reductions modulo split primes p = 1 (mod 4), for the map (x^2+a)/(x^2-a), a^2 = -1, and we settle the exceptional case of the Fariña-Asategui-Radi conjecture.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.07816 ↗

We study the asymptotic propagation speed of travelling wave solutions to the stochastic Fisher–KPP equation with multiplicative finite-activity pure jump Lévy noise, i.e.\ a compensated Poisson random measure of finite intensity, so that the solution evolves deterministically between successive jumps and jumps multiplicatively at the event times. Our main contribution is a stochastic Feynman–Kac representation for the solution, which expresses the random field as the product of the exponential martingale of the jump noise and an expectation over the paths of an independent Brownian motion. The representation converts the nonlinear stochastic partial differential equation into an expectation problem, allowing a direct analysis of the front position. Building on this representation, we derive sharp upper and lower bounds for the propagation of the front: for every speed $c>2\sqrt{1+a}$ the solution decays exponentially along the ray $x=ct$, while for every speed $c<2\sqrt{1+a}$ it does not. The two together identify the asymptotic speed in the critical-speed sense: the threshold between exponentially decaying and non-decaying fronts equals $2\sqrt{1+a}$ almost surely, an identity proved without any a priori existence of the limit $R_δ(t)/t$. The complementary bounds $2\sqrt{\underlineγ}\le c\le2\sqrt{\overlineγ}$ also hold, with $\overlineγ,\underlineγ$ explicit in $ε$ and $μ$. Under the finite-activity assumption, a stopping-time iteration yields pathwise $L^\infty$ bounds and finite-speed propagation of the level sets of the front, which underlie the existence of a travelling wave profile. The framework extends naturally to multi-species cooperative systems, and numerical simulations illustrate the informativeness of the speed bounds.

comments
46 pages, 2 figures, 1 table
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.07868 ↗

We record two observations concerning \cite{HLW24}. First, the proof of its Theorem~1 yields the population linearization (13)--(14) at \textit{any critical point} of the Fréchet function $F_μ$, under its remaining geometric and measure-theoretic assumptions; neither \textit{isolation} nor a \textit{nonsingular} Hessian of $F_μ$ is needed. Second, its Theorem~2 is given a shorter proof by applying the M-estimator theorem \cite[Theorem~5.23, pp.~53–54]{vdV98} to negative squared distance in normal coordinates, as opposed to the Donsker argument used there. We verify the pointwise differentiability, local square-integrable Lipschitz bound, second order expansion of population loss, consistency, and empirical maximization hypotheses. The resulting covariance retains the cut-locus correction. The same argument applies to a measurable selection of \textit{local} sample Fréchet minima when the population Hessian is positive definite.

fields
Statistics Theory
pdf ↗ page arXiv:2611.07956 ↗

Let $f:M^n\to\Sn^{n+q}(1)$ be a minimal immersion of a closed connected manifold with $n\ge3$ and $q\ge2$, and let $S$ be the squared length of its second fundamental form. We prove an integral inequality that gives $\max_M S\ge n$ if the immersion is not totally geodesic. If $n\ne4$ or $q=2$, equality $\max_M S=n$ holds if and only if the immersion is a Clifford minimal hypersurface; if $n=4$ and $q\ge3$, equality holds if and only if the immersion is a Clifford minimal hypersurface or the standard minimal embedding of $\mathbb{CP}^2$ in $\Sn^7(1)$. Both classifications are understood up to an ambient isometry, a totally geodesic inclusion, and a finite covering. We construct the integral inequalities using polynomial weights and divergence identities. The required algebraic estimates are proved by sums of squared tensor norms.

comments
There are some proof details that need to be carefully checked
fields
Differential Geometry
pdf ↗ page arXiv:2611.08126 ↗

We propose a second-order, semi-implicit time-stepping scheme for the shallow-water equations on the sphere discretised with compatible finite elements. The scheme splits the advection operator from the wave operator, applying a DG-upwind SSPRK3 method to the advection part and an $H(\text{div})$-conforming implicit discretisation to the wave part, solved efficiently via hybridisation. The scheme follows a three-step symmetric splitting: an explicit half-step, a full advection step, and an implicit half-step that simultaneously projects the velocity back into the $H(\text{div})$ space. This symmetry guarantees global second-order accuracy and confines the stability restriction to the CFL condition of the advection step alone. The time-step can therefore be extended beyond this limit by subcycling the advection step without additional implicit solves. The method is implemented in Firedrake and validated against a standard suite of spherical shallow-water benchmarks, demonstrating stable results for Courant numbers up to 1 (with two advection subcycles) with second-order finite elements, second-order convergence, and good parallel scaling.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.08169 ↗

We present a systematic framework for gauging continuous symmetries, and show that the Schur-Weyl duality arises naturally as a realization of this construction with open boundary conditions. Restricting to compact Lie group symmetries, we construct dual models for one-dimensional quantum lattice models exhibiting those symmetries. We demonstrate that matrix product operators enable the explicit construction of intertwiners between the dual theories and their (non-invertible) symmetries. With closed boundary conditions, we can relate the full spectrum of these dual theories by considering all possible twisted boundary conditions. We illustrate how the Peter-Weyl transform appears when the duality acts on the boundary Hilbert space of a $G$-symmetric model. The presented framework generalizes previous work on dualities for unitary fusion category symmetric models. It exemplifies how dualities for both finite and continuous symmetries rely on the relation between a bond algebra and a representation of the symmetry in the lattice as double centralizers. We argue that dual non-invertible spontaneous symmetry breaking is the mechanism that underlies symmetric tensor network algorithms. We illustrate these results for $U(1)$- and $SU(2)$-symmetric quantum lattice models.

comments
15 pages + 2 pages of appendices
fields
Mathematical Physics
pdf ↗ page arXiv:2611.08293 ↗

We prove Conjecture 1.4 of Prochno and Strzelecki [J. Approx. Theory 277 (2022), 105736] on Gelfand numbers of embeddings between finite-dimensional Schatten classes. For $0<p\le1$ and indices bounded away from the ambient dimension by a fixed proportion, we obtain the conjectured lower bound, uniformly in the target exponent $2\le q\le\infty$. Together with the known upper estimate obtained by Hinrichs, Prochno and Vybíral [Math. Ann., 380(3-4):1563-1593, 2021], this gives the exact asymptotic order in the previously unresolved range. As a consequence, we obtain a complete all-index description by combining our result with the estimates of Hinrichs, Prochno and Vybíral and of Prochno and Strzelecki. The proof is deterministic and is based on Hilbert–Schmidt projections on rectangular matrix spaces.

comments
11 page, 1 figure
fields
Functional Analysis
pdf ↗ page arXiv:2611.08448 ↗

Get each issue by email →