English
Related papers

Related papers: Extremal functions for real convex bodies: simplic…

200 papers

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…

Combinatorics · Mathematics 2013-04-30 Jesús A. De Loera , Francisco Santos , Fumihiko Takeuchi

We propose a simple derivation of an upper bound for the perimeter of an ellipse. The procedure, which relies on the use of elliptic integrals, consists in introducing, via inequalities and convexity properties, specific integrals which can…

Classical Analysis and ODEs · Mathematics 2022-05-26 Jean-Christophe Pain

We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum…

Metric Geometry · Mathematics 2012-04-13 Alexander Barvinok

We work in the setting of weighted pluripotential theory arising from polynomials associated to a convex body $P$ in $({\bf R}^+)^d$. We define the {\it logarithmic indicator function} on ${\bf C}^d$: $$H_P(z):=\sup_{ J\in P} \log |z^{…

Complex Variables · Mathematics 2023-10-30 T. Bayraktar , S. Hussung , N. Levenberg , M. Perera

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.

Combinatorics · Mathematics 2007-05-23 Amitava Bhattacharya , Shmuel Friedland , Uri N. Peled

In this paper we discuss three distance functions on the set of convex bodies. In particular we study the convergence of Delzant polytopes, which are fundamental objects in symplectic toric geometry. By using these observations, we derive…

Metric Geometry · Mathematics 2026-01-14 Hajime Fujita , Yu Kitabeppu , Ayato Mitsuishi

We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…

Computational Geometry · Computer Science 2012-08-14 Luc Habert , Michel Pocchiola

In this paper, we consider the problem of finding geodesics in a series of left-invariant problems endowed with sub-Lorentzian and Finsler structures. Explicit formulas for extremals are obtained in terms of convex trigonometric functions.…

Optimization and Control · Mathematics 2025-07-02 E. A. Ladeishchikov , L. V. Lokutsievskiy , N. V. Prilepin

This paper is devoted to measures of symmetry based on distance between centroid and one of the centers of John and Lowner ellipsoid. The author proves the accuracy of the derived upper bounds for the considered measures of symmetry.

Metric Geometry · Mathematics 2019-08-06 Evgenii Safronenko

In the article we outline the set of Matlab functions that enable the computation of elliptic Integrals and Jacobian elliptic functions for real arguments. Correctness, robustness, efficiency and accuracy of the functions are discussed in…

Mathematical Software · Computer Science 2019-07-30 Milan Batista

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

Optimization and Control · Mathematics 2010-07-27 João Gouveia , Rekha R. Thomas

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

In this paper, we study the existence of extremal functions of the discrete Sobolev inequality and Hardy-Littlewood-Sobolev inequality on lattice graphs. We introduce the discrete Concentration-Compactness principle, and prove the existence…

Analysis of PDEs · Mathematics 2021-07-01 Bobo Hua , Ruowei Li

In this paper we introduce an enhanced notion of extremal systems for sets in locally convex topological vector spaces and obtain efficient conditions for set extremality in the convex case. Then we apply this machinery to deriving new…

Optimization and Control · Mathematics 2016-10-03 Boris Mordukhovich , Nguyen Mau Nam

We consider moments of the normalized volume of a symmetric or nonsymmetric random polytope in a fixed symmetric convex body. We investigate for which bodies these moments are extremized, and calculate exact values in some of the extreme…

Metric Geometry · Mathematics 2007-05-23 Mark W. Meckes

We survey results concerning sharp estimates on volumes of sections and projections of certain convex bodies, mainly $\ell_p$ balls, by and onto lower dimensional subspaces. This subject emerged from geometry of numbers several decades ago…

Functional Analysis · Mathematics 2025-01-28 Piotr Nayar , Tomasz Tkocz

In this paper, we show that the extremal length functions on Teichm\"uller space are log-plurisubharmonic. As a corollary, we obtain an alternative proof of L.Liu and W.Su's results on the plurisubharmonicity of extremal length functions.…

Complex Variables · Mathematics 2015-07-28 Hideki Miyachi

We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…

Numerical Analysis · Computer Science 2018-06-19 Fredrik Johansson

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

Functional Analysis · Mathematics 2010-10-13 Maxim V. Balashov , Dušan Repovš