Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 16 April

Optimization and Control

A bi-level priority sorting framework for flexible AGV service scheduling in smart warehouses

This paper proposes a bi-level optimization framework to coordinate Automated Guided Vehicle (AGV) flexible operations in smart independent warehouses, addressing the critical challenge of balancing high-throughput order fulfillment with stringent cost control. The framework is designed to simultaneously optimize flexible customer service level, system cost, and operational efficiency. The first level dynamically adjusts real-time scheduling parameters, such as order commitment times and delay tolerance, based on predefined customer priority categories. The second level performs real-time routing optimization for each AGV by identifying the shortest feasible paths while avoiding conflicts. For complex multi-capacity package picking tasks, two heuristic rules, priority, deadline, with shortest path (PDSP) and delay cost with shortest path (DCSP), are applied to multi-capacity package picking tasks and further training is carried out using the reinforcement learning algorithm of A* guided deep Q-learning (AGDQN). Comprehensive simulation experiments, conducted across diverse warehouse layouts and order demand patterns, demonstrate that the proposed framework equipped with both heuristic rules consistently reduces average order delay and total system costs by over 50% during peak demand periods. This is achieved while maintaining a service level above 90% and maximizing AGV utilization. The method also exhibits superior flexibility and sustained efficiency under normal and fluctuating demand scenarios. Additional ablation studies confirm that the proposed priority sorting mechanism delivers robust performance advantages when tested with various other reinforcement learning baselines.
Read the full abstract

Dynamical Systems

Delay-Induced Stability Transitions in Directed Signed Consensus Networks

We study delay-induced transitions in consensus dynamics on signed networks with a ring topology. The proposed model is formulated as a system of delay differential equations incorporating both cooperative and antagonistic interactions, as well as heterogeneous time delays. We perform a stability analysis by deriving the associated characteristic equation and examining the real parts of its eigenvalues. It is shown that the stability of the consensus state depends critically on the magnitude of the delays. In particular, increasing time delays may destabilize the system and induce transitions from consensus to bounded non-convergent behavior or instability. A phase diagram in the parameter space is constructed to identify different dynamical regimes. Numerical simulations validate the theoretical results and illustrate the delay-induced transitions. Such delay-induced transitions have also been reported in various biological and engineered systems, highlighting the universal role of time delays in shaping collective dynamics.
Read the full abstract

Analysis of PDEs

Electric inertia and ideal magnetic reconnection in 2D

We consider inertial magneto-hydrodynamic systems in 2D. We show global existence and uniqueness of smooth solutions and global existence and uniqueness of weak solutions in Yudovich class. We prove magnetic reconnection without magnetic resistivity, for smooth solutions and for patch solutions. This is obtained by proving merger in corresponding systems of coupled active scalars.
Read the full abstract

Number Theory

Belyi map verification using certified path tracking

We provide an end-to-end workflow to rigorously compute the monodromy of Belyi maps from exact equations over number fields using certified homotopy continuation. We then apply this method at scale to certify the monodromy triples of Belyi maps in the $L$-functions and Modular Forms Database (LMFDB).
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Natural gradient descent with momentum

We consider the problem of approximating a function by an element of a nonlinear manifold which admits a differentiable parametrization, typical examples being neural networks with differentiable activation functions or tensor networks. Natural gradient descent (NGD) for the optimization of a loss function can be seen as a preconditioned gradient descent where updates in the parameter space are driven by a functional perspective. In a spirit similar to Newton's method, a NGD step uses, instead of the Hessian, the Gram matrix of the generating system of the tangent space to the approximation manifold at the current iterate, with respect to a suitable metric. This corresponds to a locally optimal update in function space, following a projected gradient onto the tangent space to the manifold. Still, both gradient and natural gradient descent methods get stuck in local minima. Furthermore, when the model class is a nonlinear manifold or the loss function is not ideally conditioned (e.g., the KL-divergence for density estimation, or a norm of the residual of a partial differential equation in physics informed learning), even the natural gradient might yield non-optimal directions at each step. This work introduces a natural version of classical inertial dynamic methods like Heavy-Ball or Nesterov and show how it can improve the learning process when working with nonlinear model classes.
Read the full abstract

Numerical Analysis · Cross-listed from physics.flu-dyn

A data-driven approach for 2D vorticity PDF equations by a new conditional average estimation

We consider the statistics for the vorticity field in two-dimensional homogeneous isotropic turbulence (HIT). First, we exploit the invariance properties to derive dimensionally reduced governing equations for the one-point and two-point probability density functions (PDFs). These take the form of linear kinetic transport equations, but with an unclosed operator in terms of a conditional average. To solve the PDF equation numerically we suggest a hybrid data-driven method that relies on carefully selected samples of DNS data and a sampling estimator for the conditional average. The method is applied to DNS data for both decaying and forced HIT, demonstrating good agreement with the direct evaluation of the PDFs using the DNS data.
Read the full abstract

All authors Qian Huang, Simon Görtz, Paul Hollmann, Johannes Conrad, Christian Rohde, Martin Oberlack

Optimization and Control · Cross-listed from cs.LG

Optimizing Stochastic Gradient Push under Broadcast Communications

We consider the problem of minimizing the convergence time for decentralized federated learning (DFL) in wireless networks under broadcast communications, with focus on mixing matrix design. The mixing matrix is a critical hyperparameter for DFL that simultaneously controls the convergence rate across iterations and the communication demand per iteration, both strongly influencing the convergence time. Although the problem has been studied previously, existing solutions are mostly designed for decentralized parallel stochastic gradient descent (D-PSGD), which requires the mixing matrix to be symmetric and doubly stochastic. These constraints confine the activated communication graph to undirected (i.e., bidirected) graphs, which limits design flexibility. In contrast, we consider mixing matrix design for stochastic gradient push (SGP), which allows asymmetric mixing matrices and hence directed communication graphs. By analyzing how the convergence rate of SGP depends on the mixing matrices, we extract an objective function that explicitly depends on graph-theoretic parameters of the activated communication graph, based on which we develop an efficient design algorithm with performance guarantees. Our evaluations based on real data show that the proposed solution can notably reduce the convergence time compared to the state of the art without compromising the quality of the trained model.
Read the full abstract

Algebraic Topology

Algebraic redshift in the $C_2$-equivariant Adams spectral sequence

We study $v_n$-periodic phenomena in $C_2$-equivariant stable homotopy through the lens of the $C_2$-equivariant Adams spectral sequence at the prime 2. In particular, we construct/detect certain classes related to powers of the $v_n$ generators of $\pi_*(BP)$ in the cohomology of certain finitely generated subalgebras $A^{C_2}(m)$ of the $C_2$-equivariant Steenrod algebra. We define the notion of classes in $\text{Ext}_{A^{C_2}}(\underline{H}^\star, \underline{H}^\star)$ being $v_n$-periodic or $v_n$-torsion and exhibit a chromatic filtration by showing that $v_n$-torsion classes are also $v_k$-torsion for $0\le k < n.$ We also promote the Lin-Davis-Mahowald-Adams splitting of Ext of the suitable version of “$R P_{-\infty}^\infty$" to the $C_2$-equivariant setting and use this to define appropriate algebraic versions of Mahowald's root invariant. We establish that whenever a class corresponding to a power of $v_{n}$ is nonzero in $ \text{Ext}_{A^{C_2}(m)}(\underline{H}^\star, \underline{H}^\star),$ then the same power of $v_{n-1}$ is also nonzero in $ \text{Ext}_{A^{C_2}(m-1)}(\underline{H}^\star, \underline{H}^\star),$ and its algebraic Mahowald invariant $M_m^{C_2-alg}(v_{n-1}^{2^f}) \subset \text{Ext}_{A^{C_2}(m)}(\underline{H}^\star, \underline{H}^\star)$ contains class(es) corresponding to $v_n^{2^f}.$ Real motivic versions of these results hold as well.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Accessible Quantum Correlations Under Complexity Constraints

Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Under the cryptographic Learning with Errors hardness assumption, we construct efficiently preparable states exhibiting both separations, even when their preparation circuits are fully known. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.
Read the full abstract

All authors Álvaro Yángüez, Noam Avidan, Jan Kochanowski, Thomas A. Hahn

Numerical Analysis

Efficient and well-conditioned ghost-point discretization of boundary operators on unfitted domains

Unfitted boundary methods are widely used to numerically solve partial differential equations (PDEs) on irregular domains, avoiding the computational burden of generating boundary-conforming grids. In the finite-difference framework, structured Cartesian grids offer advantages such as ease of implementation and efficient parallelization, while geometry is represented implicitly, for instance, through level-set functions. In this setting, ghost point methods are commonly employed to enforce boundary conditions by introducing additional relations between interior and ghost nodes. However, constructing these relations becomes challenging for high-order accurate discretizations, which often rely on wide stencils that can reduce computational efficiency and degrade performance in large-scale parallel simulations. In this work, we investigate alternative ghost-point discretizations based on compact stencils. We introduce a formulation based on a boundary operator that locally approximates the boundary condition near each ghost node, replacing it with linear relations involving both interior and ghost points. The operator is constructed via least-squares reconstruction, allowing flexible stencil configurations while preserving the desired order of accuracy. Several strategies for selecting and adapting compact stencils are proposed, guided by conditioning criteria and iterative refinement procedures to improve global stability. Numerical experiments on various geometries and convection-diffusion regimes demonstrate the effectiveness of the proposed approach, showing that it maintains high accuracy even in the presence of boundary layers and improves stencil compactness and conditioning of the resulting linear systems.
Read the full abstract

All authors Armando Coco, Alessandro Coclite, Stéphane Clain, Rui Miguel Pereira

Geometric Topology

Building homology theories (ala Floer)

These notes are an expanded version of evening talks at the 2025 Georgia International Topology Conference, and an abbreviated version of talks at Georgia Tech, which were aimed at graduate students. The hope was to indicate a common framework that has been used since the late 1980s to construct homology theories in low-dimensional topology and symplectic and contact geometry. In addition to this, we also try to indicate how the specific nature of the situation being studied dictates the algebraic nature of the chain groups used to define the homology.
Read the full abstract

Combinatorics

A Proof of the Conjecture on complemented zero-divisor graphs of semigroups

In this paper, we are motivated by the conjectures proposed by C.~Bender et al., \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove the third conjecture positively, which has remained an open question until now. The third conjecture is stated as if $G(S)$ is uniquely complemented with the clique number $3$ or greater and has the property that every vertex has a unique complement, then the graph $G(S)$ is isomorphic to the graph $G(\mathcal{P}(n))$, where $n$ is the clique number of $G(S)$.
Read the full abstract

Combinatorics

Optimal and Near-Optimal Constructions for Bootstrap Percolation in Hypercubes

The $r$-neighbour bootstrap process on a graph $G$ begins with a set of infected vertices; subsequently, healthy vertices become infected once they have at least $r$ infected neighbours. The central extremal problem in bootstrap percolation is to determine the minimum cardinality of an initial infected set that eventually spreads to all vertices of $G$, denoted $m(G;r)$. Morrison and Noel established a general lower bound on $m(Q_d;r)$, where $Q_d$ is the $d$-dimensional hypercube, and asked whether it is tight whenever $d$ is sufficiently large with respect to $r$. This question was answered affirmatively for $r\leq 3$. In this paper, we show that $m(Q_d;4)=\frac{d(d^2+3d+14)}{24}+1$, matching the bound in of Morrison and Noel, for infinitely many $d$. We also obtain, for general $d$, an upper bound on $m(Q_d;4)$ that differs from the Morrison–Noel lower bound by an additive $O(d)$ term. Several key constructions in this paper were obtained with the assistance of AlphaEvolve.
Read the full abstract

Optimization and Control

Safeguarded Accelerated Adaptive Search under Unreliable Gradient Oracles

From the probabilistic-model viewpoint, stochastic adaptive search can require any fraction $\theta\in(0,1)$ of the predicted model reduction for acceptance. Classical backtracking with Nesterov acceleration pairs its momentum construction with a test certifying $1/2$ of this reduction. In stochastic search, however, rejection entails a fresh oracle query without updating the iterates. We therefore separate the fraction required by the search from that used to construct momentum, allowing smaller search fractions to ease acceptance and potentially reduce the oracle cost of reaching a target accuracy. Safeguarded Accelerated Adaptive Search (SAAS) addresses smooth convex optimization with unreliable gradients and inexact function value oracles. We establish high-probability trial bounds under finite-moment gradient errors allowing bias and infinite variance, or bounded corruption subject to relative-accuracy conditions. Numerical experiments demonstrate that the preferred balance between search and momentum varies with gradient reliability, and that decoupling the scales enables stable and rapid progress.
Read the full abstract

All authors Shunzhi Zhang, Shichen Liao, Congying Han, Tiande Guo

Optimization and Control

Complexity Guarantees for Zeroth-order Methods via Exponentially-shifted Gaussian Smoothing: Mitigating Dimension-dependence and Incorporating Decision-dependence

In this paper, we consider two distinct challenges in the resolution of nonsmooth stochastic optimization. Of these, the first pertains to the pronounced dependence of dimension in Gaussian smoothing-enabled zeroth-order schemes, impeding applications to large-scale settings. Second, no unified analysis {exists} for smoothing-enabled stochastic zeroth-order methods, allowing for capturing standard and decision-dependent stochastic optimization. To contend with the first challenge, we introduce a new exponentially-shifted Gaussian smoothing esGs estimator whose moment bounds enjoy a linear dependence on dimension (rather than a quadratic dependence as in standard Gaussian smoothing estimators). Second, we show that such an estimator can be extended in two distinct ways to address decision-dependent regimes where the underlying densities are either available in closed form or not. Notably, the resulting gradient estimators continue to display a linear dependence in dimension. We then develop an esGs-enabled stochastic zeroth-order method applicable to nonsmooth strongly convex, convex, and {non-}convex regimes. Importantly, our guarantees provide improved dimension-dependence in iteration complexities (by a factor of problem dimension $n$) while maintaing similar oracle complexities. In addition, we also provide novel high probability guarantees and almost sure sublinear rate guarantees in convex settings, while a new subsequential almost sure convergence guarantee is provided in nonconvex regimes. Preliminary numerics support our theoretical findings show that the proposed schemes display improved computational times and more refined empirical accuracies.
Read the full abstract

Analysis of PDEs

Limit as $p(x)\rightarrow \infty$ of $p(x)$-Harmonic functions for unbounded $p(x)$

It is shown that if $p_n$ is a sequence of continuous, unbounded exponents on a bounded, smooth domain $\Omega\subset {\mathbb R}^n$ with $1<\inf\limits_{x\in \Omega}p_n(x)$ and $p_n\rightarrow \infty$ uniformly, then the sequence $(u_n)$ of solutions of the $p_n(\cdot)$-Laplacian converges to the viscosity solution of a suitable differential operator. The novelty here is that each term of the sequence of exponents $(p_n)$ is allowed to be unbounded in $\Omega$.
Read the full abstract

Number Theory

Extremal densities for forbidden configurations in $S$-smooth numbers

Let $S = \{p_1,\dots,p_r\}$ be a finite set of distinct primes, let $\Psi_S(X)$ be the number of $S$-smooth integers not exceeding $X$, and let $F_S(X)$ be the maximum size of a subset of $M(S) \cap [1,X]$ containing no set $\{n,p_1 n,\dots,p_r n\}$. We prove that $ F_S(X)=\frac{r}{r+1}\Psi_S(X)+O_S\bigl((\log X)^{r-1}\bigr) $ as $X \to \infty$, and equivalently that $ f_S(k)=\frac{r}{r+1}k+O_S\bigl(k^{(r-1)/r}\bigr) $ for the corresponding extremal function on the first $k$ $S$-smooth numbers. We also relate this problem to the analogous extremal problem on the full interval $[1,N]$. Using the classical theory of such forbidden configurations, we obtain a representation of the corresponding density constant $\alpha_S$ in terms of the increments of $f_S$, along with nested computable bounds and a recursive formula for the reciprocal tail over $S$-smooth numbers. We further show that rational reciprocal sums over $S$-smooth denominators need not arise from eventually periodic binary sequences. In the classical case $S=\{2,3\}$, we derive an explicit tail formula and prove two structural propositions for optimal sets.
Read the full abstract

Algebraic Geometry

Degenerations in tropical compactifications and tropical intersection theory of $\overline{M}_{0,n}$

The main result of this paper is a formula for the limit cycle of a 1-parameter family of subvarieties of a tropical compactification, expressed in terms of tropical intersections. Our theorem generalizes results of Dickenstein-Feichtner-Sturmfels and Katz to the case of tropical compactifications. In the second part of the paper, we apply our formula to the moduli space $\overline{M}_{0, n}$ of stable marked rational curves. We describe the tropicalization of the Kapranov maps $\overline{M}_{0, n}\to\mathbb{P}^{n-3}$, whose hyperplane pullbacks are the $\psi$-classes, with respect to a suitable choice of torus. We introduce tropical $\psi$-hypersurfaces (in genus zero). These are different from the standard definition of Mikhalkin and Kerber-Markwig, and may be of independent interest. We demonstrate our main result by giving a "firework algorithm" that computes limits of intersections of $\psi$-hypersurfaces.
Read the full abstract

All authors Sean T. Griffin, Jake Levinson, Rohini Ramadas, Rob Silversmith

Numerical Analysis

A Correction Function-based KFBI Method for Brinkman Interface Problems

In this work, we propose a correction-function-based kernel-free boundary integral (CF-KFBI) method for solving Stokes- and Brinkman-type interface problems. We begin by recasting the original interface problem with discontinuous coefficients as boundary integral equations, in which the integral operators can be interpreted as boundary data for potential functions that satisfy simpler interface problems without coefficient discontinuities. Each such interface problem is discretized using a corrected Marker-and-Cell (MAC) scheme. Within a narrow band around the interface, we introduce a local correction function that represents the solution jump, leading to a local Cauchy problem. This problem is solved with a collocation method, for which we provide criteria for a minimal choice of collocation points and prove solvability. Several numerical experiments, including both fixed- and moving-interface problems, are presented to demonstrate the accuracy and efficiency of the proposed method.
Read the full abstract

Combinatorics

Complemented zero-divisor graph of posets

In this paper, we derive a set of equivalent conditions for the zero-divisor graph $\Gamma(Q)$ of a poset $Q$ with $0$ to be complemented, characterizing it in terms of quasi-complemented posets. Furthermore, we prove that the notions of a complemented zero-divisor graph and a uniquely complemented zero-divisor graph coincide for any poset $Q$ with $0$. In addition, we provide both algebraic and topological characterizations for $\Gamma(Q)$ to be a complemented graph. In the final section, we apply these characterizations to the zero-divisor graphs of a reduced (multiplicative) semigroup $S$ with $0$ and the comaximal (ideal) graph of an Artinian ring $R$, and the nonzero component union graph $\mathbb{UG}(\mathbb{V})$ of a finite-dimensional vector space $\mathbb{V}$ over a field $\mathbb{F}$.
Read the full abstract

Group Theory

Homomorphisms of Hecke-Kiselman Monoids Associated to Simple Oriented Graphs

Let $\Gamma$ and $\Theta$ be finite simple oriented graphs, and let $\mathbf{HK}_{\Gamma}$ and $\mathbf{HK}_{\Theta}$ denote the corresponding Hecke-Kiselman monoids. We present a set of Boolean matrices that is in bijection with the set of monoid homomorphisms from $\mathbf{HK}_{\Gamma}$ to $\mathbf{HK}_{\Theta}$. In particular, we obtain a Boolean matrix monoid isomorphic to the endomorphism monoid of $\mathbf{HK}_{\Theta}$.
Read the full abstract

Optimization and Control

Enhancing Model Based Derivative Free Optimization using Direct Search

We consider single and multiobjective simulation-based optimization problems. Simulation-based optimization has traditionally used both model-based and search-based methods, often in isolation. Model-based methods include trust region approaches and Bayesian optimization, while search methods include genetic algorithms and Direct Search-type techniques. In this work, we propose a switching framework that leverages Direct Search methods to enhance the performance of any model-based optimizer. Our contributions are twofold. First, in the single-objective setting, we analyze and prove the asymptotic convergence of the proposed switching approach. Second, motivated by applications in machine learning, we consider both classification and regression problems, where the objectives span accuracy, computational time, algorithmic bias, and sparsity. The models range from complex neural networks and decision trees to simpler KNN-type baselines. For machine learning in particular, we also introduce a warm-starting mechanism using weights from previous hyperparameter or architectural configurations to exploit problem structure and accelerate training. Finally, beyond ML tasks, we evaluate the method on the standard CUTEr test problems and compare its performance against classical Bayesian and trust region solvers. We observe consistently strong numerical performance, suggesting promise for the proposed switching-based approach.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Load Block Modeling in Distribution Systems: Network Reconfiguration for Load Restoration

The distribution system restoration (DSR) problem has received considerable attention over the last decade or more. Solutions to the DSR problem identify the best set or sequence of actions to perform on a distribution circuit to restore service after a disruption. The problem is challenging from a computational perspective, with engineering constraints specific to distribution systems, such as radial operations, that are difficult to effectively model. In this paper, we revisit the model for how specific loads are shed, energized and restored–and develop a formulation that more accurately models the requirements of load shedding, load energizing and restoration in distribution systems.
Read the full abstract

All authors David M. Fobes, Harsha Nagarajan, Manuel Garcia, Robert Ferrando, Russell Bent

Analysis of PDEs

Instability of the ray-monotone selector for $W_1$-optimal transport

For the distance cost $c(x,y)=|x-y|$, the set $O(\mu,\nu)$ of $W_1$-optimal plans is generally not a singleton. Under the classical absolute-continuity hypotheses in the Euclidean case, secondary variational selection by the quadratic energy $C_2$ yields the ray-monotone $W_1$-optimal plan. We provide a counterexample to an open problem posed by Santambrogio that concerns the stability of this selector under weak convergence of the marginals. More precisely, we construct a fixed absolutely continuous source $\mu$ and absolutely continuous targets $\nu_n\rightharpoonup\nu$ such that $\gamma^{\mathrm{sel}}(\mu,\nu_n)\rightharpoonup\gamma^{\mathrm{hom}}$, where $\gamma^{\mathrm{hom}}\in O(\mu,\nu)$ but $\gamma^{\mathrm{hom}}\neq\gamma^{\mathrm{sel}}(\mu,\nu)$. We also identify the narrow Kuratowski limit of the optimal-plan sets $O(\mu,\nu_n)$, derive the constrained $\Gamma$-limit for secondary energies of the form $\int \Phi(|x-y|)\,d\gamma$ with $\Phi\in C([0,2])$, and deduce a non-commutation result for the additive perturbation $c_\varepsilon(x,y)=|x-y|+\varepsilon|x-y|^2$.
Read the full abstract

Differential Geometry

Scalar relative differential invariants

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their (differential) algebra and demonstrate both positive and negative results in this respect under various setups. As in the algebraic case, the algebra of polynomial differential invariants is not finitely generated. However we show that after localization on a finite set of relative invariants the differential algebra becomes finitely generated. We also investigate the weights of rational relative differential invariants and bound their order. Several nontrivial examples are considered and further applications are discussed.
Read the full abstract

2604.15473 · 16 Apr · In this version we included a possibility of torsion for weights of relative invariants and demonstrated that it has topological nature. Finite generation property is un-altered in this more general setup. We also prove that torsion does not arise upon jet-prolongation, and provide a torsion-free criterion showing that torsion is absent under mild conditions

Information Theory

Lossless Compression via Chained Lightweight Neural Predictors with Information Inheritance

This paper is dedicated to lossless data compression with probability estimation using neural networks. First, we propose a probability estimation architecture based on a chain of neural predictors, so that each unit of the chain is defined as a neural network with the minimum possible number of weights, which is sufficient for efficient compression of data generated by Markov sources of a given order. We show that this architecture allows us to minimize the overall number of weights participating in the probability estimation process depending on the statistical properties of the input data. Second, in order to improve compression efficiency, we introduce an information inheritance mechanism, where the probability estimate obtained by a low-order unit is used at the next higher-order unit. Experimental results show that the proposed lossless data compressor equipped with the chained probability estimation architecture provides compression ratios close to the state-of-the-art PAC compressor. At the same time, it outperforms PAC by a factor of 1.2 to 6.3 in encoding throughput and by a factor of 2.8 to 12.3 in decoding throughput on a consumer GPU.
Read the full abstract

Combinatorics

Any 2-coloring of the plane contains monochromatic unit rhombuses

In this note, we prove that any 2-coloring of the plane contains 4 points of the same color forming a rhombus with unit sides and non-unit diagonals, answering a question of Axenovich, Liu, and the second author.

Optimization and Control · Cross-listed from q-fin.PM

Risk-Sensitive Investment Management via Free Energy-Entropy Duality

We study a benchmarked risk-sensitive portfolio problem in a factor-based setting to bring together three strands of the literature: benchmarked risk-sensitive investment management, the Kuroda-Nagai change-of-measure method, and the free energy-entropy duality of Dai Pra et al. (1996). We show that the duality yields a direct solution of the benchmarked problem by reformulating it as a linear-quadratic-Gaussian stochastic differential game under a suitable equivalent probability measure, with an entropic regularization. The resulting value function is quadratic, the optimal controls are explicit affine feedback maps, and the optimal allocation admits two complementary interpretations: as a fractional Kelly strategy and as a Kelly portfolio adjusted via the entropic regularization. This formulation, therefore, contributes both a direct analytical route to the solution and a clearer interpretation of risk sensitivity, thereby embedding the classical Kuroda-Nagai change-of-measure approach within a more general framework. An added benefit of this formulation is that it is suitable for implementation via an RL algorithm. A simple implementation on U.S. equity data illustrates the tractability of the framework and numerically confirms the equivalence of the two approaches.
Read the full abstract

Geometric Topology

Remarks on Topological Rigidity of Real Moment-Angle Manifolds

We study topological rigidity of real moment-angle manifolds associated to flag simplicial complexes. Using the cubical geometry arising from the Davis construction, we identify the universal cover with the Davis complex and deduce that it admits a CAT(0) metric. As a consequence, its fundamental group satisfies the Farrell–Jones conjecture. Applying surgery theory, we deduce that real moment-angle manifolds of dimension at least five associated to flag complexes satisfy the Borel Conjecture. We also explain why this rigidity phenomenon is specific to the real case and fails for complex and quaternionic moment-angle complexes.
Read the full abstract

Functional Analysis

Mapping estimates for the $k$-plane transform in Sobolev, Besov, and Triebel–Lizorkin Spaces

We study mapping properties of the $k$-plane transform in Sobolev, Besov, and Triebel–Lizorkin spaces. For $1\le k\le d-1$, the $k$-plane transform integrates a function over $k$-dimensional affine planes in $\mathbb{R}^d$, yielding a function on the affine Grassmannian $\mathcal{G}_{k,d}$. First, we establish Sobolev stability estimates for compactly supported functions, extending classical results of Natterer for the X-ray ($k=1$) and Radon ($k=d-1$) transforms to the general $k$-plane transform. Second, we extend isometry identities for the Radon and X-ray transforms, due to Reshetnyak, Sharafutdinov, and Kindermann–Hubmer, to the $k$-plane transform. Finally, we prove boundedness of the $k$-plane transform in Besov and Triebel–Lizorkin spaces.
Read the full abstract