arXiv subjects

Beniamin Bogosel

Publications and source records attributed to Beniamin Bogosel.

At least 19 recordsLinked to original sources

arXiv2026

Proof of the local version of the Pólya--Szegö conjecture for the torsional rigidity of polygons

We prove the local version of the Pólya--Szegö conjecture for the torsional rigidity of polygons: for every $n\geq5$, the regular $n$-gon is a strict local maximizer of torsional rigidity among convex $n$-gons of prescribed area. Our proof is entirely analytic. It builds on a locally stable proportional triangular covering inspired by Solynin and Zalgaller and an associated weighted Voronoi-type partition, together with a quantitative asymptotic analysis of the loss produced by truncating the overlapping triangles to the partition cells. The result is then obtained by establishing two key ingredients: the optimality of isosceles triangles for mixed torsional rigidity at fixed area and vertex angle, and a strict concavity property of the mixed torsional rigidity of isosceles triangles.

math.SP↗

arXiv2026

Computer-assisted local maximality of regular polygons for torsional rigidity

We study torsional rigidity as a function of the labeled vertices of a convex polygon. Starting from the distributed second shape derivative, we derive the Hessian with respect to vertex coordinates. At a regular polygon, dihedral symmetry makes this matrix block circulant in radial-tangential coordinates, reducing its spectrum to the eigenvalues of Hermitian matrices of order two. We also derive an exact second-variation Galerkin identity and guaranteed functional residual majorants. Finite elements approximate the PDE solutions entering the Hessian, and FLINT/Arb provides the interval arithmetic needed for certification. In the scale-invariant setting, we certify exactly four zero eigenvalues generated by similarities and $2n-4$ strictly negative eigenvalues for $5\leq n\leq25$. The regular polygons in this range are therefore strict local maximizers, modulo similarities, of torsional rigidity divided by area squared. The observed Hessian error decreases nearly quadratically with the mesh size; the transmission regularity needed to prove this rate is stated separately as a conjecture.

math.NA↗

arXiv2026

Symmetry breaking in the polygonal Szegö-Weinberger inequality as $p\to1^+$: the longest shortest-fence quadrilateral

We consider Pólya's problem of finding, among convex sets of prescribed area, the one with the longest shortest fence, in the polygonal setting, namely when the class of competitors is restricted to polygons with a prescribed number of sides. While it is straightforward to show that, among triangles, the optimal shape is the equilateral one, we prove that symmetry breaking occurs in the case of quadrilaterals: the optimal quadrilateral is not the square. More precisely, we identify it as a specific isosceles trapezium, which is uniquely determined, up to homotheties and rigid motions, by an elementary equation for its base angle. The proof combines analytical arguments and rigorous interval-arithmetic computations.

math.OC↗

arXiv2026

Isoperimetric problems related to extremal diameter graphs in 3D: theoretical and numerical aspects

We study optimization problems for separable functionals of the Euclidean or spherical lengths of dual edge pairs in finite extremal unit-diameter configurations in three dimensions. For a fixed diameter graph, these problems lead to nonconvex constrained optimization of the vertex coordinates. We first prove that a convergent sequence of extremal configurations retains an extremal geometric core after coincident points are merged and vertices incident to at most one diameter are removed. A spherical Crofton argument then gives a sharp lower bound for additive concave functionals, attained by the regular tetrahedron. We also analyze the effect of inserting or deleting dangling vertices. For the sum of products of spherical dual-edge lengths, we obtain an exact supremal reformulation of the three-dimensional Blaschke--Lebesgue area problem. The numerical study uses all 10,644 available extremal configurations with at most 16 vertices. We combine direct evaluation with gradient-based local optimization on each fixed graph and reconstruct the intrinsic diameter graph and its dual pairs after vertex collisions. For every supplied graph, the selected verified endpoint contains a regular tetrahedron. These computations do not certify the global maximum for any fixed graph, but they motivate structural conjectures connecting tetrahedral containment with the Blaschke--Lebesgue problem.

math.OC↗

arXiv2026

Dangling points in area-minimizing Meissner polyhedra

Meissner polyhedra are constant-width bodies obtained from extremal finite sets of unit diameter. Such a generating set may contain dangling points, namely points having exactly two diametric neighbors. This article studies whether these points can play an essential role in surface-area minimization. Given an extremal set we show that the smallest surface area among the Meissner polyhedra based on it cannot increase by deleting a dangling point. Adding a dangling point cannot decrease the smallest achievable surface area. This reduces the search for area-minimizing Meissner polyhedra to generating sets without dangling points.

math.OC↗

arXiv2026

Shape optimization under width constraint: the Cheeger constant and the torsional rigidity

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, consisting of disks with three disjoint caps. Comparison results for harmonic functions help establish that in non-equilateral configurations the shape derivative has an appropriate sign, contradicting optimality.

math.OC↗

arXiv2025

Optimal Finsler-Hadwiger inequalities

Various inequalities exist between the area of a triangle, the perimeter squared $(a+b+c)^2$ and the isoperimetric deficit $Q=(a-b)^2+(b-c)^2+(c-a)^2$. The direct and reverse Finsler-Hadwiger inequalities correspond to the best linear inequalities between the three quantities mentioned above. In this paper, the sharpest inequalities between these three quantities are found explicitly. The techniques used involve Blaschke-Santaló diagrams and constrained optimization problems.

math.OC↗

arXiv2025

Optimisation of space-time periodic eigenvalues

The goal of this paper is to provide a qualitative analysis of the optimisation of space-time periodic principal eigenvalues. Namely, considering a fixed time horizon $T$ and the $d$-dimensional torus $\mathbb{T}^d$, let, for any $m\in L^\infty((0,T)\times\mathbb{T}^d)$, $λ(m)$ be the principal eigenvalue of the operator $\partial_t-Δ-m$ endowed with (time-space) periodic boundary conditions. The main question we set out to answer is the following: how to choose $m$ so as to minimise $λ(m)$? This question stems from population dynamics. We prove that in several cases it is always beneficial to rearrange $m$ with respect to time in a symmetric way, which is the first comparison result for the rearrangement in time of parabolic equations. Furthermore, we investigate the validity (or lack thereof) of Talenti inequalities for the rearrangement in time of parabolic equations. The numerical simulations which illustrate our results were obtained by developing a framework within which it is possible to optimise criteria with respect to functions having a prescribed rearrangement (or distribution function).

math.AP↗

arXiv2024

New variational arguments regarding the Blaschke-Lebesgue theorem

The sensitivity of the areas of Reuleaux polygons and disk polygons is computed with respect to vertex perturbations. Computations are completed for both constrained and Lagrangian formulations and they imply that the only critical Reuleaux polygons for the area functional are the regular ones. As a consequence, new variational proofs for the Blaschke-Lebesgue and Firey-Sallee theorems are found.

math.MG↗

arXiv2024

Polygonal Faber-Krahn inequality: Local minimality via validated computing

The main result of the paper shows that the regular $n$-gon is a local minimizer for the first Dirichlet-Laplace eigenvalue among $n$-gons having fixed area for $n \in \{5,6\}$. The eigenvalue is seen as a function of the coordinates of the vertices in $\Bbb R^{2n}$. Relying on fine regularity results of the first eigenfunction in a convex polygon, an explicit a priori estimate is given for the eigenvalues of the Hessian matrix associated to the discrete problem, whose coefficients involve the solutions of some Poisson equations with singular right hand sides. The a priori estimates, in conjunction with certified finite element approximations of these singular PDEs imply the local minimality for $n \in \{5,6\}$. All computations, including the finite element computations, are realized using interval arithmetic.

math.NA↗

arXiv2024

A reverse isoperimetric inequality for convex shapes with inclusion constraint

The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are characterized through explicit equations. The case of more general containing shapes is also discussed from both theoretical and numerical perspectives.

math.MG↗

arXiv2024

Optimization of Neumann Eigenvalues under convexity and geometric constraints

In this paper we study optimization problems for Neumann eigenvalues $μ_k$ among convex domains with a constraint on the diameter or the perimeter. We work mainly in the plane, though some results are stated in higher dimension. We study the existence of an optimal domain in all considered cases. We also consider the case of the unit disk, giving values of the index $k$ for which it can be or cannot be extremal. We give some numerical examples for small values of $k$ that lead us to state some conjectures.

math.AP↗

arXiv2023

Mixed volumes and the Blaschke-Lebesgue theorem

The mixed area of a Reuleaux polygon and its symmetric with respect to the origin is expressed in terms of the mixed area of two explicit polygons. This gives a geometric explanation of a classical proof due to Chakerian. Mixed areas and volumes are also used to reformulate the minimization of the volume under constant width constraint as isoperimetric problems. In the two dimensional case, the equivalent formulation is solved, providing another proof of the Blaschke-Lebesgue theorem. In the three dimensional case the proposed relaxed formulation involves the mean width, the area and inclusion constraints.

math.MG↗

arXiv2023

Volume computation for Meissner polyhedra and applications

The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional problems. A direct consequence is the minimality of the volume of Meissner tetrahedras among Meissner pyramids.

math.MG↗

arXiv2023

A Geometric proof for the Polygonal Isoperimetric Inequality

Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area minimizing the perimeter must be regular.

math.MG↗

arXiv2023

On the Blaschke-Lebesgue theorem for the Cheeger constant via areas and perimeters of inner parallel sets

The first main result presented in the paper shows that the perimeters of inner parallel sets of planar shapes having a given constant width are minimal for the Reuleaux triangles. This implies that the areas of inner parallel sets and, consequently, the inverse of the Cheeger constant are also minimal for the Reuleaux triangles. Proofs use elementary geometry arguments and are based on direct comparisons between general constant width shapes and the Reuleaux triangle.

math.MG↗

arXiv2023

The nonlocal isoperimetric problem for polygons: Hardy-Littlewood and Riesz inequalities

Given a non-increasing and radially symmetric kernel in $L ^ 1 _{\rm loc} (\Bbb{R} ^ 2 ; \Bbb{R}_+)$, we investigate counterparts of the classical Hardy-Littlewood and Riesz inequalities when the class of admissible domains is the family of polygons with given area and $N$ sides. The latter corresponds to study the polygonal isoperimetric problem in nonlocal version. We prove that, for every $N \geq 3$, the regular $N$-gon is optimal for Hardy-Littlewood inequality. Things go differently for Riesz inequality: while for $N = 3$ and $N = 4$ it is known that the regular triangle and the square are optimal, for $N\geq 5$ we prove that symmetry or symmetry breaking may occur (i.e. the regular $N$-gon may be optimal or not), depending on the value of $N$ and on the choice of the kernel.

math.OC↗

arXiv2023

On the numerical approximation of Blaschke-Santaló diagrams using Centroidal Voronoi Tessellations

Identifying Blaschke-Santaló diagrams is an important topic that essentially consists in determining the image $Y=F(X)$ of a map $F:X\to{\mathbb{R}}^d$, where the dimension of the source space $X$ is much larger than the one of the target space. In some cases, that occur for instance in shape optimization problems, $X$ can even be a subset of an infinite-dimensional space. The usual Monte Carlo method, consisting in randomly choosing a number $N$ of points $x_1,\dots,x_N$ in $X$ and plotting them in the target space ${\mathbb{R}}^d$, produces in many cases areas in $Y$ of very high and very low concentration leading to a rather rough numerical identification of the image set. On the contrary, our goal is to choose the points $x_i$ in an appropriate way that produces a uniform distribution in the target space. In this way we may obtain a good representation of the image set $Y$ by a relatively small number $N$ of samples which is very useful when the dimension of the source space $X$ is large (or even infinite) and the evaluation of $F(x_i)$ is costly. Our method consists in a suitable use of {\it Centroidal Voronoi Tessellations} which provides efficient numerical results. Simulations for two and three dimensional examples are shown in the paper.

math.NA↗