7.5k citations
- X. He2 profiles46 · h 52
- M. Csanád2 profiles36 · h 76
- T. Csörgő2 profiles33 · h 42
- B. Cole2 profiles29 · h 52
- R. Lacey4 profiles29 · h 65
- S. Sato8 profiles29 · h 51
- V. Pantuev2 profiles29 · h 54
- A. Malakhov8 profiles28 · h 115
- A. Ster5 profiles28 · h 42
- D. d’Enterria2 profiles28 · h 127
- J. Alexander5 profiles28 · h 100
- M. Issah3 profiles28 · h 63
- Hungarian Academy of SciencesHU95 papers
- Columbia UniversityUS48 papers
- Institute for Particle and Nuclear PhysicsHU48 papers
- Centre National de la Recherche ScientifiqueFR46 papers
- Konkoly ObservatoryHU42 papers
- Stony Brook UniversityUS35 papers
- Brookhaven National LaboratoryUS34 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR34 papers
- Lund UniversitySE33 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR32 papers
- Lawrence Livermore National LaboratoryUS32 papers
- CEA Paris-SaclayFR31 papers
4 papers · 2 filters
A new operation on partially ordered sets
Péter Pál Pach, Michael Pinsker, András Pongrácz +1
Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the firs…
Octants are Cover-Decomposable into Many Coverings
Balázs Keszegh, Dömötör Pálvölgyi
We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a finite num…
The method of double chains for largest families with excluded subposets
Péter Burcsi, Dániel T. Nagy
For a given finite poset , denotes the largest size of a family of subsets of not containing as a weak subposet. We exactly determine …
Density-based group testing
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi +1
In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are conside…