Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

82163245326 · Jun 202019922001200920172026
48 results for AKNS system

We introduce a new integrable system hierarchy which is a restriction of the AKNS nxn hierarchy coming from an unusual splitting of the loop algebra. This splitting comes from an automorphism of the loop algebra instead of an automorphism of SL(n,C). It is known that the 2x2 KdV is the standard KdV hierarchy.

2006-11-03abs ↗pdf ↗

We find generators for the full rational loop group of GL(n,C) as well as for the subgroup consisting of loops that satisfy the reality condition with respect to the noncompact real form GL(n,R). We calculate the dressing action of some of those generators on the positive loop group, and apply this to the ZS-AKNS flows…

2009-10-09abs ↗pdf ↗

Conservation laws, heirarchies, scattering theory and Bäcklund transformations are known to be the building blocks of integrable partial differential equations. We identify these as facets of a theory of Poisson group actions, and apply the theory to the ZS-AKNS nxn heirarchy (which includes the non-linear Schrödinger …

1997-07-07abs ↗pdf ↗

We study a simple model of bicycle motion: a segment of fixed length in multi-dimensional Euclidean space, moving so that the velocity of the rear end is always aligned with the segment. If the front track is prescribed, the trajectory of the rear wheel is uniquely determined via a certain first order differential equa…

2017-05-17abs ↗pdf ↗

Study null curves and their motion in 3D flat space-time, leading to integrable hierarchies.

problem Understanding null curves and their motion in 3D flat space-time.
method Analyzing the motion of null curves and their surfaces, deriving integrability conditions and hierarchies.
result Obtained one- and two-soliton surfaces associated with the MKdV equation, showing singularities in finite time.

We study the relation between the centro-affine geometry of star-shaped planar curves and the projective geometry of parametrized maps into $\RP^1$. We show that projectivization induces a map between differential invariants and a bi-Poisson map between Hamiltonian structures. We also show that a Hamiltonian evolution …

2008-08-26abs ↗pdf ↗

This paper is an expository account of the development of soliton mathematics, from its inception in famous numerical experiments of Fermi-Pasta-Ulam and Zabusky-Kruskal to the recent synthesis of Terng-Uhlenbeck (dg-ga/9707004) that explains hidden symmetries of soliton equations in terms of loop-groups acting by dres…

1997-08-08abs ↗pdf ↗

Soliton spheres are immersed 2-spheres in the conformal 4-sphere S^4=HP^1 that allow rational, conformal parametrizations f:CP^1->HP^1 obtained via twistor projection and dualization from rational curves in CP^{2n+1}. Soliton spheres can be characterized as the case of equality in the quaternionic Pluecker estimate. A …

2009-05-13abs ↗pdf ↗

We construct a local action of the group of rational maps from S2S^2 to GL(n,C)GL(n,C) on local solutions of flows of the ZS-AKNS sl(n,C)sl(n,C)-hierarchy. We show that the actions of simple elements (linear fractional transformations) give local Bäcklund transformations, and we derive a permutability formula from different fact…

1998-05-18abs ↗pdf ↗

Overview of integrable systems with symmetries, focusing on toric and semitoric systems.

problem Classifying and understanding integrable systems with symmetries.
method Using decorated polygons and controlled bifurcations in one-parameter families of systems.
result Construction of explicit semitoric systems with prescribed invariants.

Learning to control linear systems is statistically hard, especially for underactuated systems.

problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.

Discrete-time systems can be characterized by simple flat coordinates and their shifts.

problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.

The paper explores when linear system identification is hard or easy, especially for under-actuated systems.

problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.

This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.

problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an 1\ell_1-regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension.
result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.

In integrable hydrodynamic systems, coordinates exist where generators and symmetries are simple.

problem Existence of Riemannian invariants for integrable systems of hydrodynamic type.
method Finding coordinates where the generator and all symmetries are diagonal.
result In integrable hydrodynamic systems, there exist coordinates where the generator and all symmetries are diagonal.

This paper studies nonholonomic constraints in Hamiltonian systems, deriving equations and theorems.

problem Analyzing nonholonomic constraints in Hamiltonian systems.
method Deriving distributional RCH systems, geometric constraint conditions, and Hamilton-Jacobi theorems.
result Derives precise geometric constraint conditions and Hamilton-Jacobi theorems for nonholonomic systems.

This paper considers control systems defined on Lie algebroids. After deriving basic controllability tests for general control systems, we specialize our discussion to the class of mechanical control systems on Lie algebroids. This class of systems includes mechanical systems subject to holonomic and nonholonomic const…

2004-02-26abs ↗pdf ↗

Systemic risk refers to the risk that the financial system is susceptible to failures due to the characteristics of the system itself. The tremendous cost of systemic risk requires the design and implementation of tools for the efficient macroprudential regulation of financial institutions. The current paper proposes a…

2015-02-27abs ↗pdf ↗

The paper develops methods to derive mixed superposition rules for Lie systems and applies them to various physical systems.

problem Finding general solutions for Lie systems.
method Develops mixed superposition rules for Lie systems with imprimitive Lie algebras and semidirect sums.
result Extends coalgebra method to Lie systems of partial differential equations.

Paper develops reduction theory for controlled Lagrangian systems with symmetry and momentum map.

problem Reduction of controlled Lagrangian systems with symmetry and momentum map.
method Using Legendre transformation and Euler-Lagrange vector field, the paper extends symmetric reduction theory.
result Established regular reduction theory for RCL systems with symmetry and momentum map.

The paper studies connections in superintegrable systems, revealing geometric insights.

problem Understanding non- and semi-degenerate superintegrable systems.
method Analyzes two torsion-free connections associated with superintegrable systems.
result Semi-degenerate secondary structure tensor is the Ricci curvature of a natural torsion-free connection.

This paper proposes a system-agnostic policy for dynamic scheduling.

problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.

New Lie systems derived from Goursat distributions with applications to differential equations.

problem Analyzing Lie systems associated with Goursat distributions and their applications.
method Analyzing bracket-generating distributions and their relation to Lie systems, focusing on reductions and reconstructions.
result Lie systems associated with Goursat distributions can be reduced and solutions reconstructed from reduced systems.

Study integrable discretizations of cyclic systems with circular coordinate lines.

problem Integrable discretizations of 3D cyclic systems with circular coordinate lines.
method Investigate circle congruences and flat connections in the context of discrete cyclic systems.
result Characterization of circle congruences and existence of certain flat connections.

A new chaotic financial system is proposed by considering ethics involvement in a four-dimensional financial system with market confidence. A five-dimensional conformable derivative financial system is presented by introducing conformable fractional calculus to the integer-order system. A discretization scheme is propo…

2019-03-11abs ↗pdf ↗

A distributed system identification method for LTI systems using reverse experience replay.

problem Online system identification of LTI systems over multi-agent networks.
method DSGD-RER, a distributed variant of SGD-RER with backward updates.
result The estimation error decreases as the network size grows.

This work extends reduction processes for nonholonomic discrete mechanical systems.

problem Nonholonomic discrete mechanical systems and their reductions.
method Introduces a category LDPdLDP_d of discrete-time dynamical systems and a two-stage reduction process.
result Two-stage reduction process produces systems isomorphic to one-stage reduction.

Proposes a RL method using simulators for stabilizing uncertain systems.

problem Limited experiences and potential dangerous actions during RL learning of real systems.
method Two-stage approach: virtual systems for Q-function learning, real system interactions for final policy.
result Proposed method improves RL performance in uncertain discrete-time systems.

New method for constructing contact Lie systems on various spaces.

problem Constructing contact Lie systems on Riemannian and Lorentzian spaces.
method Adaptation of scaling symmetries to Lie-Hamilton systems, leading to contact Lie systems.
result Curvature-dependent reductions of contact Lie systems on Cayley-Klein spaces.

New model stabilizes asynchronous LTI systems, independent of synchronous stability.

problem Stability of asynchronous LTI systems under randomization and asynchrony.
method Introduced a new model for random asynchronous LTI systems and developed a method for system identification.
result Stability of random asynchronous LTI systems is independent of synchronous stability.