Simpler method derived for path geometries on surfaces, characterizing projective path geometries.
problem Characterizing projective path geometries on surfaces.
method Solving the equivalence problem of sub-Riemannian geometry of signature (1,1) on a contact 3-manifold.
result Characterization of projective path geometries in terms of their chains.
Study path geometries with constant torsion and cone structures.
problem Characterizing path geometries with nontrivial torsion.
method Introducing constant torsion, establishing correspondence with cone structures, describing in terms of integrable systems.
result Path geometries with constant torsion correspond to cone structures on homogeneous ruled surfaces.
Sub-Riemannian geometry connects bike paths to mathematical curves.
problem Understanding bike paths and their mathematical properties.
method Relating sub-Riemannian geometry to bicycle motion and curve shapes.
result Geodesics in sub-Riemannian geometry correspond to specific bike paths.
Develops Weyl structures for path geometries, simplifying their study.
problem Complexity in studying path geometries using traditional differential geometry methods.
method Defines distinguished connections and Schouten tensor, proving their dependence on line bundle sections.
result Shows a smaller subclass of Weyl structures for path geometries, with interesting connections to BGG sequences.
Derives path-integrals for superstrings on curved backgrounds using string geometry theory.
problem Calculating path-integrals for superstrings on curved backgrounds.
method Derives path-integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path-integrals for perturbative superstrings on all string backgrounds.
Characterizes chains in 3D CR and para-CR structures.
problem Determining when a 3D path geometry comes from CR or para-CR chains.
method Provides necessary and sufficient conditions for a 3D path geometry to arise from chains of CR or para-CR 3-manifolds, and verifies computationally.
result Characterization of chains in 3D CR and para-CR structures.
Derives path integrals for perturbative strings on various backgrounds.
problem Calculating path integrals for strings on curved backgrounds.
method Derives path integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path integrals of all order perturbative strings on various backgrounds.
EntroPath learns manifold geometry from diffusion paths.
problem Learning geodesic geometry from data graphs with spurious shortcuts.
method Maximum Entropy Path Ensemble Embedding (MERW) with k-step diffusion paths.
result EntroPath converges to squared geodesic distance in the short-time limit.
Recently, it has been shown that Absolute Parallelism (AP) geometry admits paths that are naturally quantized. These paths have been used to describe the motion of spinning particles in a background gravitational field. In case of a weak static gravitational field limits, the paths are applied successfully to interpret…
Defines Lewy curves in para-CR geometry and characterizes their path geometries.
problem Characterizing path geometries defined by para-CR Lewy curves.
method Definition and characterization of para-CR Lewy curves in various dimensions.
result Lewy curves determine the para-CR structure up to sign in flat cases.
We revisit the choice of SGD for training deep neural networks by reconsidering the appropriate geometry in which to optimize the weights. We argue for a geometry invariant to rescaling of weights that does not affect the output of the network, and suggest Path-SGD, which is an approximate steepest descent method with …
The paper shows that almost every path structure is not variational.
problem Determining if a path structure is variational.
method Generalized Douglas's result to higher dimensions and analyzed path geometries with infinitesimal symmetries.
result Almost every path structure is not variational.
Chen's iterated integrals are treated within synthetic differential geometry. The main result is that iterated integrals produce a subcomplex of the de Rham complex on the free path space as well as based path spaces.
Geodesics connect model modes in neural network loss landscapes.
problem Connecting modes in neural network loss landscapes.
method Reframed mode connectivity in Information Geometry, hypothesized geodesics as mode-connecting paths, proposed algorithm to approximate geodesics.
result Geodesics achieve mode connectivity in neural networks.
The study identifies volatility models from path geometry using signature-based methods.
problem Identifying different stochastic volatility models from observed data.
method Mapping volatility trajectories into a feature space via truncated path signatures and applying a gradient boosting classifier.
result The method achieves high classification accuracy across various volatility dynamics and parameter settings.
Two constructions link path geometries to almost Grassmann structures.
problem Linking path geometries to almost Grassmann structures.
method Introducing two Fefferman-type constructions.
result Characterizing conditions for almost Grassmann structures arising from these constructions.
Contact path geometries are curved geometric structures on a contact manifold comprising smooth families of paths modeled on the family of all isotropic lines in the projectivization of a symplectic vector space. Locally such a structure is equivalent to the graphs in the space of independent and depedent variables of …
Recently, the behavior of different epidemic models and their relation both to different types of geometries and to some biological models has been revisited . Path equations representing the behavior of epidemic models and their corresponding deviation vectors are examined. A comparison between paths and their deviati…
Absolute parallelism geometry is frequently used for physical applications. It has two main defects, from the point of view of applications. The first is the identical vanishing of its curvature tensor. The second is that its autoparallel paths do not represent physical trajectories. The present work shows how these de…
We introduce a geometric transition between two homogeneous three-dimensional geometries: hyperbolic geometry and anti de Sitter (AdS) geometry. Given a path of three-dimensional hyperbolic structures that collapse down onto a hyperbolic plane, we describe a method for constructing a natural continuation of this path i…
New SigSwap model for path-dependent financial risk.
problem Managing complex, path-dependent financial risks.
method Geometry-based approach using path-signature and Signature Expected Shortfall.
result Path-dependent risks can be converted into transparent risk factors.
String geometry theory connects strings to space-time and finds string vacua.
problem Identify and find the global minimum of the string vacuum.
method Identify perturbative vacua, derive path-integrals, and solve the global minimum using analytical and numerical methods.
result The global minimum of the effective potential is the string vacuum.
Identifies all perturbative vacua in bosonic string theory.
problem Identifying all perturbative vacua in bosonic string theory.
method Completely identified perturbative vacua through string fluctuations.
result Derivation of path-integrals up to any order from fluctuations.
A new formula connects supersymmetric path integrals to Chern-Simons theory.
problem Constructing a rigorous path integral for supersymmetric theories on spin manifolds.
method Using Chen differential forms and non-commutative geometry, a Chern-Simons transgression formula is derived.
result The supersymmetric path integral induces a differential topological invariant.
An almost complex structure J on a 4-manifold X may be described in terms of a rank 2 vector bundle E. A splitting of J consists of a pair of line bundles spanning E. A hypersurface M in X satisfying a nondegeneracy condition inherits a CR-structure from J and a path geometry from the splitting. Using the Cartan-Kähler…
3D hyperbolic spaces have endless simple paths.
problem Finding simple paths in complex 3D spaces.
method Analyzing geodesics in hyperbolic 3-manifolds.
result Cusped hyperbolic 3-manifolds have infinitely many simple closed geodesics.
Link between Teichmüller and anti de Sitter geometry via length functions.
problem Understanding the geometry of Teichmüller space and anti de Sitter manifolds.
method Establishing a connection between Teichmüller space and anti de Sitter geometry through length functions.
result New purely anti de Sitter proofs of Teichmüller theory results.
Quantum connections replace metrics with operator inner products.
problem Quantifying geometric properties in quantum systems.
method Defining quantum connections and duals using operator fields and inner products.
result Holonomy and dual connections are equivalent in quantum geometry.
GH-PID uses guided harmonic paths for efficient SOT with interpretable diagnostics.
problem Efficiently solving Stochastic Optimal Transport with hard terminal distributions and soft costs.
method Guided Harmonic Path-Integral Diffusion (GH-PID) framework with low-dimensional guidance.
result GH-PID generates geometry-aware, cost-reducing trajectories that match terminal distributions.
The paper extends symplectic techniques to generalized complex geometry.
problem Creating stable generalized complex structures on high-dimensional manifolds.
method Introducing generalized Luttinger surgery and generalized Gluck twist.
result Produced stable generalized complex structures with non-homotopy-equivalent components.
Study shows saddle connection graph's geometry and quasi-isometry properties.
problem Characterize the geometry and quasi-isometry of saddle connection graphs.
method Proved 4-hyperbolicity and uniform quasi-isometry to a tree, used generalised unicorn paths.
result Saddle connection graph is not quasi-isometrically rigid and its boundary is straight foliations.
The paper sparsifies networks by finding efficient paths in their functional space.
problem Sparsifying neural networks to improve performance and efficiency.
method The authors use the geometry of weight spaces and functional manifolds to find efficient paths (geodesics) in the functional space of neural networks.
result The proposed framework can sparsify networks and improve performance on various tasks.
The paper explores the geometry of the Spence-Kummer trilogarithm equation and its Galois analogue.
problem Investigating the geometry and functional equation of the Spence-Kummer trilogarithm.
method Using algebraic relations between polylogarithm generating series and path systems, along with tensor and homotopy criteria for functional equations.
result Derives a precise form of the Spence-Kummer equation and its Galois analogue.
Develops derived differential geometry theory.
problem Homotopy and intersection in smooth manifolds.
method Using L∞[1]-algebras and homotopy transfer. result Derived manifolds form a category of fibrant objects.
We present evolution equations for a family of paths that results from anisotropically weighting curve energies in non-linear statistics of manifold valued data. This situation arises when performing inference on data that have non-trivial covariance and are anisotropic distributed. The family can be interpreted as mos…
In this paper, we report a "new" continuity path which links the constant scalar curvature equation to a second order elliptic equation. This is largely an expository article where we describes various aspects of geometry and analysis associated with path.
Study of free particle's geometry and its perturbations using complex projective structures.
problem Understanding the geometry of a free particle and its perturbations.
method Use of complex projective structures and quasiconformal geometry to study perturbations.
result Main results loosely modeled on algebraic transformation theory, foundational for geometric understanding of the exact WKB method.
Develops a lifting theory for exponential maps in semi-Riemannian geometry.
problem Overcoming singularities in exponential maps to prove geodesic connectivity.
method Lifting theory for semi-Riemannian manifolds with path-continuation property.
result General path-lifting theorem extending globally under certain conditions.
Characterizes paths minimizing anisotropic lengths in Euclidean space.
problem Finding paths of minimal anisotropic length between points.
method Characterization through geometric connection to anisotropic isoperimetric set.
result Established a connection between minimizing paths and anisotropic isoperimetric geometry.
A new method uses string method to explore diffusion models.
problem Understanding the geometry of learned distributions in diffusion models.
method String method to compute continuous paths between samples.
result The string method identifies realistic morphing sequences and transition pathways.
In this paper, we use Floer theory to study the Hofer length functional for paths of Hamiltonian diffeomorphisms which are sufficiently short. In particular, the length minimizing properties of a short Hamiltonian path are related to the properties and number of its periodic orbits.
The Riemannian geometry is one of the main theoretical pieces in Modern Mathematics and Physics. The study of Riemann Geometry in the relevant literature is performed by using a well defined analytical path. Usually it starts from the concept of metric as the primary concept and by using the connections as an intermedi…
The abstract discusses a new causal structure on manifolds using paths and points.
problem Constructing a causal structure on manifolds using paths and points.
method Constructing a four-manifold from pairs of points and paths, and a seven-dimensional manifold from pairs of points and conics.
result The causal structure corresponds to a conformal structure only when the underlying surface is a real projective plane.
Neural network learns from higher-order connections in molecules.
problem Graph neural networks fail to account for local and hidden structures in graphs.
method Developed a neural network that can pass messages and aggregate information across higher-order paths.
result The model improves molecular property prediction.
For sub-Riemannian manifolds with a chosen complement, we first establish the derivative formula and integration by parts formula on path space with respect to a natural gradient operator. By using these formulae, we then show that upper and lower bounds of the horizontal Ricci curvature correspond to functional inequa…
String geometry theory uniquely determines classical action with T-symmetry.
problem Non-renormalizability and loop corrections in string theory.
method Distinguishes effects of β and ħ parameters, proving no loop corrections.
result No loop corrections in string geometry theory, avoiding non-renormalizability.
Adapts IG for better feature attributions and robustness.
problem Reliability concerns in feature attributions for deep learning models.
method Adaptation of path-based feature attribution to Riemannian geometry of data manifolds.
result IG along geodesics generates more intuitive and robust explanations.
New geometric analysis of PWSPDs balances density and geometry in high-dimensional data.
problem Balancing density and geometry in high-dimensional data.
method Power-weighted shortest-path distances (PWSPDs) and their geometric and computational analyses.
result High probability guarantees on the equivalence of PWSPDs on complete and nearest neighbor graphs.