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)

Friday 10 April

Optimization and Control · Cross-listed from cs.LG

Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization

Automated algorithm selection for continuous black-box optimization depends on what information is acquired from a problem under a limited probing budget and how that information is represented. We introduce a geometric probing framework that samples multi-scale two-dimensional restrictions across location, orientation, and scale, and encodes their normalized objective-value maps with validity-aware convolutional processing and permutation-invariant aggregation. We compare our method with classical ELA and Deep-ELA under matched budgets, within-problem and problem-level transfer, fusion, representation, and budget analyses. We further disentangle probe acquisition from probe processing by controlled ablation. The results show that the proposed visual representation exposes solver-performance information complementary to ELA-family features and retains a relative advantage for relative expected runtime under problem-level transfer, while greater coverage, feature richness, or predictive accessibility alone does not guarantee better selection.
Read the full abstract

All authors Jiabao Brad Wang, Xiang Shi, Yiliang Yuan, Mustafa M{\i}s{\i}r

Dynamical Systems

On stationary actions of locally compact groups and their Radon-Nikodym cocycles

We study stationary actions of locally compact measured groups through the structure and regularity of their Radon-Nikodym cocycles. We start with two dynamical consequences of stationarity. Extending a theorem of Furstenberg-Glasner from discrete groups to noncompact locally compact groups, we show that every stationary action is conservative. Thus stationary actions are never of type I. We then show that an ergodic stationary action admitting an absolutely continuous invariant sigma-finite measure is in fact probability preserving. Thus stationary actions are never of type II_infty. Using a construction of Katznelson-Weiss and Vaes-Verjans, we show that if a group admits a stationary action of type III_1, then it admits stationary actions of every type III_lambda. The second part concerns the regularity of the Radon-Nikodym cocycle. We introduce the harmonic majorant on normalized positive harmonic functions, which gives Harnack-type control of Radon-Nikodym derivatives of stationary actions. For compactly supported probability measures with an Lp-density for some p>1, we prove that the harmonic majorant is finite and locally bounded. As a consequence, such measured groups admit a universal compact Radon-Nikodym model: a single compact G-space with a continuous cocycle into which stationary actions can be realized, so that the ambient cocycle gives a version of its Radon-Nikodym cocycle. This strengthens the Mackey-Varadarajan compact model theorem by incorporating the Radon-Nikodym cocycle into the model. By contrast, we construct a random walk on the real affine group whose Poisson boundary fails Kaimanovich's SAT* property: the Poisson kernel is unbounded arbitrarily close to the identity. Therefore, Harnack's inequality already fails for positive harmonic functions. In particular, this Poisson boundary admits no topological model with continuous Poisson kernel.
Read the full abstract

Probability

A counter-example linked to Gaussian convex hulls

We consider the sequence of independent centered Gaussian random elements of a separable Banach space and their consecutive closed convex hulls. If inicial elements converge weakly to some limite, then, as shown in Davydov- Paulauskas (2024), its normalized convex hulls converge, with probability 1, to the concentration ellipsoid of the limiting distribution. The goal of the present note is to show that if the assumption of weak convergence of the initial sequence is relaxed, than the limit set can be an arbitrary convex compact set.
Read the full abstract

Statistics Theory

Node-Private Community Detection in Stochastic Block Models

We study community detection in stochastic block models under pure node-level differential privacy, a stringent notion that protects the participation of an individual together with all of their incident edges. This setting is substantially more challenging than edge-private community detection, since modifying a single node can affect linearly many observations. On the algorithmic side, we analyze a node-private estimator based on the exponential mechanism combined with an extension lemma, and show that exact recovery remains achievable. In the standard sparse regime with logarithmic average degree and a fixed number of communities, our results imply that a logarithmic privacy budget suffices to obtain nontrivial recovery guarantees. On the lower bound side, we show that this logarithmic scaling is in fact unavoidable: any pure node-private method must fail to achieve polynomially small exact-recovery error, or polynomially small expected mismatch, unless the privacy budget is at least of this order. Moreover, in the regime of super-logarithmic privacy budgets, our upper and lower bounds yield a matching two-term characterization of the minimax risk, with one term governed by the non-private statistical signal and the other by the privacy budget; these match up to universal constants in the exponents. Taken together, our results identify an inherent logarithmic privacy cost in node-private community detection, absent under edge differential privacy, and provide a precise rate-level characterization of the tradeoff between node privacy and SBM recovery.
Read the full abstract

Optimization and Control

A Bayesian Perspective on the Data-Driven LQR

The data-driven linear quadratic regulator (ddLQR) is a widely studied control method for unknown dynamical systems with disturbance. Existing approaches, both indirect, i.e., those that identify a model followed by model-based design, and direct, which bypasses the identification step, often rely on the certainty-equivalence principle and therefore do not explicitly account for model uncertainty. In this paper, we propose a Bayesian formulation for both indirect and direct ddLQR that incorporates posterior uncertainty into the control design. The resulting expected cost decomposes into a certainty-equivalence term and a variance-dependent term, providing a principled interpretation of regularization. We further show that the indirect and direct formulations are equivalent under this perspective. The resulting direct method admits a tractable semidefinite program whose size is independent of the data length. Numerical simulations demonstrate improved optimality gap and closed-loop stability, particularly in low-data regimes.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CE

Modeling and Simulation of Nitrogen Generation by Pressure Swing Adsorption for Power-to-Ammonia

Power-to-ammonia (P2A) provides a carbon-free alternative to conventional ammonia production by replacing fossil-based feedstocks with electrolytic hydrogen and nitrogen from air separation. For decentralized P2A systems, pressure swing adsorption (PSA) offers a flexible alternative to cryogenic air separation. However, its industrial implementations are largely proprietary, and open, first-principles models capable of simulating its cyclic, nonlinear transport are scarce in literature. This work presents a first-principles, dynamic, one-dimensional model of a PSA superstructure for nitrogen generation, formulated with thermodynamically consistent equations of state, coupling multicomponent mass, energy, and momentum balances with kinetically limited adsorption on carbon molecular sieves. The resulting system of partial differential-algebraic equations (PDAEs) is semi-discretized using the finite volume method, integrated using diagonally implicit Runge-Kutta methods, and cyclic steady states (CSS) are computed via shooting-based solution methods. The framework is implemented in Julia, combining analytical derivatives with automatic differentiation and utilizing sparse linear algebra for efficient solution of the arising large nonlinear systems. The framework is demonstrated on a two-bed PSA cycle for air separation, comparing spatial and temporal discretization strategies, CSS solution methods, and the effects of ideal versus real-gas thermodynamics on predicted nitrogen purity and recovery. The proposed framework establishes an extensible basis for PSA simulation and optimization.
Read the full abstract

Analysis of PDEs

The Neumann problem for a class of degenerate Hessian quotient type equations

In this paper, we obtain some important inequalities for a class of Hessian quotient type operators $\frac{\sigma_k(\Lambda(D^2u))}{\sigma_l(\Lambda(D^2u))}$, which can be regarded as a generalization of the classical Hessian quotient operators. As an application, we establish global a priori estimates and prove an existence theorem for the Neumann problem of the corresponding degenerate Hessian quotient type equation, in which the admissible range of $k$ is extended to $0< k \leq C^\mathbf{p}_n$ with $1 \leq \mathbf{p} \leq n-1$.
Read the full abstract

Probability

Uniform asymptotics for a multidimensional renewal risk model with random number of delayed claims and multivariate subexponentiality

In this paper we examine a multivariate risk model, with common renewal counting process, constant interest rate, and each claim vector is accompanied by a random number of delayed claim vectors. The interest is focused on the asymptotic behavior of the entrance probability of the discounted aggregate claims into some rare-sets, over a finite and an infinite time horizon. Our results study thecase where the main claims and the delayed claims have in some sense, asymptotic equivalent tails, but also the case where the delayed claims are negligible with comparisons with the main claims. More precisely, our estimations over finite time horizon are equipped with local uniformity, and are valid under the assumption of multivariate subexponential distributions for the claim distributions. On the case of infinite time horizon we need a mild restriction on the distribution class of multivariate subexponential distributions with positive lower Karamata index. The asymptotic relations reflect completely as all the sources of randomness, under the concrete rare-sets A, and the different dependence structures as well, without loosing elegance in spite of their generality. Further, we provide some more explicit formulas, together with relaxations of some assumptions, for the claim distributions from the multivariate regular variation. For the proof of the main results on infinite time case and for the construction of examples of multivariate distributions we need some closure properties of subexponential distributions with positive lower Karamata index. Especially, we present some necessary and sufficient conditions for the closure property with respect to convolution and some sufficient conditions for the closure property with respect to product convolution. Finally, we carry out some numerical studies to show the accuracy of our asymptotic estimations.
Read the full abstract

Optimization and Control

Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems

Scenario-based optimization problems can be solved via Benders decomposition, which separates first-stage (master problem) decisions from second-stage (subproblem) recourse actions and iteratively refines the master problem with Benders cuts. In conventional Benders decomposition, all subproblems are solved at each iteration. For problems with many scenarios, solving only a selected subset can reduce computation. We quantify the potential in selecting only those subproblems that yield cuts, and develop subproblem scoring and selection strategies. The proposed multi-criteria scoring methods combine historical subproblem performance metrics with problem-specific features, trained online via logistic regression to adapt to the changing likelihood of subproblem usefulness. Multiple stopping criteria balance exploration and exploitation: cut limits, proportional solve limits, and score thresholds. We evaluate our approach on a variant of the survivable network design problem, which serves as a testbed due to its natural decomposition into many subproblems of varying importance. Computational experiments on 135 test instances demonstrate the potential and practical performance of subproblem selection. Analysis reveals that 52.1% of all subproblems solved are unnecessary (they contribute no cuts and occur outside cut-free rounds). An oracle with perfect foresight reduces total solve times by 34.4%. Random selection performs significantly worse than full enumeration, showing that naive strategies can degrade performance. Our best-scoring and selection method achieves statistically significant improvements in both runtime and primal-dual integrals. These results provide empirical evidence that informed subproblem selection can improve Benders decomposition in this setting, while highlighting challenges in developing reliable prediction models.
Read the full abstract

Algebraic Geometry

Recent progress on the Minimal Model Program for foliations

We survey recent progress on the birational geometry of foliations on complex varieties. We focus on the MMP viewpoint: singularities, adjunction and applications to the MMP for foliations on surfaces and to the existence of flips on threefolds.

Information Theory · Cross-listed from cs.NI

Generative AI Agent Empowered Power Allocation for HAP Propulsion and Communication Systems

High altitude platforms (HAPs) are emerging as a key enabler for 6G coverage, yet limited energy must be split between propulsion and communications. Most prior HAP studies ignore propulsion power or rely on surrogates that miss hull-propeller interference, leading to misestimated communication power budgets and degraded beamforming. More importantly, HAP power allocation is intrinsically a multi-system, multidisciplinary problem in which aerodynamics, propulsion-system efficiency, and communication-system performance (quality of service (QoS) and energy efficiency (EE)) are tightly coupled.To address these challenges, this paper designs an interactive generative artificial intelligence (AI)-empowered HAP power allocation agent.By interacting with the AI agent, we develop an accurate propulsion power consumption model that takes into account the aerodynamic interference between the HAP's hull and the propeller. Assisted by the AI agent, we further formulate a HAP beamforming problem to improve user QoS and enhance the EE of the HAP communication system.This paper also proposes a QoS-enhanced energy-efficient (Q3E) beamforming algorithm to solve the formulated problem.Simulation results demonstrate the accuracy of the propulsion-power model and the effectiveness of the Q3E algorithm.
Read the full abstract

All authors Xiaoyu Xing, Dingyi Lu, Peng Yang, Zehui Xiong, Xianbin Cao, Tony Q. S. Quek

Group Theory

Spectral Dehn functions and a characterisation of word-hyperbolicity

We introduce a spectral Dehn function \[ \Lambda_{\mathcal{P}}(n):=\inf \lambda_1(\Delta), \] where $\lambda_1(\Delta)$ is the first Dirichlet eigenvalue of the random-walk Laplacian on a van Kampen diagram $\Delta$, and the infimum runs over area-minimising diagrams with boundary length at most $n$. We prove a spectral-isoperimetric inequality relating $\Lambda_{\mathcal{P}}$ to the Dehn function, and show that its degree-free face-dual variant $\Lambda^\ast_{\mathcal P}$ characterises word-hyperbolicity: a finitely presented group is word-hyperbolic if and only if \[ \inf_n \Lambda^\ast_{\mathcal{P}}(n)>0. \] Every disk diagram satisfies a diagramwise filling-length bound \[ \mathrm{FL}_b(\Delta)\cdot \operatorname{Area}(\Delta) \ge c/\lambda_1(\Delta); \] combined with a discrete Faber-Krahn inequality, this yields the sharp exponent $1/2$ in the quadratic case, attained by rectangular commutator grids over $\mathbb Z^2$. By passing to the free completion and introducing a hole-free-ancestor hereditary quasi-minimality condition, we obtain a spectral filling profile whose positivity criterion is a quasi-isometry invariant of finitely presented groups and again characterises word-hyperbolicity. The resulting profile carries finer information than the Dehn function: it separates presentations within the linear Dehn class.
Read the full abstract

Analysis of PDEs

Weighted and unweighted regularity of bilinear pseudo-differential operators with symbols in general Hörmander classes

This paper investigates the boundedness of bilinear pseudo-differential operators with symbols in the Hörmander class $BS_{\varrho,\delta}^m(\mathbb{R}^n)$ in the previously unexplored regime $0 \leq \varrho < \delta < 1$. We establish boundedness from $H^p(\mathbb{R}^n) \times H^q(\mathbb{R}^n)$ to $L^r(\mathbb{R}^n)$ (with $L^r$ replaced by $\mathrm{BMO}$ when $p=q=r=\infty$) under the probably optimal condition on the order $$m \leq m_\varrho(p,q) - \frac{n\max\{\delta-\varrho,0\}}{\max\{r,2\}},$$ where $m_\varrho(p,q)$ is the critical order in the case $0\leq\delta\leq\varrho<1.$ Furthermore, we develop refined pointwise estimates via sharp maximal functions, establishing that for $m \leq -n(1-\varrho)(\frac{1}{\min\{r_1,2\}}+ \frac{1}{\min\{r_2,2\}})$ with $1<r_{1},r_{2}<\infty$, the bilinear operators satisfy $$M^\sharp T_a(f_1,f_2)(x) \lesssim \mathcal{M}_{\vec{r}}(f_1,f_2)(x).$$ This extends the parameter range from the restrictive condition $0 \leq \delta \leq \varrho < 1$ to the general setting $0 \leq \varrho \leq 1$, $0 \leq \delta < 1$ with $\delta > \varrho$ permitted, and generalizes previous results of Park and Tomita to distinct exponent pairs. Consequently, we obtain weighted norm inequalities for bilinear pseudo-differential operators under multilinear $A_{\vec{p},(\vec{r},\infty)}$ weights.
Read the full abstract

Combinatorics

On roots of domination polynomials for friendship and book graphs

This study examines the domination polynomials of friendship graphs and book graphs, focusing on unanswered questions related to these families [Alikhani, Brown and Jahari, on the domination polynomials of friendship graphs, Filomat 30(1) (2016) 169–178]. For the friendship graph $F_n$, with even $n$, we show that the polynomial $D(F_n,x)$ has exactly three real zeros: $0$ and two simple zeros in the intervals $(-2,-1)$ and $(-1,0)$. We further show that these two nonzero zeros have monotonic variation and converge to $-1-\frac{1}{\sqrt2}$ and $-1+\frac{1}{\sqrt2}$, respectively. We obtain the quantitative approximation $(|z|-1)^2\log |z|\le n$ for any complex zeros of $D(F_n,x)$, resulting in the explicit bound $|z|\le 1+\sqrt{\tfrac{n}{\log 2}}$. For book graphs $B_n$, we ascertain the comprehensive limit set of domination roots and establish results about the presence of real roots contingent on parity. We provide a partial answer to the integer-root an issue by establishing that friendship and book graphs have no nonzero integer domination roots, whereas for corona families, the only nonzero integer root is $-2$.
Read the full abstract

Optimization and Control · Cross-listed from cs.CE

Scale-invariant projection optimization in tomographic volumetric additive manufacturing

Tomographic volumetric additive manufacturing (TVAM) requires projection patterns that achieve high in-part fidelity while suppressing unintended exposure outside the target. We present a scale-invariant projection optimization framework (SiPO) that decouples projection shape from absolute dose scaling. The method formulates projection design as a linear-fractional program based on normalized conformity and spillage metrics, which is converted into a linear program via the Charnes-Cooper transformation. Two practical deterministic cases are introduced for process control: minimizing dose spillage under strict material tolerances and maximizing target conformity under hard inhibition constraints. A matrix-free primal-dual hybrid gradient solver enables large-scale implementation. Numerical results demonstrate that the framework provides a clear trade-off between target fidelity and process separation and remains effective under 3D blur-aware forward models.
Read the full abstract

Combinatorics

Wiener and Average Distance of Irregular Square-Cell Configuration

A subgraph of the square lattice with all of its inner faces being 4-cycles is called a square-cell configuration. Prior work has provided explicit expressions for the total and average distances between vertex pairs in symmetric square-cell configurations, including well-structured families such as hexagonal square-cell configurations $H(n)$, trapezium square-cell configurations $T(n,k)$, and bitrapezium square-cell configurations $BT(n,k_1,k_2)$. In this article, we further extend the square-cell configuration from regular boundaries to irregular boundaries, which do not exhibit complete regularity or symmetry in their structure. We find the generalized expressions for the Wiener index and average distance of such irregular configurations, incorporating combinatorial and structural variations. Our results demonstrate how irregularity affects the growth and distribution of pairwise distances and provide a unifying framework that includes both symmetric and asymmetric square-cell graphs as exceptional cases. This generalization provides novel insights into the structural behaviour of square-cell frameworks characterized by complex or perturbed geometries.
Read the full abstract

All authors S. Prabhu, Sandi Klavžar, M. Anitha, M. Arulperumjothi, Paul Manuel

Classical Analysis and ODEs

Adams type Dunkl Stein-Weiss inequality on Dunkl Morrey spaces on the real line

In this paper, we study the weighted boundedness of the Dunkl fractional integral operator (i.e., Dunkl Stein-Weiss inequality) associated with the Dunkl operator on $\mathbb{R}$. Indeed, we obtain the Adams-type Dunkl Stein-Weiss inequality on Dunkl-Morrey spaces. Our result extends the classical Adams type Stein-Weiss inequality on Morrey space result to the Dunkl setting. Furthermore, we establish the weighted boundedness of the Dunkl fractional maximal function on Dunkl Morrey spaces.
Read the full abstract

Geometric Topology

Equivariant Unknotting Number and Involutive Khovanov Homology

We demonstrate that the equivariant unknotting number $\widetilde{u}(K)$ of a strongly invertible knot $K$ is bounded below by the $H$-torsion order $\widetilde{\mathrm{ord}}(K)$ of the involutive Bar-Natan homology $\widetilde{\mathrm{BN}}(K)$. This result serves as an equivariant analogue to the bound established by Alishahi. As an application, we identify five strongly invertible prime knots with crossing numbers at most $9$ for which the strict inequality $u(K) < \widetilde{u}(K)$ holds.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Online Quantile Regression for Nonparametric Additive Models

This paper introduces a projected functional gradient descent algorithm (P-FGD) for training nonparametric additive quantile regression models in online settings. This algorithm extends the functional stochastic gradient descent framework to the pinball loss. An advantage of P-FGD is that it does not need to store historical data while maintaining $O(J_t\ln J_t)$ computational complexity per step where $J_t$ denotes the number of basis functions. Besides, we only need $O(J_t)$ computational time for quantile function prediction at time $t$. These properties show that P-FGD is much better than the commonly used RKHS in online learning. By leveraging a novel Hilbert space projection identity, we also prove that the proposed online quantile function estimator (P-FGD) achieves the minimax optimal consistency rate $O(t^{-\frac{2s}{2s+1}})$ where $t$ is the current time and $s$ denotes the smoothness degree of the quantile function. Extensions to mini-batch learning are also established.
Read the full abstract

Information Theory

From Distance to Angle: One-Shot Detection Under Isotropic Multivariate Cauchy Noise

We study one-shot detection under isotropic multivariate Cauchy noise using finite constellations, with emphasis on the geometric mechanisms governing symbol-level reliability. Under isotropic Cauchy noise, the maximum-likelihood rule induces the same Euclidean Voronoi decision regions as in the Gaussian case, so the distinction lies not in the decision geometry itself but in how probability mass is distributed over these fixed regions. In the small-noise regime, we derive a reciprocal distance-spectrum upper bound for the symbol error probability (SEP), showing that this bound, and the associated reliability descriptor, retain a longer-range dependence on the global constellation geometry than under additive white Gaussian noise. In the large-noise regime, we prove that the correct-decision probability converges to a limit determined solely by the angular measure of the associated Voronoi recession cone. These results formalize a regime-dependent transition from bound-based distance descriptors to angle-based reliability descriptors under heavy-tailed noise. Beyond asymptotic characterization, we show that these descriptors also admit a lightweight design interpretation for planar constellations under a common average power budget. The theory is further illustrated through an asymmetric four-point example exhibiting geometric collapse, a standard four-point Quadrature Amplitude Modulation (4QAM) sanity check, and finite-$\gamma$ numerical validation for both asymptotic regimes, together with descriptor-guided design comparisons that reveal collapse avoidance and reciprocal-distance burden as practically meaningful screening criteria.
Read the full abstract

Analysis of PDEs

Global existence of classical solutions for the multi-dimensional compressible Navier-Stokes-Poisson equations on solid balls for arbitrary spherically symmetric large initial data

Whether the 3D compressible Navier-Stokes-Poisson equations admit global classical solutions for general large initial data has long been a challenging open problem. In this paper, we provide an affirmative answer to this question under spherical symmetry on solid balls . Specifically, we consider the initial-boundary value problem for the multi-dimensional compressible equations with density-dependent viscosity coefficients satisfying the BD-type entropy equality, namely, assuming $\mu=\rho^{\alpha},\ \lambda=(\alpha-1)\rho^{\alpha}$ with $N=2, \alpha\in (\frac{1}{2},1]$ and $N=3, \alpha\in (\frac{5}{6},1]$, we establish the global existence of spherically symmetric classical solutions to the compressible Navier-Stokes-Poisson equations for both gaseous stars and plasmas with arbitrarily large initial data on solid balls. Our key observation lies in successfully handling the singularity at the center of the ball. By controlling the growth orders of the density and the gravitational potential at the central singularity, leveraging the structural advantages of the BD entropy and spherical symmetry, and fully exploiting the coupling between the effective velocity and the velocity, we establish $L^\infty$ estimates for the key quantities, which in turn yield upper and lower bound estimates for the density. This can be regarded as the first result on the existence of global classical solutions for arbitrarily large initial data to the compressible Navier-Stokes-Poisson equations in a truly multi-dimensional domain with high-dimensional features.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Linear Systems as Representations of Time Groups

In this paper, we develop a representation-theoretic formulation of discrete-time linear systems. We show that such systems are naturally viewed as representations of time groups acting on vector spaces, thereby endowing the state space with a canonical algebraic structure. This perspective provides a unified framework for linear systems over different fields, in which familiar structural properties arise from the underlying representation. In particular, invariant decompositions of the state space correspond to invariant subrepresentations, while the distinctions between real, complex, and finite-field systems emerge from the algebraic properties of the base field and the time group. We further show that linear systems over finite fields naturally correspond to representations of finite cyclic time groups, leading to module structures over polynomial quotient rings. This provides a systematic alternative to spectral analysis in settings where eigenvalue-based methods are not the most natural organizing language.
Read the full abstract

Number Theory

Linear recurrence sequences and palindromic concatenations of two repdigits in base $\beta$

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of $a_{n}$ which are palindromic concatenations of two repdigits in base $\beta$ is finite.
Read the full abstract

Algebraic Geometry

Moduli of toric principal bundles

Let $G$ be a reductive algebraic group. A toric principal $G$-bundle is a principal $G$-bundle over a toric variety together with a torus action commuting with the $G$-action. Extending the Klyachko classification of toric vector bundles, Kaveh-Manon classify toric principal bundles by piecewise linear maps to the (extended) Tits building of $G$. In this paper, we use this classification to construct a moduli space of (framed) toric principal bundles with given total equivariant characteristic class, as a locally closed subvariety of a product of partial flag varieties. This extends the construction of moduli of toric vector bundles by Sam Payne.
Read the full abstract

Numerical Analysis

An unfitted finite element method for PDE-constrained shape optimization via shape gradient flow

In this paper, we propose an unfitted finite element method to solve PDE-constrained shape optimization problems via shape gradient flow. The shape gradient flow system consists of the state equation, the adjoint equation, the velocity equation, as well as the flow map that generates the evolution of the boundary driven by the velocity field, which can be viewed as a limit system of the classical shape gradient descent algorithm. In \cite{GongLiRao} the authors proposed an evolving finite element method to solve the shape gradient flow system. Instead, in this paper, we propose an unfitted finite element method in which the evolution of the boundary is realized by cubic splines and the equations are solved by cut finite element methods with ghost penalization. Under reasonable assumptions, we are able to prove some optimal convergence rates that are further validated by numerical experiments.
Read the full abstract

Optimization and Control

Connections Between Determinantal Point Processes and Gramians in Control

Determinantal point processes (DPPs) are probability models over subsets of a ground set that favor diverse selections while suppressing redundancy. That is, they tend to assign higher likelihood to collections whose elements complement one another instead of repeating the same information. For example, in recommendation systems, a DPP prefers showing users several relevant items that differ in content or style, rather than many near-duplicates of essentially the same item. Although DPPs have been studied extensively in machine learning, random matrix theory, and popularized through components of YouTube's search recommendation system, they have not been considered in the context of dynamic systems; time domain analysis is not a feature of DPPs. This paper establishes interesting connections between DPPs and control theory. By showing that the observability (controllability) Gramian parameterized by sensor (control) node subsets is a DPP, we provide a probabilistic and spectral perspective on sensor (actuator) selection for linear dynamic systems. This notion of probability here does not represent stochastic uncertainty in the system dynamics; it instead represents a likelihood measure over sensor (actuator) configurations induced by the Gramian. To that end, we derive an effective observable rank condition, characterize the balance between individual node contributions and diversity, and establish node inclusion monotonicity and negative dependence properties. Finally, we show that this formulation recovers classical greedy optimization guarantees and admits a maximum a posteriori interpretation of the sensor/actuator node selection problem. Numerical case studies on three network topologies corroborate the theoretical results.
Read the full abstract

Analysis of PDEs

Sampleability transport, nonlinear regularization, and the porous medium flow

We study the Wasserstein projection of a compactly supported probability measure onto the class of measures whose density ratio is bounded, and we place this projection in a broader program connecting generative modeling, optimal transport, and nonlinear diffusion. The paper proves existence and uniqueness of the sampleability projection, uniqueness of the Brenier map at the minimizer, path independence of the quadratic Wasserstein generation loss, and the diffusion-threshold picture for the heat semigroup. The porous medium equation is then analyzed as a candidate forward regularizer. We prove the two rigorous properties that make the equation attractive for this purpose, namely finite propagation of compact support and an explicit Wasserstein cost bound obtained from dissipation of the Rényi entropy. We then identify a structural obstruction inherent to any porous-medium version of the sampleability theory. Every nontrivial compactly supported whole-space porous-medium profile has vanishing essential infimum on any compact set containing its support, hence infinite density ratio in the original sense, and the assertion that the porous medium flow reaches the same density-ratio sampleable class while preserving compact support is false. To isolate the mathematically valid content of the nonlinear-diffusion program, we also prove an endpoint-constrained Benamou-Brenier principle for the sampleability projection and derive the corrected spectral picture near a strictly positive equilibrium on a fixed compact domain. In that regime the leading-order damping is exponential, with quadratic mode coupling in the first nonlinear correction. The Hele-Shaw and mesa-limit interpretation is therefore presented here as a conjectural variational extension rather than as a proved theorem.
Read the full abstract

2604.08911 · 10 Apr · Withdrawn due to errors. Definition 3.2 forces every measure in the sampleable class to have full support on B_R, so D_C(mu) is bounded below by a positive constant for every mu and no Gaussian smoothing lies in the class. The convexification cost of Definition 3.6 is zero for every measure, so Theorem 3.7 is false. Theorem 4.8 and Proposition 4.10 are unproved and Theorem 5.3 is wrong

Information Theory

Continuous Wavefront Design via Virtual Point Sources: A Holographic Paradigm for Near-Field XL-MIMO

Beamforming design for extremely large-scale multiple-input multiple-output (XL-MIMO) systems is challenging due to prohibitive computational complexity and complex near-field propagation effects. To address this, this paper introduces a holographic beamforming paradigm that reformulates the design from optimizing variables at spatially discrete antenna locations to shaping a continuous electromagnetic wave function over the array aperture, effectively mitigating the growth of algorithmic complexity as the array scale increases. We apply this paradigm to the challenging dual near-field (DNF) scenario, where strong transceiver coupling severely degrades conventional iterative algorithms. In this case, we propose a novel Virtual Point Source (VPS) method, which approximates the ideal wave function with a single and analytically tractable spherical-wave. A rigorous geometric-optical analysis is provided to show that the optimal VPS location can be determined in a fully non-iterative manner, thus decoupling the coupled DNF problem. The proposed method is demonstrated in an intelligent reflecting surfaces (IRS)-assisted system, where simulation results show that our non-iterative approach achieves performance comparable to converged alternating-optimization (AO) algorithms, while incurring significantly lower complexity and avoiding convergence uncertainty. This work offers a new theoretical framework for holographic beamforming design in XL-MIMO systems.
Read the full abstract

All authors Xiyuan Liu, Qingqing Wu, Rui Wang, Qiaoyan Peng, Jun Wu

Analysis of PDEs

Existence and uniqueness of nonlocal nonlinear conservation laws via fixed-point methods

We investigate the well-posedness of scalar conservation laws whose flux depends on the solution both pointwise and nonlocally through integral averages. Our analysis is based on a fixed-point formulation, in which the nonlocal dependence is incorporated as a space- and time-dependent component of the flux, together with classical stability estimates for entropy solutions. This framework unifies and extends several models previously considered in the literature and applies, in particular, to conservation laws with memory effects (nonlocality in time) or delay. We prove the existence and uniqueness of weak entropy solutions on a sufficiently short time horizon and show that under additional assumptions, existence and uniqueness can be obtained on any finite time horizon. In addition, we present numerical simulations to illustrate the qualitative effects of memory on the solution dynamics.
Read the full abstract

All authors Xiaoqian Gong, Alexander Keimer, Lorenzo Liverani, Hossein Nick Zinat Matin

Representation Theory

Graded Casimir Elements and Central Extensions of Color Lie Algebras

A color Lie algebra is a generalization of a Lie (super)algebra by an Abelian group $\Gamma$. The underlying vector space and defining relations of the algebra are graded by $\Gamma$, and a color Lie algebra can admit graded Casimir elements. Furthermore, in that case its loop algebra admits graded central extensions. We present a general method for constructing 2nd order graded Casimir elements and graded central extensions for a given color Lie algebra and its loop algebra, respectively. We also show that there exists a large class of color Lie algebras admitting such graded Casimir elements or central extensions by providing three examples, namely, $\mathfrak{sl}(2)$ for $\Gamma = \mathbb{Z}_3^2$, and $\mathfrak{q}(n)$ and $\mathfrak{osp}(m|2n)$ for $\Gamma = \mathbb{Z}_2^2$.
Read the full abstract

All authors Naruhiko Aizawa, Ichi Fujii, Jambulingam Segar, Joris Van der Jeugt