Searcharxiv⌕ Search

arXiv subjects

Antonio Cañete

Publications and source records attributed to Antonio Cañete.

14 recordsLinked to original sources

Cheeger sets for rotationally symmetric planar convex bodies

In this note we obtain some properties of the Cheeger set $C_Ω$ asociated to a $k$-rotationally symmetric planar convex body $Ω$. More precisely, we prove that $C_Ω$ is also $k$-rotationally symmetric and touches all the edges of $Ω$.

math.MG↗

Optimal divisions of a convex body

For a convex body $C$ in $\mathbb{R}^d$ and a division of $C$ into convex subsets $C_1,\ldots,C_n$, we can consider $max\{F(C_1),\ldots, F(C_n)\}$ (respectively, $min\{F(C_1),\ldots, F(C_n)\}$), where $F$ represents one of these classical geometric magnitudes: the diameter, the minimal width, or the inradius. In this work we study the divisions of $C$ minimizing (respectively, maximizing) the previous value, as well as other related questions.

math.MG↗

Borsuk number for planar convex bodies

By using some simple tools from graph theory, we obtain a characterization of the planar convex bodies with Borsuk number equal to two. This result allows to give some examples of planar convex bodies with Borsuk number equal to three. Moreover, we also prove that the unique centrally symmetric planar convex bodies with Borsuk number equal to three are the Euclidean balls.

math.MG↗

On the isodiametric and isominwidth inequalities for planar bisections

For a given planar convex compact set $K$, consider a bisection $\{A,B\}$ of $K$ (i.e., $A\cup B=K$ and whose common boundary $A\cap B$ is an injective continuous curve connecting two boundary points of $K$) minimizing the corresponding maximum diameter (or maximum width) of the regions among all such bisections of $K$. In this note we study some properties of these minimizing bisections and we provide analogous to the isodiametric (Bieberbach, 1915), the isominwidth (Pál, 1921), the reverse isodiametric (Behrend, 1937), and the reverse isominwidth (González Merino \& Schymura, 2018) inequalities.

math.MG↗

The maximum relative diameter for multi-rotationally symmetric planar convex bodies

In this work we study the maximum relative diameter functional $d_M$ in the class of multi-rotationally symmetric planar convex bodies. A given set $C$ of this class is $k$-rotationally symmetric for $k\in\{k_1,\ldots,k_n\}\subset\nn$, and so it is natural to consider the standard $k_i$-partition $P_{k_i}$ associated to $C$ (which is a minimizing $k_i$-partition for $d_M$ when $k_i\geq3$) and the corresponding value $d_M(P_{k_i})$. We establish the relation among these values, characterizing the particular sets for which all these values coincide.

math.MG↗

Subdivisions of rotationally symmetric planar convex bodies minimizing the maximum relative diameter

In this work we study subdivisions of $k$-rotationally symmetric planar convex bodies that minimize the maximum relative diameter functional. For some particular subdivisions called $k$-partitions, consisting of $k$ curves meeting in an interior vertex, we prove that the so-called \emph{standard $k$-partition} (given by $k$ equiangular inradius segments) is minimizing for any $k\in\mathbb{N}$, $k\geq 3$. For general subdivisions, we show that the previous result only holds for $k\leq 6$. We also study the optimal set for this problem, obtaining that for each $k\in\mathbb{N}$, $k\geq 3$, it consists of the intersection of the unit circle with the corresponding regular $k$-gon of certain area. Finally, we also discuss the problem for planar convex sets and large values of $k$, and conjecture the optimal $k$-subdivision in this case.

math.MG↗

Trisections of a 3-rotationally symmetric planar convex body minimizing the maximum relative diameter

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 standard trisection. We also determine the optimal set giving the minimum value for this functional and study the corresponding universal lower bound.

math.MG↗

Compact stable hypersurfaces with free boundary in convex solid cones with homogeneous densities

We consider a smooth Euclidean solid cone endowed with a smooth homogeneous density function used to weight Euclidean volume and hypersurface area. By assuming convexity of the cone and a curvature-dimension condition we prove that the unique compact, orientable, second order minima of the weighted area under variations preserving the weighted volume and with free boundary in the boundary of the cone are intersections with the cone of round spheres centered at the vertex.

math.DG↗

Some isoperimetric problems in planes with density

We study the isoperimetric problem in Euclidean space endowed with a density. We first consider piecewise constant densities and examine particular cases related to the characteristic functions of half-planes, strips and balls. We also consider continuous modification of Gauss density in $\R^2$. Finally, we give a list of related open questions.

math.DG↗

On the isoperimetric problem in Euclidean space with density

We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive stability conditions, which lead to the conjecture that for a radial log-convex density, balls about the origin are isoperimetric regions. Finally, we prove this conjecture and the uniqueness of minimizers for the density $\exp (|x|^2)$ by using symmetrization techniques.

math.DG↗

Least-perimeter partitions of the disk into three regions of given areas

We prove that the unique least-perimeter way of partitioning the unit 2-dimensional disk into three regions of prescribed areas is by means of the standard graph consisting in three balanced constant geodesic curvature curves meeting themselves at 120 degrees, and reaching orthogonally the boundary of the disk.

math.DG↗