Application of Multiobjective Genetic Algorithms in the Feature Selection Problem
Suslin's hypothesis, the diamond principle and the proper forcing axiom
Orthogonality of packings of paths and independent sets partitions on bipartite gr...
| Full text | |
| Author(s): |
Dellamonica, Domingos, Jr.
;
Kohayakawa, Yoshiharu
;
Lee, Sang June
;
Rodl, Vojtech
;
Samotij, Wojciech
Total Authors: 5
|
| Document type: | Journal article |
| Source: | PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY; v. 116, p. 41-pg., 2018-03-01. |
| Abstract | |
For any integer h2, a set A of integers is called a Bh-set if all sums a1++ah, with a1,...,ahA and a1ah, are distinct. We obtain essentially sharp asymptotic bounds for the number of Bh-sets of a given cardinality that are contained in the interval {1,,n}. As a consequence of these bounds, we determine, for any integer mn, the cardinality of the largest Bh-set contained in a typical m-element subset of {1,...,n}. (AU) | |
| FAPESP's process: | 13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat |
| Grantee: | Oswaldo Baffa Filho |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |