English
Related papers

Related papers: Klein polyhedra and lattices with positive norm mi…

200 papers

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…

Computational Geometry · Computer Science 2010-01-21 David Eppstein

We consider the codimension one asymptotic stability problem for the soliton of the focusing cubic Klein-Gordon equation on the line under even perturbations. The main obstruction to full asymptotic stability on the center-stable manifold…

Analysis of PDEs · Mathematics 2024-03-04 Jonas Luhrmann , Wilhelm Schlag

We construct projections from the space of differential k-forms which belong to L2 and whose exterior derivative also belongs to L2, to finite dimensional subspaces of piecewise polynomial differential forms defined on a simplicial mesh.…

Numerical Analysis · Mathematics 2012-11-27 Richard S. Falk , Ragnar Winther

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Computational Geometry · Computer Science 2017-12-06 Giuseppe Sellaroli

Let $X$ be a complex manifold and let $g$ be a polyhedral metric on it inducing its topology. We say that $g$ is a polyhedral K\"ahler (PK) metric on $X$ if it is K\"ahler outside its singular set. The local geometry of PK metrics is…

Differential Geometry · Mathematics 2021-06-25 Martin de Borbon , Dmitri Panov

A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…

Metric Geometry · Mathematics 2016-04-05 Samuel Reid

Polyhedral K\"ahler surfaces are a class of complex surfaces, which are flat everywhere except on a two-dimensional skeleton. They are defined as a generalisation of the "gluing a polygon side by side" construction of flat Riemann surfaces.…

Algebraic Geometry · Mathematics 2018-06-11 Cécile Gachet

The present paper is in a sense a continuation of \cite{PLS}, it relies on the notation and some results. The problem tackled in both papers is the nature of the continued fraction expansion of $\sqrt[3]{2}$: are the partial quotients…

Number Theory · Mathematics 2011-02-01 Mitja Lakner , Peter Petek , Marjeta Škapin Rugelj

A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…

Metric Geometry · Mathematics 2014-01-03 Michel Deza , Mathieu Dutour Sikirić

In n-dimensional Euclidean space E^n, harmonic curvatures of a non-degenerate curve defined by \"Ozdamar and Hacisaliho\u{g}lu [4]. In this paper, We define a new type of curves called LC helix when the angle between tangent of this curve…

Differential Geometry · Mathematics 2012-03-12 Ali Senol , Evren Ziplar , Yusuf Yayli

Projectivizations of pointed polyhedral cones $C$ are positive geometries in the sense of Arkani-Hamed, Bai, and Lam. Their canonical forms look like $$ \Omega_C(x)=\frac{A(x)}{B(x)} dx, $$ with $A,B$ polynomials. The denominator $B(x)$ is…

Combinatorics · Mathematics 2025-04-11 Christian Gaetz

The Bergman kernels of monomial polyhedra are explicitly computed. Monomial polyhedra are a class of bounded pseudoconvex Reinhardt domains defined as sublevel sets of Laurent monomials. Their kernels are rational functions and are obtained…

Complex Variables · Mathematics 2023-08-14 Debraj Chakrabarti , Isaac Cinzori , Ishani Gaidhane , Jonathan Gregory , Mary Wright

Let $K$ be a bounded convex domain in $\mathbb{R}^2$ symmetric about the origin. The critical locus of $K$ is defined to be the (non-empty compact) set of lattices $\Lambda$ in $\mathbb{R}^2$ of smallest possible covolume such that $\Lambda…

Metric Geometry · Mathematics 2021-01-13 Dmitry Kleinbock , Anurag Rao , Srinivasan Sathiamurthy

In this note we prove the following result: There is a positive constant $\epsilon(n,\Lambda)$ such that if $M^n$ is a simply connected compact K$\ddot{a}$hler manifold with sectional curvature bounded from above by $\Lambda$, diameter…

Differential Geometry · Mathematics 2008-11-10 Hong Huang

A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full…

Combinatorics · Mathematics 2008-11-11 S. Felsner , K. Knauer

Steinitz's theorem states that if the origin belongs to the interior of the convex hull of a set $Q \subset \mathbb{R}^d$, then there are at most $2d$ points $Q^\prime$ of $Q$ whose convex hull contains the origin in the interior.…

Metric Geometry · Mathematics 2023-12-01 Grigory Ivanov , Márton Naszódi

Kleinian singularities are quotients of $\mathbb{C}^2$ by finite subgroups of $\mathrm{SL}_2(\mathbb{C})$. They are in bijection with the simply-laced Dynkin diagrams via the McKay correspondence. Anti-Poisson involutions and their fixed…

Representation Theory · Mathematics 2025-04-14 Mengwei Hu

Dualising the construction of a polyhedral product, we introduce the notion of a polyhedral coproduct as a certain homotopy limit over the face poset of a simplicial complex. We begin a study of the basic properties of polyhedral…

Algebraic Topology · Mathematics 2025-06-04 Steven Amelotte , William Hornslien , Lewis Stanton

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Combinatorics · Mathematics 2025-06-30 Jean Cardinal , Vincent Pilaud

We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner…

Optimization and Control · Mathematics 2017-05-08 Gennadiy Averkov , Amitabh Basu , Joseph Paat
‹ Prev 1 8 9 10 Next ›