English
Related papers

Related papers: Containment and inscribed simplices

200 papers

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

Given n convex bodies in the real space of dimension d, we consider the set of homogeneous polynomials of degree d in n variables that can be represented as their volume polynomial. This set is a subset of the set of Lorentzian polynomials.…

Combinatorics · Mathematics 2026-01-14 Amelie Menges

Inspired by a fundamental theorem of Bernstein, Kushnirenko, and Khovanskii we study the following Bezout type inequality for mixed volumes $$ V(L_1,\dots,L_{n})V_n(K)\leq V(L_1,K[{n-1}])V(L_2,\dots, L_{n},K). $$ We show that the above…

Metric Geometry · Mathematics 2020-12-22 Christos Saroglou , Ivan Soprunov , Artem Zvavitch

We study the following open problem, suggested by Barker and Larman. Let $K$ and $L$ be convex bodies in $\mathbb R^n$ ($n\ge 2$) that contain a Euclidean ball $B$ in their interiors. If $\mathrm{vol}_{n-1}(K\cap H) =…

Metric Geometry · Mathematics 2015-09-29 Vladyslav Yaskin , Ning Zhang

There is a hierarchy of structure conditions for convex sets. In this paper we study a recently defined [3, 8, 9] condition called locally nonconical convexity (abbreviated LNC). Is is easy to show that every strictly convex set is LNC, as…

Functional Analysis · Mathematics 2016-09-07 C. A. Akemann , G. C. Shell , N. Weaver

Let $K$ and $L$ be two convex bodies in $\mathbb R^n$, $n\geq 2$, with $L\subset \text{int}\, K$. We say that $L$ is an equichordal body for $K$ if every chord of $K$ tangent to $L$ has length equal to a given fixed value $\lambda$. J.…

Metric Geometry · Mathematics 2026-02-03 Jesús Jerónimo-Castro , Francisco G. Jimenez-Lopez , Efrén Morales-Amaya

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

Differential Geometry · Mathematics 2010-11-16 François Fillastre

The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…

Metric Geometry · Mathematics 2018-02-13 Csaba Vincze

Let G be a p-adic reductive group, and R an algebraically closed field. Let us consider a smooth representation of G on an R-vector space V. Fix an open compact subgroup K of G and a smooth irreducible representation of K on a…

Representation Theory · Mathematics 2023-02-15 Guy Henniart , Vincent Sécherre

Let n be a natural number equal or greater than 2. In this paper we study the topological structure of certain hyperspaces of convex subsets of constant width, equipped with the Hausdorff metric topology. We focus our attention on the…

Geometric Topology · Mathematics 2013-12-17 Sergey Antonyan , Natalia Jonard-Pérez , Saúl Juárez-Ordóñez

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

According to a 2002 theorem by Cardaliaguet and Tahraoui, an isotropic, compact and connected subset of the group $\operatorname{GL}^+(2)$ of invertible $2\times2-\,$matrices is rank-one convex if and only if it is polyconvex. In a 2005…

Analysis of PDEs · Mathematics 2020-09-22 Jendrik Voss , Ionel-Dumitrel Ghiba , Robert J. Martin , Patrizio Neff

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

In 2011 at an Oberwolfach workshop in Discrete Geometry, V. Dol'nikov posed the following problem. Consider three non-empty families of translates of a convex compact set $K$ in the plane. Suppose that every two translates from different…

Metric Geometry · Mathematics 2015-04-08 Jesús Jerónimo-Castro , Alexander Magazinov , Pablo Soberón

The complex Radon transform $\hat F$ of a rapidly decreasing distribution $F\in\mathscr{O}_C^{\prime}(\mathbb{C}^n)$ is considered. A compact set $K\subset\mathbb{C}^n$ is called linearly convex if the set $ \mathbb{C}^n \setminus K$ is a…

Complex Variables · Mathematics 2007-05-23 A. B. Sekerin

We prove that if K is a remainder of the Hilbert space (i.e., K is the complement of the Hilbert space in its metrizable compactification) then every non-one-point closed image of K either contains a compact set with no transfinite…

General Topology · Mathematics 2017-12-21 Elżbieta Pol , Roman Pol

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

Rings and Algebras · Mathematics 2021-05-03 G. Grätzer , H. Lakser

Barker and Larman asked the following. Let $K' \subset {\Bbb{R}}^d$ be a convex body, whose interior contains a given convex body $K \subset {\Bbb{R}}^d$, and let, for all supporting hyperplanes $H$ of $K$, the $(d-1)$-volumes of the…

Metric Geometry · Mathematics 2016-02-03 E. Makai, , H. Martini

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

Optimization and Control · Mathematics 2023-03-24 Hamza Fawzi , João Gouveia , Pablo A. Parrilo , James Saunderson , Rekha R. Thomas

We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…

Computational Complexity · Computer Science 2012-11-26 Hans Raj Tiwary