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

73146218291 · Jun 202019922001200920172026
48 results for discrete maps

New theorem proves convergence of various discrete conformal structures to conformal maps.

problem Proving convergence of discrete conformal structures to conformal maps.
method General theorem using piecewise linear discrete conformal mappings and Riemannian barycentric coordinates.
result Discrete conformal mappings converge to conformal maps under certain conditions.

The paper proves convergence of discrete maps to Riemann mappings for polyhedral surfaces.

problem Discrete conformal geometry of polyhedral surfaces.
method Establishing rigidity for hexagonal triangulations and estimating quasiconformal constants.
result Discrete conformal maps converge to Riemann mappings for Jordan domains.

Discrete conformal maps on surfaces with vertex decorations are studied.

problem Discrete conformal equivalence for decorated piecewise Euclidean surfaces.
method Intimate relationship between decorated PE-surfaces, canonical tessellations of hyperbolic surfaces, and convex hyperbolic polyhedra; concave variational principle.
result Proof of discrete uniformization theorem for decorated PE-surfaces.

Optimal discrete harmonic maps between hyperbolic surfaces are found via minimizing energy.

problem Finding optimal discrete harmonic maps between hyperbolic surfaces.
method Minimizing Dirichlet energy over all possible hyperbolic structures and realizations within a fixed homotopy class.
result At the optimal hyperbolic structure, the discrete harmonic map and edge weights are induced from a weighted Delaunay decomposition.

We establish a connection between recent developments in the study of vortices in the abelian Higgs models, and in the theory of structure-preserving discrete conformal maps. We explain how both are related via conformal mapping problems involving prescribed linear combinations of the curvature and volume form, and sho…

2017-03-14abs ↗pdf ↗

We establish a connection between two previously unrelated topics: a particular discrete version of conformal geometry for triangulated surfaces, and the geometry of ideal polyhedra in hyperbolic three-space. Two triangulated surfaces are considered discretely conformally equivalent if the edge lengths are related by s…

2010-05-15abs ↗pdf ↗

In the previous paper [GLM2018], we showed that the theory of harmonic maps between Riemannian manifolds may be discretized by introducing triangulations with vertex and edge weights on the domain manifold. In the present paper, we study convergence of the discrete theory to the smooth theory when taking finer and fine…

2019-10-17abs ↗pdf ↗

A discrete conformal map (DCM) maps the square lattice to the Riemann sphere such that the image of every irreducible square has the same cross-ratio. This paper shows that every periodic DCM can be determined from spectral data (a hyperelliptic compact Riemann surface, called the spectral curve, equipped with some mar…

1999-05-19abs ↗pdf ↗

Discrete approximation solves Björling's minimal surface problem.

problem Constructing minimal surfaces from real-analytic curves with specified normal fields.
method Approximate solution by discrete minimal surfaces and discrete isothermic surfaces.
result Approximation error is proportional to the square of the mesh size.

We present effective methods to compute equivariant harmonic maps from the universal cover of a surface into a nonpositively curved space. By discretizing the theory appropriately, we show that the energy functional is strongly convex and derive convergence of the discrete heat flow to the energy minimizer, with explic…

2018-10-29abs ↗pdf ↗

Estimates discontinuous optimal transport maps between a discrete and continuous distribution.

problem Estimating discontinuous optimal transport maps between a discrete and continuous distribution.
method Entropic optimal transport estimator, computationally efficient.
result The estimator converges at the minimax-optimal rate n1/2n^{-1/2} in the semi-discrete setting.

Develops a new method for learning discrete distributions without embedding them in a continuous space.

problem Challenges in learning discrete distributions using current methodologies.
method Introduces a MAD invertible map and a mixed variational flow (MAD Mix) for discrete distributions.
result MAD Mix produces more reliable approximations than continuous-embedding flows.

Maps between Hadamard manifolds are quasi-isometric to harmonic maps.

problem Understanding the relationship between quasi-isometric maps and harmonic maps on Hadamard manifolds.
method Extending a previous result to quotient spaces of Hadamard manifolds by convex cocompact discrete groups.
result Locally quasi-isometric maps to Hadamard manifolds are within bounded distance from a unique harmonic map.

Accelerators with power-law memory are proposed in the framework of the discrete time approach. To describe discrete accelerators we use the capital stock adjustment principle, which has been suggested by Matthews.The suggested discrete accelerators with memory describe the economic processes with the power-law memory …

2016-12-23abs ↗pdf ↗

New methods use transport maps to improve Langevin dynamics for sampling.

problem Sampling high-dimensional, non-Gaussian distributions efficiently.
method Apply transport maps to accelerate Langevin dynamics convergence.
result Discretized processes converge to target distribution with non-asymptotic bounds.

Study shows mapping class groups are one-ended for surfaces with at least one end.

problem Analyzing the number of ends in mapping class groups of surfaces.
method Proving the associated translatable curve graph is one-ended, quasi-isometric to the mapping class group.
result Mapping class groups are one-ended for surfaces with at least one end of discrete type.

The paper proves a mapping from a space of holonomy varieties to Teichmüller spaces, with a non-empty discrete intersection.

problem Intersection of Poincaré holonomy varieties and their properties.
method Holomorphic mapping and branched covering proof.
result Intersection of arbitrary Poincaré holonomy varieties is a non-empty discrete set.

Extremal length is a conformal invariant that transfers naturally to the discrete setting, giving square tilings as a natural combinatorial analog of conformal mappings. Recent work by S. Hersonsky has explored generalizing these ideas to three-dimensional cube tilings. The connections between discrete extremal length …

2013-08-13abs ↗pdf ↗

We present a definition of discrete channel surfaces in Lie sphere geometry, which reflects several properties for smooth channel surfaces. Various sets of data, defined at vertices, on edges or on faces, are associated with a discrete channel surface that may be used to reconstruct the underlying particular discrete L…

2018-09-05abs ↗pdf ↗

Skew parallelogram nets factorize, encompassing discrete differential geometry.

problem Factorization of polynomials in discrete differential geometry.
method Lax representation, Bäcklund transformations, factorization of polynomials.
result Skew parallelogram nets encompass all systems with polynomial representations.

We consider discrete nets in Grassmannians Grd\mathbb{G}^d_r which generalize Q-nets (maps ZNPd\mathbb{Z}^N\to\mathbb{P}^d with planar elementary quadrilaterals) and Darboux nets (Pd\mathbb{P}^d-valued maps defined on the edges of ZN\mathbb{Z}^N such that quadruples of points corresponding to elementary squares are all co…

2008-12-30abs ↗pdf ↗

Research proves limits on harmonic map orders into Euclidean buildings.

problem Limits on the possible orders of harmonic maps from surfaces to Euclidean buildings.
method Direct analysis of homogeneous maps and related spherical billiards problem.
result The order of harmonic maps is of the form mk\frac mk where kk divides W|W|.

This paper explores geometric insights into discrete R-congruences and their envelopes.

problem Understanding the ambiguity in discrete R-congruences and their envelopes.
method Analyzes discrete R-congruences that are enveloped by specific types of surfaces and maps.
result Discovers a 2-parameter family of discrete enveloping surfaces for discrete R-congruences.

Earth observation embeddings can convert discrete biome maps into continuous representations that better capture ecological variation.

problem Biome maps impose categorical boundaries that compress continuous variation in biotic communities.
method Fit a linear classifier on Earth observation embeddings to predict biome labels.
result Continuous biome representation outperforms discrete biome labels for predicting species occurrence.

Liouville's theorem says that in dimension greater than two, all conformal maps are Möbius transformations. We prove an analogous statement about simplicial complexes, where two simplicial complexes are considered discretely conformally equivalent if they are combinatorially equivalent and the lengths of corresponding …

2019-11-03abs ↗pdf ↗

Study discretizes Dirac and port-Hamiltonian systems using manifolds.

problem Discretization of Dirac and port-Hamiltonian systems.
method Retraction and discretization maps on manifolds for Dirac structures, applied to port-Hamiltonian systems.
result Numerical integrators for port-Hamiltonian systems derived from discretization techniques.

Study on Gauss map of anisotropic minimal surfaces with Morse index estimates.

problem Estimating the Morse index of anisotropic minimal surfaces.
method Local analysis of Gauss map, conformal geometric techniques applied to the Gauss map.
result Upper and lower estimates for the Morse index of anisotropic minimal surfaces.

Stochastic optimization improves semi-discrete OT map estimation with a minimax rate.

problem Empirical success of SGD in semi-discrete OT, but lack of theoretical guarantees.
method Averaged projected SGD with a minimax convergence rate of O(1/√n).
result SGD methods can estimate the OT map with a minimax convergence rate of O(1/√n).

Riemannian Neural OT maps improve scalability on manifolds.

problem Challenges in extending neural OT to high-dimensional Riemannian manifolds.
method Introduces Riemannian Neural OT (RNOT) maps that avoid discretization and incorporate geometric structure.
result RNOT maps approximate Riemannian OT maps with sub-exponential complexity in the dimension.

The paper analyzes rates of convergence for optimal transport map estimators using barycentric projections.

problem Estimating optimal transport maps from data sampled according to two distributions.
method Comprehensive analysis of rates of convergence for plug-in estimators defined via barycentric projections.
result New stability estimate for barycentric projections under minimal smoothness assumptions.

By the Riemann-mapping theorem, one can bijectively map the interior of an nn-gon PP to that of another nn-gon QQ conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of PP to those QQ. In this case, one wants to find the ``best" mapping between these polygons, i.e.…

2014-01-24abs ↗pdf ↗

Let SL(2, H\mathbb H) be the group of 2×22 \times 2 quaternionic matrices A=(abcd)A=\begin{pmatrix} a & b \\ c & d \end{pmatrix} with quaternionic determinant detA=adaca1b=1\det A=|ad-aca^{-1} b|=1. This group acts by the orientation-preserving isometries of the five dimensional (real) hyperbolic space. We obtain discreteness criteria f…

2017-08-19abs ↗pdf ↗

Discrete-time systems can be characterized by simple flat coordinates and their shifts.

problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.