Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
A branch of geometry dealing with convex sets and functions. Polytopes, convex bodies, discrete geometry, linear programming, antimatroids, ...
3
votes
Accepted
Is a ball the hardest body to approximate by polytopes (in the Banach–Mazur metric)?
Let me give a proof of rozu's guess that $\phi_3(D)=1/2$ and $\phi_3(S)=\sqrt{2}-1$ if $D$, $S$ are a disk and a square. This disproves your conjecture.
First of all, for every $K$ and every $N$ the c …
4
votes
Accepted
Find the number of triangles in plane
Your argument already gives $$2\cdot\frac{(n-6c)^3}{216}+3\cdot \frac{(n-6c)^3}{108}=\frac{(n-6c)^3}{27}$$
triangles.
2
votes
Accepted
On centrally symmetric convex figures on the hyperbolic plane
"Only if" part (for a symmetric region, bisectors are concurrent) is rather clear.
Now "if" part. Assume that the common point of all bisectors exists, denote it by $O$. Clearly every chord $AOB$ thro …
5
votes
Accepted
Prékopa-Leindler style inequality?
Is not it obvious (unlike Prékopa-Leindler)?
We are given that for all $x_1,x_2$ we have $(f_1/g_1)^2 (x_1)\leqslant (g_2/f_2)^3(x_2)$, thus there exists $c>0$ such that $(f_1/g_1)^2 (x_1)\leqslant c^ …
3
votes
Monotonicity of perimeter of convex subsets of hyperbolic plane
Does not an elementary Euclidean proof work verbatim? If both sets are polygons, the interior one is obtained from the exterior one by cuts (i.e. transformations $P\to P\cap H$, where $P$ is a polygon …
1
vote
Accepted
On faces of polytopes
Let $A_0\subset A$ be the set where $\ell$ attains a minimum on $A$. It is a face of some dimension $k<d$. If $k=d-1$, we are done. Assume that $k<d-1$. Without loss of generality, $0\in A_0$ and more …
3
votes
Accepted
Does a matroid base polytope contain its circumcenter?
I do not think so. Consider a uniform matroid on 3 elements $a, b, c$ of rank 2, and take 100 copies of $a$ (so, totally we have 102 elements). Then the matroid base polytope has full dimension 101, t …
2
votes
Accepted
A claim on the concurrency of area bisectors of planar convex regions
A planar convex region is centrally symmetric if and only if its area bisectors are all concurrent.
Yes. Let all area bisectors of our region $K$ pass through a point $O$. Note that any line $\ell$ …
14
votes
Accepted
covering convex sets by round balls
Yes. Any point $y$ in the convex hull of $x$'s is a barycenter of some non-negative masses $m_i$ in $x_i$, $\sum m_i=1$, $y=\sum m_i x_i$. Point $y$ minimizes the moment of inertia $I(p)=\sum m_i |p-x …
9
votes
Accepted
Contact points for John's ellipsoid
Looks true. A necessary and sufficient condition for these points (let $E$ be a standard ball) is that the identity operator $I$ is a non-negative linear combination of projectors $P_i$ on lines throu …
1
vote
Minimum Euclidean squared norm in the convex hull of points with rational coordinates
Yes, this is true in general case. Let $P={\rm conv} M$ for a finite set $M\subset \mathbb{Q}^n$, and let $x_0$ be a minimizer of $\|x\|^2$ over $x\in P$. I am going to prove that $x_0\in \mathbb{Q}^n …
4
votes
Accepted
If $C_1\subseteq C_2$ are two closed convex cones that are pointed with $\partial C_1\subset...
Assume that $q\in C_2\setminus C_1$. Let $p$ be an interior point of $C_1$. Then the interval $(p,q)$ contains a boundary point of $C_1$ but only interior points of $C_2$. A contradiction.
1
vote
Accepted
Convex-like properties of the polar parametrization of the boundary a convex body on the plane
If $f(x)=\min\{s>0:x/s\in B\}$ is Minkowski functional of $B$, then $f$ is a convex function on the plane and ${\bf p}(t)=\frac{e^{it}}{f(e^{it})}$. I think your claims now follow from the properties …
4
votes
Number of Inner Diagonals of Convex Hulls of $n+2$ Points in Convex Configuration in $E^n$
If $p_1,\dots,p_{n+2}$ are the vertices and $\sum \lambda_i p_i=0$, $\sum \lambda_i=0$, is their (let it be unique for a moment) affine dependence, the point $q=\alpha p_i+(1-\alpha) p_j$ on the diago …
3
votes
Accepted
Almost convex combinations in $\mathbb R^n$
I do not know the reference, but it looks that even more may be achieved: $t_1,\dots,t_{n-1}$ may be chosen close to 0 and $t_n$ close to 1. Indeed, if the span of $a\cup A$ is spanned by linearly ind …