nhaliday + open-problems   39

(Gil Kalai) The weak epsilon-net problem | What's new
This is a problem in discrete and convex geometry. It seeks to quantify the intuitively obvious fact that large convex bodies are so “fat” that they cannot avoid “detection” by a small number of observation points.
gowers  mathtariat  tcstariat  tcs  math  concept  rounding  linear-programming  research  open-problems  geometry  math.CO  magnitude  probabilistic-method  math.MG  discrete  nibble  org:bleg  questions  curvature  pigeonhole-markov  convexity-curvature 
january 2017 by nhaliday
soft question - A Book You Would Like to Write - MathOverflow
- The Differential Topology of Loop Spaces
- Knot Theory: Kawaii examples for topological machines
- An Introduction to Forcing (for people who don't care about foundations.)
writing  math  q-n-a  discussion  books  list  synthesis  big-list  overflow  soft-question  techtariat  mathtariat  exposition  topology  open-problems  logic  nibble  fedja  questions 
october 2016 by nhaliday

bundles : academemeta

related tags

aaronson  academia  acm  acmtariat  additive  additive-combo  age-generation  ai  ai-control  alg-combo  algebraic-complexity  algorithmic-econ  algorithms  alignment  ama  announcement  aphorism  approximation  atoms  automation  barons  big-list  big-picture  big-surf  boaz-barak  books  boolean-analysis  borel-cantelli  business  caching  cartoons  circuits  clever-rats  coloring  communication  communication-complexity  complexity  computation  computational-geometry  concept  constraint-satisfaction  convexity-curvature  cool  coordination  core-rats  correlation  counterexample  counting  crypto  cs  curiosity  curvature  deep-learning  density  direction  discrete  discussion  duplication  duty  education  EEA  entanglement  epistemic  equilibrium  error  evidence  evolution  expert  expert-experience  exposition  farmers-and-foragers  fedja  finiteness  fisher  flux-stasis  fourier  frontier  game-theory  geometry  giants  gowers  hanson  hardness  hari-seldon  heuristic  hi-order-bits  hierarchy  history  homepage  ideas  idk  impact  information-theory  integral  intuition  lattice  learning  learning-theory  lens  linear-algebra  linear-programming  liner-notes  links  list  logic  lower-bounds  machine-learning  magnitude  matching  math  math.CA  math.CO  math.FA  math.GR  math.MG  math.NT  mathtariat  measure  mechanics  michael-nielsen  mihai  miri-cfar  models  mostly-modern  motivation  multi  multiplicative  news  nibble  old-anglo  oly  open-problems  openai  optimization  org:bleg  org:edu  org:inst  org:mag  org:sci  orourke  overflow  papers  pdf  philosophy  physics  pigeonhole-markov  plots  popsci  population  pre-ww2  preprint  probabilistic-method  probability  proof-systems  proofs  pseudorandomness  puzzles  q-n-a  qra  quantum  quantum-info  questions  rand-approx  rand-complexity  ratty  reference  reflection  reinforcement  relativization  research  research-program  rhetoric  rigor  rigorous-crypto  rounding  ryan-odonnell  sampling  scale  SDP  sensitivity  skunkworks  slides  soft-question  space  speed  speedometer  startups  stats  sublinear  sum-of-squares  summary  survey  synthesis  talks  tcs  tcstariat  techtariat  thinking  tidbits  time-complexity  todo  top-n  topology  tricks  UGC  uncertainty  urban-rural  volo-avolo  wiki  writing  yc  yoga  🖥 

Copy this bookmark: