English
Related papers

Related papers: A simplicial polytope that maximizes the isotropic…

200 papers

Let $K$ be a simplical complex, and let $\mathcal{L}_i^{up}(K), \mathcal{Q}_i^{up}(K)$ be the $i$-th up Laplacian and signless Laplacian of $K$, respectively. In this paper we proved that the largest eigenvalue of $\mathcal{L}_i^{up}(K)$ is…

Combinatorics · Mathematics 2025-07-22 Yi-Zheng Fan , Hui-Feng Wu , Yi Wang

Given a (finite) simplicial complex, we define its $i$-th Laplacian polytope as the convex hull of the columns of its $i$-th Laplacian matrix. This extends Laplacian simplices of finite simple graphs, as introduced by Braun and Meyer. After…

Combinatorics · Mathematics 2023-02-06 Martina Juhnke-Kubitzke , Daniel Köhne

Existence of nicely bounded sections of two symmetric convex bodies K and L implies that the intersection of random rotations of K and L is nicely bounded. For L = subspace, this main result immediately yields the unexpected phenomenon: "If…

Functional Analysis · Mathematics 2016-12-23 Roman Vershynin

The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr.~on the reverse question: Every convex body has a linear image whose…

Metric Geometry · Mathematics 2020-04-29 Bernardo González Merino , Matthias Schymura

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava

For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…

Metric Geometry · Mathematics 2021-06-22 Gilles Bonnet , Anna Gusakova , Christoph Thäle , Dmitry Zaporozhets

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

Metric Geometry · Mathematics 2025-03-31 Lenny Fukshansky

The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…

Metric Geometry · Mathematics 2018-11-13 Julian Grote , Christoph Thaele , Elisabeth M. Werner

We consider the problem of wrapping three-dimensional solid bodies with a given planar sheet of paper, where the paper may be folded or wrinkled but not stretched or torn. We propose a conjecture characterising the maximumvolume solid…

Metric Geometry · Mathematics 2026-04-06 R Nandakumar

We prove power series expansions for the expectations of the number of vertices and missed area of random $L$-convex polygons in planar convex bodies with sufficiently smooth boundaries. Random $L$-convex polygons arise as the intersection…

Metric Geometry · Mathematics 2025-09-16 Ferenc Fodor , Dániel I. Papvári

Recall that a convex body $K$ is in John's position if the unit Euclidean ball is the maximal volume ellipsoid contained in $K$. Approximating convex body in John's position by polytopes we obtain the following results. 1. Let $n>R_n\ge 1$…

Metric Geometry · Mathematics 2019-08-19 Han Huang

For two convex discs $K$ and $L$, we say that $K$ is $L$-convex if it is equal to the intersection of all translates of $L$ that contain $K$. In $L$-convexity the set $L$ plays a similar role as closed half-spaces do in the classical notion…

Metric Geometry · Mathematics 2026-04-09 Ferenc Fodor , Dániel I. Papvári , Viktor Vígh

We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…

Analysis of PDEs · Mathematics 2014-12-09 Gershon Kresin , Vladimir Maz'ya

We introduce canonical measures on a locally finite simplicial complex $K$ and study their asymptotic behavior under infinitely many barycentric subdivisions. We also compute the face polynomial of the asymptotic link and dual block of a…

Geometric Topology · Mathematics 2017-06-08 Nermin Salepci , Jean-Yves Welschinger

Let K\subset R^N be any convex body containing the origin. A measurable set G\subset R^N with finite and positive Lebesgue measure is said to be K-dense if, for any fixed r>0, the measure of G\cap (x+r K) is constant when x varies on the…

Metric Geometry · Mathematics 2013-08-07 Rolando Magnanini , Michele Marini

Characterizing face-number-related invariants of a given class of simplicial complexes has been a central topic in combinatorial topology. In this regard, one of the well-known invariants is $g_2$. Let $K$ be a normal $3$-pseudomanifold…

Geometric Topology · Mathematics 2023-07-04 Biplab Basak , Raju Kumar Gupta , Sourav Sarkar

Let $K$ be an isotropic convex body in $\R^n$. Given $\eps>0$, how many independent points $X_i$ uniformly distributed on $K$ are needed for the empirical covariance matrix to approximate the identity up to $\eps$ with overwhelming…

Probability · Mathematics 2015-05-13 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

We consider the problem of minimizing the relative perimeter under a volume constraint in an unbounded convex body $C\subset \mathbb{R}^{n+1}$, without assuming any further regularity on the boundary of $C$. Motivated by an example of an…

Metric Geometry · Mathematics 2016-06-27 Gian Paolo Leonardi , Manuel Ritoré , Efstratios Vernadakis

We strongly believe that in order to prove two important geometrical pro\-blems in convexity, namely, the G. Bianchi and P. Gruber's Conjecture \cite{bigru} and the J. A. Barker and D. G. Larman's Conjecture \cite{Barker}, it is necessary…

Metric Geometry · Mathematics 2026-02-03 Efrén Morales-Amaya , Geronimmo Mondragón , Jesús Jerónimo-Castro