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

4080120160 · Jun 202019922001200920172026
48 results for Eulerian formulation

A new method solves high-dimensional MFGs using particle-based flow matching.

problem Solving high-dimensional Mean-Field Games (MFGs) is computationally challenging.
method Proposes a particle-based deep Flow Matching (FM) method to update particles and train a flow neural network.
result Proves convergence of the scheme to a stationary point sublinearly and linearly under convexity assumptions.

Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.

problem Unknottability of spatial graphs by region crossing changes.
method Region crossing changes to switch over/under relations within regions of spatial graph diagrams.
result Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.

Smartfluidnet accelerates Eulerian fluid simulation with neural networks.

problem Current neural network methods for Eulerian fluid simulation lack flexibility and generalization.
method Smartfluidnet automates model generation and dynamic switching to meet user requirements.
result Smartfluidnet achieves 1.46x and 590x speedup compared to state-of-the-art models, with better simulation quality.

A graph (digraph) G=(V,E)G=(V,E) with a set TVT\subseteq V of terminals is called inner Eulerian if each nonterminal node vv has even degree (resp. the numbers of edges entering and leaving vv are equal). Cherkassky and Lovász showed that the maximum number of pairwise edge-disjoint TT-paths in an inner Eulerian graph $G…

2005-10-21abs ↗pdf ↗

We present a unified derivation of covariant time derivatives, which transform as tensors under a time-dependent coordinate change. Such derivatives are essential for formulating physical laws in a frame-independent manner. Three specific derivatives are described: convective, corotational, and directional. The covaria…

2001-02-28abs ↗pdf ↗

Study controls bifurcations in Eulerian flows with multiple Hopf singularities.

problem Bifurcation analysis and control of nonlinear Eulerian flows with non-resonant n-tuple Hopf singularities.
method Analysis of CW complex bifurcations of flow-invariant Clifford hypertori, using leaf-bifurcation varieties.
result Tertiary toral CW complex bifurcates from and persists outside a secondary toral CW complex.

New method preserves topology in Hodge decomposition for scalar and vector fields.

problem Topology-preserving Hodge decomposition on manifolds with boundaries.
method Comprehensive 5-component decomposition in Eulerian representation.
result Effective numerical experiments validate the method's accuracy and orthogonality.

We prove a number of new restrictions on the enumerative properties of homology manifolds and semi-Eulerian complexes and posets. These include a determination of the affine span of the fine hh-vector of balanced semi-Eulerian complexes and the toric hh-vector of semi-Eulerian posets. The lower bounds on simplicial h…

2007-09-25abs ↗pdf ↗

The study constructs links from polytope subgraphs and proves their hyperbolic properties.

problem Proving hyperbolic structures for links from polytope subgraphs.
method Construction of 3-manifolds from polytope subgraphs and analysis of their topology.
result Hyperbolic links are parametrized by specific subgraphs in hyperbolic polytopes.

Study on linking numbers in random book embeddings of complete graphs.

problem Distribution and mean of linking numbers in random book embeddings of complete graphs.
method Analyzes a family of two-component links arising from random embeddings of complete graphs, using Eulerian numbers and linear growth in mean linking number.
result Mean of squared linking number over all random embeddings is $ rac{i}{6}$, where ii is the number of interior edges.

Combines geometric hydrodynamics with magnetic systems to derive new equations and prove well-posedness.

problem Deriving new equations for magnetic systems and proving their well-posedness.
method Introducing the magnetic Euler-Arnold equation and proving well-posedness for specific equations.
result Local and global well-posedness results for the magnetic Euler-Arnold equation associated with the global quasi-geostrophic equations.

An explicit expression is obtained for the sectional curvature in the plane spanned by two stationary flows, cos(k, x) and cos(l, x). It is shown that for certain values of the wave vectors k and l the curvature becomes positive for alpha > alpha_0, where 0 < alpha_0 < 1 is of the order 1/k. This suggests that the flow…

2000-07-09abs ↗pdf ↗

Study Alexander polynomials of special alternating links and generalize Fox's conjecture.

problem Distinguish special alternating links up to isotopy using polynomial invariants.
method Combinatorial and discrete geometric properties of Alexander polynomials of special alternating links.
result Generalized Alexander polynomials of special alternating links can be expressed in terms of volumes of root polytopes of unimodular matrices.

Develops a real-analytic embedding for diffeomorphisms of the line, linking to Fisher-Rao geometry.

problem Embedding diffeomorphisms of the line in a geometric framework.
method Real-analytic embedding, LpL^p Fisher-Rao geometry, Schwarzian curvature.
result Establishes a connection between diffeomorphisms and Fisher-Rao geometry, providing explicit geodesics and connections.

This paper provides a precise sense in which the time t map for the Euler equations of an ideal fluid in a region in R^n (or a smooth compact n-manifold with boundary) is a Poisson map relative to the Lie-Poisson bracket associated with the group of volume preserving diffeomorphism group. This is interesting and nontri…

2007-11-30abs ↗pdf ↗

LPINNs solve complex PDEs by reformulating PINNs on Lagrangian frame, reducing training complexity.

problem Complexity in training PINNs, especially for convection-diffusion equations.
method Propose LPINNs, a Lagrangian reformulation of PINNs, with two branches solving state variables and characteristics curves.
result Loss landscapes of LPINNs are less sensitive to problem complexity compared to traditional PINNs.

Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon graphs of a knot or link diagram that arise from Seifert states. We provide a ch…

2011-06-21abs ↗pdf ↗

We investigate the integration of a planning mechanism into sequence-to-sequence models using attention. We develop a model which can plan ahead in the future when it computes its alignments between input and output sequences, constructing a matrix of proposed future alignments and a commitment vector that governs whet…

2017-11-28abs ↗pdf ↗

We survey the role of symmetry in diffeomorphic registration of landmarks, curves, surfaces, images and higher-order data. The infinite dimensional problem of finding correspondences between objects can for a range of concrete data types be reduced resulting in compact representations of shape and spatial structure. Th…

2014-12-23abs ↗pdf ↗

Improved linear upper bound for ribbonlength of knots.

problem Estimating the ribbonlength of knots and links.
method Using four-page open book decompositions and spanning trees of checkerboard graphs, constructing a four-page presentation with at most 2c(K) arcs.
result Proved that ribbonlength is bounded above by the four-page index, leading to the linear bound Rib(K) ≤ 2c(K).

Study uses outer metrics for PDE-constrained shape optimization over diffeomorphism group.

problem Optimizing shapes governed by PDEs over the diffeomorphism group.
method Outer metrics on diffeomorphism group, Riemannian steepest descent method.
result Riemannian approach outperforms other metrics in solving PDE-constrained shape optimization problems.

We define a new notion of total curvature, called net total curvature, for finite graphs embedded in Rn, and investigate its properties. Two guiding principles are given by Milnor's way of measuring the local crookedness of a Jordan curve via a Crofton-type formula, and by considering the double cover of a given graph …

2011-01-12abs ↗pdf ↗

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and p2+p3=ip_2+p_3=i. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are obtained by starting with an edge and continuing at each vertex by the edge oppo…

2002-12-27abs ↗pdf ↗

We consider Lagrangian coherent structures (LCSs) as the boundaries of material subsets whose advective evolution is metastable under weak diffusion. For their detection, we first transform the Eulerian advection-diffusion equation to Lagrangian coordinates, in which it takes the form of a time-dependent diffusion or h…

2016-08-19abs ↗pdf ↗

Many models in mathematical physics are given as non-linear partial differential equation of hydrodynamic type; the incompressible Euler, KdV, and Camassa--Holm equations are well-studied examples.A beautiful approach to well-posedness is to go from the Eulerian to a Lagrangian description.Geometrically it corresponds …

2018-10-08abs ↗pdf ↗

The paper studies conjugate points on Lie groups with specific metrics.

problem Existence and properties of conjugate points on Lie groups with left-invariant metrics.
method Using reformulated index form in terms of adjoint action, the paper proves sufficient conditions for conjugate points and provides bounds and criteria.
result All geodesics in compact semisimple Lie groups have conjugate points, with upper and lower bounds on conjugate times.

In this paper we offer a novel type of network model which can capture the precise structure of a financial market based, for example, on empirical findings. With the attached stochastic framework it is further possible to study how an arbitrary network structure and its expected counterparty credit risk are analytical…

2015-04-26abs ↗pdf ↗

Jointly estimates flow fields and particle properties from Lagrangian data.

problem Estimating flow fields and particle properties from sparse, noisy Lagrangian data.
method Data assimilation framework coupling Eulerian and Lagrangian models.
result Joint estimation of flow fields and particle properties in various flow regimes.

Optimal data-driven formulations are found for learning and decision-making with historical data.

problem Designing optimal learning and decision-making formulations from historical data.
method Define a yardstick for measuring formulation quality, then construct an optimal formulation that is uniformly closer to the true cost.
result Existence of three distinct out-of-sample performance regimes with corresponding optimal formulations.