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.
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.
When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's alge…
The paper determines the structure of Kakimizu complexes for genus one hyperbolic knots.
problem Understanding the structure of Kakimizu complexes for genus one hyperbolic knots.
method Analyzing the simplicial complex of minimal genus Seifert surfaces in the exterior of the knots.
result The Kakimizu complex for genus one hyperbolic knots consists of a single d-simplex for d=0,4 and otherwise of at most two d-simplices which intersect in a common (d−1)-face.
It is proved that the volume of spherical or hyperbolic simplices, when considered as a function of the dihedral angles, can be extended continuously to degenerated simplices.
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to algorithmically construct a trisection, which describes a 4-dimensional manifold as a uni…
Low rank matrix recovery problems appear widely in statistics, combinatorics, and imaging. One celebrated method for solving these problems is to formulate and solve a semidefinite program (SDP). It is often known that the exact solution to the SDP with perfect data recovers the solution to the original low rank matrix…
We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension n, 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…
In this paper, we show that Gromov-Thurston's principle works for hyperbolic 3-manifolds of infinite volume and with finitely generated fundamental group. As an application, we have a new proof of Ending Lamination Theorem. Our proof essentially relays only on Maximum Volume Law for hyperbolic 3-simplices.
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 …
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…
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.
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.
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…
We construct invariants of four-dimensional piecewise-linear manifolds, represented as simplicial complexes, with respect to rebuildings that transform a cluster of three 4-simplices having a common two-dimensional face in a different cluster of the same type and having the same boundary. Our construction is based on t…
We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension. Our technique consists of partitioning the space into simplices and then embedding the data points into features corresponding to the simplices' barycentric coordinates. We then …
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.