Convexity conditions for parametric tensor‐product B‐spline surfaces.pdfVIP

Three Optimal Algorithms for Balls of Three Colors , 1 1 1 Zdenˇek Dvoˇr´ak , V´ıt Jel´ınek , Daniel , Jan Kynˇcl , and Michael Saks2, 1 Department of Applied Mathematics and, Institute for Theoretical Computer Science (ITI)† , Charles University, Malostransk´e n´amest´ı 25, 118 00 Prague, Czech Republic {rakdver, jelinek, kral, kyncl}@kam.mff.cuni.cz 2 Department of Mathematics, Rutgers, the State University of NJ 110 Frelinghuysen Road, Piscataway, NJ 08854-8019, USA saks@math.rutgers.edu Abstract. We consider a game played by two players, Paul and Carol. Carol fixes a coloring of n balls with three colors. At each step, Paul chooses a pair of balls and asks Carol whether the balls have the same color. Carol truthfully answers yes or no. In the Plurality problem, Paul wants to find a ball with the most common color. In the Partition prob- lem, Paul wants to partition the balls according to their colors. He wants to ask Carol the least number of questions to reach his goal. We find opti- mal deterministic and probabilistic strategies for the Partition problem and an asymptotically optimal probabilistic strategy for the Plurality problem. 1 Introduction We study a game played by two players, Paul and Carol, in which Paul wants to determine a certain property of the input based on Carol’s answers. Carol fixes a coloring of n balls by k colors. Paul does not know the coloring