Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 148 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

The problem of minimal resistance for functions and domains (1309.6441v1)

Published 25 Sep 2013 in math.CA and math.DS

Abstract: Here we solve the problem posed by Comte and Lachand-Robert in (2001). Take a bounded domain \Omega in R2 and a piecewise smooth non-positive function u : \bar{\Omega} \to R vanishing on the boundary of \Omega. 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 F(u;\Omega) = \frac{1}{|\Omega|} \int_\Omega (1 + |\nabla u(x)|2){-1} dx. It is required to find \inf_{\Omega,u} F(u;\Omega). One can easily see that |\nabla u(x)| < 1 for all regular x \in \Omega, and therefore one always has F(u;\Omega) > 1/2. We prove that the infimum of F is exactly 1/2. This result is somewhat paradoxical, and the proof is inspired by, and is partly similar to, the paradoxical solution given by Besicovitch to the Kakeya problem.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.