中文
相关论文

相关论文: On approximations by projections of polytopes with…

200 篇论文

The lower dimensional Busemann-Petty problem asks whether origin-symmetric convex bodies in R^n with smaller volume of all k-dimensional sections necessarily have smaller volume. The answer is negative for k>3. The problem is still open for…

泛函分析 · 数学 2017-05-17 Susanna Dann

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

最优化与控制 · 数学 2022-09-08 Dogyoon Song , Pablo A. Parrilo

We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…

复变函数 · 数学 2023-06-21 Giovanni Domenico Di Salvo

We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…

计算几何 · 计算机科学 2025-05-27 Jiaqi Zheng , Tiow-Seng Tan

Let $C$ be a proper convex cone generated by a compact set which supports a measure $\mu$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $\mu$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral…

最优化与控制 · 数学 2014-10-14 Julián Romero , Mauricio Velasco

The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…

数论 · 数学 2026-03-13 Roope Anttila , Jonathan M. Fraser , Henna Koivusalo

The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…

计算几何 · 计算机科学 2025-10-20 Roman Vershynin

We consider the following Bezout inequality for mixed volumes: $$V(K_1,\dots,K_r,\Delta[{n-r}])V_n(\Delta)^{r-1}\leq \prod_{i=1}^r V(K_i,\Delta[{n-1}])\ \text{ for }2\leq r\leq n.$$ It was shown previously that the inequality is true for…

度量几何 · 数学 2020-12-22 Christos Saroglou , Ivan Soprunov , Artem Zvavitch

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

最优化与控制 · 数学 2024-01-25 Daniel Dörfler , Andreas Löhne

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

概率论 · 数学 2020-03-02 Gil Kur

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ sides are unknown when $s \ge 4$. In this paper, we propose an approach to construct convex small $n$-gons of…

度量几何 · 数学 2023-06-29 Christian Bingane

The X-ray numbers of some classes of convex bodies are investigated. In particular, we give a proof of the X-ray Conjecture as well as of the Illumination Conjecture for almost smooth convex bodies of any dimension and for convex bodies of…

度量几何 · 数学 2011-09-29 Karoly Bezdek , Gyorgy Kiss

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

最优化与控制 · 数学 2018-01-15 Prasad Raghavendra , Nick Ryder , Nikhil Srivastava , Benjamin Weitz

The diameter of a polytope is a fundamental geometric parameter that plays a crucial role in understanding the efficiency of the simplex method. Despite its central nature, the computational complexity of computing the diameter of a given…

计算复杂性 · 计算机科学 2025-11-04 Lasse Wulf

We begin by proving a few general facts about Simson polygons, defined as polygons which admit a pedal line. We use an inductive argument to show that no convex $n$-gon, $n\geq5$, admits a Simson Line. We then determine a property which…

度量几何 · 数学 2014-06-20 Emmanuel Tsukerman

In this note we consider two topics involving the relationship between the symplectic capacity and the mean width of convex bodies in $\mathbb{R}^{2n}$. We first describe an alternative path from the symplectic Brunn-Minkowski inequality of…

辛几何 · 数学 2026-02-10 Jonghyeon Ahn , Ely Kerman

In this short note, we show that the inradius of a convex body is comparable to its volume divided by its surface area. We also give a simple formula, in terms of its volume and inradius, that is comparable to the volume of its intersection…

度量几何 · 数学 2024-02-13 Benedict Sewell

The main objective of this article is to provide an alternative approach to the central result of [Eldred, A. Anthony, Kirk, W. A., Veeramani, P., Proximal normal structure and relatively nonexpansive mappings, Studia Math., vol 171(3),…

泛函分析 · 数学 2022-06-30 Abhik Digar , G. Sankara Raju Kosuru

Extending results of Suss and Hadwiger (proved by them for the case of convex bodies and positive ratios), we show that compact (respectively, closed) convex sets in the Euclidean space of dimension n are homothetic provided for any given…

度量几何 · 数学 2009-03-17 V. Soltan

Let $X$ be a projective irreducible holomorphic symplectic manifold. We associate with any big $\mathbf{R}$-divisor $D$ on $X$ a convex polygon $\Delta_E^{\mathrm{num}}(D)$ of dimension 2, whose Euclidean volume is…

代数几何 · 数学 2025-01-22 Francesco Antonio Denisi
‹ 上一页 1 8 9 10 下一页 ›