Optimization and Control · Cross-listed from q-fin.MF
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 2 April
We study a speculative trading problem within the exploratory reinforcement learning (RL) framework of Wang et al. [2020]. The problem is formulated as a sequential optimal stopping problem over entry and exit times under general utility function and price process. We first consider a relaxed version of the problem in which the stopping times are modeled by the jump times of Cox processes driven by bounded, non-randomized intensity controls. Under the exploratory formulation, the agent's randomized control is characterized via the probability measure over the jump intensities, and their objective function is regularized by Shannon's differential entropy. This yields a system of the exploratory HJB equations and Gibbs distributions in closed-form as the optimal policy. Error estimates and convergence of the RL objective to the value function of the original problem are established. Finally, an RL algorithm is designed, and its implementation is showcased in a pairs-trading application.
Optimization and Control
Balancing Morality and Economics: Population Games with Herding and Inertia
The adoption of clean technologies (CTs) plays an important role in reducing carbon dioxide (CO$_2$) emissions. We study CT adoption in a large population of consumers with heterogeneous behavioral tendencies. We model the interaction among the agents as a multi-type mean-field game in which the agents choose between clean and polluting technology based products and may either behave as rationals (trading off price and moral incentives), herding agents (just follow the majority), or lethargic agents exhibiting inertia toward adopting the new technologies. We characterize equilibrium CT adoption levels using the recently introduced notion of $\boldsymbol{\alpha}$-Rational Nash Equilibrium ($\boldsymbol{\alpha}$-RNE) and its multi-type extension. We then identify a stable subset using the limits of a stochastic turn-by-turn behavioral dynamics. Our results highlight the role of population composition in determining CT adoption. In particular, widespread adoption requires either a sufficiently small price disadvantage for CTs or the presence of a sufficiently large herding population that can be influenced through social awareness programs. Surprisingly, we could prove that environmental damages do not provide sufficient incentives to increase CT adoption.
Read the full abstract
Numerical Analysis
Subdivision $k$-Form Spaces within the Finite Element Exterior Calculus Framework
This paper introduces discrete differential form spaces over two-dimensional manifold meshes that feature enhanced subdivision-induced inter-element regularity compared to conventional finite element (FE) spaces. This increase in smoothness is achieved by pulling back refined subdivision basis functions along a hierarchy of increasingly fine meshes that are generated by a subdivision algorithm. We introduce a framework that casts several known instances of $k$-form subdivision schemes in the language of FE and derive conditions under which the resulting subdivision-induced hierarchy of FE function spaces satisfies a discrete de Rham complex. The paper further illustrates the enforcing of zero boundary conditions by discarding basis functions close to the mesh boundary and shows that this does not compromise the de Rham complex. To analyse our novel subdivision $k$-form spaces we solve the Maxwell eigenvalue problem to confirm the absence of spurious modes and to study the accuracy of the computed eigenvalues. Recovering accurately the expected analytic eigenvalue spectrum shows that our novel subdivision $k$-form spaces indeed preserve the de Rham complex, since this test case is known to be challenging for methods not preserving this structure. Further, we numerically investigate the approximation errors of these subdivision spaces for given analytic functions. The presented study shows that our method can be employed in two ways. Upon a suitable choice of parameters, the subdivision $k$-form spaces are up to $1.5$ orders of magnitude more accurate in the $L^2$ norm than conventional lowest-order FE spaces with the same number of degrees of freedom. Alternatively, for a given target accuracy, the number of required degrees of freedom can be significantly reduced, resulting in a speed-up by a factor of up to 6 for the discussed test cases.
Read the full abstract
Number Theory
Coefficient-Level Böttcher Theory for Wild Superattracting Germs of Degree $p^e$
Let $p$ be an odd prime, let $e\ge2$, and put $q=p^e$. We study the wild family \[ \varphi_{r,e}(x)=x^q+qp^r x^{q+1}=x^{p^e}+p^{r+e}x^{p^e+1} \qquad (r\ge0), \] and the inverse Böttcher coordinate $f_{r,e}(x)=x\sum_{k\ge0}a_k(r,e)x^k/k!$ characterized by \[ \varphi_{r,e}(f_{r,e}(x))=f_{r,e}(x^q). \] For the clean family, we prove a complete mod-$p$ digit-sum law in the special fiber $r=0$. For the higher fibers $r\ge1$, we prove a coefficient-level theorem consisting of a global digit-weight lower bound, a leading monomial theorem on divisible non-pure classes, a lag-$e$ pure-power recursion, and subadditivity of the induced digit weight. This yields the pure-power branch word \[ (B^{e-1}A)^{\lceil r/e\rceil}B^\infty \] and the radius formula \[ \rho(f_{r,e})=p^{-\theta_{r,e}},\qquad \theta_{r,e}=p^{-e\lceil r/e\rceil}\left(\frac{1}{p-1}+e\lceil r/e\rceil-r\right). \] We then prove a tail-stable extension. In the special fiber, $p$-divisible tails preserve the digit-sum law modulo $p$. In the higher fibers, tails satisfying $v_p(\vartheta_h)\ge\Lambda_{r,e}(h+1)+1$ lie beyond the clean-family initial $\Lambda_{r,e}$-graded term and therefore preserve the leading terms, the pure-power branch word, the valuation asymptotic, and the radius. For $e=2$, this recovers the Salerno–Silverman degree-$p^2$ family and the Fu–Nie radius statement for the inverse coordinate in that family.
Read the full abstract
Mathematical Physics
A Rigorous Functional-Integral Construction of Toral Chern-Simons Theory
We construct the functional integral of Abelian Chern-Simons theory with toral gauge group $\mathbb T=\mathfrak t/\Lambda \cong U(1)^n$ at level $K$, where $K:\Lambda\times\Lambda\to\mathbb Z$ is an even, integral, nondegenerate symmetric bilinear form, by exact zeta-regularized Gaussian evaluation of the formal quotient integral over connections modulo gauge. For closed $3$-manifolds, this yields a topological invariant; for manifolds with boundary, the relative functional integral produces the canonical boundary state. The resulting theory satisfies the required axioms of a $(2+1)$-dimensional TQFT.
Read the full abstract
Number Theory
Circle coverings driven by arithmetic sequences: a percolation approach to Diophantine approximation and fractal intersections
We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences $(q_n)_{n\in\mathbb{N}}$, we show that the covering radius $\frac{1}{n}$ is sharp up to a constant: there exist $C>c>0$ such that, for Lebesgue-almost all $x$, the intervals of length $\frac{C}{n}$ cover $[0,1)$ infinitely often, while this fails for intervals of length $\frac{c}{n}$. Moreover, the lower bound holds for certain sub-lacunary rates and the results partially extend to all probability measures with sufficiently fast Fourier decay. As an application, we obtain a new bound for a variant of the inhomogeneous Littlewood-Cassels problem: for any badly approximable $\alpha$ and $\gamma\in\mathbb{R}$, there exists a set of badly approximable $\beta$ of full Hausdorff dimension such that $ \|n\alpha-\gamma\| \|n\beta-\delta\|<C/(n\log n)$ for infinitely many $n\geqslant 1,$ uniformly in $\delta\in\mathbb{R}$. This improves upon previous works of Haynes-Jensen-Kristensen, Chow-Technau, and the third author, and is best possible when one restricts to best approximations of the first factor. Second, under certain arithmetic restrictions on $(q_n)_{n\in\mathbb{N}}$, we compute the almost-sure Hausdorff dimension of limsup sets generated by intervals of size $\frac{1}{n^{\nu}}$ for $\nu \geqslant 1$, centered at $\{q_n x\}$, and intersected with Ahlfors regular compact sets such as the middle-third Cantor set. In particular, our results apply to all real-valued lacunary sequences, to integer-valued polynomials, and to powers of primes. This substantially extends the work of Bugeaud and Durand, which applies only to certain super-lacunary integer-valued sequences.
Read the full abstract
Information Theory
On the existence of linear rank-metric intersecting codes
Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric intersecting codes exhibit substantially different behavior. It was previously shown that a nondegenerate $[n,k,d]_{q^m/q}$ rank-metric intersecting code must satisfy $2k-1 \le n \le 2m-3$, and the tightness of the upper bound was left open. Using the geometric interpretation of rank-metric codes via $q$-systems, we prove that the dual subspace associated with a rank-metric intersecting code must satisfy strong evasiveness properties. This connection allows us to derive new restrictions on the parameters of such codes and to show that the bound $n=2m-3$ can be attained only when $k=3$ and $m\ge 6$. More generally, we show that $n \leq 2m-\lfloor(k+4)/2\rfloor$. Moreover, we obtain a geometric characterization of these extremal codes in terms of scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$. As a consequence, the existence problem for $[2m-3,3,d]_{q^m/q}$ rank-metric intersecting codes is reduced to the existence of scattered subspaces of dimension $m+3$. Using known constructions of maximum scattered subspaces, we derive existence results when $m$ is even. Finally, we prove that $[6,3,3]_{q^5/q}$ rank-metric intersecting codes do not exist for any prime power $q$, thus resolving an open problem posed by Bartoli et al. in 2025.
Read the full abstract
Combinatorics
Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
We show that for every positive integer ${t \geq 2}$ there exists an integer $s$ such that every graph that contains no induced subgraph isomorphic to either the $6$-vertex path or the $(2,t)$-biclique, the complete bipartite graph $K_{2,t}$, has tree-independence number at most $s$. This result makes partial progress on a conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht.
Read the full abstract
Classical Analysis and ODEs
Systems with discrete singular $\phi$-Laplacian and maximal monotone boundary conditions
We are concerned with solvability of nonlinear systems involving a discrete singular $\phi$-Laplacian operator of type \begin{equation*} u \mapsto \Delta\left[\phi(\Delta u(n-1))\right] \qquad (n\in \{1, \dots, T\}), \end{equation*} associated with a general two point boundary condition having the form \begin{equation*} \left(\phi(\Delta u(0)),-\phi(\Delta u(T))\right)\in\gamma(u(0),u(T+1)), \end{equation*} where $\gamma:\mathbb{R}^N\times\mathbb{R}^N\to2^{\mathbb{R}^N\times\mathbb{R}^N}$ is a maximal monotone operator with $0_{\mathbb{R}^N \times \mathbb{R}^N}\in \gamma(0_{\mathbb{R}^N \times \mathbb{R}^N})$. The mapping $\phi$ is a potential homeomorphism from an open ball of radius $a$ centered at the origin $B_a \subset \mathbb{R}^N$ onto $\mathbb{R}^N$ and $\Delta$ stands for the usual forward difference operator. When the perturbing nonlinearity in the system has not a potential structure we obtain existence of solutions by a priori estimates. Also, when the nonlinearity is of gradient type and $\gamma$ is a subdifferential, we provide a variational approach of the system in the frame of critical point theory for convex, lower semicontinuous perturbations of $C^1$-functionals. Then we derive the existence of solutions either as minimizers or saddle points of the corresponding energy functional.
Read the full abstract
Algebraic Geometry
The integral (log) cotangent complex of extensions of valued fields
Let $(L, v_L) / (K, v_K)$ be a finite or purely transcendental extension of real valued fields. We construct the associated integral cotangent and log cotangent complexes in terms of a MacLane-Vaquié chain approximating $v_L$. This leads to explicit formulas for associated invariants such as the (absolute) (log) different, weight norm and Kähler norm. As a corollary of our methods we obtain strong control of the higher homology of the integral (log) cotangent complex, generalizing an important result of Gabber and Ramero to the logarithmic setting.
Read the full abstract
Probability · Cross-listed from cond-mat.stat-mech
Resetting optimized competitive first-passage outcomes in non-Markovian systems
We investigate the role of stochastic resetting in non-Markovian systems, where memory effects arise due to slow relaxation, rugged energy landscapes, disordered environments, and molecular crowding. Using the celebrated continuous-time random walk (CTRW) framework, we analyze first-passage processes with multiple competing outcomes and examine how resetting can selectively enhance desired events. We characterize the efficiency of resetting through conditional mean first-passage times (MFPTs) and demonstrate that its impact is highly sensitive to the underlying waiting-time statistics. Furthermore, we derive an inequality that quantifies how resetting controls fluctuations in conditional first-passage times (FPTs), revealing regimes where variability is significantly suppressed. Our results provide a systematic understanding of how long-term memory influences competitive first-passage outcomes and establish resetting as a powerful control mechanism beyond the conventional Markovian setting.
Read the full abstract
Quantum Algebra
Equivalence of toral Chern-Simons and Reshetikhin-Turaev theories
We prove a natural isomorphism between toral Chern-Simons theory with gauge group $\mathbb T=\mathfrak t/\Lambda\cong U(1)^n$ and the Reshetikhin-Turaev theory associated with the finite quadratic module determined by an even, integral, nondegenerate symmetric bilinear form $K:\Lambda\times\Lambda\to\mathbb Z.$ More precisely, let $G_K=\Lambda^*/K\Lambda$ be the discriminant group of $K$, equipped with its induced quadratic form $q_K$, and let $C(G_K,q_K)$ be the corresponding pointed modular category. Using the geometric quantization formulation of toral Chern-Simons theory, we show that the resulting TQFT is naturally isomorphic to the Reshetikhin–Turaev TQFT determined by $C(G_K,q_K)$. The equivalence is established at the level of closed 3-manifold invariants, bordism operators for manifolds with boundary, and the extended $(2+1)$-dimensional structure, yielding a natural isomorphism of extended TQFTs.
Read the full abstract
Analysis of PDEs
Lectures on curve shortening flow
The curve shortening flow is a geometric heat equation for curves and provides an accessible setting to illustrate many important concepts from nonlinear partial differential equations, including maximum principle estimates, monotonicity formulas, Harnack inequalities and blowup analysis. All these techniques will be combined to give an exposition of Huisken's proof of Grayson's beautiful theorem that the curve shortening flow shrinks any closed embedded curve in the plane to a round point.
Read the full abstract
Probability
Homogenized Transformers
We study a random model of deep multi-head self-attention in which the weights are resampled independently across layers and heads, as at initialization of training. Viewing depth as a time variable, the residual stream defines a discrete-time interacting particle system on the unit sphere. We prove that, under suitable joint scalings of the depth, the residual step size, and the number of heads, this dynamics admits a nontrivial homogenized limit. Depending on the scaling, the limit is either deterministic or stochastic with common noise; in the mean-field regime, the latter leads to a stochastic nonlinear Fokker–Planck equation for the conditional law of a representative token. In the Gaussian setting, the limiting drift vanishes, making the homogenized dynamics explicit enough to study representation collapse. This yields quantitative trade-offs between dimension, context length, and temperature, and identifies regimes in which clustering can be mitigated.
Read the full abstract
Analysis of PDEs
Semi-explicit entropic solution to a generalised Riemann problem in some hydrological context
We discuss solutions of the one dimensional scalar conservation law with the flux function $y\longmapsto G_{c,\rho}\left(y\right)=((1-\rho)c-y)\mathbb{1}_{\{y>c\}}-\rho y\mathbb{1}_{\{y\leqslant c\}}$ for two specific initial conditions $u(\cdot,0)=u_0$. This equation arises as the limit of a specific conceptual hydrological model. For initial data strictly below (resp. above) the threshold level $c$, the equation reduces to a constant-speed transport equation with velocity $p$ (resp. $1$). Our goal is to understand precisely what happens when the initial condition crosses the threshold $c$, which corresponds to a generalisation of the Riemann problem, and to provide, in such cases, quasi-closed-form expressions for the corresponding solutions.
Read the full abstract
Numerical Analysis
Efficient construction and explicit dimensionality of Lie group-equivariant and permutation-invariant spaces
We give a practical construction of functions of $N$ variables that are simultaneously equivariant under a group action and invariant under permutations, or simply group-equivariant, valid for any finite-dimensional space stable under that action. The method applies to any connected linear Lie group: it uses the Lie algebra to build a matrix $M$ whose kernel corresponds exactly to the subspace with the desired symmetry properties, removing the need for Clebsch-Gordan coefficients and explicit symmetrization over permutations. For the groups $SO(3)$ and $SU(2)$, the special structure of the matrix $M$ yields a linear scaling method which significantly outperforms the typically exponential cost of existing methods in the literature. As a byproduct, we obtain the exact dimension of group-equivariant and permutation-invariant spaces. This allows us to compare dimensionalities and show that, for large $N$, this dimension is of comparable order to that of the permutation-invariant space alone, while pre-asymptotically it is orders of magnitude lower. Enforcing group-equivariance explicitly, on top of permutation-invariance, therefore yields a substantial computational gain when approximating such functions.
Read the full abstract
Group Theory
Determining $\mathbb R$-Rank in Semisimple Lie Groups via uniform approximate Lattice arising as Regular Model Sets
Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every non-compact Cartan subgroup $C$ of $G$, there exists $g \in G$ such that the intersection $gCg^{-1} \cap \Lambda^2$ is non-empty and itself forms a uniform approximate lattice, extending a classical result of Mostow for lattices. The proof relies on a Moore-type ergodicity theorem for the hull of a strong approximate lattice, proved here as a key tool. Moreover, we prove that such approximate lattices determine the $\mathbb{R}$-rank of the ambient group $G$, drawing on ideas from the work of Prasad and Raghunathan on lattices.
Read the full abstract
Numerical Analysis · Cross-listed from physics.flu-dyn
Revisiting Conservativeness in Fluid Dynamics: Failure of Non-Conservative PINNs and a Path-Integral Remedy
The choice between conservative and non-conservative formulations is a fundamental dilemma in CFD. While non-conservative forms offer intuitive modeling in primitive variables, they typically produce erroneous shock speeds. This paper critically analyzes these formulations, contrasting classical failures against the capabilities of Physics-Informed Neural Networks (PINNs). Using the Adaptive Weight and Viscosity (PINNs-AWV) architecture, we evaluate cases ranging from shallow water equations to unsteady 1D and 2D Euler equations. Results reveal a significant dichotomy: while PINNs-AWV restores physical fidelity in scalar and steady systems, standard non-conservative PINNs fail in unsteady systems like the Sod shock tube. We demonstrate this failure stems from non-vanishing source terms introduced by viscous regularization, which violate the Rankine–Hugoniot jump conditions. To resolve this, we implement a path-integral framework based on Dal Maso–LeFloch–Murat (DLM) theory. By incorporating path-consistent losses in PINNs (PI-PINN) and using path-conservative numerical schemes, we successfully recover correct shock speeds within non-conservative frameworks. Our results prove the path-integral approach provides a rigorous mathematical bridge for physical accuracy in both classical and machine learning solvers, enabling primitive-variable formulations in transient, high-speed simulations.
Read the full abstract
Optimization and Control
Output Corridor Impulsive Control of First-order Continuous System with Non-local Attractivity Analysis
This paper addresses the design of an impulsive controller for a continuous scalar time-invariant linear plant that constitutes the simplest conceivable model of chemical kinetics. The model is ubiquitous in process control as well as pharmacometrics and readily generalizes to systems of Wiener structure. Given the impulsive nature of the feedback, the control problem formulation is particularly suited to discrete dosing applications in engineering and medicine, where both doses and inter-dose intervals are manipulated. Since the feedback controller acts at discrete time instants and employs both amplitude and frequency modulation, whereas the plant is continuous, the closed-loop system exhibits hybrid dynamics featuring complex nonlinear phenomena. The problem of confining the plant output to a predefined corridor of values is considered. The method at the heart of the proposed approach is to design a stable periodic solution, called a 1-cycle, whose one-dimensional orbit coincides with the predefined corridor. Conditions ensuring local and global attractivity of the 1-cycle are established. As a numerical illustration of the proposed approach, the problem of intravenous paracetamol dosing is considered.
Read the full abstract
Combinatorics
An Erdős-Ko-Rado result for some principal series representations
Let $V$ be an irreducible principal series representation of $\mathrm{GL}_2(q)$ satisfying certain conditions. Two subsets $S_1, S_2 \subseteq \mathrm{GL}_2(q)$ are called cross-$t$-intersecting if $\dim\{v \in V: g_1v = g_2v\} \geqslant t$ for any $(g_1, g_2) \in S_1 \times S_2$. In this paper, we determine $\max(|S_1|\cdot|S_2|)$ where $S_1, S_2 \subseteq \mathrm{GL}_2(q)$ are cross-$1$-intersecting. Our proofs are based on eigenvalue techniques and the representation theory of $\mathrm{GL}_2(q)$.
Read the full abstract
Metric Geometry
Self perimeter of convex sets
This paper introduces a natural definition for the volume of the unit ball in $n$-dimensional normed spaces $\mathbb{R}^n$. This definition preserves the Euclidean relation $P(B)/V(B)=n$ between the perimiter and the volume of the unit ball $B$ in $R^n$. We show that this volume definition is invariant under origin-preserving affine transformations and polar duality. For $n=2$, we derive an explicit integral formula for the self-perimeter of the unit ball, extend it to non-centrally symmetric sets;. The construction is extended to $\mathbb{R}^n$ via a recursive integration over the boundary, utilizing $(n-1)$-dimensional volumes of planar intersections. Finally, we pose and discuss an Alexandrov-type problem for the associated surface measure, providing perturbative solutions in the 2D case. In particular we prove that, generically, any perturbation of the surface measure of the Euclidean 2-D disk yields a 4-fold symmetric convex set in the leading order.
Read the full abstract
Combinatorics
King Chasing Problem in Chinese Chess is NP-hard
We prove that king chasing problem in Chinese Chess is NP-hard when generalized to $n\times n$ boards. `King chasing' is a frequently-used strategy in Chinese Chess, which means that the player has to continuously check the opponent in every move until finally checkmating the opponent's king. The problem is to determine which player has a winning strategy in generalized Chinese Chess, under the constraints of king chasing. Obviously, it is a sub-problem of generalized Chinese Chess problem. We prove that king chasing problem in Chinese Chess is NP-hard by reducing from the classic NP-complete problem 3-SAT.
Read the full abstract
Representation Theory
Cuspidal $\ell$-modular representations of ${\rm GL}_n(F)$ distinguished by a Galois involution, II
Let $F/F_0$ be a quadratic extension of non-Archimedean locally compact fields with residual characteristic $p\neq2$, and $\ell$ be a prime number different from $p$. We classify those $\ell$-modular cuspidal irreducible representations of ${\rm GL}_n(F)$ which are ${\rm GL}_n(F_0)$-distinguished, that is, which carry a non-zero ${\rm GL}_n(F_0)$-invariant linear form. In the case when $\ell\neq2$, an $\ell$-modular cuspidal representation of ${\rm GL}_n(F)$ is ${\rm GL}_n(F_0)$-distinguished if and only if it lifts to a ${\rm GL}_n(F_0)$-distinguished cuspidal $\ell$-adic representation, whereas when $\ell=2$, it is ${\rm GL}_n(F_0)$-distinguished if and only if it is conjugate-self-dual.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
A Weak Notion of Symmetry for Dynamical Systems
Many nonlinear dynamical systems exhibit symmetry, affording substantial benefits for control design, observer architecture, and data-driven control. While the classical notion of group invariance enables a cascade decomposition of the system into highly structured subsystems, it demands very rigid structure in the original system. Conversely, much more general notions (e.g., partial symmetry) have been shown to be sufficient for obtaining less-structured decompositions. In this work, we propose a middle ground termed "weak invariance", studying diffeomorphisms (resp., vector fields) that are group invariant up to a diffeomorphism of (resp., vector field on) the symmetry group. Remarkably, we prove that weak invariance implies that this diffeomorphism of (resp., vector field on) the symmetry group must be an automorphism (resp., group linear). Additionally, we demonstrate that a vector field is weakly invariant if and only if its flow is weakly invariant, where the associated group linear vector field generates the associated automorphisms. Finally, we show that weakly invariant systems admit a cascade decomposition in which the dynamics are group affine along the orbits. Weak invariance thus generalizes both classical invariance and the important class of group affine dynamical systems on Lie groups, laying a foundation for new methods of symmetry-informed control and observer design.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Global Geometry of Orthogonal Foliations of Signed-Quadratic Systems
This work formalizes the differential topology of redundancy resolution for systems governed by signed-quadratic actuation maps. By analyzing the minimally redundant case, the global topology of the continuous fiber bundle defining the nonlinear actuation null-space is established. The distribution orthogonal to these fibers is proven to be globally integrable and governed by an exact logarithmic potential field. This field foliates the actuator space, inducing a structural stratification of all orthants into transverse layers whose combinatorial sizes follow a strictly binomial progression. Within these layers, adjacent orthants are continuously connected via lower-dimensional strata termed reciprocal hinges, while the layers themselves are separated by boundary hyperplanes, or portals, that act as global sections of the fibers. This partition formally distinguishes extremal and transitional layers, which exhibit fundamentally distinct fiber topologies and foliation properties. Exploiting this geometric framework, we prove that the orthogonal manifolds within the extremal orthants form a global diffeomorphism to the entire unbounded task space. This establishes the theoretical existence of globally smooth right-inverses that permanently confine the system to a single orthant, guaranteeing the absolute avoidance of kinematic singularities. While motivated by the physical actuation maps of multirotor and marine vehicles, the results provide a strictly foundational topological classification of signed-quadratic surjective systems.
Read the full abstract
Analysis of PDEs
Sharp spectral estimates for free boundary problems arising in plasma physics
We derive a sharp spectral estimate for a superlinear free boundary problem arising in plasma physics. The semilinear equation is coupled with a constraint, which forces the analysis of a non-local eigenvalue equation. Consequently the corresponding first eigenvalue, say $\sigma_1$, is not a standard one and it is shown that it cannot satisfy a general isoperimetric property of Faber-Krahn type. This motivates a careful analysis of the problem on balls in any dimension $N\geq 2$, where we prove that in fact $\sigma_1$ is always positive. The implications about the uniqueness problem for the Emden equation are also discussed.
Read the full abstract
Complex Variables
Hölder regularity of Siciak-Zaharjuta extremal functions on compact Hermitian manifolds
For a compact subset in a compact Hermitian manifold, we prove that the Hölder continuity of the extremal function at a given point in the set is a local property and that the Hölder continuity of a weighted extremal function follows from the Hölder continuities of the extremal function and the weight function with a uniform density in capacity. The second result can be seen as a continuation of a result of Lu, Phung and Tô \cite{LPT21}. Moreover, for a compact subset in a compact Hermitian manifold, we prove that, both at the point level and at the global level, the Hölder continuity of the extremal function with the uniform density in capacity is equivalent to the local Hölder continuity property, which is also equivalent to the weak local Hölder continuity property. These results are generalizations of the results of Nguyen \cite{Ng24} on compact Kähler manifolds. We also show that the \(\mu\)-Hölder continuity property of a convex compact subset in \(\mathbb{C}^n\) and of a compact subset in \(\mathbb{C}^n\) at a star center imply the local \(\mu\)-Hölder continuity property of order \(\mu\) of the convex compact subset and of the compact subset at the point, respectively.
Read the full abstract
Optimization and Control
When does learning pay off? A study on DRL-based dynamic algorithm configuration for carbon-aware scheduling
Deep reinforcement learning (DRL) has recently emerged as a promising tool for Dynamic Algorithm Configuration (DAC), enabling evolutionary algorithms to adapt their parameters online rather than relying on static tuned configurations. While DRL can learn effective control policies, training is computationally expensive. This cost may be justified if learned policies generalize, allowing the training effort to transfer across instance types and problem scales. Yet, for real-world optimization problems, it remains unclear whether this promise holds in practice and under which conditions the investment in learning pays off. In this work, we investigate this question in the context of the carbon-aware permutation flow-shop scheduling problem. We develop a DRL-based DAC framework and train it exclusively on small, simple instances. We then deploy the learned policy on both similar and more complex unseen instances and compare its performance against a static tuned baseline, which provides a fair point of comparison. Our findings show that the proposed method provides a strong dynamic algorithm control policy that can be effectively transferred to different unseen problem instances. Notably, on simple and cheap to compute instances, similar to those observed during training and tuning, DRL performs comparably with the statically tuned baseline. However, as instance characteristics diverge and computational complexities increase, the DRL-learned policy continuously outperforms static tuning. These results confirm that DRL can acquire robust and generalizable control policies which are effective beyond the training instance distributions. This ability to generalize across instance types makes the initial computational investment worthwhile, particularly in settings where static tuning struggles to adapt to changing problem scenarios.
Read the full abstract
Complex Variables
Characterization of continuity of Siciak-Zaharjuta extremal functions on compact Hermitian manifolds
For a compact subset in a compact Hermitian manifold, we prove that the continuity of the extremal function at a given point in the set is a local property and that the continuity of a weighted extremal function follows from the continuities of the extremal function and the weight function. These results are generalizations of the results of Nguyen \cite{Ng24} on compact Kähler manifolds. Moreover, for a compact subset in a compact Hermitian manifold, at the point level and accordingly at the global level, we characterize the continuity of the extremal function via the local \(L\)-regularity, which is equivalent to the weak local \(L\)-regularity. We also show that the \(L\)-regularity of a compact subset in \(\mathbb{C}^n\) at a star center implies the local \(L\)-regularity. Consequently, a convex compact \(L\)-regular subset in \(\mathbb{C}^n\) is locally \(L\)-regular.
Read the full abstract
Probability
Semicircle laws with combined variance for non-uniform Erdős-Rényi hypergraphs
We consider Erdős-Rényi-type random hypergraphs that are non-uniform, in the sense that hyperedges of different sizes may coexist, and inhomogeneous, in that connection probabilities may depend on the hyperedge size. All parameters are allowed to scale with the hypergraph size. We study the random adjacency matrix whose $(u,v)$-entry counts the number of hyperedges containing both vertices $u$ and $v$, and characterize its expected limiting spectral distribution in terms of the connection probabilities and the hyperedge sizes. We provide a Pastur-type condition, in the sense of Chatterjee (2005), under which the matrix can be Gaussianized, as well as a more restrictive but simpler sufficient condition in terms of the generalized average degree of the model. As a second main result, based on such a Gaussianization, we characterize the limiting spectral distributions under non-sparse conditions as semicircle laws with an explicit parametric variance. The latter can be expressed as a convex combination of the variances arising in the uniform cases, with coefficients determined by the trade-off between the different sources of inhomogeneity.