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

Trend · papers per month

82163245326 · Jun 202019922001200920172026
48 results for graph-Hörmander systems

Paper constructs solutions for a class of overdetermined systems.

problem Constructing solutions for a class of overdetermined systems.
method Resolution of the solution sheaf, sufficient condition for global exactness, gluing techniques, local solvability of the Treves complex.
result Obtained a sufficient condition for global exactness, leading to gluing techniques for local solutions.

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nont…

2007-05-15abs ↗pdf ↗

The spectral geometry of mesh matrices of graphs is explored, leading to new formulas and eigenvalue estimates.

problem Understanding the spectral properties of mesh matrices of graphs.
method Definition and study of mesh matrices, introduction of mesh Laplacian, derivation of characteristic polynomial formulas.
result Mesh Laplacian eigenvalues are all real and greater than or equal to 1, with a smallest positive eigenvalue estimated.

In this paper, we extend Meek's conjecture (Meek 1997) from directed and acyclic graphs to chain graphs, and prove that the extended conjecture is true. Specifically, we prove that if a chain graph H is an independence map of the independence model induced by another chain graph G, then (i) G can be transformed into H …

2011-09-25abs ↗pdf ↗

A plane graph HH is a {\em plane minor} of a plane graph GG if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes GG to HH. Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmativ…

2019-05-06abs ↗pdf ↗

Quotients of Gordian and H(2)-Gordian graphs are hyperbolic.

problem Investigate quotients of Gordian and H(2)-Gordian graphs under knot invariants.
method Defined equivalence relations by knot invariants (det, Jones span, tricolorability) and showed quotient graphs are Gromov hyperbolic.
result Quotients of H(2)-Gordian graph of links modulo span of Jones polynomial is isomorphic to complete graph.

Innovative advances validate a conjecture on maximal hypoellipticity in sub-Riemannian geometry.

problem Characterizing maximal hypoellipticity in sub-Riemannian geometry.
method Generalization of Connes tangent groupoid, pseudodifferential calculus, and invertibility of principal symbol.
result Validation of Helffer and Nourrigat's conjecture on maximal hypoellipticity.

Higher dimensional graphs can be used to colour two-dimensional geometric graphs. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colourable with 4 colours. The later goal is achieved if all interior edge degrees are even. Using a refinement process which cuts the in…

2014-12-22abs ↗pdf ↗

The paper proves existence of solutions to Kazdan-Warner equations on finite graphs.

problem Existence of solutions to Kazdan-Warner equations on finite graphs.
method Variational methods and eigenvalue analysis.
result The paper proves the existence of solutions to the Kazdan-Warner equations under various conditions.

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.

With the growth of renewable generation (RG) and the development of associated ride through curves serving as operating limits, during disturbances, on violation of these limits, the power system is at risk of losing large amounts of generation. In order to identify preventive control measures that avoid such scenarios…

2019-09-15abs ↗pdf ↗