Noah Kravitz

activity

20172026

(k, ℓ)

-sum-free sets in compact abelian groups

3 citations · 7 across the 11 of their papers we have counts for

collaborators

Showing 2019 · math.COShow all

3 papers · 2 filters

math.CO2019★ 2 cited

Barely lonely runners and very lonely runners

Noah Kravitz

We introduce a sharpened version of the well-known Lonely Runner Conjecture of Wills and Cusick. Given a real number $x$ , let $∥ x ∥$ denote the distance from $x$ to the ne…

math.CO2019

Linear extension numbers of $n$ -element posets

Noah Kravitz, Ashwin Sah

We address the following natural but hitherto unstudied question: what are the possible linear extension numbers of an $n$ -element poset? Let $LE (n)$ denote the set of all…

math.CO2019★ 3 cited

The largest $(k, ℓ)$ -sum-free sets in compact abelian groups

Noah Kravitz

A subset $A$ of a finite abelian group is called $(k, ℓ)$ -sum-free if $k A \cap ℓ A = \emptyset.$ In this paper, we extend this concept to compact abelian groups and study the qu…

Barely lonely runners and very lonely runners

Linear extension numbers of n-element posets

The largest (k,ℓ)-sum-free sets in compact abelian groups

Linear extension numbers of $n$ -element posets

The largest $(k, ℓ)$ -sum-free sets in compact abelian groups