arXiv research

Study shows Bergman metric is non-Einstein for certain domains.

Proves smoothness of minimal surfaces near polyhedral boundaries.

Characterizes billiard and quasigeodesic flows in polyhedral convex bodies.

We prove that, both in the hyperbolic and spherical 3-spaces, there exist nonconvex compact boundary-free polyhedral surfaces without selfintersections which admit nontrivial continuous deformations preserving all dihedral angles and study properties of such polyhedral surfaces. In particular, we prove that the volume …

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

The paper defines Dirichlet domains for Anosov subgroups in Lie groups.

We show that the notion of $3$-hyperconvexity on oriented flag manifolds defines a partial cyclic order. Using the notion of interval given by this partial cyclic order, we construct Schottky groups and show that they correspond to images of positive representations in the sense of Fock and Goncharov. We construct poly…

The main aim of this paper is to give two infinite series of examples of Lorentz space forms that can be obtained from Lorentz polyhedra by identification of faces. These Lorentz space forms are bi-quotients of the form $Γ_1\backslash G/Γ_2$, where $G=\widetilde{\operatorname{SU}(1,1)}\cong\widetilde{\operatorname{SL}(…

Study on discrete Gaussian curvature for polyhedral surfaces.

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 $CAT(0)$ metrics are arborescent.

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

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 $2π.$ 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…

Constructs symplectic structures from rational functions on fans.

Finite element method approximates scalar curvature in arbitrary dimensions.

A polyhedral map is called $\{p, q\}$-equivelar if each face has $p$ edges and each vertex belongs to $q$ faces. In 1983, it was shown that there exist infinitely many geometrically realizable $\{p, q\}$-equivelar polyhedral maps if $q > p = 4$, $p > q = 4$ or $q - 3 > p = 3$. 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 study Atlas-type models of equity markets with local characteristics that depend on both name and rank, and in ways that induce a stable capital distribution. Ergodic properties and rankings of processes are examined with reference to the theory of reflected Brownian motions in polyhedral domains. In the context of …

The paper approximates Einstein tensor using finite elements.

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 …

Non-rigidity degree of a lattice $L$, nrd$L$, is dimension of the L-type domain to which $L$ belongs. We complete here the table of nrd's of all root lattices and their duals; namely, the hardest remaining case of $D_n^*$, and the case of $E_7^*$ are decided. We describe explicitly the $L$-type domain ${\cal D}(D_n^*)$…

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 study some basic analytic questions related to differential operators on Lie manifolds, which are manifolds whose large scale geometry can be described by a a Lie algebra of vector fields on a compactification. We extend to Lie manifolds several classical results on Sobolev spaces, elliptic regularity, and mapping p…

This work describes compactifications of metric spaces and vector spaces using asymmetric norms.

We investigate the rigidity of hyperbolic cone metrics on $3$-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…

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.

We investigate subgroups of SL (n,Z) which preserve an open nondegenerate convex cone in real n-space and admit in that cone as fundamental domain a polyhedral cone of which some faces are allowed to lie on the boundary. Examples are arithmetic groups acting on selfdual cones, Weyl groups of certain Kac-Moody algebras …

We prove that the Koebe circle domain conjecture is equivalent to the Weyl type problem that every complete hyperbolic surface of genus zero is isometric to the boundary of the hyperbolic convex hull of the complement of a circle domain. It provides a new way to approach the Koebe's conjecture using convex geometry. Co…

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

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

Linear optimization is many times algorithmically simpler than non-linear convex optimization. Linear optimization over matroid polytopes, matching polytopes and path polytopes are example of problems for which we have simple and efficient combinatorial algorithms, but whose non-linear convex counterpart is harder and …