Study proves uniform ellipticity implies uniform polyconvexity for anisotropic energy functionals.
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.
Trend · papers per month
Constructs polyhedral chains with prescribed tangent plane distributions.
We prove that every stationary polyhedral varifold minimizes area in the following senses: (1) its area cannot be decreased by a one-to-one Lipschitz ambient deformation that coincides with the identity outside of a compact set, and (2) it is the varifold associated to a mass-minimizing flat chain with coefficients in …
Differential chains are a proper subspace of de Rham currents given as an inductive limit of Banach spaces endowed with a geometrically defined strong topology. Boundary is a continuous operator, as are operators that dualize to Hodge star, Lie derivative, pullback and interior product. Partitions of unity exist in thi…
This work describes compactifications of metric spaces and vector spaces using asymmetric norms.
Polyhedral surfaces can be broken down into parallelograms.
New flow connects symplectic maps to hyperKähler geometry.
Study on discrete Gaussian curvature for polyhedral surfaces.
In this paper, we consider clustering data that is assumed to come from one of finitely many pointed convex polyhedral cones. This model is referred to as the Union of Polyhedral Cones (UOPC) model. Similar to the Union of Subspaces (UOS) model where each data from each subspace is generated from a (unknown) basis, in …
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…
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 …
Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.
Locally finite complexes with polyhedral metrics are arborescent.
The paper proves rigidity of bordered polyhedral surfaces using variational principles.
In a finite-dimensional real vector space furnished with a rational structure with respect to a subfield of the field of real numbers, every (simplicial) rational semifan is contained in a complete (simplicial) rational semifan. In this paper this result is proved constructively on use of techniques from polyhedral geo…
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.
Characterizes metrics on triangulated surfaces using glued Euclidean triangles.
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least The combinatorial information of these surfaces is shown to be identified with that of Euclidean polyhedral surfaces with negative combinatorial curvature everywher…
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…
A polyhedral map is called -equivelar if each face has edges and each vertex belongs to faces. In 1983, it was shown that there exist infinitely many geometrically realizable -equivelar polyhedral maps if , or . It was shown in 2001 that there exist infi…
Smooth 2-tori in R^4 can be approximated by polyhedral Lagrangian or isotropic tori.
Survey on discrete curvature concepts for polygons and polyhedral surfaces.
We show that area minimizing polyhedral surfaces are saddle.
The study provides conditions for approximating Riemannian manifolds with polyhedral metrics.
Study calculates Floer homology for binary polyhedral spaces.
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 …
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…
New bounds show polyhedral surrogates are optimal for generalization.
New index theory proves Gromov's dihedral conjectures.
Constructs a moment map flow for isotropic maps on surfaces.
We investigate the rigidity of hyperbolic cone metrics on -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…
Researchers decompose hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.
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…
In this note we introduce certain invariants of real Lefschetz fibrations. We call these invariants {\em real Lefschetz chains}. We prove that if the fiber genus is greater than 1, then the real Lefschetz chains are complete invariants of real Lefschetz fibrations with only real critical values. If however the fiber ge…
The study connects polyhedral manifolds to Riemannian ones with geometric bounds.
We show that a compact length space is polyhedral if a small spherical neighborhood of any point is conic.
Softens tilings in 3D space, proving conjectures about polyhedral tilings.
Study shows non-polyhedral structure in moduli spaces for n≥8.
Conditions for polyhedral Kähler metrics on CP^n with specific singularities.
Study circle patterns and polyhedral surfaces in hyperbolic ends, proving manifold properties.
Flat metrics on hyperbolic surfaces embed as polyhedral surfaces in (2+1)-spacetimes.
Study shows Bergman metric is non-Einstein for certain domains.
We study the rigidity of polyhedral surfaces using variational principle. The action functionals are derived from the cosine laws. The main focus of this paper is on the cosine law for a non-triangular region bounded by three possibly disjoint geodesics. Several of these cosine laws were first discovered and used by Fe…
We present and apply a method for disproving the existence of polyhedral immersions in of certain triangulations on non-orientable surfaces. In particular, it is proved that neither of the two vertex-minimal, neighborly 9-vertex triangulations of the non-orientable surface of genus 5 are realizable as im…
We show that 3-dimensional polyhedral manifolds with nonnegative curvature in the sense of Alexandrov can be approximated by nonnegatively curved 3-dimensional Riemannian manifolds.
The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.
The study classifies singularities in curved 3D shapes.
We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many predictions (e.g.\ rankings) as a point in , assigns the original loss val…