Erdős--Szekeres-type problems in the real projective plane

Authors: Balko, Martin, Scheucher, Manfred, Valtr, Pavel

Contributors: Martin Balko and Manfred Scheucher and Pavel Valtr, Goaoc, Xavier, Kerber, Michael

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Horton set, Theory of computation → Computational geometry, real projective plane, Information systems → Data structures, 0102 computer and information sciences, Mathematics of computing → Combinatorics, 01 natural sciences, convex position, k-gon, k-hole, point set, Theory of computation → Randomness, geometry and discrete structures, FOS: Mathematics, Mathematics of computing → Probability and statistics, random point set, Combinatorics (math.CO), ddc:004, 0101 mathematics, Erdős-Szekeres theorem

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.10

enThe Pareto Cover Problem

Authors: Natura, Bento, Neuwohner, Meike, Weltge, Stefan

Contributors: Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz

Subject Terms: Covering, Optimization, Mathematics of computing → Discrete optimization, Theory of computation → Randomness, geometry and discrete structures, Theory of computation → Dynamic programming, Theory of computation → Problems, reductions and completeness, Theory of computation → Packing and covering problems, Pareto, Approximation Algorithm

Majorizing Measures for the Optimizer

Authors: Borst, Sander, Dadush, Daniel, Olver, Neil, Sinha, Makrand

Contributors: Sander Borst and Daniel Dadush and Neil Olver and Makrand Sinha, Lee, James R.

Source: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)

Subject Terms: FOS: Computer and information sciences, convex optimization, Generic chaining, G.3, Gaussian processes, 01 natural sciences, 60G15, 68Q87, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0101 mathematics, Mathematics - Optimization and Control, Dimensionality Reduction, dimensionality reduction, Mathematics of computing → Convex optimization, generic chaining, Probability (math.PR), Majorizing measures, Convex optimization, Optimization and Control (math.OC), Theory of computation → Randomness, geometry and discrete structures, Mathematics of computing → Stochastic processes, ddc:004, majorizing measures, Mathematics - Probability

File Description: application/pdf

Access URL: http://arxiv.org/abs/2012.13306
https://drops.dagstuhl.de/opus/volltexte/2021/13612/
http://doi.org/10.4230/LIPIcs.ITCS.2021.73
https://eprints.lse.ac.uk/112159/
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A30431
https://doi.org/10.4230/LIPIcs.ITCS.2021.73
https://arxiv.org/abs/2012.13306
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.73
http://eprints.lse.ac.uk/112159/