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,742 papers · 148 categories

Trend · papers per month

82163245326 · Jun 202019922001200920172026
48 results for multicomponent systems

The paper solves integrable systems of PDEs, including famous equations.

problem Constructing solutions for multicomponent integrable PDEs.
method Reduction to a finite-dimensional system, using Nijenhuis geometry.
result Animations of multi-component soliton and cnoidal solutions.

Model predicts viscosity of multicomponent systems efficiently.

problem Expensive experimental viscosity measurements in various industries.
method Artificial neural networks trained on a database of chemical systems and temperatures.
result Model Viskositas provides more accurate predictions with lower errors, variability, and outliers.

The formal structure of geometrical thermodynamics is reviewed with particular emphasis on the geometry of equilibria submanifolds. On these submanifolds thermodynamic metrics are defined as the Hessian of thermodynamic potentials. Links between geometry and thermodynamics are explored for single and multiple component…

2005-07-08abs ↗pdf ↗

New hierarchies and equations derived from Poisson structures.

problem Development of new hierarchies and equations from Poisson structures.
method Introduction and classification of multicomponent Poisson structures, derivation of hierarchies and equations.
result New Harry Dym and Hunter-Saxton equations derived for arbitrary number of components.

The paper explores weight systems and their applications to graph and embedded graph invariants.

problem Developing weight systems for graphs and embedded graphs.
method Construction of weight systems from graph invariants and metrized Lie algebras, and extending to arbitrary embedded graphs.
result Explicit forms of generating functions and recurrence relations for weight systems on chord diagrams and embedded graphs.

Study Frobenius pencils and compatible non-homogeneous Poisson structures.

problem Compatibility of multicomponent local Poisson structures.
method Algebraic interpretation via Frobenius algebras and classification of Frobenius pencils.
result Classification of Frobenius pencils under generic conditions.

We investigate rational homology cobordisms of 3-manifolds with non-zero first Betti number. This is motivated by the natural generalization of the slice-ribbon conjecture to multicomponent links. In particular we consider the problem of which rational homology S1×S2S^1\times S^2's bound rational homology S1×D3S^1\times D^3'…

2015-02-13abs ↗pdf ↗

Geometric interpretations of some virtual knot invariants are given in terms of invariants of links in S3\mathbb{S}^3. Alexander polynomials of almost classical knots are shown to be specializations of the multi-variable Alexander polynomial of certain two-component boundary links of the form JKJ \sqcup K with JJ a fi…

2017-06-23abs ↗pdf ↗

Motivated by the sigma model limit of multicomponent Ginzburg-Landau theory, a version of the Faddeev-Skyrme model is considered in which the scalar field is coupled dynamically to a one-form field called the supercurrent. This coupled model is investigated in the general setting where physical space is an oriented Rie…

2008-12-08abs ↗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.

Estimates input from output of nonlinear systems using ANN.

problem Estimating unknown compositional input from system output.
method Artificial Neural Networks (ANNs) for nonlinear system inversion.
result ANNs can compete with optimal bounds for linear systems and demonstrate promising results for nonlinear 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.

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.

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.

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.