All Questions
377 questions
1
vote
0
answers
59
views
What can be said about 2 convex solids with corresponding maximal planar sections having equal area?
This post follows Are two convex solids with all corresponding shadows equal in area congruent?
Every convex 3D body has planar sections with normals in any given direction. We consider the maximum ...
- 5,979
1
vote
1
answer
194
views
Bounds on lengths of intervals in bounded-degree interval graphs
A graph is said to be an interval graph if its vertices can be associated with (closed) intervals on the real line $\mathbb R$ and there is an edge between two vertices if and only if the ...
- 277
1
vote
0
answers
183
views
How many squares can be determined using $n$ points?: revisited
The question was recently asked How many squares can be determined by $n$ points in $\mathbb{R}^3$?
The main observations were:
In $\mathbb{R}^2$ at most $O(n^2)$ as every pair of points determines ...
- 30.1k
1
vote
2
answers
152
views
Smallest triangles that contain 2D convex regions with reflection symmetry
Given any 2D convex region $C$ with a mirror symmetry. Two pairs of questions:
We need to find the smallest area (likewise, smallest perimeter) triangle that contains $C$. Is it sufficient to only ...
- 5,979
1
vote
0
answers
93
views
Flag $f$-vectors of CW-complexes
Hidden away in the appendix of this nice paper by Björner and Kalai, they give a clean description of $f$-vectors that can arise from regular CW-complexes in terms of truncations of the Euler-Poincaré ...
- 238
1
vote
2
answers
196
views
Partitioning unit square with equal frequency rectangles
If I had to partition the unit square $[0,1]\times[0,1]$ into $k^2$ rectangles such that the sum of their diagonals is minimum possible, I would simply choose the $k \times k$ grid of squares. Now ...
- 153
1
vote
1
answer
178
views
Inside-out dissections of solids -2
We record some general questions based on
Inside-out dissections of solids
Inside-out dissections of a cube
Can every convex polyhedral solid be inside-out dissected to a congruent polyhedral solid?...
- 5,979
1
vote
0
answers
111
views
On finding optimal convex planar shapes to cover a given convex planar shape
Covering a specific convex shape S with n copies of another specified convex shape S' (which may be different from S) is well studied - for example, https://erich-friedman.github.io/packing/index.html....
- 5,979
1
vote
1
answer
104
views
Finding the point within a convex n-gon that minimizes the largest angle subtended there by an edge of the n-gon
This post records a variant to the question asked in this post: Finding the point within a convex n-gon that maximizes the least angle subtended there by an edge of the n-gon
Given a convex n-gon, ...
- 5,979
1
vote
1
answer
561
views
Convex polyhedron and its Gauß-curvature [closed]
I have asked this question on MathSE and no one could give me an answer. So I'll post my question here.
What I am trying to prove:
A convex polyhedron has positive Gauß-Curvature at every vertex.
...
- 129
1
vote
0
answers
111
views
Maximizing the minimum curvature of a convex shape with a given volume in higher dimensions
Given any $d$-dimensional convex shape $S$ in the Euclidean space with $d\gg 1$, let $K_{\min}(S)$ be the minimum value of the Gaussian curvature of its boundary.
Question: What is the maximum value $...
- 1,677
1
vote
1
answer
260
views
VC dimension of cone-restricted linear classifiers
Let $\mathcal{C}$ be a pointed, salient cone in $\mathbb{R}^d$. We may also assume that $\mathcal{C}$ is full-dimensional. Consider the set of binary classifiers $$\mathcal{H} = \{\boldsymbol{x}\...
- 215
1
vote
0
answers
78
views
Triangulation of polygons with all triangles having a common angle
Following Partition of polygons into 'strongly acute' and 'strongly obtuse' triangles, we record another triangulation question.
Question: Given an n-vertex polygonal region ("n-...
- 5,979
1
vote
0
answers
85
views
More on triangles inscribed in convex regions with one vertex fixed
We add a bit to On maximum perimeter triangles inscribed in convex regions with one vertex fixed. Let C be a convex planar region and P a point on its boundary.
Are there convex shapes C other than (...
- 5,979
1
vote
0
answers
64
views
Cutting off odd numbers of equal area triangles from a unit square
Two earlier related posts:
Cutting the unit square into pieces with rational length sides
On a possible variant of Monsky's theorem
Question: for odd n, how does one cut the unit square into n ...
- 5,979
1
vote
0
answers
97
views
Tiling the plane with pair-wise non-congruent and mutually similar triangles
Question: Is it possible to tile the plane with triangles that are (1) mutually similar, (2) pairwise non-congruent and (3)non-right? No other constraints.
Note 1: Reg requirement 3 above: since any ...
- 5,979
1
vote
0
answers
82
views
Inside-out dissections of polygons - a generalization
Definitions (Inside-out polygonal dissections): a polygon P has an inside out dissection into P' if P′ is congruent to P and the perimeter of P becomes interior to P' and so the perimeter of P' is ...
- 5,979
1
vote
2
answers
121
views
How to solve the optimization problem $\max_{\mathbf{w}}\sum_i\text{sign}(\mathbf{w}^T \mathbf{x}_i)$?
I am looking for an algorithm to solve the following optimization problem
$$\max_{\mathbf{w}}\sum_i\text{sign}(\mathbf{w}^T \mathbf{x}_i)$$
where $\mathbf{w}$ and each $\mathbf{x}_i\in\mathbb{R}^d$.
...
- 175
0
votes
1
answer
127
views
Maximum number of points in convex position on a grid
Guys this problem really bothers me (I don`t know how to prove it) please help:
What is the maximum number of points in convex position on a $n\times m$ grid?
(My guess would be $2*(m+n)-4$.)
- 51
0
votes
1
answer
98
views
Tiling the plane with quadrilaterals that are mutually non-congruent and affine equivalent
Question: Can the plane be tiled with convex quadrilaterals that are (1) mutually non-congruent in a Euclidean sense and (2) mutually affine-equivalent?
Remark: Every trapezoid is affine equivalent to ...
- 5,979
0
votes
0
answers
49
views
When can a compact metric space be covered by finitely many nearly-disjoint closed and convex sets?
This question is a follow-up of the following negative question.
Let $(X,d)$ be a (non-empty) compact metric space.
More generally than in the first post, I'll call a set of non-empty subsets $C_1,\...
- 5,405
0
votes
0
answers
99
views
Perfectly balanced spanning trees
I call a spanning tree perfectly balanced if, after a two-coloring of the tree-graph's vertices
the two vertex sets that are defined by the assigned colors have equal cardinality and
the two vertex ...
- 13.2k
0
votes
1
answer
92
views
Can we prove that simple polygons can always be split in half (vertex-wise) by diagonals?
Can we prove that for any simple polygon with more than 3 vertices there always exists a diagonal which:
is inside the polygon
doesn't intersect with any edges
splits the polygon in two polygons in ...
0
votes
0
answers
89
views
What is the minimal number of lines needed to partition a simplex into cells of diameter at most $\epsilon$?
I am studying a problem that requires me to partition the simplex into cells using a particular family of hyperplanes. For concreteness, consider the 2-simplex. I would like to construct lines ...
- 23
0
votes
0
answers
63
views
Bounds for the Dispersal Problem in convex regions
We add a bit to: Bounds for minimax facility location in a convex region
Two earlier posts: Cutting convex regions into equal diameter and equal least width pieces - 2 and Facility location on ...
- 5,979
0
votes
0
answers
93
views
On smallest convex m-gons that contain a given n-gon where m<n
Given a convex n-gon region P, and an m less than n, will the least area convex m-gon Q that contains P be such that an edge of Q coincides with an edge of P (in other words Q cannot be such that P ...
- 5,979
0
votes
0
answers
98
views
Asymptotic optimal sphericity
How quickly does maximum sphericity of polyhedra with $n$ faces approach 1 as $n→∞$? I can show that sphericity $1 - \frac{5 \sqrt{3} π}{27n} - O(n^{-3/2})$ is possible. Is this, especially $O(n^{-3/...
- 7,545