Adam Benjamin Sealfon
NEW YORK
Adam Benjamin Sealfon, 17, of Brooklyn, submitted an Intel Science Talent
Search computer science project that explored graphs and hypergraphs, which have
applications in biology, particle physics and Internet searches. A graph is a
collection of vertices (points) in which certain pairs are connected by edges
(lines). Adam studied algorithms for testing properties of k-uniform hypergraphs
- generalizations of graphs in which each line connects exactly k points, where
k > 2. An adaptive algorithm is a query that may depend on the outcome of
earlier queries; non-adaptive algorithms are queries determined without
attention to prior answers. Adam's results include a k-th order upper bound on
the complexity gap between a non-adaptive and an adaptive algorithm on k-uniform
hypergraphs. He also proposes an adaptive algorithm for testing whether a
3-hypergraph is a disjoint union of cliques, and determines the gap between his
algorithm and a certain class of non-adaptive algorithms. At Stuyvesant High
School in New York, Adam enjoys the politics and history clubs, piano and
creative writing. He has perfect SATs, hopes to attend Princeton or Harvard, and
is the son of Stuart and Celia Sealfon.
|
