Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
3
Newest
 Informed
Impact
~819 people reached

  • 0 posts edited
  • 0 helpful flags
  • 6 votes cast
Oct
2
comment Proposals for polymath projects
For a convex cover, the lower bound would be 0.270911861. The current lower bound is proved by trying to estimate the minimal area of a convex shape containing a segment, a triangle and a rectangle. We can try to add more shapes to tighten the lower bound, but I am not sure if it will be analytically or computationally feasible.
Oct
2
awarded  Informed
Feb
5
awarded  Supporter
Jan
11
answered Conley index for isolated invariant sets with no exit points
Nov
19
awarded  Teacher
Nov
18
answered Induced maps in Morse Homology