Problems of Minimal Resistance and the Kakeya Problem

• Autor(a) principal: Plakhov, Alexander
• Data de Publicação: 2015
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10773/21409
• topic: Newton’s problem of least resistance; Shape optimization; Kakeya problem

Here we solve the problem posed by Comte and Lachand-Robert in [8]. Take a bounded domain R2 and a piecewise smooth nonpositive function u : ¯ ! R vanishing on @ . Consider a flow of point particles falling vertically down and reflected elastically from the graph of u. It is assumed that each particle is reflected no more than once (no multiple reflections are allowed); then the resistance of the graph to the flow is expressed as R(u; ) = 1 | | R (1 + |ru(x)|2)−1dx. We need to find inf ,u R(u; ). One can easily see that |ru(x)| < 1 for all regular x 2 , and therefore one always has R(u; ) > 1/2. We prove that the infimum of R is exactly 1/2. This result is somewhat paradoxical, and the proof is inspired by, and partly similar to, the paradoxical solution given by Besicovitch to the Kakeya problem