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

Trend · papers per month

19385675 · Jun 202019922001200920172026
48 results for polyhedral norms

Study normal curves in sub-Finsler Lie groups with specific norms, focusing on branching and face stability.

problem Analyzing normal curves in sub-Finsler Lie groups with different norms.
method Using tools from convex analysis, the Pontryagin Maximum Principle is revisited to express the normal equation as a differential inclusion involving the subdifferential of the dual norm.
result Normal curves in polyhedral norms have controls that locally take values in a single face of a sphere with respect to the norm.

We establish a natural and geometric 1-1 correspondence between projective toric varieties of dimension nn and horofunction compactifications of Rn\mathbb{R}^n with respect to rational polyhedral norms. For this purpose, we explain a topological model of toric varieties. Consequently, toric varieties in algebraic geom…

2017-05-22abs ↗pdf ↗

In this paper we answer positively a question raised by Kapovich and Leeb in a paper titled "Finsler bordifications of symmetric and certain locally symmetric spaces". Specifically, we show that for a finite-dimensional vector space with a polyhedral norm, its horofunction compactification is homeomorphic to the dual u…

2016-07-02abs ↗pdf ↗

Paper tackles image reconstruction from limited data using polyhedral norms and convex regularizers.

problem Learning convex regularizers for image reconstruction from limited data.
method Imposes amplitude-equivariance, approximates functionals with polyhedral norms, identifies synthesis and analysis forms, proposes a trainable tight frame architecture.
result Proposed framework outperforms sparsity-based methods in denoising and biomedical image reconstruction.

We study the stable norm on the first homology of a closed, non-orientable surface equipped with a Riemannian metric. We prove that in every conformal class there exists a metric whose stable norm is polyhedral. Furthermore the stable norm is never strictly convex if the first Betti number of the surface is greater tha…

2007-03-22abs ↗pdf ↗

The real homology of a compact Riemannian manifold MM is naturally endowed with the stable norm. The stable norm on H1(M,R)H_1(M,\mathbb{R}) arises from the Riemannian length functional by homogenization. It is difficult and interesting to decide which norms on the finite-dimensional vector space H1(M,R)H_1(M,\mathbb{R}) are st…

2008-06-21abs ↗pdf ↗

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are completely described by combinatorial properties of the graph. We study then th…

2005-02-22abs ↗pdf ↗

Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial selection problem is often turned into a convex optimization problem by replacing the cardinality function by its convex envelope (tightest c…

2010-08-25abs ↗pdf ↗

Study on discrete Gaussian curvature for polyhedral surfaces.

problem Discretization of Gaussian curvature for polyhedral surfaces.
method Generalization of discrete conformal equivalence to define discrete Gaussian curvature and classify polyhedral surfaces.
result Existence of polyhedral surfaces with constant discrete Gaussian curvature in every discrete conformal class.

Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the aim of our work is to find and to discuss suitable assessments of smoothness of…

2017-03-15abs ↗pdf ↗

A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a unique hyperbolic polyhedral metric with a given discrete curvature satisfying …

2014-01-18abs ↗pdf ↗

Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.

problem Characterize polyhedrally-complete intermediate logics.
method Developed Nerve Criterion to characterize polyhedrally-complete logics combinatorially.
result Nerve Criterion provides a necessary and sufficient condition for polyhedrally-completeness.

The paper proves rigidity of bordered polyhedral surfaces using variational principles.

problem Determining the rigidity of bordered polyhedral surfaces.
method Using the variational principle, the paper shows that bordered polyhedral surfaces are determined by boundary values and discrete curvatures on interior edges.
result The paper re-proves the classical result that two Euclidean or hyperbolic cyclic polygons are congruent if their side lengths are equal.

A hyperbolic conjugacy class in the modular group PSL(2,Z) corresponds to a closed geodesic in the modular orbifold. Some of these geodesics virtually bound immersed surfaces, and some do not; the distinction is related to the polyhedral structure in the unit ball of the stable commutator length norm. We prove the foll…

2010-03-07abs ↗pdf ↗

SOC-ICNN expands neural network representational capacity by using conic optimization.

problem Restrictive representational capacity of ReLU-based ICNNs.
method Proposes SOC-ICNN architecture that uses Second-Order Cone Programming.
result SOC-ICNN strictly expands representational space without increasing complexity.

We develop a method to find a set of diminimal polyhedral maps on the torus from which all other polyhedral maps on the torus may be generated by face splitting and vertex splitting. We employ this method, though not to its completion, to find 53 diminimal polyhedral maps on the Torus.

2001-07-17abs ↗pdf ↗

New algorithm achieves optimal privacy and efficiency in non-Euclidean convex optimization.

problem Optimizing convex functions while maintaining privacy in non-Euclidean settings.
method Developed a linear-time algorithm for p\ell_p-setups, leveraging geometric properties.
result Optimal excess risk achieved in linear time for 1<p21 < p \leq 2.

Characterizes metrics on triangulated surfaces using glued Euclidean triangles.

problem Describing metrics on triangulated surfaces constructed from glued Euclidean triangles.
method Carefully constructing polyhedral metrics and proving their uniqueness.
result Polyhedral metrics are the only intrinsic metrics preserving Euclidean triangle lengths.

We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least 2π.2π. The combinatorial information of these surfaces is shown to be identified with that of Euclidean polyhedral surfaces with negative combinatorial curvature everywher…

2018-07-28abs ↗pdf ↗

A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature polyhedral metric which is unique up to scaling. Furthermore, the constant curvature me…

2013-09-17abs ↗pdf ↗

A polyhedral map is called {p,q}\{p, q\}-equivelar if each face has pp edges and each vertex belongs to qq faces. In 1983, it was shown that there exist infinitely many geometrically realizable {p,q}\{p, q\}-equivelar polyhedral maps if q>p=4q > p = 4, p>q=4p > q = 4 or q3>p=3q - 3 > p = 3. It was shown in 2001 that there exist infi…

2005-06-30abs ↗pdf ↗

The study provides conditions for approximating Riemannian manifolds with polyhedral metrics.

problem Approximating Riemannian manifolds with polyhedral metrics.
method Conditions on curvature tensors for Lipschitz and local polyhedral approximations.
result Conditions are sufficient for local polyhedral approximations, conjectured to be sufficient for global approximations.

Finite element method approximates scalar curvature in arbitrary dimensions.

problem Approximating scalar curvature using finite elements in arbitrary dimensions.
method Piecewise polynomial interpolants of a smooth Riemannian metric on a triangulated polyhedral domain.
result Finite element interpolants converge to scalar curvature with rate O(hr+1)O(h^{r+1}) in H2(Ω)H^{-2}(Ω) norm.

We study rigidity of polyhedral surfaces and the moduli space of polyhedral surfaces using variational principles. Curvature like quantities for polyhedral surfaces are introduced. Many of them are shown to determine the polyhedral metric up to isometry. The action functionals in the variational approaches are derived …

2006-12-22abs ↗pdf ↗

This paper investigates several global rigidity issues for polyhedral surfaces including inversive distance circle packings. Inversive distance circle packings are polyhedral surfaces introduced by P. Bowers and K. Stephenson as a generalization of Andreev-Thurston's circle packing. They conjectured that inversive dist…

2010-10-15abs ↗pdf ↗

We investigate the rigidity of hyperbolic cone metrics on 33-manifolds which are isometric gluing of ideal and hyper-ideal tetrahedra in hyperbolic spaces. These metrics will be called ideal and hyper-ideal hyperbolic polyhedral metrics. It is shown that a hyper-ideal hyperbolic polyhedral metric is determined up to i…

2014-04-22abs ↗pdf ↗

Researchers decompose hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.

problem Decomposing hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.
method Two different approaches to demonstrate the existence of polyhedral decompositions.
result The number of polyhedral decompositions of MM is finite.

In this article we introduce the notion of Polyhedral Kahler manifolds, even dimensional polyhedral manifolds with unitary holonomy. We concentrate on the 4-dimensional case, prove that such manifolds are smooth complex surfaces, and classify the singularities of the metric. The singularities form a divisor and the res…

2009-01-13abs ↗pdf ↗

The study connects polyhedral manifolds to Riemannian ones with geometric bounds.

problem Connecting polyhedral manifolds to Riemannian manifolds with geometric constraints.
method Using a theorem by C. Lange and B. Bowditch, the study bounds the curvature and injectivity radius of Riemannian manifolds.
result Polyhedral manifolds with bounded geometry are bi-Lipschitz homeomorphic to Riemannian manifolds with controlled curvature and injectivity radius.

Study shows non-polyhedral structure in moduli spaces for n≥8.

problem Identifying non-polyhedral structure in moduli spaces of pointed stable curves.
method Constructing an extremal non-polyhedral ray via maps on meromorphic strata of differentials.
result Moduli spaces are not Mori Dream Spaces for n≥8.

Conditions for polyhedral Kähler metrics on CP^n with specific singularities.

problem Existence of polyhedral Kähler metrics on complex projective space with specified singularities.
method Parabolic Kobayashi-Hitchin correspondence, linear and quadratic constraints on cone angles.
result Necessary and sufficient conditions for the existence of polyhedral Kähler metrics on CP^n.

Study circle patterns and polyhedral surfaces in hyperbolic ends, proving manifold properties.

problem Understanding the space of complex projective structures on surfaces with circle patterns.
method Analyzing ideal polyhedral surfaces in hyperbolic ends, proving manifold properties and Lagrangian immersions.
result The space of complex projective structures on surfaces with circle patterns is a manifold of dimension 6g-6.

Flat metrics on hyperbolic surfaces embed as polyhedral surfaces in (2+1)-spacetimes.

problem Embedding flat metrics on hyperbolic surfaces into (2+1)-spacetimes.
method Using convex polyhedral Cauchy surfaces and Teichmüller space properties.
result Existence and uniqueness of flat metrics embedding in (2+1)-spacetimes.