857 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Hungarian Academy of SciencesHU402 papers
- Eötvös Loránd UniversityHU156 papers
- Budapest University of Technology and EconomicsHU58 papers
- Central European UniversityAT42 papers
- École Polytechnique Fédérale de LausanneCH31 papers
- Central European University - Budapest Campus24 papers
- University of PannoniaHU23 papers
- Centre National de la Recherche ScientifiqueFR21 papers
- University College LondonGB20 papers
- University of SzegedHU20 papers
- University of Illinois Urbana-ChampaignUS18 papers
- Charles UniversityCZ15 papers
6 papers · 2 filters
Algebraic vertices of non-convex polyhedra
Arseniy Akopyan, Imre Bárány, Sinai Robins
In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicato…
Centrally symmetric convex bodies and sections having maximal quermassintegrals
E. Makai, H. Martini
Let , and let be a convex body containing the origin in its interior. In a previous paper we have proved the following. The body is -sym…
Positive-fraction intersection results and variations of weak epsilon-nets
Alexander Magazinov, Pablo Soberón
Given a finite set of points in and a family of sets generated by the pairs of points of , we determine volumetric and structural conditions for the sets that allo…
The packing density of the -dimensional cross-polytope
G. Fejes Tóth, F. Fodor, V. Vígh
The packing density of the regular cross-polytope in Euclidean -space is unknown except in dimensions and where it is 1. The only non-trivial upper bound is due to Grave…
Small subset sums
Gergely Ambrus, Imre Barany, Victor Grinberg
Let ||.|| be a norm in R^d whose unit ball is B. Assume that V\subset B is a finite set of cardinality n, with \sum_{v \in V} v=0. We show that for every integer k with 0 \le k \le…
Better bounds for planar sets avoiding unit distances
Tamás Keleti, Máté Matolcsi, Fernando Mário de Oliveira Filho +1
A -avoiding set is a subset of that does not contain pairs of points at distance . Let denote the maximum fraction of that c…