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

15304560 · May 202619922001200920172026
48 results for geodesic simplices

Projective geodesic extensions for nonholonomic systems are derived under conformal transformations.

problem Deriving conditions for projective geodesic extensions in nonholonomic mechanics.
method Analyzing necessary and sufficient conditions for existence under conformal modifications.
result Conditions for existence of projective geodesic extensions in nonholonomic systems under conformal transformations.

Study transverse measures on infinite type hyperbolic surfaces.

problem Characterize the cone of transverse measures on infinite type hyperbolic surfaces.
method Use inverse limits and geodesic laminations to describe and construct cones of transverse measures.
result Explicit descriptions and bases of cones of transverse measures exist for many laminations.

Proves simplicity of Lyapunov exponents for specific Anosov flows.

problem Proving all Lyapunov exponents have multiplicity 1 for certain Anosov flows.
method Perturbative results for flows, modification of eigenvalues, Markov partition, and simplicity criterion.
result In a C1C^1-open and CkC^k-dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.

Injectivity of geodesic X-ray transform on low-regularity manifolds.

problem Injectivity of geodesic X-ray transform on manifolds with low regularity.
method Calculus of differential and curvature operators on non-smooth structures.
result Injectivity of geodesic X-ray transform on simple Riemannian manifolds with C1,1C^{1,1}-regularity.

The paper improves bounds on geodesic lengths and their simplicity on hyperbolic surfaces.

problem Estimating the distribution of geodesic lengths on hyperbolic surfaces.
method Analyzing the moduli space of hyperbolic surfaces with the Weil-Petersson metric.
result Most geodesics of certain lengths are simple and non-separating, confirming a conjecture.

New findings on lightconvex boundaries in Finslerian spacetimes.

problem Understanding causal structures in Finslerian spacetimes.
method General results for indefinite Finslerian manifolds with boundary, and equivalence among boundary lightconvexity, causally simple interior, and Hausdorff space of cone geodesics.
result Equivalence among boundary lightconvexity, causally simple interior, and Hausdorff space of cone geodesics in globally hyperbolic spacetimes.

A new method defines bounded cohomology classes from differential forms.

problem Defining bounded cohomology classes from differential forms.
method Integration over geodesic simplices and Fourier analysis on the hyperbolic plane.
result The method defines an injective embedding of differential forms into bounded cohomology classes.

The paper establishes conditions for Riemannian connections and semi-simplicity of Lie algebras using spray structures.

problem Conditions for Riemannian connections and semi-simplicity of Lie algebras.
method Using almost product structures and spray, the paper provides necessary and sufficient conditions for these properties.
result Equivalence of semi-simplicity of Lie algebras to derived ideal coincidence, interiority of derivations, and adjoint representation semi-simplicity.

Study calculates the renormalized area of catenoids in hyperbolic spaces.

problem Calculating the renormalized area of catenoids in hyperbolic spaces.
method Variational characterization and Chern--Gauss--Bonnet formulas for locally conformally flat manifolds.
result Renormalized area of catenoids varies continuously from negative infinity to twice the area of totally geodesic hypersurfaces.

We define the ideal simplicial volume for compact manifolds with boundary. Roughly speaking, the ideal simplicial volume of a manifold MM measures the minimal size of possibly ideal triangulations of MM "with real coefficients", thus providing a variation of the ordinary simplicial volume defined by Gromov in 1982, t…

2018-02-14abs ↗pdf ↗

It has been shown in \cite{DPSU} that, under some additional assumptions, two simple domains with the same scattering data are equivalent. We show that the simplicity of a region can be read from the metric in the boundary and the scattering data. This lets us extend the results in \cite{DPSU} to regions with the same …

2010-04-14abs ↗pdf ↗

We consider a volume maximization program to construct hyperbolic structures on triangulated 3-manifolds, for which previous progress has lead to consider angle assignments which do not correspond to a hyperbolic metric on each simplex. We show that critical points of the generalized volume are associated to geometric …

2009-08-14abs ↗pdf ↗

Framework reduces simplicity bias in NNs, improving OOD generalization and robustness.

problem Simplicity bias in deep learning models leads to biased predictions and poor OOD generalization.
method Proposes a framework that regularizes conditional mutual information to encourage use of diverse features.
result Demonstrates effectiveness in various settings, enhancing OOD generalization and robustness.

New framework shows CC^*-simplicity for groups without certain subalgebras.

problem Characterizing CC^*-simplicity of groups.
method Introducing confined subalgebras and Uniformly Recurrent States.
result A countable discrete group is CC^*-simple if it has no non-trivial amenable confined subalgebras.

We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension nn, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are defined using Karcher means. Given a finite set of vertices in a convex set on t…

2014-06-14abs ↗pdf ↗

It is known that the (2k1)(2k-1)-sphere has at most 2O(nklogn)2^{O(n^k \log n)} combinatorially distinct triangulations with nn vertices, for every k2k\ge 2. Here we construct at least 2Ω(nk)2^{Ω(n^k)} such triangulations, improving on the previous constructions which gave 2Ω(nk1)2^{Ω(n^{k-1})} in the general case (Kalai) and $2^{Ω(n^{5/…

2014-08-15abs ↗pdf ↗

Research reveals simplicity bias in random logistic map, impacting data analysis and forecasting.

problem Simplicity bias in dynamical systems and its impact on data analysis and prediction.
method Examined the logistic map and random logistic map, focusing on simplicity bias and noise effects.
result Simplicity bias is observable in the random logistic map, persisting even with small noise levels.

The Apollonius theorem is generalized for m-simplices, with applications in geometry and optimization.

problem Generalizing the Apollonius theorem for m-simplices.
method Direct generalization of the theorem to m-simplices in n-dimensional space.
result Applications in geometry and optimization, including minimal surface enclosures, simplex thickness, and root-finding methods.

We study prismatics sets analogously to simplical sets except that realization involves prisms, i.e., products of simplices rather than just simplices. Particular examples are the prismatic subdivision of a simplicial set S and the prismatic star of S. Both have the same homotopy type as S and in particular the latter …

2008-07-31abs ↗pdf ↗

We generalize the very well known boundary operator of the ordinary singular homology theory, defined in many books about algebraic topology. We describe a variant of this ordinary simplicial boundary operator where the usual boundary (n-1)-simplices of each n-simplex are replaced by combinations of internal (n-1)- sim…

2011-09-09abs ↗pdf ↗

The paper explores how simplicity leads to better out-of-distribution generalization in models.

problem Understanding the theoretical principles behind out-of-distribution (OOD) generalization in modern models.
method Examining diffusion models in image generation to analyze compositional generalization abilities and develop a theoretical framework for simplicity-based OOD generalization.
result The true, generalizable model corresponds to the simplest among consistent models, and this simplicity can be quantified and used to establish sample complexity guarantees.

The study reveals simplicity bias in neural networks leading to better compositional mappings.

problem Understanding when and how to encourage neural networks to learn compositional mappings.
method Examined compositional mappings through coding length and gradient descent dynamics.
result Neural networks tend to learn the simplest bijections, explaining their good generalization.

Study on simplicity of Lie skew braces, proving new results for compact cases.

problem Simplicity of Lie skew braces, focusing on compact connected cases.
method Reviewing correspondence, investigating ideals and rigidity, proving main result for compact Lie skew braces.
result Compact connected simple Lie skew braces are either trivial or have simple underlying Lie groups.

Two-layer networks favor simple features, especially in complex datasets.

problem Simplicity bias in neural networks over-reliing on simple features.
method Characterization of two-layer neural networks with small weights and gradient flow.
result Features learned in middle training stages are more useful for out-of-distribution transfer.

We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that are inspired by the ideas from toric topology.

2016-09-19abs ↗pdf ↗

Neural nets learn simple distributions first, then more complex ones.

problem Understanding how neural networks generalize from simple to complex functions.
method Stochastic gradient descent training, synthetic data, CIFAR10, ImageNet pre-training.
result Neural networks initially use lower-order statistics, then higher-order ones.

The paper proves eigenvalues are simple for specific operators on bundles.

problem Eigenvalue simplicity for connection Laplacian and GG-simplicity on bundles.
method Analyzes connections on vector bundles and principal bundles, proving eigenvalue simplicity for a residual set of connections.
result Eigenvalues of the connection Laplacian and Laplace-Beltrami operator are simple for specified conditions.

Research shows how certain flat structures behave in specific convex domains.

problem Understanding the behavior of codimension-1 simplices in divisible convex domains.
method Analyzes the set of codimension-1 flats and their images in quotient manifolds.
result The set of codimension-1 flats forms a finite collection of disjoint virtual tori, leading to cusped convex projective manifolds.

Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial invariants, but that all such invariants are multiples of the Euler characteristi…

2002-01-18abs ↗pdf ↗