{'fraction_non_alphanumeric': 0.01911764705882353, 'fraction_numerical': 0.0, 'mean_word_length': 5.485714285714286, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Area-minimizing minimal graphs over nonconvex domains

Sufficient conditions for which a minimal graph over a nonconvex domain is area-minimizing are presented. The conditions are shown to hold for subsurfaces of Enneper's surface, the singly periodic Scherk surface, and the associated surfaces of the doubly periodic Scherk surface which previously were unknown to be area-minimizing. In particular these surfaces are graphs over (angularly accessible) domains which have a nice complementary set of rays. A computer assisted method for proving polynomial inequalities with rational coefficients is also presented. This method is then applied to prove more general inequalities.