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,695 papers · 148 categories

Trend · papers per month

count % of corpus

7 results for “t-graphs”

Existence and uniqueness of

t

-graphs of prescribed mean curvature in Heisenberg groupsmath.DG

Study on $t$ -graphs with prescribed mean curvature in Heisenberg groups.

problem Existence and uniqueness of

t

-graphs with prescribed mean curvature.

method Characterization of classical solutions without Dirichlet boundary data, conditions for uniqueness, approximation technique for non-constant mean curvature.

result Conditions for existence and uniqueness of

t

-graphs in Heisenberg groups.

Heisenberg group prescribed mean curvature t-graphs existence uniqueness

2024-05-10abs ↗pdf ↗

The prescribed mean curvature equation for

t

-graphs in the sub-Finsler Heisenberg group

\mathbb{H}^n

math.AP

Study on curvature equation in Heisenberg group with convex boundary.

problem Existence of solutions to prescribed mean curvature equation in sub-Finsler Heisenberg group.

method Finsler approximation scheme to prove existence of Lipschitz solutions.

result Existence of a Lipschitz solution for the Dirichlet problem.

Heisenberg group prescribed mean curvature Finsler approximation Lipschitz solution

2022-07-27abs ↗pdf ↗

Examples of area-minimizing surfaces in the subriemannian Heisenberg group H^1 with low regularitymath.DG

We give new examples of entire area-minimizing t-graphs in the subriemannian Heisenberg group H^1. Most of the examples are locally lipschitz in Euclidean sense. Some regular examples have prescribed singular set consisting of either a horizontal line or a finite number of horizontal halflines extending from a given po…

2008-03-10abs ↗pdf ↗

Multiple cluster algebra structures for TCD maps I: theoretical frameworkmath.CO

Unified framework for various geometric constructions.

problem Organizing diverse geometric constructions.

method Introducing TCD maps and defining local moves.

result Two distinct cluster structures on TCD maps.

cluster algebra discrete geometry TCD maps dSKP equation projective structure

2026-01-13abs ↗pdf ↗

Discrete Differential Geometry and Cluster Algebras via TCD mapsmath.CO

Develops TCD maps to relate discrete differential geometry and cluster algebras.

problem Capturing constraints and dynamics in discrete differential geometry.

method Triple crossing diagram maps (TCD maps) and geometric operations.

result Establishes a hierarchy of cluster structures on TCD maps.

Triple Crossing Diagram Maps Discrete Differential Geometry Cluster Algebras Triple Graphs T-Embeddings

2023-05-03abs ↗pdf ↗

Adaptive Policy Learning Under Unknown Network Interferencestat.ML

Algorithm learns interference network and optimizes treatment allocation for unknown network effects.

problem Adaptive experimentation under unknown network interference.

method Thompson sampling algorithm with Gibbs sampler for joint learning of interference network and treatment allocation.

result Proves a Bayesian regret bound and achieves sublinear regret in real-world applications.

Thompson sampling network interference adaptive experimentation Bayesian regret spillover effects

2026-05-11abs ↗pdf ↗

On the Power of Preconditioning in Sparse Linear Regressioncs.LG

New research shows how preconditioning can solve sparse linear regression problems efficiently.

problem Efficiently solving sparse linear regression problems without restrictive conditions.

method Preconditioned Lasso approach to solve sparse linear regression problems.

result Preconditioning can solve a large class of sparse linear regression problems nearly optimally.

Sparse Linear Regression Preconditioning Treewidth Markov Property Gaussian Markov Random Field

2021-06-17abs ↗pdf ↗