Concept
Countable set
Related publications (44)
A proof of a sumset conjecture of Erdős
In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...
2019Computing Crowd Consensus with Partial Agreement (Extended Abstract)
Quoc Viet Hung Nguyen, Thành Tâm Nguyên
Crowdsourcing has been widely established as a means to enable human computation at large-scale, in particular for tasks that require manual labelling of large sets of data items. Answers obtained from heterogeneous crowd workers are aggregated to obtain a ...
IEEE2018Computing Crowd Consensus with Partial Agreement
Quoc Viet Hung Nguyen, Thành Tâm Nguyên
Crowdsourcing has been widely established as a means to enable human computation at large-scale, in particular for tasks that require manual labelling of large sets of data items. Answers obtained from heterogeneous crowd workers are aggregated to obtain a ...
2018Angle-dependent magnetization dynamics with mirror-symmetric excitations in artificial quasicrystalline nanomagnet lattices
Dirk Grundler, Vinayak Shantaram Bhat
We report angle-dependent spin-wave spectroscopy on aperiodic quasicrystalline magnetic lattices, i.e., Ammann, Penrose P2 and P3 lattices made of large arrays of interconnected Ni80Fe20 nanobars. Spin-wave spectra obtained in the nearly saturated state co ...
2018Signalling strength determines proapoptotic functions of STING
Freddy Radtke, Andrea Ablasser, Ute Koch, Muhammet Fatih Gülen
Mammalian cells use cytosolic nucleic acid receptors to detect pathogens and other stress signals. In innate immune cells the presence of cytosolic DNA is sensed by the cGAS-STING signalling pathway, which initiates a gene expression programme linked to ce ...
Springer Nature2017Families with no s pairwise disjoint sets
For integers n >= s >= 2 let e (n, s) denote the maximum of vertical bar F vertical bar, where F is a family of subsets of an n- element set and F contains no s pairwise disjoint members. Half a century ago, solving a conjecture of Erd. os, Kleitman determ ...
Wiley2017Exchange anisotropy in the skyrmion host GaV4S8
Using ferromagnetic resonance spectroscopy at 34 GHz we explored the magnetic anisotropy of single-crystalline GaV4S8 in the field-polarized magnetic state. We describe the data in terms of an easy-axis type uniaxial anisotropy with an anisotropy constant ...
Institute of Physics2017Computation in Multicast Networks: Function Alignment and Converse Theorems
Michael Christoph Gastpar, Naveen Goela
The classical problem in a network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers that decode the same set of messages. In this paper, computation over multicast networks ...
Institute of Electrical and Electronics Engineers2016Multi-Label Answer Aggregation for Crowdsourcing
Crowdsourcing has been widely established as a means to enable human computation at large scale, in particular for tasks that require manual labelling of large sets of data items. Answers obtained from heterogeneous crowd workers are aggregated to obtain a ...
2016Programming with Enumerable Sets of Structures
Viktor Kuncak, Ivan Kuraj, Daniel Jackson
We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, a ...
Assoc Computing Machinery2015