相关论文: Sharp bounds for the p-torsion of convex planar do…

In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…

Let $\Omega\subset\mathbb{R}^n$, $n\geq 2$, be a bounded, open and convex set and let $f$ be a positive and non-increasing function depending only on the distance from the boundary of $\Omega$. We consider the $p-$torsional rigidity…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…

The torsion function of a convex planar domain has convex level sets, but explicit formulae are known only for rectangles and ellipses. Here we study the torsion function on convex planar domains of high eccentricity. We obtain an…

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…

It has been a widely belief that for a planar convex domain with two coordinate axes of symmetry, the location of maximal norm of gradient of torsion function is either linked to contact points of largest inscribed circle or connected to…

We consider the functional given by the product of the first Dirichlet eigenvalue and the torsional rigidity of planar domains normalized by the area. This scale invariant functional was studied by P\'olya and Szeg\H{o} in 1951 who showed…

We are interested in the optimization of convex domains under a PDE constraint. Due to the difficulties of approximating convex domains in $\mathbb{R}^3$, the restriction to rotationally symmetric domains is used to reduce shape…

We establish a quantitative version of the isoperimetric inequality for the torsion of multiply connected domains, among sets with given area and with given joint area of the holes. Since the optimal shape is the annulus, we investigate how…

Given a convex set $\Omega$ of $\mathbb{R}^n$, we consider the shape optimization problem of finding a convex subset $\omega\subset \Omega$, of a given measure, minimizing the $p$-distance functional $$\mathcal{J}_p(\omega) :=…

In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…

We explore the Steklov eigenvalue problem on convex polygons, focusing mainly on the inverse Steklov problem. Our primary finding reveals that, for almost all convex polygonal domains, there exist at most finitely many non-congruent domains…

We prove explicit upper and lower bounds for the torsional rigidity of extrinsic domains of submanifolds P^m with controlled radial mean curvature in ambient Riemannian manifolds N^n with a pole p and with sectional curvatures bounded from…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…

We prove area bounds for planar convex bodies in terms of their number of interior integral points and their lattice width data. As an application, we obtain sharp area bounds for rational polygons with a fixed number of interior integral…

We prove a Payne-Weinberger type inequality for the $p$-Laplacian Neumann eigenvalues ($p\ge 2$). The inequality provides the sharp upper bound on convex domains, in terms of the diameter alone, of the best constants in Poincar\'e…

We investigate a shape optimization problem of the Polya-Szego type and prove some results on symmetry and asymmetry of extremal domains.

Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…