Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 8 March

Analysis of PDEs

Solvability of a class of integro-differential equations with Laplace and bi-Laplace operators

The work deals with the studies of the existence of solutions of an integro-differential equation in the situation of the difference of the standard Laplacian and the bi-Laplacian in the diffusion term. The proof of the existence of solutions relies on a fixed point technique. We use the solvability conditions for the non-Fredholm elliptic operators in unbounded domains.
Read the full abstract

Algebraic Geometry

Higher Schwarzians

The classical Schwarzian can be computed directly from the coefficients of a second-order linear equation. We extend this coefficient viewpoint to monic operators of arbitrary order over unital associative differential algebras over the rationals. The normalized coefficients freely generate the universal gauge covariants under covariant differentiation. Projective normalization in the scalar case, followed by symmetrization, gives higher Schwarzians with compatible finite laws under changes of frame and parameter. On a complex curve, these invariants, together with the coefficient connection and quadratic datum, reconstruct the operator. On a compact curve of genus $g\ge2$, canonical Szegő kernels turn the construction into a tool for recovering bundle geometry. A bracket of the cubic invariant recovers marked extensions of acyclic line bundles with distinct cubics. Higher invariants through degree $4g-1$ separate acyclic line bundles and detect their self-extensions. For acyclic bundles of arbitrary rank, the full invariant jets at a point generate the associative span of the canonical monodromy. The same universal coefficient calculus gives automorphic tensors on Siegel modular varieties. For genus-two filtered symplectic connections with invertible Kodaira–Spencer map, matrix Schwarzian invariants determine where scalar equations selected by the Hodge filtration acquire apparent singularities. Exact Picard–Fuchs calculations exhibit these divisors and express their equations in Siegel modular forms. The exact calculations are supplied in a reproducible ancillary package.
Read the full abstract

Dynamical Systems

Variational principles for nonautonomous dynamical systems

We study thermodynamical formalism of a discrete nonautonomous dynamical system determined by a sequence of continuous self-maps of a compact metric space. Using the methods of Convex Analysis we get variational principles for pressure functions determined by the system.

Number Theory

A trigonometric approach to an identity by Ramanujan

An identity by Ramanujan is expressed using polar coordinates, so that its proof reduces to the verification of an elementary trigonometric identity. This approach produces a few variations on Ramanujan's original identity.

Probability

Weak Functional Inequalities for Perturbed Measures

This paper is a follow up to an article by two of the authors dedicated to the study of Poincaré and logarithmic Sobolev inequalities for measures of the form $d\mu = e^{-U} d\nu$ where $e^{-U}$ is seen as a perturbation of $d\nu$. Application to the same functional inequalities for convolution products are then discussed. In the present paper we investigate similar problems for weaker functional inequalities, namely weak Poincaré, weighted Poincaré, weak log-Sobolev and weighted log-Sobolev inequalities.
Read the full abstract

Geometric Topology

On the isotopy classes of embeddings of surfaces in 5-manifolds

Let f, g be two homotopic smooth embeddings of a closed surface in a closed oriented 5-dimensional manifold. We show that if f admits a common algebraic dual 3-sphere, or if the fundamental group of the ambient space is trivial, then f and g must be isotopic. This generalizes a result of Kosanovic, Schneiderman, and Teichner. The proof is based on the construction of an invariant that classifies the isotopy classes of smooth embeddings of surfaces in ambient 5-dimensional manifolds within a homotopy class, which may be of independent interest. The invariant is defined in terms of the homotopy groups of the 5-dimensional manifold.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Robust Cooperative Output Regulation of Discrete-Time Heterogeneous Multi-Agent Systems

This article considers robust cooperative output regulation of discrete-time uncertain heterogeneous (in dimension) multi-agent systems (MASs). We show that the solvability of this problem with an internal model-based distributed control law reduces to the existence of a structured control gain that makes the nominal closed-loop system matrix of the MAS Schur. Accordingly, this article focuses on global and agent-wise local sufficient conditions for the existence and design of such a structured control gain. Based on a structured Lyapunov inequality, we present a convexification that yields a linear matrix inequality (LMI), whose feasibility is a global sufficient condition for the existence and design. Considering the individual nominal dynamics of each agent, the existence is also ensured if each agent solves a structure-free control problem. Its convexification yields LMIs that allow each agent to separately design its structure-free control gain. Lastly, we study the relationships between the sets of control gains emerging from both global and local perspectives.
Read the full abstract

Optimization and Control

Continuous-Time Heterogeneous Agent Models with Recursive Utility and Preference for Late Resolution

We consider continuous-time heterogeneous agent models with recursive utility (Epstein-Zin utility) cast as mean field games, in which agents prefer late resolution of uncertainty. The model leads to a system coupling a pair of Hamilton-Jacobi-Bellman equations with state constraints and Fokker-Planck-Kolmogorov equations. We investigate the existence of solutions to the mean field game system and discuss some important qualitative features of the model.
Read the full abstract

Statistics Theory · Cross-listed from econ.EM

Testing for Endogeneity: A Moment-Based Bayesian Approach

A standard assumption in the Bayesian estimation of linear regression models is that the regressors are exogenous in the sense that they are uncorrelated with the model error term. In practice, however, this assumption can be invalid. In this paper, using the exponentially tilted empirical likelihood framework, we develop a Bayes factor test for endogeneity that compares a base model that is correctly specified under exogeneity but misspecified under endogeneity against an extended model that is correctly specified in either case. We provide a comprehensive study of the log-marginal exponentially tilted empirical likelihood. We demonstrate that our testing procedure is consistent from a frequentist point of view: as the sample grows, it almost surely selects the base model if and only if the regressors are exogenous, and the extended model if and only if the regressors are endogenous. The methods are illustrated with simulated data, and problems concerning the causal effect of automobile prices on automobile demand and the causal effect of potentially endogenous airplane ticket prices on passenger volume.
Read the full abstract

Category Theory

Revisiting colimits in $\mathbf{Cat}$ and homotopy category

In this paper, we justify and make precise an elementary approach that establishes the existence of (co)limits in $\mathbf{Cat}$. This approach, while conceptually evident, has not been made fully explicit or systematically described in the literature. We first demonstrate an equivalence between the existence of the homotopy category functor $h : \mathbf{sSet} \rightarrow \mathbf{Cat}$ and the existence of a specific class of weighted colimits in $\mathbf{Cat}$. We then construct these weighted colimits explicitly by using certain properties of simplicial sets and the nerve functor. Consequentially, the embedding $N : \mathbf{Cat} \hookrightarrow \mathbf{sSet}$ is reflective, and can be used to infer the (co)completeness of $\mathbf{Cat}$. Finally, we use this approach to reformulate the construction of coequalizers and localizations in $\mathbf{Cat}$.
Read the full abstract

Algebraic Geometry

The GW/PT conjectures for toric pairs

We prove the conjectural correspondence between logarithmic Gromov-Witten theory and logarithmic Donaldson/Pandharipande-Thomas theory for pairs $(Y|\partial Y)$ consisting of a toric threefold $Y$ and any torus invariant divisor $\partial Y$, with primary insertions. The results are the first verifications of this conjecture when $\partial Y$ is singular, i.e., the “fully logarithmic” setting, and the first proof of the equivariant toric correspondence for pairs when $\partial Y$ is nonempty. When $\partial Y$ is empty, we get a new proof of the known toric correspondence, but our methods also lead to stronger conclusions. In particular, we show the PT series is a Laurent polynomial in the presence of sufficient positivity and prove a 2008 conjecture of Oblomkov, Okounkov, Pandharipande, and the first author stating the capped vertex is a Laurent polynomial. The methods also verify the logarithmic DT/PT conjecture for toric threefold pairs. Using the constraints of the logarithmic theory, the complete evaluation of toric pairs is determined by a single calculation – the degree $1$ series of $\mathbb{P}^3$.
Read the full abstract

Numerical Analysis

Weak Scalability of time parallel Schwarz methods for parabolic optimal control problems

Parabolic optimal control problems arise in numerous scientific and engineering applications. They typically lead to large-scale coupled forward-backward systems that cannot be treated with classical time-stepping schemes and are computationally expensive to solve. Therefore, parallel methods are essential to reduce the computational time required. In this work, we investigate a time domain decomposition approach, namely the time parallel Schwarz method, applied to parabolic optimal control problems. We analyze the convergence behavior and focus on the weak scalability property of this method as the number of time intervals increases. To characterize the spectral radius of the iteration matrix, we present two analysis techniques: the construction of a tailored matrix norm and the application of block Toeplitz matrix theory. Our analyses yield both nonasymptotic bounds on the spectral radius and an asymptotic characterization of the eigenvalues as the number of time intervals tends to infinity. Numerical experiments further confirm our theoretical findings and demonstrate the weak scalability of the time parallel Schwarz method. This work introduces the first theoretical tool for analyzing the weak scalability of time domain decomposition methods, and our results shed light on the suitability of our algorithm for large-scale simulations on modern high-performance computing architectures.
Read the full abstract

Optimization and Control

Stabilization of monotone control systems with input constraints

We present a stabilizing output-feedback controller for nonlinear finite and infinite-dimensional control systems governed by monotone operators that respects given input constraints. In particular, we show under a detectability-like assumption that a saturated version of the classical output feedback controller in passivity-based control achieves control-constrained stabilization as long as the control corresponding to the desired equilibrium is in the interior of the control constraint set. We illustrate our findings using a heat equation, a wave equation, and a finite-dimensional nonlinear port-Hamiltonian system.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Entanglement Fidelity in Standard Quantum Channels

Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator $\rho$, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.
Read the full abstract

Mathematical Physics

Combining Symmetries and Helmholtz's Conditions to Construct Lagrangians

We present new relations derived from Noether's identity that reveal the compatibility between the components of the Hessian matrix of the Lagrangian, the infinitesimal symmetry transformation of the configuration variables and time, and a constant of motion. Using these relations, we develop two new methods to incorporate symmetry requirements directly into the inverse problem of mechanics, thereby restricting the set of acceptable Lagrangians. We accomplish this by combining these relations with Helmholtz's conditions, which allow us to construct Lagrangians whose actions exhibit specific symmetries from the outset. The theory is illustrated with one- and two-dimensional examples.
Read the full abstract

Operator Algebras

Positive isometric Fourier multipliers on non-commutative $L^p$-spaces

For a locally compact group \(G\), let \(\mathcal{L}G\) denote its left group von Neumann algebra and let \(L^p(\mathcal{L}G)\), \(1 \le p \le \infty\), be the corresponding non-commutative \(L^p\)-space. Given \(\phi \in L^\infty(G)\), we study the Fourier multiplier \(M_{\phi,p}\) acting on \(L^p(\mathcal{L}G)\). We prove that for any \(p \neq 2\), the operator \(M_{\phi,p}\) is a positive surjective isometry if and only if \(\phi\) coincides locally almost everywhere with a continuous character of \(G\). This characterization extends results obtained recently (jointly with C.~Arhancet) in the unimodular setting.
Read the full abstract

Numerical Analysis

A low-dissipation central scheme for ideal MHD

Central schemes for conservation laws are Riemann solver free methods which are simple and easy to implement. In recent work for Euler equations [Kurganov & Xin, J. Sci. Comput., 96:56, 2023] their accuracy has been enhanced in terms of better resolution of contact waves. In this paper, we extend this low dissipation central upwind method to the ideal MHD system in one- and two-dimensions. In the two-dimensional case, we separate the variables into two groups: hydrodynamic and magnetic, which are stored at cell centers and faces, respectively. For the the hydrodynamic variables, we apply the low dissipation central upwind scheme while for the magnetic variables, a constrained transport method is used which maintains the divergence-free property of the magnetic field. The time integration is performed with third order strong stability preserving Runge-Kutta scheme. To validate the proposed scheme, we apply this method to several challenging test cases. The results show that the LDCU correction term plays a useful role at the contact discontinuity and enhances the resolution of waves. We also observe experimental second-order accuracy for smooth solutions and the divergence-free condition is maintained to machine precision.
Read the full abstract

Combinatorics

The orthogonal connectedness of polyhedral surfaces

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not orthogonally decomposable.
Read the full abstract

All authors Julia Q. Du, Xuemei He, Xiaotian Song, Daniela Stiller, Liping Yuan, Tudor Zamfirescu

Optimization and Control · Cross-listed from cs.AI

Large Language Model for Discrete Optimization Problems: Evaluation and Step-by-step Reasoning

This work investigated the capabilities of different models, including the Llama-3 series of models and CHATGPT, with different forms of expression in solving discrete optimization problems by testing natural language datasets. In contrast to formal datasets with a limited scope of parameters, our dataset included a variety of problem types in discrete optimization problems and featured a wide range of parameter magnitudes, including instances with large parameter sets, integrated with augmented data. It aimed to (1) provide an overview of LLMs' ability in large-scale problems, (2) offer suggestions to those who want to solve discrete optimization problems automatically, and (3) regard the performance as a benchmark for future research. These datasets included original, expanded and augmented datasets. Among these three datasets, the original and augmented ones aimed for evaluation while the expanded one may help finetune a new model. In the experiment, comparisons were made between strong and week models, CoT methods and No-CoT methods on various datasets. The result showed that stronger model performed better reasonably. Contrary to general agreement, it also showed that CoT technique was not always effective regarding the capability of models and disordered datasets improved performance of models on easy to-understand problems, even though they were sometimes with high variance, a manifestation of instability. Therefore, for those who seek to enhance the automatic resolution of discrete optimization problems, it is recommended to consult the results, including the line charts presented in the Appendix, as well as the conclusions drawn in this study for relevant suggestions.
Read the full abstract

All authors Tianhao Qian, Guilin Qi, Z.Y. Wu, Ran Gu, Xuanyi Liu, Canchen Lyu

Symplectic Geometry

Topological symplectic manifolds and bi-Lipschitz structures

We show that a topological symplectic manifold has a canonically associated bi-Lipschitz structure. As a corollary, we obtain the first examples of non-existence and non-uniqueness for topological symplectic structures. Our arguments hold for any topological manifold admitting an atlas with transition maps that are $C^0$–limits of bi-Lipschitz homeomorphisms.
Read the full abstract

Information Theory

Tensor-Based Modulation on the Unit Circle: A Coding Perspective

Tensor-based modulation (TBM) provides a multi-linear spreading framework for blind multi-user separation in unsourced random access. In this paper, we show that TBM is a coded modulation built on a non-binary linear block code over $\mathbb{Z}_M$, whose symbols are mapped to $M$-PSK modulation, defining a geometrically uniform signal space code. We explicitly derive this generator matrix, characterize its rank deficiency, and show that reference symbols for tensor identifiability correspond to code shortening, producing a quasi-systematic or a systematic code, depending on the number of considered reference symbols for the TBM. Simulations in single-user AWGN and multi-user non-coherent multi-antenna fading channels demonstrate strong robustness and interference resilience, establishing TBM as a scalable, algebraically structured modulation-coding scheme bridging tensor representations and modern coding theory.
Read the full abstract

All authors Sweta Suresh, Charly Poulliat, Claire Goursaud, Maxime Guillaud

Analysis of PDEs

Low Mach Number Limit and Convergence Rates for a Compressible Two-Fluid Model with Algebraic Pressure Closure

We study the low Mach number limit for a viscous compressible two-fluid model with algebraic pressure closure in the three-dimensional torus $\mathbb{T}^3$. The pressure is determined implicitly through the densities of the two phases, which makes the singular limit substantially more delicate than for models with explicit pressure laws. Working in the framework of local-in-time strong solutions, we prove that, for well-prepared initial data, solutions to the rescaled compressible two-fluid system exist on a time interval independent of the Mach number and converge to the solution of the incompressible Navier–Stokes equations as the Mach number tends to zero. In addition, we establish explicit convergence rates for the densities and the velocity field. The proof relies on uniform high-order energy estimates and a relative energy argument adapted to the implicit structure of the pressure law. These results provide a rigorous justification of the low Mach number limit for the compressible two-fluid model with algebraic pressure closure.
Read the full abstract

Dynamical Systems

Shadow chains and Conley chains for continuous-time semiflows

In a recent series of articles we introduced the concept of "stream of a semiflow. A stream is a closed and transitive binary relation which extends the relation "being on the orbit of" and allows to encode the qualitative behavior of a semiflow into a direct graph. The most important stream of a semiflow is its chain stream, based on Charles Conley's chains. In those previous works we omitted several details and proofs on continuous-time semiflows. In the present work we complement those articles as follows: (i) we provide a full proof of the closedness and transitivity of the chain stream for continuous-time semiflows; (ii) we introduce the concept of “shadow chain” for a continuous-time semiflow, based on the Anosov-Sinai-Bowen idea of pseudo-orbit. Shadow chains have the advantage that fit naturally with semiflows arising from differential equations. Our main result is that, although the shadow chain stream and the Conley chain stream are in general distinct as binary relations, they yield the same chain-recurrent set, the same nodes, and the same chain graph whenever the semiflow has strong compact dynamics. While doing this, we also introduce an equivalent definition of recurrent point of a stream in terms of forward-orbit equivalence, which simplifies several arguments below, and we strengthen the definition of s-uniform continuity of a semiflow, fixing a gap in the proof of some important results when the space is not locally compact. This is a radical revision of the first version posted to the arXiv.
Read the full abstract

Combinatorics

On an infinite sequence of strongly regular digraphs with parameters $(9(2n+3), 3(2n+3), 2n+4, 2n+1, 2n+4)$

The paper constructs an infinite sequence of strongly regular directed graphs. The construction is based on representing adjacency matrices as block matrices composed of circulant blocks, together with the use of a compactification operation consistent with polynomial arithmetic modulo $x^{2n+3}-1$. Using computer search with the pychoco library and subsequent analysis of automorphism groups in the GAP system, a stable structural pattern was identified, which made it possible to formulate and prove an explicit formula for the adjacency matrices of the infinite sequence of directed graphs. Among the obtained digraphs, there are examples with parameters $(63, 21, 8, 5, 8)$ and $(81, 27, 10, 7, 10)$, for which the question of existence had previously remained open. A hypothesis on the structure of the automorphism groups of the digraphs in the constructed sequence is also formulated.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Step-Size Decay and Structural Stagnation in Greedy Sparse Learning

Greedy algorithms are central to sparse approximation and stage-wise learning methods such as matching pursuit and boosting. It is known that the Power-Relaxed Greedy Algorithm with step sizes $m^{-\alpha}$ may fail to converge when $\alpha>1$ in general Hilbert spaces. In this work, we revisit this phenomenon from a sparse learning perspective. We study realizable regression problems with controlled feature coherence and derive explicit lower bounds on the residual norm, showing that over-decaying step-size schedules induce structural stagnation even in low-dimensional sparse settings. Numerical experiments confirm the theoretical predictions and illustrate the role of feature coherence. Our results provide insight into step-size design in greedy sparse learning.
Read the full abstract

Analysis of PDEs

Symbol calculus for semiclassical Gevrey operators

We construct a Banach algebra of Gevrey asymptotic symbols that is stable under the semiclassical quantization product and elliptic inversion (microlocal parametrix), and derive sharp quantitative estimates for the coefficients of the full asymptotic inverse. As an application, we obtain exponential estimates for adiabatic projectors in the Gevrey setting.
Read the full abstract

Information Theory

BCH and LCD cyclic codes of length $n=\lambda(q^m+1)$ over finite fields

BCH and LCD cyclic codes of length $n=\lambda(q^m+1)$ with $\lambda\mid q-1$ are studied. A complete characterization of $q$-cyclotomic cosets modulo $n$ is given: Theorem \ref{th4} provides a necessary and sufficient condition for any $0\le \gamma<n$ to be a coset leader, and for odd $m$, the two largest coset leaders are explicitly determined (Theorem \ref{th9} and Theorem \ref{th14}). Based on these results, the dimensions of several families of BCH codes are determined, and the lower bound on the minimal distance of $\mathcal{C}_{(q,n,2\delta+1,n-\delta+1)}$ is raised to $2(\delta+1)$ (Theorem \ref{th15}–\ref{th5}). Notably, several of these codes are optimal. When $m$ is odd, the necessary and sufficient condition for the BCH code $\mathcal{C}_{(q,n,\delta,0)}$ to be dually-BCH is proved (Theorem \ref{th11}). Finally, an exact enumeration of all LCD cyclic codes of this length is derived (Theorem \ref{th3}). All of the above results extend previous results that were limited to $\lambda=1$.
Read the full abstract

Optimization and Control

Heterogeneous Stochastic Momentum ADMM for Distributed Nonconvex Composite Optimization

This paper investigates the distributed stochastic nonconvex and nonsmooth composite optimization problem. Existing stochastic typically rely on uniform step size strictly bounded by global network parameters, such as the maximum node degree or spectral radius. This dependency creates a severe performance bottleneck, particularly in heterogeneous network topologies where the step size must be conservatively reduced to ensure stability. To overcome this limitation, we propose a novel Heterogeneous Stochastic Momentum Alternating Direction Method of Multipliers (HSM-ADMM). By integrating a recursive momentum estimator (STORM), HSM-ADMM achieves the optimal oracle complexity of $\mathcal{O}(\epsilon^{-1.5})$ to reach an $\epsilon$-stationary point, utilizing a strictly single-loop structure and an $\mathcal{O}(1)$ mini-batch size. The core innovation lies in a node-specific adaptive step-size strategy, which scales the proximal term according to local degree information. We theoretically demonstrate this design completely decouples the algorithmic stability from global network properties, enabling robust and accelerated convergence across arbitrary connected topologies without requiring any global structural knowledge. Furthermore, HSM-ADMM requires transmitting only a single primal variable per iteration, significantly reducing communication bandwidth compared to state-of-the-art gradient tracking algorithms. Extensive numerical experiments on distributed nonconvex learning tasks validate the superior efficiency of the proposed HSM-ADMM algorithm.
Read the full abstract

All authors Yangming Zhang, Yongyang Xiong, Jinming Xu, Keyou You, Yang Shi

Differential Geometry

Foliation of area-minimizing hypersurfaces in asymptotically flat manifolds of higher dimension

We prove the existence of foliations by area-minimizing hypersurfaces in asymptotically flat (AF) manifolds with arbitrary dimension and arbitrary ends. Also we provide behaviors of those hypersurfaces near the infinity of AF ends and demonstrate that the singular set of those area-minimizing hypersurfaces is outside AF ends (cf Theorem \ref{thm: foliation}). Building on the positive mass theorem for AF manifolds with arbitrary ends, we establish a global behavior for free-boundary area-minimizing hypersurfaces inside coordinate cylinders in AF manifolds of dimension less than or equal to $8$ (cf. Theorem \ref{thm: 8dim Schoen conj})
Read the full abstract

Numerical Analysis

Numerical Approach for On-the-Fly Active Flow Control via Flow Map Learning Method

We present a data-driven numerical approach for on-the-fly active flow control and demonstrate its effectiveness for drag reduction in two-dimensional incompressible flow past a cylinder. The method is based on flow map learning (FML), a recently developed framework for modeling unknown dynamical systems that is particularly effective for partially observed systems. For active flow control, we construct an FML dynamical model for the quantities of interest (QoIs), namely the drag and lift forces. During offline learning, training data are generated for the responses of drag and lift to the control variable, and a deep neural network (DNN)-based FML model is constructed. The learned FML model enables online optimal flow control without requiring simulations of the flow field. We demonstrate that the FML-based approach can be integrated with existing optimal control strategies, including deep reinforcement learning (DRL) and model predictive control (MPC). Numerical results show that the proposed approach enables on-the-fly flow control and achieves more than $20\%$ drag reduction. By eliminating the need for forward simulations during control optimization, the approach offers the potential for real-time optimal control in other systems.
Read the full abstract