S. Gul

activity

20102021

collaborators

4 papers

cs.CG2021

Efficient covering of convex domains by congruent discs

Shai Gul, Reuven Cohen, Simi Haber

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs ne…

cs.CG2018

Online exploration outside a convex obstacle

Shai Gul, Eitan Tiktinsky, Slava Shamshanov +1

A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem o…

math.CV2010

$Q_{α}$ -Normal Families and entire functions

Shai Gul, Shahar Nevo

For every countable ordinal number $α$ we construct an entire function $f = f_{α}$ such that the family ${f (n z) : n \in N}$ is exactly $Q_{α}$ -normal in the unit disk.

math.CV2010

Creating Limit Functions By The Pang-Zalcman Lemma

Shai Gul, Shahar Nevo

In this paper we calculate the collection of limit functions obtained by applying an extension of Zalcman's Lemma, due to X. C. Pang, to the non-normal family $\left\{f(nz):n\in\ma…

Efficient covering of convex domains by congruent discs

Online exploration outside a convex obstacle

Qα​-Normal Families and entire functions

Creating Limit Functions By The Pang-Zalcman Lemma

$Q_{α}$ -Normal Families and entire functions