Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 14 May

Combinatorics

A Study on Type-2 Isomorphic Circulant Graphs: Part 7: $C_{432}(R)$, $C_{6750}(S)$ - each has 2 types of Type-2 isomorphic circulant graphs

In this study, we obtain two families of circulant graphs, (i) family of circulant graphs $C_{432}(R)$, each has isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2 as well as $m$ = 3; and (ii) family of circulant graphs $C_{6750}(S)$, each has isomorphic circulant graphs of Type-2 w.r.t. $m$ = 3 as well as $m$ = 5. This article is the $7^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}.
Read the full abstract

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

Three dimensional simulation of fluid-driven frictional and tensile ruptures on existing discontinuities

We present an implicit, fully-coupled hydro-mechanical solver for the three dimensional simulation of fluid-driven rupture propagation along existing discontinuities. The solver handles simultaneously frictional slip (shear failure) and tensile opening (hydraulic fracture) along arbitrary intersecting fractures and faults in a linearly elastic and impermeable rock matrix. The spatial discretization combines a collocation displacement discontinuity boundary element method for quasi-static elasticity with a Galerkin finite element method for nonlinear pore-fluid diffusion along the discontinuities. Frictional and tensile failure are governed by a poro-elastoplastic cohesive zone like interface law with slip-weakening friction, dilatancy, and tensile strength degradation, integrated via an elastic predictor-plastic corrector scheme. The strong nonlinear coupling between mechanical deformation and fracture permeability is handled via adaptive implicit time-stepping. Efficient block preconditioning of the coupled tangent system, leveraging hierarchical matrix representations of the boundary element operator, is essential to achieve robustness across the full range of fracture behaviors. Accuracy and convergence are demonstrated against a comprehensive suite of analytical and semi-analytical solutions of increasing complexity: fluid-driven frictional ruptures under constant and slip-weakening friction, dilatant ruptures with permeability changes, and penny shaped hydraulic fractures spanning the viscosity-to-toughness transition. The solver is further assessed on two multi-fracture configurations: injection into three intersecting fractures, and a height-confined hydraulic fracture intersecting a strike-slip fault. The proposed framework simultaneously captures frictional slip, dilatancy, permeability evolution, and tensile opening.
Read the full abstract

All authors Brice Lecampion, Sylvain Brisson, Antareep Sarma, Ankit Gupta, Alexis Sáez, Regina Fakhretdinova

Logic

Model-theoretic Tameness in finite extensions of groups

It is shown that finite-index extensions and finite-index subgroups of $\omega$-stable groups can be model-theoretically wild. More precisely, there exists an $\omega$-stable group $G$ such that any given countable first-order structure in a finite language is interpretable both in some finite-index extension of $G$ and in some finite-index subgroup of $G$.
Read the full abstract

Differential Geometry

Solitons for the inverse curve shortening flow on the hyperbolic plane

We study the solitons of the inverse curve shortening flow in the hyperbolic plane with respect to Killing fields: all parabolic fields, and the hyperbolic and elliptic fields with unit translation length and unit angular speed. The three cases reduce to one planar system. Except for a family of horocycles, every soliton has an endpoint at finite distance where the curvature blows up and the curve is a branch of a cusp. In the parabolic and elliptic cases there is a critical value $H$ of the parameter of the family: below $H$ the other end meets the ideal boundary orthogonally, above $H$ it is a second singular endpoint, and at $H$ the curvature tends to $1$. In the hyperbolic case $H=\pi/2$ and the critical solitons are horocycles. These horocycles are the only complete solitons and the only solitons of constant curvature.
Read the full abstract

Differential Geometry

Classification of the ruled surfaces that are critical points of the Dirichlet energy

We classify all ruled surfaces in Euclidean space that are critical points of the Dirichlet energy, obtaining explicit parametrizations of these surfaces.

Analysis of PDEs · Cross-listed from physics.flu-dyn

The radial Newton problem: nonlinear dynamics of minimal resistance in central fields

This paper investigates the nonlinear dynamics of Newton's problem of minimal resistance in radial fields. We move beyond classical translational symmetry to analyze two non-equilibrium scenarios: a scale-invariant free expansion and an incompressible source flow. Our analysis reveals that the scale-invariant model suffers from a symmetry-breaking instability (loss of ellipticity) that necessitates geometric truncation. Conversely, we prove that the incompressible flow acts as a structural regularizer, admitting unique, smooth, and strictly concave solutions. These findings provide new qualitative insights into how physical conservation laws ensure the regularity and symmetry of optimal configurations in high-speed central flows, bridging the gap between variational calculus and the physics of complex systems.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Optimal Pattern Detection Tree for Symbolic Rule-Based Classification

Pattern discovery in data plays a crucial role across diverse domains, including healthcare, risk assessment, and machinery maintenance. In contrast to black-box deep learning models, symbolic rule discovery emerges as a key data mining task, generating human-interpretable rules that offer both transparency and intuitive explainability. This paper introduces the Optimal Pattern Detection Tree (OPDT), a rule-based machine learning model based on novel mixed-integer programming to discover a single optimal pattern in data through binary classification. To incorporate prior knowledge and compliance requirements, we further introduce the Branching Structure Constraints (BSC) framework, which enables decision makers to encode domain knowledge and constraints directly into the model. This optimization-based approach discovers a hidden underlying pattern in datasets, when it exists, by identifying an optimal rule that maximizes coverage while minimizing the false positive rate due to misclassification. Our computational experiments show that OPDT discovers a pattern with optimality guarantees on moderately sized datasets within reasonable runtime.
Read the full abstract

Optimization and Control

Boundary null-controllability for the beam equation with classical structural damping

Let $\Delta$ be the Dirichlet Laplacian on the interval $(0,\pi)$, and let $T>0$. We prove a well-posedness results for the structurally damped beam equation $$u_{tt}+\Delta^2 u-\rho \Delta u_t=0, x\in (0,\pi),t>0$$ with various boundary conditions including $$ u(0,t)=u_{xx}(0,t)=0; u(\pi,t)=f(t),u_{xx}(\pi,t)=0, $$ and $f\in H_0^2(0,T)$ and appropriate initial conditions. Viewing $f$ as a control, we prove null controllability for all $\rho \leq 2$. For $\rho >2$, we show null controllability for arbitrary $T>0$ holds for almost all $\rho$, but fails for a dense subset of $(2,\infty)$. An analagous result is proven for Neumann control.
Read the full abstract

Number Theory

A density version of quaternary Goldbach problem

Let $\mathcal{P}$ denote the set of all primes, and let $\underline\delta(P)$ denote the relative lower density of a subset $P$ in $\mathcal{P}$. Suppose that $P_1, P_2, P_3, P_4$ are four subsets of primes with $\underline\delta(P_1)+\underline\delta(P_2)>1$ and $ \underline\delta(P_3)+\underline\delta(P_4)>1.$ Then for every sufficiently large even integer $n$, there exist primes $p_i \in P_i$ $(i=1,2,3,4)$ such that $n=p_1+p_2+p_3+p_4$. The condition is the best possible.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Automated Curriculum Design for High-dimensional Human Motor Learning

Designing effective practice schedules for high-dimensional motor learning tasks remains a challenge, especially when skill states are unobservable and task performance may not reflect the true learning. We propose an automated curriculum design framework that combines a human motor learning model and personalized real-time skill estimation with Stochastic Nonlinear Model Predictive Control in de-novo (novel) motor learning paradigms. We validated our framework both through simulations and human-subject studies (N = 36) using a hand exoskeleton. Our proposed approach accelerates skill acquisition by $\sim23\%$, and ${\sim17\%}$ when compared to a random curriculum and a performance heuristics-based curriculum, respectively. These significant gains in learning efficiency highlight the potential of model-based, individualized curricula for motor rehabilitation and complex skill training.
Read the full abstract

All authors Ankur Kamboj, Rajiv Ranganathan, Xiaobo Tan, Vaibhav Srivastava

Optimization and Control

Equilibrium for Time-inconsistent Mean Field Games: A Systematic Analysis by Entropy Regularization

This paper studies the existence and approximation of equilibria for general time-inconsistent mean field game (MFG) problems in continuous time. To handle the intricate nonlocal equilibrium Hamilton-Jacobi-Bellman (EHJB) system arising from initial-time dependence, such as non-exponential discounting, we develop a vanishing entropy regularization approach. Using entropy regularization, we first characterize the regularized equilibrium through a coupled exploratory equilibrium HJB (EEHJB) equation and a law-dependent stochastic differential equation. By exploiting Schauder fixed-point arguments and tailored parabolic regularity estimates in a suitable functional space involving both value functions and measure flows, we establish the global existence of regularized equilibria under mild assumptions. We then establish convergence as the entropy regularization vanishes. By employing compactness arguments, Young measure techniques, and a duality tool for divergence-form Fokker-Planck equations, we prove that the regularized equilibria converge, up to subsequences, to a mean-field equilibrium of the original MFG. Furthermore, under entropy regularization, we propose a policy iteration algorithm and establish its convergence under short-time-horizon and weak-terminal-interaction conditions.
Read the full abstract

All authors Erhan Bayraktar, Zhenhua Wang, Xiang Yu, Keyu Zhang

Analysis of PDEs

Well-posedness theorems in fluid-structure interaction: perfectly elastic shells

In this work, we consider the interaction of a 3D incompressible fluid with a 2D flexible shell that occupies (a part of) the boundary of the fluid domain. We assume that the shell is perfectly elastic while the fluid is governed by the Navier–Stokes equations. Consequently, damping within the coupled system comes entirely from the parabolic fluid subsystem. Our main result is the construction of a local-in-time unique strong solution to the system of PDEs. Standard techniques from the literature do not apply here. They are restricted to visco-elastic structures, where the corresponding solid phase is parabolic. Our construction relies on a different method built upon a new estimate for the acceleration of the system. In the case of a 2D viscous incompressible fluid interacting with a 1D perfectly elastic shell we can extend the local solution globally in time (until a possible self-intersection of the shell).
Read the full abstract

All authors Dominic Breit, Prince Romeo Mensah, Sebastian Schwarzacher, Pei Su

Optimization and Control

Convergence of difference inclusions: a diameter criterion and step-size conditions

We study bounded realizations of discrete difference inclusions with set-valued increments and additive errors. Our results have two parts. First, we give a general convergence criterion in which changes in a convergent scalar quantity control the diameters of local sequence segments near an accumulation point. We also develop a stratified descent framework for verifying this control. For convergent realizations, the framework yields a stationarity condition for the limit from outer limits of the scaled update map. When applied to first-order methods for minimizing locally Lipschitz objectives definable in polynomially bounded o-minimal structures, the framework yields convergence to critical points for bounded sequences generated by the inexact subgradient, momentum, and stochastic subgradient methods with step sizes of order $k^{-1}$, under the corresponding error and noise conditions. Second, we study first-order methods with polynomial step sizes of order $k^{-a}$. At the square-summability boundary \(a=1/2\), we construct a locally Lipschitz semialgebraic objective for which the exact subgradient method generates a bounded, nonconvergent sequence whose accumulation points satisfy our active-geometry assumptions. Under these assumptions, bounded sequences generated by the momentum method converge for \(1/2<a\leq1\), while bounded sequences generated by the stochastic subgradient method converge almost surely for \(2/3<a\leq1\). The momentum range is sharp for this method class, while the stochastic range matches recent full-sequence convergence results for smooth nonconvex objectives.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Nearest-Neighbor Radii under Dependent Sampling

Nearest-neighbor methods are fundamental to classical and modern machine learning, yet their geometric properties are typically analyzed under independent sampling. In this paper, we study the nearest-neighbor radii under dependent sampling. We consider strong mixing dependent observations and ask whether dependence changes the scale of nearest-neighbor neighborhoods. We establish distribution-free almost sure convergence under polynomial mixing and sharp non-asymptotic moment bounds under geometric mixing. The moment bounds depend on the local intrinsic dimension rather than the ambient dimension, making the results applicable to high-dimensional data supported on lower-dimensional manifolds. Synthetic experiments and real-world time-series benchmarks illustrate the theory, showing that nearest-neighbor geometry remains informative under dependent sampling.
Read the full abstract

Number Theory

Fibonomial determinants

In this paper, we find several determinants expressing the Fibonomial coefficients. We also give the generating functions, Vandermonde identity, and continued fractions about Fibonomial coefficients.

Analysis of PDEs

The "good" Boussinesq equation on the half-line with Robin boundary conditions

We prove the local Hadamard well-posedness of the “good” Boussinesq equation formulated on the half-line with nonzero Robin boundary conditions. These boundary data involve the Dirichlet and Neumann boundary values as well as the second spatial derivative of the solution evaluated at the boundary. The nonlinear analysis crucially relies on the linear estimates established through the explicit solution formula obtained for the forced linear counterpart of the problem via Fokas's unified transform. The two pieces of initial data and the two pieces of boundary data belong in appropriate Sobolev spaces. The corresponding solution is established in the natural Hadamard solution space of continuous/continuously differentiable functions from a suitable time interval to the Sobolev spaces associated with the two initial data. Furthermore, in line with the well-posedness theory of the Cauchy problem, in the case of low regularity (namely, below the spatial continuity threshold) the solution space is refined by also including an appropriate spatiotemporal Lebesgue space.
Read the full abstract

Information Theory

Secure Joint Source-Channel Coding of Multimodal Semantic Sources

We study the problem of secure joint source-channel coding for multimodal semantic sources transmitted over noisy wiretap channels. The source model consists of $m$ modalities (e.g., image, audio, and sensor data), all represented as random variables. The encoder observes independent and identically distributed samples of an arbitrary non-empty subset of modalities, which are encoded, using wiretap coding with a help of a secret key shared with the legitimate receiver, and transmitted over a discrete memoryless wiretap channel. The legitimate receiver reconstructs all modalities. We extend the rate-distortion-perception characterisation to semantic unimodal and multimodal sources. We establish outer and inner bounds on the tradeoff between transmission rate, key rate, fidelity, and secrecy under per-modality distortion and perception constraints, and per-subset equivocation constraint. The bounds coincide for the less noisy wiretap channels. Our results show that the fundamental limit for secrecy consists of three operationally distinct components: the level of compression of each subset of modalities, the secret key rate, and the statistics of the wiretap channel.
Read the full abstract

Optimization and Control

PI-SONet: A Physics-Informed Symplectic Operator Network for Real-Time Optimal Control of Multi-Agent Systems

Many real-life applications involve controlling high-dimensional multi-agent systems in real-time. Existing optimal control solvers often suffer from the curse-of-dimensionality and require complete rerunning for each new problem setting. We target nonconvex, nonlinear problems in 100s of dimensions by introducing PI-SONet (Physics-Informed Symplectic Operator Network), a structure-preserving operator learning framework for solving parameterized families of optimal control problems and their Pontraygin Maximum Principle (PMP) systems. PI-SONet combines a latent right-space solver with a conditional symplectic operator to produce tractable Hamiltonian trajectories in a computationally efficient auxiliary space and transform them back to physical space. This decomposition yields a single trained operator that approximates the PMP solution map, inherently preserves Hamiltonian structure, and generalizes across unseen problem configurations. Unlike existing methods, which are fundamentally single-instance solvers, PI-SONet achieves sub-second inferences on new problem instances, equating to up to 10,000x speedup over representative baselines. These results suggest that structure-preserving neural operators provide a practical route toward reusable, real-time surrogates for high-dimensional optimal control.
Read the full abstract

All authors Alan John Varghese, Shanqing Liu, Paula Chen, Yaochen Zhu, Jérôme Darbon, George Em Karniadakis

Information Theory · Cross-listed from eess.SP

Analog RF Computing: A New Paradigm for Energy-Efficient Edge AI Over MU-MIMO Systems

Modern edge devices increasingly rely on neural networks for intelligent applications. However, conventional digital computing-based edge inference requires substantial memory and energy consumption. In analog radio frequency (RF) computing, a base station (BS) encodes the weights of the neural networks and broadcasts the RF waveforms to the clients. Each client reuses its passive mixer to multiply the received weight-encoded waveform with a locally generated input-encoded waveform. This enables wireless receivers to perform the matrix-vector multiplications (MVMs) that account for most of the computation burden in edge inference with ultra-low energy consumption. Unlike conventional downlink transmissions which are optimized for communications, analog RF computing requires a computing-centric physical layer that controls both the analog MVM accuracy and the energy consumption for inference. Motivated by this, in this paper, we propose a physical layer design framework for analog RF computing in MU-MIMO wireless systems. We derive tractable models for computing accuracy and energy consumption for inference, formulate a joint BS beamforming and client-side scaling problem subject to computing accuracy, transmit power, and hardware constraints, and develop a low-complexity algorithm to solve the non-convex problem. The proposed design provides client- and layer-specific accuracy control for both uniform- and mixed-precision inference. Simulations under 3GPP specifications show that analog RF computing can significantly reduce client-side energy consumption by nearly two orders of magnitude compared to digital computing, while mixed-precision inference requires even lower energy consumption than uniform-precision inference. Overall, these results establish analog RF computing over wireless networks as a promising paradigm for energy-efficient edge inference.
Read the full abstract

Optimization and Control

Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization

We analyze convergence rates of norm-minimization-based outer approximation algorithms for convex vector optimization when the scalarization uses an $\ell_p$ norm with $p \in (1,\infty)$. While the Euclidean case ($p=2$) achieves the optimal rate $O(k^{2/(1-q)})$, the behavior under general $\ell_p$ norms has remained open. A direct approach via the modulus of smoothness yields only the weaker exponent $\min(p,2)$, which degrades for $1 < p < 2$. We prove that the Hausdorff approximation error satisfies $\delta_H(P_k, A) = O(k^{2/(1-q)})$ for every $p \in (1,\infty)$, where $q$ is the number of objectives and $k$ is the iteration count. The proof introduces a Euclidean intermediary technique that exploits the ambient inner product structure of $\R^q$ to obtain a quadratic bound on the hyperplane distance, bypassing the $\ell_p$ smoothness limitation; norm equivalence then converts this to any $\ell_p$ metric at the cost of only a dimension-dependent constant, not a loss of exponent. Numerical experiments confirm the $p$-independent rate predicted by the theory.
Read the full abstract

Combinatorics

A Subtraction Nim with a Pass

We consider a subtraction Nim with subtraction set {s_1,s_2,s_3={2,4n,4n+2}, where n is a positive integer such that n >= 3. We do not treat the case that n=1 or n=2 in this article. We show that this game satisfies the reverse-mex property of Grundy numbers, i.e., G(x)=mex{G(x+s_1), G(x+s_2), G(x+s_3)}, where the mex is taken over successors rather than predecessors. We modify the rule of this subtraction Nim to allow a one-time pass, that is, a passing move usable at most once during the game, unavailable from terminal positions; once used by either player, it becomes unavailable. In classical Nim, the introduction of a pass move complicates the game, and finding a formula that describes the set of P-positions in traditional three-pile Nim with a pass remains an important open question. In the case of subtraction Nim with a pass, however, the introduction of a pass move does not complicate the game. We prove that this game still satisfies the reverse-mex property of Grundy numbers when a pass move is available.
Read the full abstract

Optimization and Control

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization

We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation error in a fixed Euclidean norm. This enables the algorithm to exploit problem geometry dynamically. Our approach rests on two theoretical foundations. First, we prove that the improved Euclidean convergence rate $O(k^{2/(1-q)})$ – previously known only for the standard $\ell_2$-norm – extends to all fixed inner-product norms. Second, we establish a dispersion theorem showing that the cut-normals generated by the algorithm naturally spread across all directions when the upper image has a strictly convex boundary with bounded curvature. This geometric condition guarantees that the adaptive metric remains well-conditioned throughout execution. Building on these results, we derive explicit convergence bounds that quantify how metric conditioning influences the Hausdorff error estimates. Numerical experiments on three test problems validate the theoretical convergence rate; on the problems whose Pareto fronts have sufficient curvature, the adaptive metric additionally reduces the iteration count relative to the fixed Euclidean norm. Our results provide a rigorous foundation for adaptive metric selection in convex vector optimization.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.NC

Approximate Macroscopic Dynamics of Spiking Neural Networks Based on Solutions to the Transport Equation

Firing rate fluctuations in neural populations are observed experimentally over multiple time scales, in single neurons, across trials when elicited by stimuli, and across populations. In this work, we examine how firing rate fluctuations emerge in networks of coupled integrate-and-fire neurons as a function of the initial distribution of voltages in networks with time-varying inputs. We analytically derive an approximation for the evolution of the instantaneous population rate or flux as a function of the initial voltage distribution through a Fokker-Planck system. Unlike earlier mean field approaches based on asynchronous or constant flux steady state solutions to the Fokker-Planck system, the approach considered here is based on the transport solution to the advection equation and assumes that the time-varying inputs are slow, and the neurons are in the excitation-driven regime. The transport mean field system predicts how firing rate fluctuations emerge from a dynamic interaction between time-varying inputs, initial densities, and coupling in populations of neurons.
Read the full abstract

Number Theory

L-indistinguishability for covering groups of algebraic tori

A global packet may simultaneously contain an automorphic representation and a non-automorphic representation. The global $\mathcal S$-group is expected, and known in some cases, to specify the automorphic representations in each global packet. For a covering group of an algebraic torus, it is not obvious from the definition whether the analogue of a global $\mathcal S$-group has finite order. In this paper, we verify this finiteness for a Brylinski-Deligne covering group of a torus.
Read the full abstract

Classical Analysis and ODEs

Optimal $C^{1,1}$ and Quasi-Optimal $C^2$ Monotone Interpolation with Curvature Control

We study monotone Hermite interpolation on an interval, where both function values and first derivatives are prescribed at the nodes. Among all $C^{1,1}$ interpolants, we seek one with optimal curvature, measured by $\|F''\|_{L^\infty}$. In this paper, we analyze the limitations of some classical techniques, and provide an explicit optimal construction in $C^{1,1}$ given by quadratic splines by studying the optimal velocity profile. Moreover, given $E = \{x_1,\cdots,x_N\}$ and $f: E\to \mathbb{R}$ (without derivatives), we also provide a formula to compute the corresponding trace seminorm \[ \inf\Bigl\{ \|F''\|_{L^\infty} : F(x)=f(x) \text{ on $E$ and } F'\ge 0 \text{ everywhere} \Bigr\}. \] In addition, we also describe how to mollify $C^{1,1}$ solutions to $C^2$ while preserving monotonicity and sacrificing a controlled amount of optimality.
Read the full abstract

Information Theory

Capacity Characterization and Formation Optimization for Multi-User MIMO Communications with UAV Swarm

For a multi-user multiple-input multiple-output (MU-MIMO) wireless communication system, imagining that the locations of the users are now fully controllable, what is the maximum sum-capacity, and what are the corresponding optimal user locations? While these questions are irrelevant in conventional human-centric communications with random user mobility, they become critically important for emerging applications involving ground or aerial robots. This paper addresses these fundamental questions in the context of MU-MIMO communications with an unmanned aerial vehicle (UAV) swarm acting as the users. To this end, we first derive closed-form expressions for the sum-capacity of MU-MIMO UAV swarm communications. Our results reveal that, compared to conventional MU-MIMO systems, the additional degrees of freedom provided by the coordinated mobility of the UAV swarm yields substantial capacity enhancement. Specifically, when the base station (BS) is equipped with an $M$-element uniform linear array (ULA), the full spatial multiplexing gain and beamforming gain, both equal to $M$, can be achieved simultaneously. For a BS with a uniform planar array (UPA), we show that asymptotically $\frac{\pi M}{4}$ users can simultaneously enjoy the full beamforming gain $M$. Furthermore, we propose a novel framework to optimize UAV swarm formation for maximizing the sum-capacity achieved by successive interference cancellation (SIC) and maximizing the sum-rate via treating interference as noise (TIN), taking into account practical considerations such as collision avoidance and swarm cohesion constraints. By exploiting the manifold structure of the array response vectors with respect to UAV directions, we develop an efficient algorithm to solve the resulting non-convex formation optimization problems. Extensive simulation results demonstrate that the proposed algorithms achieve near-optimal performance.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Policy Optimization in Hybrid Discrete-Continuous Action Spaces via Mixed Gradients

We study reinforcement learning in hybrid discrete-continuous action spaces, such as settings where the discrete component selects a regime (or index) and the continuous component optimizes within it – a structure common in robotics, control, and operations problems. Standard model-free policy gradient methods rely on score-function (SF) estimators and suffer from severe credit-assignment issues in high-dimensional settings, leading to poor gradient quality. On the other hand, differentiable simulation largely sidesteps these issues by backpropagating through a simulator, but the presence of discrete actions or non-smooth dynamics yields biased or uninformative gradients. To address this, we propose Hybrid Policy Optimization (HPO), which backpropagates through the simulator wherever smoothness permits, using a mixed gradient estimator that combines pathwise and SF gradients while maintaining unbiasedness. We also show how problems with action discontinuities can be reformulated in hybrid form, further broadening its applicability. Empirically, HPO substantially outperforms PPO on inventory control and switched linear-quadratic regulator problems, with performance gaps increasing as the continuous action dimension grows. Finally, we characterize the structure of the mixed gradient, showing that its cross term – which captures how continuous actions influence future discrete decisions – becomes negligible near a discrete best response, thereby enabling approximate decentralized updates of the continuous and discrete components and reducing variance near optimality. All resources are available at github.com/MatiasAlvo/hybrid-rl.
Read the full abstract

Combinatorics

Graceful Labeling of Two Families of Spiders

A graceful labeling of a graph $G$ is an injective function $f : V(G) \to \{0, \ldots, |E(G)|\}$ such that $\{\,|f(u)-f(v)| : uv \in E(G)\,\} = \{1, \ldots, |E(G)|\}$. If such a labeling exists, then we call $G$ graceful. Introduced by Rosa in 1967, graceful labeling has been widely studied, and the Graceful Tree Conjecture asserts that every tree is graceful. The conjecture is known to hold for several classes of trees, including caterpillars, trees with at most four leaves, trees of diameter at most five, and certain spiders. An important subclass is that of \emph{$\alpha$-labelings}, where a graceful labeling $f$ admits an integer $\alpha$ such that each edge joins a vertex with label at most $\alpha$ to one with label greater than $\alpha$. A result from 1982 by Huang, Kotzig, and Rosa shows that if $H$ has an $\alpha$-labeling with a vertex $u$ labeled $0$ or $\alpha$, and $G$ has a graceful labeling with a vertex $v$ labeled $0$, then identifying $u$ and $v$ yields a graceful graph, though this requires a $0$-labeled vertex in $G$. We prove a related result that relaxes this condition: if $G$ has a graceful labeling $f$ such that $f(u)+\lfloor n/2 \rfloor + 1 \le n$ and $n \not\equiv 1 \pmod{4}$, where $u\in V(G)$ and $n\ge 2$ is an integer, then joining $u$ to an end vertex of the vertex-disjoint $n$-vertex path $P_n$ yields a graceful graph. As an application, we show that any spider with legs $L_1,\ldots,L_s$ ($s \ge 1$) satisfying $|E(L_{2})| \ge 2|E(L_1)|+ 4$ and $|E(L_{i+1})| \ge 2|E(L_i)|+ 2$ for $i \in \{2,\ldots, s-1\}$ is graceful. Furthermore, we give an explicit graceful labeling for spiders with one leg of arbitrary length and all others of length at most two such that the center is labeled by $0$. This labeling enables the construction of larger graceful spiders by attaching paths at the center.
Read the full abstract

Number Theory

How Twist Class Redundancy Drives the Prediction of Traces of Frobenius of Elliptic Curves

Recent interest in applying machine learning methods to predict invariants of mathematical objects has yielded models with surprisingly strong performance, including those predicting traces of Frobenius for elliptic curves. We demonstrate that the underlying datasets contain significant redundancy within quadratic twist classes, which alone is sufficient to produce highly accurate predictions. To ensure future models capture new arithmetic properties rather than potentially exploiting these dataset artifacts, we introduce a benchmark dataset consisting exclusively of unique twist class representatives.
Read the full abstract

Algebraic Geometry

Degeneration Theorems of Connes and Feigin–Tsygan Type in Mixed Characteristic, with q-Analogues

We prove mixed-characteristic analogues of the Connes and Feigin–Tsygan degeneration theorem. Let $W=W(k)$ be the Witt vectors of a perfect field of characteristic $p>0$. For a smooth proper variety $X$ over $W$, the de Rham-to-$\HP$ spectral sequence is split degenerate under the small-dimension hypothesis $dim(X/W)<p-1$. More generally, if $X$ is smooth and proper over the ring of integers $O_K$ of a finite extension of $\mathrm{Frac}(W)$ with ramification index $e$, we prove the corresponding split degeneration under $2e dim(X/O_K)<p-1$. Under the same ramification hypothesis, we also prove split degeneration of the $Ainf$-to-$TP$ spectral sequence. Finally, after inverting an explicit factorial, we obtain a topological $q$-de Rham analogue.
Read the full abstract