{'fraction_non_alphanumeric': 0.0182370820668693, 'fraction_numerical': 0.00303951367781155, 'mean_word_length': 5.101851851851852, '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}}
Disconjugacy of fourth-order equations on graphs

This paper develops the theory of disconjugacy of fourth-order equations on geometric graphs which arises in modelling rod structures. The disconjugacy of an equation is defined in terms of a special fundamental system of solutions of the homogeneous equation. The disconjugacy property is shown to be related to the positivity property of the Green's functions for certain classes of boundary value problems for a fourth-order equation on a graph. A maximum principle for a fourth-order equation on a graph is formulated, and some properties of differential inequalities are proved. Bibliography: 25 titles.