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

8162432 · Jun 202019922001200920172026
48 results for foliated simplices

Study simplicial volume via foliated simplices and duality.

problem Calculate simplicial volume using foliated simplices and duality.
method Defined real singular foliated homology, constructed foliated fundamental class, and established isometric isomorphism with measurable bounded cohomology.
result Norm of foliated fundamental class equals simplicial volume of MM.

This paper compares two invariants of foliated manifolds which seem to measure the non-Hausdorffness of the leaf space: the transversal length on the fundamental group and the foliated Gromov norm on the homology. We consider foliations with the property that the set of singular simplices transverse to the foliation sa…

2003-03-19abs ↗pdf ↗

We prove that an isometric action of a Lie group on a Riemannian manifold admits a resolution preserving the transverse geometry if and only if the action is infinitesimally polar. We provide applications concerning topological simplicity of several classes of isometric actions, including polar and variationally comple…

2009-04-13abs ↗pdf ↗

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.

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 ↗

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 horoboundary of Teichmüller space is path connected and has non-dense Busemann points.

problem Characterizing the horoboundary of Teichmüller space.
method Using the relationship between the horofunction and visual compactifications of Teichmüller spaces.
result The horoboundary of Teichmüller space is path connected and has non-dense Busemann points.

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 ↗

Study foliations on Riemannian manifolds with specific vector fields, focusing on geometric properties.

problem Investigate foliations transverse to closed conformal vector fields on Riemannian manifolds.
method Analyze conditions for totally geodesic leaves and geometric constraints on foliations.
result Characterize totally geodesic foliations and classify minimal and constant mean curvature foliations.

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.

The study limits the number of specific foliations with bounded geometry.

problem Bounding the number of isoparametric foliations with bounded geometry.
method Proving finitely many foliations with specific properties and constructing infinite families of non-diffeomorphic foliations.
result There are only finitely many isoparametrically foliated closed connected Riemannian manifolds with bounded geometry, up to foliated diffeomorphism.

Survey on Killing foliations with technical advantages.

problem Understanding closures of Riemannian foliations.
method Review of Molino's structural theory and transverse isometry theory.
result Closures of Killing foliations described by transverse Killing vector fields.

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 ↗

A smooth foliation of a Riemannian manifold is metric when its leaves are locally equidistant and is homogenous when its leaves are locally orbits of a Lie group acting by isometries. Homogenous foliations are metric foliations, but metric foliations need not be homogenous foliations. We prove that a homogenous three-s…

2018-03-23abs ↗pdf ↗

Study of affine and projective structures on foliated complex manifolds.

problem Formalizing and analyzing affine and projective structures on foliations.
method Formalizing concepts, providing local normal forms, proving index formulae, classifying structures.
result Compact algebraic manifolds of even dimension do not admit foliated projective structures.