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

15304459 · Jun 202019922001200920172026
48 results for Triple Bottom Line

Optimizes social interactions for profit, people, and planet using mathematical models.

problem Determining the most effective social configurations for mutual objectives.
method Formulated as a mathematical optimization problem, using (meta)relational models theory.
result Identifies the most suitable combination of sociality forms for mutual objectives.

A bottom tangle is a tangle in a cube consisting of arc components whose boundary points are on a line in the bottom square of the cube. A ribbon bottom tangle is a bottom tangle whose closure is a ribbon link. For every n-component ribbon bottom tangle T, we prove that the universal invariant J_T of T associated to th…

2009-05-12abs ↗pdf ↗

Generalizes Tulczyjew triples for contact manifolds in Hamiltonian and Lagrangian formalisms.

problem Tackles the need for a geometric tool in contact manifolds.
method Introduces a generalized Tulczyjew triple for contact manifolds.
result Contact Hamiltonians and Lagrangians as sections of line bundles determine dynamics on contact phase space.

A bottom tangle is a tangle in a cube consisting only of arc components, each of which has the two endpoints on the bottom line of the cube, placed next to each other. We introduce a subcategory B of the category of framed, oriented tangles, which acts on the set of bottom tangles. We give a finite set of generators of…

2005-05-11abs ↗pdf ↗

Algorithm finds real line mapping from points under ordinal constraints.

problem Finding a mapping from points to real line under ordinal constraints.
method Approximation algorithm for dense case in O(n7)+(1/ε)O(1/ε1/8)nO(n^7) + (1/\varepsilon)^{O(1/\varepsilon^{1/8})} n time.
result Computes a solution satisfying (1O(ε1/8))(1-O(\varepsilon^{1/8}))-fraction of all constraints.

A central question in the study of line arrangements in the complex projective plane CP2\mathbb{CP}^2 is: when does the combinatorial data of the arrangement determine its topological properties? In the present work, we introduce a topological invariant of complexified real line arrangements, the chamber weight. This in…

2017-02-03abs ↗pdf ↗

During a stock market peak the price of a given stock (i i ) jumps from an initial level p1(i) p_1(i) to a peak level p2(i) p_2(i) before falling back to a bottom level p3(i) p_3(i) . The ratios A(i)=p2(i)/p1(i) A(i) = p_2(i)/p_1(i) and B(i)=p3(i)/p1(i) B(i)= p_3(i)/p_1(i) are referred to as the peak- and bottom-amplitude respectively. The paper show…

2000-09-14abs ↗pdf ↗

We recall the definition of the quadratic helicity invariant and of the higher asymptotic ergodic MM-invariant. We present a simpler new proof (in part) that the MM-invariant is ergodic. The MM-invariant is a higher invariant, this means that for the magnetic field with closed magnetic lines the invariant is not a f…

2015-03-18abs ↗pdf ↗

Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements whose intersection points are doubles or triples. This result is obtained by consi…

2013-06-25abs ↗pdf ↗

Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the Alexander Invariant and certain invariants of combinatorial line arrangements a…

2004-03-31abs ↗pdf ↗

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2\mathbb{CP}^2 under certain conditions.

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the side-lengths of a triangle in X. We construct an example of a complete path metr…

2006-11-06abs ↗pdf ↗

A holomorphic triple over a compact Riemann surface consists of two holomorphic vector bundles and a holomorphic map between them. After fixing the topological types of the bundles and a real parameter, there exist moduli spaces of stable holomorphic triples. In this paper we study non-emptiness, irreducibility, smooth…

2002-11-27abs ↗pdf ↗

In this paper we analyze, evaluate, and improve the performance of training generalized linear models on modern CPUs. We start with a state-of-the-art asynchronous parallel training algorithm, identify system-level performance bottlenecks, and apply optimizations that improve data parallelism, cache line locality, and …

2018-11-05abs ↗pdf ↗

The paper explores fairness, welfare, and equity in personalized pricing across various applications.

problem Interplay of fairness, welfare, and equity in personalized pricing based on customer features.
method Comprehensive literature review and observational metrics without underlying valuation distribution assumptions.
result Personalized pricing can expand access, improve welfare, and increase revenue or budget utilization.

Bottom-up algorithms outperform top-down in hierarchical community detection at intermediate levels.

problem Finding the optimal hierarchical community structure in networks.
method A bottom-up algorithm for hierarchical clustering of networks.
result Bottom-up algorithms achieve the information-theoretic threshold for exact recovery at intermediate levels of the hierarchy.

We study the bottom of the spectrum in Hilbert geometries, we show that it is zero if and only if the geometry is amenable, in other words if and only if it admits a Fölner sequence. We also show that the bottom of the spectrum admits an upper bound, which depends only on the dimension and which is the bottom of the sp…

2007-12-10abs ↗pdf ↗

The study finds the maximum spectrum of 3D manifolds with lower scalar curvature.

problem Finding the maximum spectrum of 3D manifolds with lower scalar curvature.
method Establishing an analogous result to Cheng's theorem for 3D manifolds with scalar curvature lower bound.
result A splitting theorem for 3D manifolds with the maximal bottom spectrum.

We study moduli space of holomorphic triples E1φE2E_{1}\xrightarrowφ E_{2}, composed of torsion-free sheaves Ei,i=1,2E_{i}, i=1,2 and a holomorphic mophism between them, over a smooth complex projective surface SS. The triples are equipped with Schmitt stability condition [Alg Rep Th. 6. 1. pp 1-32, 2003]. We observe that when…

2019-10-31abs ↗pdf ↗

We decompose returns for portfolios of bottom-ranked, lower-priced assets relative to the market into rank crossovers and changes in the relative price of those bottom-ranked assets. This decomposition is general and consistent with virtually any asset pricing model. Crossovers measure changes in rank and are smoothly …

2018-12-13abs ↗pdf ↗

The spectrum of certain manifolds matches that of hyperbolic space if the bottom spectrum is maximal.

problem Investigating spectral rigidity of manifolds with Ricci bounded below and maximal bottom spectrum.
method Analyzing the spectrum of the Laplacian on manifolds with specific Ricci curvature bounds.
result The spectrum of the manifold coincides with that of hyperbolic space if the bottom spectrum is maximal.

A link L is called Brunnian if every proper sublink of L is trivial. Similarly, a bottom tangle T is called Brunnian if every proper subtangle of T is trivial. In this paper, we give a small subalgebra of the n-fold completed tensor power of U_h(sl_2) in which the universal sl_2 invariant of n-component Brunnian bottom…

2011-11-27abs ↗pdf ↗

BUSTLE synthesizes programs by learning from intermediate values.

problem Challenges in synthesizing complex programs due to large search space.
method Bottom-up search guided by a neural network trained on input-output examples.
result Bottom-up search with execution of intermediate programs provides valuable semantic information.

The study of spectral-tightness in Riemannian manifolds and its topological implications.

problem Understanding the spectral properties of Riemannian manifolds and their coverings.
method Analyzing the fundamental group and the Euclidean local de Rham factor to characterize spectral-tightness.
result Spectral-tightness is a topological property of the fundamental group, and it can be characterized by the dimension of the Euclidean local de Rham factor.

Modeling poverty transitions in India over 54 years, showing rising but persistent poverty.

problem Understanding and addressing poverty dynamics in India over long periods.
method Stochastic model of Geometric Brownian Motion with reallocation (RGBM).
result Annual poverty transitions are common, but poverty persists, especially among the poorest.

The universal sl_2 invariant of bottom tangles has a universality property for the colored Jones polynomial of links. Habiro conjectured that the universal sl_2 invariant of boundary bottom tangles takes values in certain subalgebras of the completed tensor powers of the quantized enveloping algebra U_h(sl_2) of the Li…

2011-03-11abs ↗pdf ↗

Paper sharpens inequality linking curvature and spectrum on manifolds.

problem Linking scalar curvature and the bottom spectrum on complete manifolds.
method Using deformed Dirac operators and relative A^\widehat{A}-cowaist.
result Established a sharp inequality between scalar curvature and the bottom spectrum.

Using an artificial neural network (ANN), a fixed universe of approximately 1500 equities from the Value Line index are rank-ordered by their predicted price changes over the next quarter. Inputs to the network consist only of the ten prior quarterly percentage changes in price and in earnings for each equity (by quart…

2008-06-16abs ↗pdf ↗

Closed hyperbolic manifolds and manifolds with nonpositive sectional curvature are geometrically rigid under certain curvature conditions.

problem Geometric rigidity under scalar curvature lower bound
method Prove rigidity in the equality case of the sharp bottom spectrum estimate
result Closed manifolds with specific curvature conditions must be hyperbolic

We present an end-to-end trained memory system that quickly adapts to new data and generates samples like them. Inspired by Kanerva's sparse distributed memory, it has a robust distributed reading and writing mechanism. The memory is analytically tractable, which enables optimal on-line compression via a Bayesian updat…

2018-04-05abs ↗pdf ↗