{'fraction_non_alphanumeric': 0.01159678858162355, 'fraction_numerical': 0.0, 'mean_word_length': 4.905263157894737, '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}}
Counting corners in compositions and set partitions presented as bargraphs

Abstract In this paper, we consider statistics on compositions of a fixed number and set partitions of a fixed size represented geometrically as bargraphs. By a corner of a bargraph, we mean a vertex along its polygonal boundary, where types of corners are identified by the sequence of steps directly before and after. Here, we find a generating function formula of the joint distribution for the statistics on compositions of n recording the number of corners of types uh or dh. We also find an explicit formula for the total number of corners of either type in all compositions of n, supplying both algebraic and combinatorial proofs. We then determine the joint distribution on compositions for corners of type for all i less than some fixed number as well as the comparable distributions for corners of type and on set partitions of size n having k blocks. In deriving our results, we solve various types of difference equations that are satisfied by the generating functions, using inductive arguments to determine closed form expressions.