2000 character limit reached
A new proof of compactness in G(S)BD
Published 27 Apr 2021 in math.AP | (2104.13141v2)
Abstract: We prove a compactness result in GBD which also provides a new proof of the compactness theorem in GSBD, due to Chambolle and Crismale [5, Theorem 1.1]. Our proof is based on a Fr\'echet-Kolmogorov compactness criterion and does not rely on Korn or Poincar\'e-Korn inequalities.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.