<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>A game-theoretic proof of convexity preserving properties for motion by curvature</dc:title>
<dc:creator>Qingqing Liu</dc:creator><dc:creator>Armin Schikorra</dc:creator><dc:creator>Xiaodan Zhou</dc:creator>
<dc:subject>49L25</dc:subject><dc:subject>35J93</dc:subject><dc:subject>35K93</dc:subject><dc:subject>49N90</dc:subject><dc:subject>convexity preserving</dc:subject><dc:subject>curvature flow equations</dc:subject><dc:subject>discrete games</dc:subject><dc:subject>viscosity solutions</dc:subject>
<dc:description>In this paper, we revisit the convexity-preserving properties for the level set mean curvature flow equation by using the game-theoretic approximation established by Kohn and Serfaty (2006). Our new proofs are based on investigating game strategies or iterated applications of dynamic programming principles, without invoking deep partial differential equation theory. We also use this method to study convexity preserving for the Neumann boundary problem.</dc:description>
<dc:publisher>Indiana University Mathematics Journal</dc:publisher>
<dc:date>2016</dc:date>
<dc:type>text</dc:type>
<dc:format>pdf</dc:format>
<dc:identifier>10.1512/iumj.2016.65.5740</dc:identifier>
<dc:source>10.1512/iumj.2016.65.5740</dc:source>
<dc:language>en</dc:language>
<dc:relation>Indiana Univ. Math. J. 65 (2016) 171 - 197</dc:relation>
<dc:coverage>state-of-the-art mathematics</dc:coverage>
<dc:rights>http://iumj.org/access/</dc:rights>
</oai_dc:dc>