中文
相关论文

相关论文: The longest shortest fence and sharp Poincar\'e-So…

200 篇论文

In this work we study the fencing problem consisting of finnding a trisection of a 3-rotationally symmetric planar convex body which minimizes the maximum relative diameter. We prove that an optimal solution is given by the so-called…

度量几何 · 数学 2014-05-20 Antonio Cañete , Cinzia Miori , Salvador Segura Gomis

Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…

最优化与控制 · 数学 2021-02-05 Orgil-Erdene Erdenebaatar , Uuganbaatar Ninjbat

We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…

最优化与控制 · 数学 2025-12-08 C. Yalçın Kaya , Lyle Noakes , Philip Schrader

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$ is a concave (resp.…

度量几何 · 数学 2024-02-08 Bushra Basit , Zsolt Lángi

We study the least gradient problem in bounded regions with Lipschitz boundary in the plane. We provide a set of conditions for the existence of solutions in non-convex simply connected regions. We assume the boundary data is continuous and…

偏微分方程分析 · 数学 2024-08-26 Samer Dweik , Piotr Rybka , Ahmad Sabra

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

度量几何 · 数学 2013-12-10 Zakhar Ovsyannikov

It is well known that among all closed bounded curves in the plane with the given perimeter, the circle encloses the maximum area. There are many proofs in the literature. In this article we have given a new proof using some ideas of Demar.

历史与综述 · 数学 2016-09-28 Absos Ali Shaikh , Chandan Kumar Mondal

The P\'al inequality is a classical result which asserts that among all planar convex sets of given width the equilateral triangle is the one of minimal area. In this paper we prove three quantitative versions of this inequality, by…

度量几何 · 数学 2025-03-17 Ilaria Lucardesi , Davide Zucco

We study shortest curves in proximally smooth subsets of a Hilbert space. We consider an $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and $b$ satisfying $\left|{a-b}\right| < 2R.$ We provide a simple geometric algorithm…

泛函分析 · 数学 2024-11-26 Grigory M. Ivanov , Mariana S. Lopushanski , Grigorii E. Ivanov

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

计算几何 · 计算机科学 2021-08-03 Shai Gul , Reuven Cohen , Simi Haber

We settle J. Wetzel's 1970's conjecture and show that a 30{^\circ} circular sector of unit radius can accommodate every planar arc of unit length. Leo Moser asked in 1966 for the smallest (convex) region in the plane that can accommodate…

度量几何 · 数学 2019-07-18 Chatchawan Panraksa , Wacharin Wichiramala

An opaque set (or a barrier) for $U \subseteq \mathbb{R}^2$ is a set $B$ of finite-length curves such that any line intersecting $U$ also intersects $B$. In this paper, we consider the lower bound for the shortest barrier when $U$ is the…

计算几何 · 计算机科学 2015-09-15 Taisuke Izumi

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…

计算几何 · 计算机科学 2018-10-26 Ery Arias-Castro , Thibaut Le Gouic

In this article it is shown that the equilateral triangle maximizes the Cheeger constant and minimizes the torsional rigidity among shapes having a fixed minimal width. The proof techniques use direct comparisons with simpler shapes,…

最优化与控制 · 数学 2026-03-24 Beniamin Bogosel

In this pedagogical note we present a short proof of the following main result of arxiv.org/abs/0911.5319, and clarify its relation to the isoperimetric problem. On the hyperbolic plane consider triangles ABC with fixed lengths of AB and…

度量几何 · 数学 2017-10-12 A. Skopenkov

P\'al's classical isominwidth inequality states that the regular triangle has minimal area among plane convex bodies of minimal width $w$. A similar result is the Blaschke--Lebesgue inequality that states that Reuleaux triangles minimize…

度量几何 · 数学 2026-02-24 Ferenc Fodor , Nathan Robock , Ádám Sagmeister

We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.

最优化与控制 · 数学 2012-11-07 Vincenzo Ferone , Carlo Nitsch , Cristina Trombetti

Explicit lower bounds for the length of the shortest opaque set for the unit disc and the unit square in the Euclidean plane are derived. The results are based on an explicit application of the general method of Kawamura, Moriyama, Otachi…

度量几何 · 数学 2025-12-11 Markus Kiderlen , Florian Pausinger

The convex body isoperimetric conjecture in the plane asserts that the least perimeter to enclose given area inside a unit disk is greater than inside any other convex set of area $\pi$. In this note we confirm two cases of the conjecture:…

微分几何 · 数学 2021-04-13 Bo-Hshiung Wang , Ye-Kai Wang

Henrot and Lucardesi, in Commun. Contemp. Math. (2024), conjectured that among planar convex sets with prescribed minimal width, the equilateral triangle uniquely maximizes the Cheeger constant. In this short note, we confirm this…

最优化与控制 · 数学 2025-11-18 Ilias Ftouhi , Ilaria Lucardesi , Giorgio Saracco
‹ 上一页 1 2 3 10 下一页 ›