Adam Sheffer's Home Page
Adam Sheffer
California Institute of Technology (Caltech),
Department of Mathematics
,
276 Sloane.
Phone: 626-395-4347,
Email: adamsh -at- caltech.edu
(Picture by Dawn K Chase)
Recently:
Check out
my blog
focusing on combinatorial geometry.
I am a Bateman Research Instructor, working with
Nets Katz
. Before that, I did my Ph.D. in Tel Aviv University under the supervision of
Micha Sharir
.
Research related pages:
My growing collection of
expository notes for the polynomial method
.
My page with up-to-date results on
numbers of plane graphs
.
Currently Teaching (fall 14):
Introduction to discrete mathematics (Ma/CS 6a)
Publications:
J. Fox, J. Pach, A. Sheffer, A. Suk, and J. Zahl,
A semi-algebraic version of Zarankiewicz's problem
,
Manuscript.
A. Sheffer, J. Zahl, and F. de Zeeuw,
Few distinct distances implies no heavy lines or circles
,
Combinatorica
, to appear.
M. Sharir, A. Sheffer, and J. Zahl,
Improved bounds for incidences between points and circles
,
Combinat. Probab. Comput.
, to appear.
(also in
Proc. 29th ACM Symp. on Computational Geometry
(SoCG 2013), 97--106.)
J. Cilleruelo, M. Sharir, and A. Sheffer,
A note on distinct distances in rectangular lattices
,
Submitted.
A. Basit and A. Sheffer,
Incidences with k-non-degenerate sets and their applications,
Submitted.
V. Dujmović, P. Morin and A. Sheffer,
Crossings in grid drawings
,
Electr. J. Comb.
, 21(1) (2014).
M. Sharir, A. Sheffer, and J. Solymosi,
Distinct distances on two lines
,
J. Combinat. Theory A
, 120 (2013), 1732--1736.
M. Sharir and A. Sheffer,
Counting plane graphs: Cross-graph charging schemes
,
Combinat. Probab. Comput.
, 22 (2013), 935--954.
M. Sharir, A. Sheffer, and E. Welzl,
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique
,
J. Combinat. Theory A
120 (2013), 777--794.
(Also in
Proc. 28th ACM Symp. on Computational Geometry
(SoCG 2012), 189--198.)
M. Ben-Ner, A. Schulz, and A. Sheffer,
On numbers of pseudo-triangulations
,
Comput. Geom. Theory Appl.
46 (2013), 688--699.
M. Hoffmann, A. Schulz, M. Sharir, A. Sheffer, C. D. Tóth, and E. Welzl,
Counting plane graphs: Flippability and its applications
,
Thirty Essays on Geometric Graph Theory (J. Pach, ed.)
, Springer, 2013, pp. 303--326.
A. Dumitrescu, A. Schulz, A. Sheffer, and Cs. D. Tóth,
Bounds on the maximum multiplicity of some common geometric graphs
,
SIAM J. Discrete Math.
, 27 (2013), 802--826.
M. Sharir, A. Sheffer, and E. Welzl,
On degrees in random triangulations,
J. Combinat. Theory A
118 (2011), 1979--1999.
(Also in
Proc. 26th ACM Symp. on Computational Geometry
(SoCG 2010), 297--306.)
M. Sharir and A. Sheffer,
Counting triangulations of planar point sets
,
Electr. J. Comb.
, 18(1) (2011)
Surveys:
A. Sheffer,
Distinct Distances: Open Problems and Current Bounds
,
Manuscript.
Other:
Pictures from
SharirFest 2010
can be found
here
.